--- _id: '46372' abstract: - lang: eng text: We present a new hybrid evolutionary algorithm for the effective hypervolume approximation of the Pareto front of a given differentiable multi-objective optimization problem. Starting point for the local search (LS) mechanism is a new division of the decision space as we will argue that in each of these regions a different LS strategy seems to be most promising. For the LS in two out of the three regions we will utilize and adapt the Directed Search method which is capable of steering the search into any direction given in objective space and which is thus well suited for the problem at hand. We further on integrate the resulting LS mechanism into SMS-EMOA, a state-of-the-art evolutionary algorithm for hypervolume approximations. Finally, we will present some numerical results on several benchmark problems with two and three objectives indicating the strength and competitiveness of the novel hybrid. author: - first_name: O full_name: Schütze, O last_name: Schütze - first_name: Hernandez VA full_name: Sosa, Hernandez VA last_name: Sosa - first_name: Heike full_name: Trautmann, Heike id: '100740' last_name: Trautmann orcid: 0000-0002-9788-8282 - first_name: G full_name: Rudolph, G last_name: Rudolph citation: ama: Schütze O, Sosa HV, Trautmann H, Rudolph G. The Hypervolume based Directed Search Method for Multi-Objective Optimization Problems. Journal of Heuristics. 2016;22(3):273–300. doi:10.1007/s10732-016-9310-0 apa: Schütze, O., Sosa, H. V., Trautmann, H., & Rudolph, G. (2016). The Hypervolume based Directed Search Method for Multi-Objective Optimization Problems. Journal of Heuristics, 22(3), 273–300. https://doi.org/10.1007/s10732-016-9310-0 bibtex: '@article{Schütze_Sosa_Trautmann_Rudolph_2016, title={The Hypervolume based Directed Search Method for Multi-Objective Optimization Problems}, volume={22}, DOI={10.1007/s10732-016-9310-0}, number={3}, journal={Journal of Heuristics}, author={Schütze, O and Sosa, Hernandez VA and Trautmann, Heike and Rudolph, G}, year={2016}, pages={273–300} }' chicago: 'Schütze, O, Hernandez VA Sosa, Heike Trautmann, and G Rudolph. “The Hypervolume Based Directed Search Method for Multi-Objective Optimization Problems.” Journal of Heuristics 22, no. 3 (2016): 273–300. https://doi.org/10.1007/s10732-016-9310-0.' ieee: 'O. Schütze, H. V. Sosa, H. Trautmann, and G. Rudolph, “The Hypervolume based Directed Search Method for Multi-Objective Optimization Problems,” Journal of Heuristics, vol. 22, no. 3, pp. 273–300, 2016, doi: 10.1007/s10732-016-9310-0.' mla: Schütze, O., et al. “The Hypervolume Based Directed Search Method for Multi-Objective Optimization Problems.” Journal of Heuristics, vol. 22, no. 3, 2016, pp. 273–300, doi:10.1007/s10732-016-9310-0. short: O. Schütze, H.V. Sosa, H. Trautmann, G. Rudolph, Journal of Heuristics 22 (2016) 273–300. date_created: 2023-08-04T15:19:11Z date_updated: 2023-10-16T13:40:43Z department: - _id: '34' - _id: '819' doi: 10.1007/s10732-016-9310-0 intvolume: ' 22' issue: '3' language: - iso: eng page: 273–300 publication: Journal of Heuristics status: public title: The Hypervolume based Directed Search Method for Multi-Objective Optimization Problems type: journal_article user_id: '15504' volume: 22 year: '2016' ... --- _id: '46368' abstract: - lang: eng text: Exploratory Landscape Analysis (ELA) aims at understanding characteristics of single-objective continuous (black-box) optimization problems in an automated way. Moreover, the approach provides the basis for constructing algorithm selection models for unseen problem instances. Recently, it has gained increasing attention and numerical features have been designed by various research groups. This paper introduces the R-Package FLACCO which makes all relevant features available in a unified framework together with efficient helper functions. Moreover, a case study which gives perspectives to ELA for multi-objective optimization problems is presented. author: - first_name: Pascal full_name: Kerschke, Pascal last_name: Kerschke - first_name: Heike full_name: Trautmann, Heike id: '100740' last_name: Trautmann orcid: 0000-0002-9788-8282 citation: ama: 'Kerschke P, Trautmann H. The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC). ; 2016. doi:10.1109/CEC.2016.7748359' apa: Kerschke, P., & Trautmann, H. (2016). The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems. Proceedings of the IEEE Congress on Evolutionary Computation (CEC). https://doi.org/10.1109/CEC.2016.7748359 bibtex: '@inproceedings{Kerschke_Trautmann_2016, place={Vancouver, BC, Kanada}, title={The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems}, DOI={10.1109/CEC.2016.7748359}, booktitle={Proceedings of the IEEE Congress on Evolutionary Computation (CEC)}, author={Kerschke, Pascal and Trautmann, Heike}, year={2016} }' chicago: Kerschke, Pascal, and Heike Trautmann. “The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems.” In Proceedings of the IEEE Congress on Evolutionary Computation (CEC). Vancouver, BC, Kanada, 2016. https://doi.org/10.1109/CEC.2016.7748359. ieee: 'P. Kerschke and H. Trautmann, “The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems,” 2016, doi: 10.1109/CEC.2016.7748359.' mla: Kerschke, Pascal, and Heike Trautmann. “The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems.” Proceedings of the IEEE Congress on Evolutionary Computation (CEC), 2016, doi:10.1109/CEC.2016.7748359. short: 'P. Kerschke, H. Trautmann, in: Proceedings of the IEEE Congress on Evolutionary Computation (CEC), Vancouver, BC, Kanada, 2016.' date_created: 2023-08-04T15:14:52Z date_updated: 2023-10-16T13:39:06Z department: - _id: '34' - _id: '819' doi: 10.1109/CEC.2016.7748359 language: - iso: eng place: Vancouver, BC, Kanada publication: Proceedings of the IEEE Congress on Evolutionary Computation (CEC) status: public title: The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems type: conference user_id: '15504' year: '2016' ... --- _id: '46370' abstract: - lang: eng text: This report documents the talks and discussions at the Dagstuhl Seminar 15211 "Theory of Evolutionary Algorithms". This seminar, now in its 8th edition, is the main meeting point of the highly active theory of randomized search heuristics subcommunities in Australia, Asia, North America, and Europe. Topics intensively discussed include rigorous runtime analysis and computational complexity theory for randomised search heuristics, information geometry of randomised search, and synergies between the theory of evolutionary algorithms and theories of natural evolution. author: - first_name: F full_name: Neumann, F last_name: Neumann - first_name: Heike full_name: Trautmann, Heike id: '100740' last_name: Trautmann orcid: 0000-0002-9788-8282 citation: ama: 'Neumann F, Trautmann H. Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211). Dagstuhl Reports. 2016;5(5):78–79. doi:10.4230/DagRep.5.5.57' apa: 'Neumann, F., & Trautmann, H. (2016). Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211). Dagstuhl Reports, 5(5), 78–79. https://doi.org/10.4230/DagRep.5.5.57' bibtex: '@article{Neumann_Trautmann_2016, title={Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211)}, volume={5}, DOI={10.4230/DagRep.5.5.57}, number={5}, journal={Dagstuhl Reports}, author={Neumann, F and Trautmann, Heike}, year={2016}, pages={78–79} }' chicago: 'Neumann, F, and Heike Trautmann. “Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211).” Dagstuhl Reports 5, no. 5 (2016): 78–79. https://doi.org/10.4230/DagRep.5.5.57.' ieee: 'F. Neumann and H. Trautmann, “Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211),” Dagstuhl Reports, vol. 5, no. 5, pp. 78–79, 2016, doi: 10.4230/DagRep.5.5.57.' mla: 'Neumann, F., and Heike Trautmann. “Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211).” Dagstuhl Reports, vol. 5, no. 5, 2016, pp. 78–79, doi:10.4230/DagRep.5.5.57.' short: F. Neumann, H. Trautmann, Dagstuhl Reports 5 (2016) 78–79. date_created: 2023-08-04T15:17:00Z date_updated: 2023-10-16T13:40:00Z department: - _id: '34' - _id: '819' doi: 10.4230/DagRep.5.5.57 intvolume: ' 5' issue: '5' language: - iso: eng page: 78–79 publication: Dagstuhl Reports status: public title: 'Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211)' type: journal_article user_id: '15504' volume: 5 year: '2016' ... --- _id: '48309' author: - first_name: Ivan full_name: Habernal, Ivan id: '101881' last_name: Habernal - first_name: Iryna full_name: Gurevych, Iryna last_name: Gurevych citation: ama: 'Habernal I, Gurevych I. What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation. In: Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing. Association for Computational Linguistics; 2016. doi:10.18653/v1/d16-1129' apa: Habernal, I., & Gurevych, I. (2016). What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation. Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing. https://doi.org/10.18653/v1/d16-1129 bibtex: '@inproceedings{Habernal_Gurevych_2016, title={What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation}, DOI={10.18653/v1/d16-1129}, booktitle={Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing}, publisher={Association for Computational Linguistics}, author={Habernal, Ivan and Gurevych, Iryna}, year={2016} }' chicago: Habernal, Ivan, and Iryna Gurevych. “What Makes a Convincing Argument? Empirical Analysis and Detecting            Attributes of Convincingness in Web Argumentation.” In Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing. Association for Computational Linguistics, 2016. https://doi.org/10.18653/v1/d16-1129. ieee: 'I. Habernal and I. Gurevych, “What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation,” 2016, doi: 10.18653/v1/d16-1129.' mla: Habernal, Ivan, and Iryna Gurevych. “What Makes a Convincing Argument? Empirical Analysis and Detecting            Attributes of Convincingness in Web Argumentation.” Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing, Association for Computational Linguistics, 2016, doi:10.18653/v1/d16-1129. short: 'I. Habernal, I. Gurevych, in: Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing, Association for Computational Linguistics, 2016.' date_created: 2023-10-19T08:31:58Z date_updated: 2023-10-19T12:07:05Z department: - _id: '34' - _id: '820' doi: 10.18653/v1/d16-1129 language: - iso: eng publication: Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing publication_status: published publisher: Association for Computational Linguistics status: public title: What makes a convincing argument? Empirical analysis and detecting attributes of convincingness in Web argumentation type: conference user_id: '15504' year: '2016' ... --- _id: '11890' abstract: - lang: eng text: In this paper we study the influence of directional radio patterns of Bluetooth low energy (BLE) beacons on smartphone localization accuracy and beacon network planning. A two-dimensional model of the power emission characteristic is derived from measurements of the radiation pattern of BLE beacons carried out in an RF chamber. The Cramer-Rao lower bound (CRLB) for position estimation is then derived for this directional power emission model. With this lower bound on the RMS positioning error the coverage of different beacon network configurations can be evaluated. For near-optimal network planing an evolutionary optimization algorithm for finding the best beacon placement is presented. author: - first_name: Joerg full_name: Schmalenstroeer, Joerg id: '460' last_name: Schmalenstroeer - first_name: Reinhold full_name: Haeb-Umbach, Reinhold id: '242' last_name: Haeb-Umbach citation: ama: 'Schmalenstroeer J, Haeb-Umbach R. Investigations into Bluetooth Low Energy Localization Precision Limits. In: 24th European Signal Processing Conference (EUSIPCO 2016). ; 2016.' apa: Schmalenstroeer, J., & Haeb-Umbach, R. (2016). Investigations into Bluetooth Low Energy Localization Precision Limits. 24th European Signal Processing Conference (EUSIPCO 2016). bibtex: '@inproceedings{Schmalenstroeer_Haeb-Umbach_2016, title={Investigations into Bluetooth Low Energy Localization Precision Limits}, booktitle={24th European Signal Processing Conference (EUSIPCO 2016)}, author={Schmalenstroeer, Joerg and Haeb-Umbach, Reinhold}, year={2016} }' chicago: Schmalenstroeer, Joerg, and Reinhold Haeb-Umbach. “Investigations into Bluetooth Low Energy Localization Precision Limits.” In 24th European Signal Processing Conference (EUSIPCO 2016), 2016. ieee: J. Schmalenstroeer and R. Haeb-Umbach, “Investigations into Bluetooth Low Energy Localization Precision Limits,” 2016. mla: Schmalenstroeer, Joerg, and Reinhold Haeb-Umbach. “Investigations into Bluetooth Low Energy Localization Precision Limits.” 24th European Signal Processing Conference (EUSIPCO 2016), 2016. short: 'J. Schmalenstroeer, R. Haeb-Umbach, in: 24th European Signal Processing Conference (EUSIPCO 2016), 2016.' date_created: 2019-07-12T05:30:14Z date_updated: 2023-10-26T08:11:52Z department: - _id: '54' language: - iso: eng main_file_link: - open_access: '1' url: https://groups.uni-paderborn.de/nt/pubs/2016/SchHaeb16.pdf oa: '1' publication: 24th European Signal Processing Conference (EUSIPCO 2016) quality_controlled: '1' related_material: link: - description: Poster relation: supplementary_material url: https://groups.uni-paderborn.de/nt/pubs/2016/SchHaeb16_Poster.pdf status: public title: Investigations into Bluetooth Low Energy Localization Precision Limits type: conference user_id: '460' year: '2016' ... --- _id: '47241' author: - first_name: Yasemin full_name: Acar, Yasemin id: '94636' last_name: Acar - first_name: Michael full_name: Backes, Michael last_name: Backes - first_name: Sascha full_name: Fahl, Sascha last_name: Fahl - first_name: Doowon full_name: Kim, Doowon last_name: Kim - first_name: Michelle L. full_name: Mazurek, Michelle L. last_name: Mazurek - first_name: Christian full_name: Stransky, Christian last_name: Stransky citation: ama: 'Acar Y, Backes M, Fahl S, Kim D, Mazurek ML, Stransky C. You Get Where You’re Looking for: The Impact of Information Sources on Code Security. In: 2016 IEEE Symposium on Security and Privacy (SP). IEEE; 2016. doi:10.1109/sp.2016.25' apa: 'Acar, Y., Backes, M., Fahl, S., Kim, D., Mazurek, M. L., & Stransky, C. (2016). You Get Where You’re Looking for: The Impact of Information Sources on Code Security. 2016 IEEE Symposium on Security and Privacy (SP). https://doi.org/10.1109/sp.2016.25' bibtex: '@inproceedings{Acar_Backes_Fahl_Kim_Mazurek_Stransky_2016, title={You Get Where You’re Looking for: The Impact of Information Sources on Code Security}, DOI={10.1109/sp.2016.25}, booktitle={2016 IEEE Symposium on Security and Privacy (SP)}, publisher={IEEE}, author={Acar, Yasemin and Backes, Michael and Fahl, Sascha and Kim, Doowon and Mazurek, Michelle L. and Stransky, Christian}, year={2016} }' chicago: 'Acar, Yasemin, Michael Backes, Sascha Fahl, Doowon Kim, Michelle L. Mazurek, and Christian Stransky. “You Get Where You’re Looking for: The Impact of Information Sources on Code Security.” In 2016 IEEE Symposium on Security and Privacy (SP). IEEE, 2016. https://doi.org/10.1109/sp.2016.25.' ieee: 'Y. Acar, M. Backes, S. Fahl, D. Kim, M. L. Mazurek, and C. Stransky, “You Get Where You’re Looking for: The Impact of Information Sources on Code Security,” 2016, doi: 10.1109/sp.2016.25.' mla: 'Acar, Yasemin, et al. “You Get Where You’re Looking for: The Impact of Information Sources on Code Security.” 2016 IEEE Symposium on Security and Privacy (SP), IEEE, 2016, doi:10.1109/sp.2016.25.' short: 'Y. Acar, M. Backes, S. Fahl, D. Kim, M.L. Mazurek, C. Stransky, in: 2016 IEEE Symposium on Security and Privacy (SP), IEEE, 2016.' date_created: 2023-09-22T12:42:01Z date_updated: 2023-11-22T09:24:35Z department: - _id: '34' - _id: '740' doi: 10.1109/sp.2016.25 extern: '1' language: - iso: eng publication: 2016 IEEE Symposium on Security and Privacy (SP) publication_status: published publisher: IEEE status: public title: 'You Get Where You''re Looking for: The Impact of Information Sources on Code Security' type: conference user_id: '15458' year: '2016' ... --- _id: '47239' author: - first_name: Sergej full_name: Dechand, Sergej last_name: Dechand - first_name: Dominik full_name: Schürmann, Dominik last_name: Schürmann - first_name: Karoline full_name: Busse, Karoline last_name: Busse - first_name: Yasemin full_name: Acar, Yasemin id: '94636' last_name: Acar - first_name: Sascha full_name: Fahl, Sascha last_name: Fahl - first_name: Matthew full_name: Smith, Matthew last_name: Smith citation: ama: 'Dechand S, Schürmann D, Busse K, Acar Y, Fahl S, Smith M. An Empirical Study of Textual Key-Fingerprint Representations. In: Holz T, Savage S, eds. 25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016. USENIX Association; 2016:193–208.' apa: Dechand, S., Schürmann, D., Busse, K., Acar, Y., Fahl, S., & Smith, M. (2016). An Empirical Study of Textual Key-Fingerprint Representations. In T. Holz & S. Savage (Eds.), 25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016 (pp. 193–208). USENIX Association. bibtex: '@inproceedings{Dechand_Schürmann_Busse_Acar_Fahl_Smith_2016, title={An Empirical Study of Textual Key-Fingerprint Representations}, booktitle={25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016}, publisher={USENIX Association}, author={Dechand, Sergej and Schürmann, Dominik and Busse, Karoline and Acar, Yasemin and Fahl, Sascha and Smith, Matthew}, editor={Holz, Thorsten and Savage, Stefan}, year={2016}, pages={193–208} }' chicago: Dechand, Sergej, Dominik Schürmann, Karoline Busse, Yasemin Acar, Sascha Fahl, and Matthew Smith. “An Empirical Study of Textual Key-Fingerprint Representations.” In 25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016, edited by Thorsten Holz and Stefan Savage, 193–208. USENIX Association, 2016. ieee: S. Dechand, D. Schürmann, K. Busse, Y. Acar, S. Fahl, and M. Smith, “An Empirical Study of Textual Key-Fingerprint Representations,” in 25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016, 2016, pp. 193–208. mla: Dechand, Sergej, et al. “An Empirical Study of Textual Key-Fingerprint Representations.” 25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016, edited by Thorsten Holz and Stefan Savage, USENIX Association, 2016, pp. 193–208. short: 'S. Dechand, D. Schürmann, K. Busse, Y. Acar, S. Fahl, M. Smith, in: T. Holz, S. Savage (Eds.), 25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016, USENIX Association, 2016, pp. 193–208.' date_created: 2023-09-22T12:40:35Z date_updated: 2023-11-22T09:24:57Z department: - _id: '34' - _id: '740' editor: - first_name: Thorsten full_name: Holz, Thorsten last_name: Holz - first_name: Stefan full_name: Savage, Stefan last_name: Savage extern: '1' language: - iso: eng page: 193–208 publication: 25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016 publisher: USENIX Association status: public title: An Empirical Study of Textual Key-Fingerprint Representations type: conference user_id: '15458' year: '2016' ... --- _id: '48873' abstract: - lang: eng text: Despite the intrinsic hardness of the Traveling Salesperson Problem (TSP) heuristic solvers, e.g., LKH+restart and EAX+restart, are remarkably successful in generating satisfactory or even optimal solutions. However, the reasons for their success are not yet fully understood. Recent approaches take an analytical viewpoint and try to identify instance features, which make an instance hard or easy to solve. We contribute to this area by generating instance sets for couples of TSP algorithms A and B by maximizing/minimizing their performance difference in order to generate instances which are easier to solve for one solver and much harder to solve for the other. This instance set offers the potential to identify key features which allow to distinguish between the problem hardness classes of both algorithms. author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Heike full_name: Trautmann, Heike last_name: Trautmann citation: ama: 'Bossek J, Trautmann H. Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers. In: Festa P, Sellmann M, Vanschoren J, eds. Learning and Intelligent Optimization. Lecture Notes in Computer Science. Springer International Publishing; 2016:48–59. doi:10.1007/978-3-319-50349-3_4' apa: Bossek, J., & Trautmann, H. (2016). Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers. In P. Festa, M. Sellmann, & J. Vanschoren (Eds.), Learning and Intelligent Optimization (pp. 48–59). Springer International Publishing. https://doi.org/10.1007/978-3-319-50349-3_4 bibtex: '@inproceedings{Bossek_Trautmann_2016, place={Cham}, series={Lecture Notes in Computer Science}, title={Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers}, DOI={10.1007/978-3-319-50349-3_4}, booktitle={Learning and Intelligent Optimization}, publisher={Springer International Publishing}, author={Bossek, Jakob and Trautmann, Heike}, editor={Festa, Paola and Sellmann, Meinolf and Vanschoren, Joaquin}, year={2016}, pages={48–59}, collection={Lecture Notes in Computer Science} }' chicago: 'Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers.” In Learning and Intelligent Optimization, edited by Paola Festa, Meinolf Sellmann, and Joaquin Vanschoren, 48–59. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2016. https://doi.org/10.1007/978-3-319-50349-3_4.' ieee: 'J. Bossek and H. Trautmann, “Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers,” in Learning and Intelligent Optimization, 2016, pp. 48–59, doi: 10.1007/978-3-319-50349-3_4.' mla: Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers.” Learning and Intelligent Optimization, edited by Paola Festa et al., Springer International Publishing, 2016, pp. 48–59, doi:10.1007/978-3-319-50349-3_4. short: 'J. Bossek, H. Trautmann, in: P. Festa, M. Sellmann, J. Vanschoren (Eds.), Learning and Intelligent Optimization, Springer International Publishing, Cham, 2016, pp. 48–59.' date_created: 2023-11-14T15:58:57Z date_updated: 2023-12-13T10:47:05Z department: - _id: '819' doi: 10.1007/978-3-319-50349-3_4 editor: - first_name: Paola full_name: Festa, Paola last_name: Festa - first_name: Meinolf full_name: Sellmann, Meinolf last_name: Sellmann - first_name: Joaquin full_name: Vanschoren, Joaquin last_name: Vanschoren extern: '1' keyword: - Algorithm selection - Feature selection - Instance hardness - TSP language: - iso: eng page: 48–59 place: Cham publication: Learning and Intelligent Optimization publication_identifier: isbn: - 978-3-319-50349-3 publication_status: published publisher: Springer International Publishing series_title: Lecture Notes in Computer Science status: public title: Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers type: conference user_id: '102979' year: '2016' ... --- _id: '51464' author: - first_name: Joachim full_name: Hilgert, Joachim id: '220' last_name: Hilgert citation: ama: 'Hilgert J. Schwierigkeiten beim Übergang von Schule zu Hochschule im zeitlichen Vergleich - Ein Blick auf Defizite beim Erwerb von Schlüsselkompetenzen. In: Hoppenbrock A, et al., eds. Lehren und Lernen von Mathematik in der Studieneingangsphase. Springer Spektrum; 2016.' apa: Hilgert, J. (2016). Schwierigkeiten beim Übergang von Schule zu Hochschule im zeitlichen Vergleich - Ein Blick auf Defizite beim Erwerb von Schlüsselkompetenzen. In A. Hoppenbrock & et al. (Eds.), Lehren und Lernen von Mathematik in der Studieneingangsphase. Springer Spektrum. bibtex: '@inbook{Hilgert_2016, title={Schwierigkeiten beim Übergang von Schule zu Hochschule im zeitlichen Vergleich - Ein Blick auf Defizite beim Erwerb von Schlüsselkompetenzen}, booktitle={Lehren und Lernen von Mathematik in der Studieneingangsphase}, publisher={Springer Spektrum}, author={Hilgert, Joachim}, editor={Hoppenbrock, A. and et al.}, year={2016} }' chicago: Hilgert, Joachim. “Schwierigkeiten beim Übergang von Schule zu Hochschule im zeitlichen Vergleich - Ein Blick auf Defizite beim Erwerb von Schlüsselkompetenzen.” In Lehren und Lernen von Mathematik in der Studieneingangsphase, edited by A. Hoppenbrock and et al. Springer Spektrum, 2016. ieee: J. Hilgert, “Schwierigkeiten beim Übergang von Schule zu Hochschule im zeitlichen Vergleich - Ein Blick auf Defizite beim Erwerb von Schlüsselkompetenzen,” in Lehren und Lernen von Mathematik in der Studieneingangsphase, A. Hoppenbrock and et al., Eds. Springer Spektrum, 2016. mla: Hilgert, Joachim. “Schwierigkeiten beim Übergang von Schule zu Hochschule im zeitlichen Vergleich - Ein Blick auf Defizite beim Erwerb von Schlüsselkompetenzen.” Lehren und Lernen von Mathematik in der Studieneingangsphase, edited by A. Hoppenbrock and et al., Springer Spektrum, 2016. short: 'J. Hilgert, in: A. Hoppenbrock, et al. (Eds.), Lehren und Lernen von Mathematik in der Studieneingangsphase, Springer Spektrum, 2016.' corporate_editor: - et al. date_created: 2024-02-19T08:06:18Z date_updated: 2024-02-19T08:06:22Z department: - _id: '91' editor: - first_name: A. full_name: Hoppenbrock, A. last_name: Hoppenbrock language: - iso: ger publication: Lehren und Lernen von Mathematik in der Studieneingangsphase publication_status: published publisher: Springer Spektrum status: public title: Schwierigkeiten beim Übergang von Schule zu Hochschule im zeitlichen Vergleich - Ein Blick auf Defizite beim Erwerb von Schlüsselkompetenzen type: book_chapter user_id: '49063' year: '2016' ... --- _id: '51463' author: - first_name: Joachim full_name: Hilgert, Joachim id: '220' last_name: Hilgert - first_name: A. full_name: Pasquale, A. last_name: Pasquale - first_name: T. full_name: Przebinda, T. last_name: Przebinda citation: ama: 'Hilgert J, Pasquale A, Przebinda T. Resonances for the Laplacian: the cases BC2 and C2 (except SO(p,2) with p>2 odd). In: Kielanowski P, et al., eds. Geometric Methods in Physics. Birkhäuser; 2016.' apa: 'Hilgert, J., Pasquale, A., & Przebinda, T. (2016). Resonances for the Laplacian: the cases BC2 and C2 (except SO(p,2) with p>2 odd). In P. Kielanowski & et al. (Eds.), Geometric Methods in Physics. Birkhäuser.' bibtex: '@inbook{Hilgert_Pasquale_Przebinda_2016, title={Resonances for the Laplacian: the cases BC2 and C2 (except SO(p,2) with p>2 odd)}, booktitle={Geometric Methods in Physics}, publisher={Birkhäuser}, author={Hilgert, Joachim and Pasquale, A. and Przebinda, T.}, editor={Kielanowski, P. and et al.}, year={2016} }' chicago: 'Hilgert, Joachim, A. Pasquale, and T. Przebinda. “Resonances for the Laplacian: The Cases BC2 and C2 (except SO(p,2) with P>2 Odd).” In Geometric Methods in Physics, edited by P. Kielanowski and et al. Birkhäuser, 2016.' ieee: 'J. Hilgert, A. Pasquale, and T. Przebinda, “Resonances for the Laplacian: the cases BC2 and C2 (except SO(p,2) with p>2 odd),” in Geometric Methods in Physics, P. Kielanowski and et al., Eds. Birkhäuser, 2016.' mla: 'Hilgert, Joachim, et al. “Resonances for the Laplacian: The Cases BC2 and C2 (except SO(p,2) with P>2 Odd).” Geometric Methods in Physics, edited by P. Kielanowski and et al., Birkhäuser, 2016.' short: 'J. Hilgert, A. Pasquale, T. Przebinda, in: P. Kielanowski, et al. (Eds.), Geometric Methods in Physics, Birkhäuser, 2016.' corporate_editor: - et al. date_created: 2024-02-19T08:05:20Z date_updated: 2024-02-19T08:05:24Z department: - _id: '91' editor: - first_name: P. full_name: Kielanowski, P. last_name: Kielanowski language: - iso: eng publication: Geometric Methods in Physics publication_status: published publisher: Birkhäuser status: public title: 'Resonances for the Laplacian: the cases BC2 and C2 (except SO(p,2) with p>2 odd)' type: book_chapter user_id: '49063' year: '2016' ... --- _id: '51489' citation: ama: Hilgert J, ed. Mathematische Strukturen. Springer Spektrum; 2016. apa: Hilgert, J. (Ed.). (2016). Mathematische Strukturen. Springer Spektrum. bibtex: '@book{Hilgert_2016, title={Mathematische Strukturen}, publisher={Springer Spektrum}, year={2016} }' chicago: Hilgert, Joachim, ed. Mathematische Strukturen. Springer Spektrum, 2016. ieee: J. Hilgert, Ed., Mathematische Strukturen. Springer Spektrum, 2016. mla: Hilgert, Joachim, editor. Mathematische Strukturen. Springer Spektrum, 2016. short: J. Hilgert, ed., Mathematische Strukturen, Springer Spektrum, 2016. date_created: 2024-02-19T10:16:40Z date_updated: 2024-02-19T10:16:47Z department: - _id: '91' editor: - first_name: Joachim full_name: Hilgert, Joachim id: '220' last_name: Hilgert language: - iso: ger main_file_link: - url: https://link.springer.com/book/10.1007/978-3-662-48870-6 publication_status: published publisher: Springer Spektrum status: public title: Mathematische Strukturen type: book_editor user_id: '49063' year: '2016' ... --- _id: '52575' author: - first_name: Gerda full_name: Werth, Gerda id: '578' last_name: Werth citation: ama: 'Werth G. Ziehen und Beweisen mit DGS - Welche Beweiskraft haben für Studierende die Erkenntnisse, die sie im Zugmodus gewinnen? In: Institut für Mathematik und Informatik der Pädagogischen Hochschule Heidelberg, ed. Beiträge zum Mathematikunterricht. WTM; 2016.' apa: Werth, G. (2016). Ziehen und Beweisen mit DGS - Welche Beweiskraft haben für Studierende die Erkenntnisse, die sie im Zugmodus gewinnen? In Institut für Mathematik und Informatik der Pädagogischen Hochschule Heidelberg (Ed.), Beiträge zum Mathematikunterricht. WTM. bibtex: '@inproceedings{Werth_2016, place={Münster}, title={Ziehen und Beweisen mit DGS - Welche Beweiskraft haben für Studierende die Erkenntnisse, die sie im Zugmodus gewinnen?}, booktitle={Beiträge zum Mathematikunterricht}, publisher={WTM}, author={Werth, Gerda}, editor={Institut für Mathematik und Informatik der Pädagogischen Hochschule Heidelberg}, year={2016} }' chicago: 'Werth, Gerda. “Ziehen und Beweisen mit DGS - Welche Beweiskraft haben für Studierende die Erkenntnisse, die sie im Zugmodus gewinnen?” In Beiträge zum Mathematikunterricht, edited by Institut für Mathematik und Informatik der Pädagogischen Hochschule Heidelberg. Münster: WTM, 2016.' ieee: G. Werth, “Ziehen und Beweisen mit DGS - Welche Beweiskraft haben für Studierende die Erkenntnisse, die sie im Zugmodus gewinnen?,” in Beiträge zum Mathematikunterricht, Heidelberg, 2016. mla: Werth, Gerda. “Ziehen und Beweisen mit DGS - Welche Beweiskraft haben für Studierende die Erkenntnisse, die sie im Zugmodus gewinnen?” Beiträge zum Mathematikunterricht, edited by Institut für Mathematik und Informatik der Pädagogischen Hochschule Heidelberg, WTM, 2016. short: 'G. Werth, in: Institut für Mathematik und Informatik der Pädagogischen Hochschule Heidelberg (Ed.), Beiträge zum Mathematikunterricht, WTM, Münster, 2016.' conference: end_date: 2016-03-11 location: Heidelberg name: 50. Tagung für Didaktik der Mathematik start_date: 2016-03-07 corporate_editor: - Institut für Mathematik und Informatik der Pädagogischen Hochschule Heidelberg date_created: 2024-03-14T11:23:04Z date_updated: 2024-03-14T11:23:50Z department: - _id: '98' language: - iso: ger place: Münster publication: Beiträge zum Mathematikunterricht publication_status: published publisher: WTM status: public title: Ziehen und Beweisen mit DGS - Welche Beweiskraft haben für Studierende die Erkenntnisse, die sie im Zugmodus gewinnen? type: conference user_id: '578' year: '2016' ... --- _id: '52803' author: - first_name: Stefan full_name: Borgwardt, Stefan last_name: Borgwardt - first_name: Theofilos full_name: Mailis, Theofilos last_name: Mailis - first_name: Rafael full_name: Peñaloza, Rafael last_name: Peñaloza - first_name: Anni-Yasmin full_name: Turhan, Anni-Yasmin id: '104470' last_name: Turhan citation: ama: Borgwardt S, Mailis T, Peñaloza R, Turhan A-Y. Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies. Journal on Data Semantics. 2016;5(2):55-75. doi:10.1007/s13740-015-0055-y apa: Borgwardt, S., Mailis, T., Peñaloza, R., & Turhan, A.-Y. (2016). Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies. Journal on Data Semantics, 5(2), 55–75. https://doi.org/10.1007/s13740-015-0055-y bibtex: '@article{Borgwardt_Mailis_Peñaloza_Turhan_2016, title={Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies}, volume={5}, DOI={10.1007/s13740-015-0055-y}, number={2}, journal={Journal on Data Semantics}, publisher={Springer Science and Business Media LLC}, author={Borgwardt, Stefan and Mailis, Theofilos and Peñaloza, Rafael and Turhan, Anni-Yasmin}, year={2016}, pages={55–75} }' chicago: 'Borgwardt, Stefan, Theofilos Mailis, Rafael Peñaloza, and Anni-Yasmin Turhan. “Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies.” Journal on Data Semantics 5, no. 2 (2016): 55–75. https://doi.org/10.1007/s13740-015-0055-y.' ieee: 'S. Borgwardt, T. Mailis, R. Peñaloza, and A.-Y. Turhan, “Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies,” Journal on Data Semantics, vol. 5, no. 2, pp. 55–75, 2016, doi: 10.1007/s13740-015-0055-y.' mla: Borgwardt, Stefan, et al. “Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies.” Journal on Data Semantics, vol. 5, no. 2, Springer Science and Business Media LLC, 2016, pp. 55–75, doi:10.1007/s13740-015-0055-y. short: S. Borgwardt, T. Mailis, R. Peñaloza, A.-Y. Turhan, Journal on Data Semantics 5 (2016) 55–75. date_created: 2024-03-25T09:23:39Z date_updated: 2024-03-25T13:50:33Z department: - _id: '888' doi: 10.1007/s13740-015-0055-y intvolume: ' 5' issue: '2' keyword: - Artificial Intelligence - Computer Networks and Communications - Information Systems language: - iso: eng page: 55-75 publication: Journal on Data Semantics publication_identifier: issn: - 1861-2032 - 1861-2040 publication_status: published publisher: Springer Science and Business Media LLC status: public title: Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies type: journal_article user_id: '9503' volume: 5 year: '2016' ... --- _id: '250' abstract: - lang: eng text: Before execution, users should formally validate the correctness of software received from untrusted providers. To accelerate this validation, in the proof carrying code (PCC) paradigm the provider delivers the software together with a certificate, a formal proof of the software’s correctness. Thus, the user only checks if the attached certificate shows correctness of the delivered software.Recently, we introduced configurable program certification, a generic, PCC based framework supporting various software analyses and safety properties. Evaluation of our framework revealed that validation suffers from certificate reading. In this paper, we present two orthogonal approaches which improve certificate validation, both reducing the impact of certificate reading. The first approach reduces the certificate size, storing information only if it cannot easily be recomputed. The second approach partitions the certificate into independently checkable parts. The trick is to read parts of the certificate while already checking read parts. Our experiments show that validation highly benefits from our improvements. author: - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs citation: ama: 'Jakobs M-C. Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning. In: Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM). LNCS. ; 2015:159--174. doi:10.1007/978-3-319-22969-0_12' apa: Jakobs, M.-C. (2015). Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning. In Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM) (pp. 159--174). https://doi.org/10.1007/978-3-319-22969-0_12 bibtex: '@inproceedings{Jakobs_2015, series={LNCS}, title={Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning}, DOI={10.1007/978-3-319-22969-0_12}, booktitle={Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM)}, author={Jakobs, Marie-Christine}, year={2015}, pages={159--174}, collection={LNCS} }' chicago: Jakobs, Marie-Christine. “Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning.” In Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM), 159--174. LNCS, 2015. https://doi.org/10.1007/978-3-319-22969-0_12. ieee: M.-C. Jakobs, “Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning,” in Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM), 2015, pp. 159--174. mla: Jakobs, Marie-Christine. “Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning.” Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM), 2015, pp. 159--174, doi:10.1007/978-3-319-22969-0_12. short: 'M.-C. Jakobs, in: Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM), 2015, pp. 159--174.' date_created: 2017-10-17T12:41:40Z date_updated: 2022-01-06T06:56:43Z ddc: - '040' department: - _id: '77' doi: 10.1007/978-3-319-22969-0_12 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:45:15Z date_updated: 2018-03-21T09:45:15Z file_id: '1489' file_name: 250-Jakobs2015.pdf file_size: 724308 relation: main_file success: 1 file_date_updated: 2018-03-21T09:45:15Z has_accepted_license: '1' language: - iso: eng page: 159--174 project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM) series_title: LNCS status: public title: Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning type: conference user_id: '477' year: '2015' ... --- _id: '25073' abstract: - lang: eng text: In this paper, we introduce an approach for combining embedded systems with Service-oriented Computing techniques based on a concrete application scenario from the robotics domain. Our proposed Service-oriented Architecture allows for incorporating computational expensive functionality as services into a distributed computing environment. Furthermore, our framework facilitates a seamless integration of embedded systems such as robots as service providers into the computing environment. The entire communication is based on so-called recipes, which can be interpreted as autonomous messages that contain all necessary information for executing compositions of services. author: - first_name: Alexander full_name: Jungmann, Alexander last_name: Jungmann - first_name: Jan full_name: Jatzkowski, Jan last_name: Jatzkowski - first_name: Bernd full_name: Kleinjohann, Bernd last_name: Kleinjohann citation: ama: 'Jungmann A, Jatzkowski J, Kleinjohann B. Combining Service-oriented Computing with Embedded Systems - A Robotics Case Study. In: Proceedings of the 5th IFIP International Embedded Systems Symposium (IESS). Springer-Verlag; 2015.' apa: Jungmann, A., Jatzkowski, J., & Kleinjohann, B. (2015). Combining Service-oriented Computing with Embedded Systems - A Robotics Case Study. Proceedings of the 5th IFIP International Embedded Systems Symposium (IESS). bibtex: '@inproceedings{Jungmann_Jatzkowski_Kleinjohann_2015, title={Combining Service-oriented Computing with Embedded Systems - A Robotics Case Study}, booktitle={Proceedings of the 5th IFIP International Embedded Systems Symposium (IESS)}, publisher={Springer-Verlag}, author={Jungmann, Alexander and Jatzkowski, Jan and Kleinjohann, Bernd}, year={2015} }' chicago: Jungmann, Alexander, Jan Jatzkowski, and Bernd Kleinjohann. “Combining Service-Oriented Computing with Embedded Systems - A Robotics Case Study.” In Proceedings of the 5th IFIP International Embedded Systems Symposium (IESS). Springer-Verlag, 2015. ieee: A. Jungmann, J. Jatzkowski, and B. Kleinjohann, “Combining Service-oriented Computing with Embedded Systems - A Robotics Case Study,” 2015. mla: Jungmann, Alexander, et al. “Combining Service-Oriented Computing with Embedded Systems - A Robotics Case Study.” Proceedings of the 5th IFIP International Embedded Systems Symposium (IESS), Springer-Verlag, 2015. short: 'A. Jungmann, J. Jatzkowski, B. Kleinjohann, in: Proceedings of the 5th IFIP International Embedded Systems Symposium (IESS), Springer-Verlag, 2015.' conference: end_date: 2015-11-06 start_date: 2015-11-03 date_created: 2021-09-28T11:42:10Z date_updated: 2022-01-06T06:56:50Z department: - _id: '672' language: - iso: eng publication: Proceedings of the 5th IFIP International Embedded Systems Symposium (IESS) publisher: Springer-Verlag status: public title: Combining Service-oriented Computing with Embedded Systems - A Robotics Case Study type: conference user_id: '21240' year: '2015' ... --- _id: '25074' author: - first_name: Jan full_name: Jatzkowski, Jan last_name: Jatzkowski - first_name: Marcio Eduardo full_name: Kreutz, Marcio Eduardo last_name: Kreutz - first_name: Achim full_name: Rettberg, Achim last_name: Rettberg citation: ama: 'Jatzkowski J, Kreutz ME, Rettberg A. Hierarchical Multicore-Scheduling for Virtualization of Dependent Real-Time Systems. In: Proceedings of the 5th IFIP International Embedded Systems Symposium (IESS). Springer; 2015.' apa: Jatzkowski, J., Kreutz, M. E., & Rettberg, A. (2015). Hierarchical Multicore-Scheduling for Virtualization of Dependent Real-Time Systems. Proceedings of the 5th IFIP International Embedded Systems Symposium (IESS). bibtex: '@inproceedings{Jatzkowski_Kreutz_Rettberg_2015, title={Hierarchical Multicore-Scheduling for Virtualization of Dependent Real-Time Systems}, booktitle={Proceedings of the 5th IFIP International Embedded Systems Symposium (IESS)}, publisher={Springer}, author={Jatzkowski, Jan and Kreutz, Marcio Eduardo and Rettberg, Achim}, year={2015} }' chicago: Jatzkowski, Jan, Marcio Eduardo Kreutz, and Achim Rettberg. “Hierarchical Multicore-Scheduling for Virtualization of Dependent Real-Time Systems.” In Proceedings of the 5th IFIP International Embedded Systems Symposium (IESS). Springer, 2015. ieee: J. Jatzkowski, M. E. Kreutz, and A. Rettberg, “Hierarchical Multicore-Scheduling for Virtualization of Dependent Real-Time Systems,” 2015. mla: Jatzkowski, Jan, et al. “Hierarchical Multicore-Scheduling for Virtualization of Dependent Real-Time Systems.” Proceedings of the 5th IFIP International Embedded Systems Symposium (IESS), Springer, 2015. short: 'J. Jatzkowski, M.E. Kreutz, A. Rettberg, in: Proceedings of the 5th IFIP International Embedded Systems Symposium (IESS), Springer, 2015.' conference: end_date: 2015-11-06 start_date: 2015-11-03 date_created: 2021-09-28T11:45:59Z date_updated: 2022-01-06T06:56:50Z department: - _id: '672' language: - iso: eng publication: Proceedings of the 5th IFIP International Embedded Systems Symposium (IESS) publisher: Springer status: public title: Hierarchical Multicore-Scheduling for Virtualization of Dependent Real-Time Systems type: conference user_id: '21240' year: '2015' ... --- _id: '25075' author: - first_name: Katharina full_name: Stahl, Katharina last_name: Stahl - first_name: Jörg full_name: Stöcklein, Jörg last_name: Stöcklein - first_name: Silja full_name: Li, Silja last_name: Li citation: ama: 'Stahl K, Stöcklein J, Li S. Evaluation of Autonomous Approaches using Virtual Environments. In: Shumaker R, Lackey S, eds. Virtual, Augmented and Mixed Reality VAMR 2015 Held as Part of HCI International 2015. Vol 9179. LNCS. Springer International Publishing Switzerland; 2015:499-512.' apa: Stahl, K., Stöcklein, J., & Li, S. (2015). Evaluation of Autonomous Approaches using Virtual Environments. In R. Shumaker & S. Lackey (Eds.), Virtual, Augmented and Mixed Reality VAMR 2015 Held as Part of HCI International 2015 (Vol. 9179, pp. 499–512). Springer International Publishing Switzerland. bibtex: '@inproceedings{Stahl_Stöcklein_Li_2015, series={LNCS}, title={Evaluation of Autonomous Approaches using Virtual Environments}, volume={9179}, booktitle={Virtual, Augmented and Mixed Reality VAMR 2015 Held as Part of HCI International 2015}, publisher={Springer International Publishing Switzerland}, author={Stahl, Katharina and Stöcklein, Jörg and Li, Silja}, editor={Shumaker, Randall and Lackey, Stephanie}, year={2015}, pages={499–512}, collection={LNCS} }' chicago: Stahl, Katharina, Jörg Stöcklein, and Silja Li. “Evaluation of Autonomous Approaches Using Virtual Environments.” In Virtual, Augmented and Mixed Reality VAMR 2015 Held as Part of HCI International 2015, edited by Randall Shumaker and Stephanie Lackey, 9179:499–512. LNCS. Springer International Publishing Switzerland, 2015. ieee: K. Stahl, J. Stöcklein, and S. Li, “Evaluation of Autonomous Approaches using Virtual Environments,” in Virtual, Augmented and Mixed Reality VAMR 2015 Held as Part of HCI International 2015, Los Angeles, CA, USA, 2. - 7. Aug. 2015, 2015, vol. 9179, pp. 499–512. mla: Stahl, Katharina, et al. “Evaluation of Autonomous Approaches Using Virtual Environments.” Virtual, Augmented and Mixed Reality VAMR 2015 Held as Part of HCI International 2015, edited by Randall Shumaker and Stephanie Lackey, vol. 9179, Springer International Publishing Switzerland, 2015, pp. 499–512. short: 'K. Stahl, J. Stöcklein, S. Li, in: R. Shumaker, S. Lackey (Eds.), Virtual, Augmented and Mixed Reality VAMR 2015 Held as Part of HCI International 2015, Springer International Publishing Switzerland, 2015, pp. 499–512.' conference: end_date: 2015-08-07 location: Los Angeles, CA, USA, 2. - 7. Aug. 2015 start_date: 2015-08-02 date_created: 2021-09-28T11:54:54Z date_updated: 2022-01-06T06:56:50Z department: - _id: '672' editor: - first_name: Randall full_name: Shumaker, Randall last_name: Shumaker - first_name: Stephanie full_name: Lackey, Stephanie last_name: Lackey language: - iso: eng page: 499-512 publication: Virtual, Augmented and Mixed Reality VAMR 2015 Held as Part of HCI International 2015 publisher: Springer International Publishing Switzerland series_title: LNCS status: public title: Evaluation of Autonomous Approaches using Virtual Environments type: conference user_id: '21240' volume: ' 9179' year: '2015' ... --- _id: '25076' abstract: - lang: eng text: Automated service composition aims at automatically generating software solutions based on services to provide more complex functionality. In this paper, we give an initial overview about why adaptivity becomes increasingly important when aiming for automated composition of service functionality in dynamic and freely accessible environments such as service markets. We systematically derive dependencies among crucial processes such as service composition and service execution in a holistic view. Furthermore, we briefly discuss the influences and effects of changes in the environment according to the derived dependencies, and discuss possible future research directions. author: - first_name: Alexander full_name: Jungmann, Alexander last_name: Jungmann citation: ama: 'Jungmann A. On Adaptivity for Automated Composition of Service Functionality. In: Proceedings of the IEEE 11th World Congress on Services (SERVICES). IEEE Computer Society; 2015:329-332.' apa: Jungmann, A. (2015). On Adaptivity for Automated Composition of Service Functionality. Proceedings of the IEEE 11th World Congress on Services (SERVICES), 329–332. bibtex: '@inproceedings{Jungmann_2015, title={On Adaptivity for Automated Composition of Service Functionality}, booktitle={Proceedings of the IEEE 11th World Congress on Services (SERVICES)}, publisher={IEEE Computer Society}, author={Jungmann, Alexander}, year={2015}, pages={329–332} }' chicago: Jungmann, Alexander. “On Adaptivity for Automated Composition of Service Functionality.” In Proceedings of the IEEE 11th World Congress on Services (SERVICES), 329–32. IEEE Computer Society, 2015. ieee: A. Jungmann, “On Adaptivity for Automated Composition of Service Functionality,” in Proceedings of the IEEE 11th World Congress on Services (SERVICES), 2015, pp. 329–332. mla: Jungmann, Alexander. “On Adaptivity for Automated Composition of Service Functionality.” Proceedings of the IEEE 11th World Congress on Services (SERVICES), IEEE Computer Society, 2015, pp. 329–32. short: 'A. Jungmann, in: Proceedings of the IEEE 11th World Congress on Services (SERVICES), IEEE Computer Society, 2015, pp. 329–332.' conference: end_date: 2015-07-02 start_date: 2016-06-26 date_created: 2021-09-28T12:06:08Z date_updated: 2022-01-06T06:56:50Z department: - _id: '672' language: - iso: eng page: 329-332 publication: Proceedings of the IEEE 11th World Congress on Services (SERVICES) publisher: IEEE Computer Society status: public title: On Adaptivity for Automated Composition of Service Functionality type: conference user_id: '21240' year: '2015' ... --- _id: '25080' abstract: - lang: eng text: ervices are self-contained and platform independent software components that aim at maximizing software reuse. The automated composition of services to a target software artifact has been tackled with many AI techniques, but existing approaches make unreasonably strong assumptions such as a predefined data flow, are limited to tiny problem sizes, ignore non-functional properties, or assume offline service repositories. This paper presents an algorithm that automatically composes services without making such assumptions. We employ a backward search algorithm that starts from an empty composition and prepends service calls to already discovered candidates until a solution is found. Available services are determined during the search process. We implemented our algorithm, performed an experimental evaluation, and compared it to other approaches. author: - first_name: Felix full_name: Mohr, Felix last_name: Mohr - first_name: Alexander full_name: Jungmann, Alexander last_name: Jungmann - first_name: Hans full_name: Kleine Büning, Hans last_name: Kleine Büning citation: ama: 'Mohr F, Jungmann A, Kleine Büning H. Automated Online Service Composition. In: Proceedings of the 12th IEEE International Conference on Services Computing (SCC). IEEE Computer Society; 2015:57-64.' apa: Mohr, F., Jungmann, A., & Kleine Büning, H. (2015). Automated Online Service Composition. Proceedings of the 12th IEEE International Conference on Services Computing (SCC), 57–64. bibtex: '@inproceedings{Mohr_Jungmann_Kleine Büning_2015, title={Automated Online Service Composition}, booktitle={Proceedings of the 12th IEEE International Conference on Services Computing (SCC)}, publisher={ IEEE Computer Society}, author={Mohr, Felix and Jungmann, Alexander and Kleine Büning, Hans}, year={2015}, pages={57–64} }' chicago: Mohr, Felix, Alexander Jungmann, and Hans Kleine Büning. “Automated Online Service Composition.” In Proceedings of the 12th IEEE International Conference on Services Computing (SCC), 57–64. IEEE Computer Society, 2015. ieee: F. Mohr, A. Jungmann, and H. Kleine Büning, “Automated Online Service Composition,” in Proceedings of the 12th IEEE International Conference on Services Computing (SCC), 2015, pp. 57–64. mla: Mohr, Felix, et al. “Automated Online Service Composition.” Proceedings of the 12th IEEE International Conference on Services Computing (SCC), IEEE Computer Society, 2015, pp. 57–64. short: 'F. Mohr, A. Jungmann, H. Kleine Büning, in: Proceedings of the 12th IEEE International Conference on Services Computing (SCC), IEEE Computer Society, 2015, pp. 57–64.' conference: end_date: 2015-07-02 start_date: 2015-06-26 date_created: 2021-09-28T12:27:27Z date_updated: 2022-01-06T06:56:50Z department: - _id: '672' language: - iso: eng page: 57-64 publication: Proceedings of the 12th IEEE International Conference on Services Computing (SCC) publisher: ' IEEE Computer Society' status: public title: Automated Online Service Composition type: conference user_id: '21240' year: '2015' ... --- _id: '25082' author: - first_name: Jan full_name: Jatzkowski, Jan last_name: Jatzkowski - first_name: Marcio Eduardo full_name: Kreutz, Marcio Eduardo last_name: Kreutz - first_name: Achim full_name: Rettberg, Achim last_name: Rettberg citation: ama: 'Jatzkowski J, Kreutz ME, Rettberg A. Towards Hierarchical Scheduling of Dependent Systems with Hypervisor-based Virtualization. In: Proceedings of Electronic System Level Synthesis Conference (ESLsyn). ; 2015.' apa: Jatzkowski, J., Kreutz, M. E., & Rettberg, A. (2015). Towards Hierarchical Scheduling of Dependent Systems with Hypervisor-based Virtualization. Proceedings of Electronic System Level Synthesis Conference (ESLsyn). bibtex: '@inproceedings{Jatzkowski_Kreutz_Rettberg_2015, title={Towards Hierarchical Scheduling of Dependent Systems with Hypervisor-based Virtualization}, booktitle={Proceedings of Electronic System Level Synthesis Conference (ESLsyn)}, author={Jatzkowski, Jan and Kreutz, Marcio Eduardo and Rettberg, Achim}, year={2015} }' chicago: Jatzkowski, Jan, Marcio Eduardo Kreutz, and Achim Rettberg. “Towards Hierarchical Scheduling of Dependent Systems with Hypervisor-Based Virtualization.” In Proceedings of Electronic System Level Synthesis Conference (ESLsyn), 2015. ieee: J. Jatzkowski, M. E. Kreutz, and A. Rettberg, “Towards Hierarchical Scheduling of Dependent Systems with Hypervisor-based Virtualization,” 2015. mla: Jatzkowski, Jan, et al. “Towards Hierarchical Scheduling of Dependent Systems with Hypervisor-Based Virtualization.” Proceedings of Electronic System Level Synthesis Conference (ESLsyn), 2015. short: 'J. Jatzkowski, M.E. Kreutz, A. Rettberg, in: Proceedings of Electronic System Level Synthesis Conference (ESLsyn), 2015.' conference: end_date: 2015-06-11 start_date: 2015-06-10 date_created: 2021-09-28T12:31:36Z date_updated: 2022-01-06T06:56:50Z department: - _id: '672' language: - iso: eng publication: Proceedings of Electronic System Level Synthesis Conference (ESLsyn) status: public title: Towards Hierarchical Scheduling of Dependent Systems with Hypervisor-based Virtualization type: conference user_id: '21240' year: '2015' ... --- _id: '25083' author: - first_name: Jan full_name: Jatzkowski, Jan last_name: Jatzkowski - first_name: Bernd full_name: Kleinjohann, Bernd last_name: Kleinjohann citation: ama: 'Jatzkowski J, Kleinjohann B. Self-Reconfiguration of Real-Time Communication within Cyber-Physical Systems. In: Mechatronics. Elsevier; 2015.' apa: Jatzkowski, J., & Kleinjohann, B. (2015). Self-Reconfiguration of Real-Time Communication within Cyber-Physical Systems. Mechatronics. bibtex: '@inproceedings{Jatzkowski_Kleinjohann_2015, title={Self-Reconfiguration of Real-Time Communication within Cyber-Physical Systems}, booktitle={Mechatronics}, publisher={Elsevier}, author={Jatzkowski, Jan and Kleinjohann, Bernd}, year={2015} }' chicago: Jatzkowski, Jan, and Bernd Kleinjohann. “Self-Reconfiguration of Real-Time Communication within Cyber-Physical Systems.” In Mechatronics. Elsevier, 2015. ieee: J. Jatzkowski and B. Kleinjohann, “Self-Reconfiguration of Real-Time Communication within Cyber-Physical Systems,” Mai 2015, 2015. mla: Jatzkowski, Jan, and Bernd Kleinjohann. “Self-Reconfiguration of Real-Time Communication within Cyber-Physical Systems.” Mechatronics, Elsevier, 2015. short: 'J. Jatzkowski, B. Kleinjohann, in: Mechatronics, Elsevier, 2015.' conference: location: Mai 2015 date_created: 2021-09-28T12:42:40Z date_updated: 2022-01-06T06:56:50Z department: - _id: '672' language: - iso: eng publication: Mechatronics publisher: Elsevier status: public title: Self-Reconfiguration of Real-Time Communication within Cyber-Physical Systems type: conference user_id: '21240' year: '2015' ... --- _id: '251' author: - first_name: Karlson full_name: Pfannschmidt, Karlson last_name: Pfannschmidt citation: ama: Pfannschmidt K. Solving the Aggregated Bandits Problem. Universität Paderborn; 2015. apa: Pfannschmidt, K. (2015). Solving the aggregated bandits problem. Universität Paderborn. bibtex: '@book{Pfannschmidt_2015, title={Solving the aggregated bandits problem}, publisher={Universität Paderborn}, author={Pfannschmidt, Karlson}, year={2015} }' chicago: Pfannschmidt, Karlson. Solving the Aggregated Bandits Problem. Universität Paderborn, 2015. ieee: K. Pfannschmidt, Solving the aggregated bandits problem. Universität Paderborn, 2015. mla: Pfannschmidt, Karlson. Solving the Aggregated Bandits Problem. Universität Paderborn, 2015. short: K. Pfannschmidt, Solving the Aggregated Bandits Problem, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:41Z date_updated: 2022-01-06T06:56:50Z department: - _id: '63' - _id: '541' project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Solving the aggregated bandits problem type: mastersthesis user_id: '14052' year: '2015' ... --- _id: '25107' abstract: - lang: eng text: On-the-fly composition of service-based software solutions is still a challenging task. Even more challenges emerge when facing automatic service composition in markets of composed services for end users. In this paper, we focus on the functional discrepancy between “what a user wants” specified in terms of a request and “what a user gets” when executing a composed service. To meet the challenge of functional discrepancy, we propose the combination of existing symbolic composition approaches with machine learning techniques. We developed a learning recommendation system that expands the capabilities of existing composition algorithms to facilitate adaptivity and consequently reduces functional discrepancy. As a representative of symbolic techniques, an Artificial Intelligence planning based approach produces solutions that are correct with respect to formal specifications. Our learning recommendation system supports the symbolic approach in decision-making. Reinforcement Learning techniques enable the recommendation system to adjust its recommendation strategy over time based on user ratings. We implemented the proposed functionality in terms of a prototypical composition framework. Preliminary results from experiments conducted in the image processing domain illustrate the benefit of combining both complementary techniques. author: - first_name: Alexander full_name: Jungmann, Alexander last_name: Jungmann - first_name: Felix full_name: Mohr, Felix last_name: Mohr citation: ama: Jungmann A, Mohr F. An approach towards adaptive service composition in markets of composed services. Journal of Internet Services and Applications 6(1). Published online 2015:1-18. apa: Jungmann, A., & Mohr, F. (2015). An approach towards adaptive service composition in markets of composed services. Journal of Internet Services and Applications 6(1), 1–18. bibtex: '@article{Jungmann_Mohr_2015, title={An approach towards adaptive service composition in markets of composed services}, journal={Journal of Internet Services and Applications 6(1)}, author={Jungmann, Alexander and Mohr, Felix}, year={2015}, pages={1–18} }' chicago: Jungmann, Alexander, and Felix Mohr. “An Approach towards Adaptive Service Composition in Markets of Composed Services.” Journal of Internet Services and Applications 6(1), 2015, 1–18. ieee: A. Jungmann and F. Mohr, “An approach towards adaptive service composition in markets of composed services,” Journal of Internet Services and Applications 6(1), pp. 1–18, 2015. mla: Jungmann, Alexander, and Felix Mohr. “An Approach towards Adaptive Service Composition in Markets of Composed Services.” Journal of Internet Services and Applications 6(1), 2015, pp. 1–18. short: A. Jungmann, F. Mohr, Journal of Internet Services and Applications 6(1) (2015) 1–18. date_created: 2021-09-29T09:39:32Z date_updated: 2022-01-06T06:56:51Z department: - _id: '672' language: - iso: eng page: 1-18 publication: Journal of Internet Services and Applications 6(1) status: public title: An approach towards adaptive service composition in markets of composed services type: journal_article user_id: '21240' year: '2015' ... --- _id: '25108' abstract: - lang: eng text: Autonomous adaptation in self-adapting embedded real-time systems introduces novel risks as it may lead to unforeseen system behavior. An anomaly detection framework integrated in a real-time operating system can ease the identification of such suspicious novel behavior and, thereby, offers the potential to enhance the reliability of the considered self-x system. However, anomaly detection is based on knowledge about normal behavior. When dealing with self-reconfiguring applications, normal behavior changes. Hence, knowledge base requires adaptation or even re-construction at runtime. The stringent restrictions of real-time systems considering runtime and memory consumption make this task to a really challenging problem. We present our idea for online construction of application behavior knowledge that does not rely on training phase. The applications' behavior is defined by the application's system call invocations. For the knowledge base, we exploit suffix trees as they offer potentials to represent application behavior patterns and associated information in a compact manner. The online algorithm provided by suffix trees is a basis to construct the knowledge base with low computational effort. Anomaly detection and classification is integrated into the online construction method. New behavioral patterns do not unconditionally update the behavior knowledge base. They are evaluated in a context-related manner inspired by Danger Theory, a special discipline of artificial immune systems. Copyright © 2015 John Wiley & Sons, Ltd. author: - first_name: Franz-Josef full_name: Rammig, Franz-Josef last_name: Rammig - first_name: Katharina full_name: Stahl, Katharina last_name: Stahl citation: ama: 'Rammig F-J, Stahl K. Online behavior classification for anomaly detection in self-x real-time systems. Concurrency and Computation: Practice and Experience . Published online 2015.' apa: 'Rammig, F.-J., & Stahl, K. (2015). Online behavior classification for anomaly detection in self-x real-time systems. Concurrency and Computation: Practice and Experience .' bibtex: '@article{Rammig_Stahl_2015, title={Online behavior classification for anomaly detection in self-x real-time systems}, journal={Concurrency and Computation: Practice and Experience }, author={Rammig, Franz-Josef and Stahl, Katharina}, year={2015} }' chicago: 'Rammig, Franz-Josef, and Katharina Stahl. “Online Behavior Classification for Anomaly Detection in Self-x Real-Time Systems.” Concurrency and Computation: Practice and Experience , 2015.' ieee: 'F.-J. Rammig and K. Stahl, “Online behavior classification for anomaly detection in self-x real-time systems,” Concurrency and Computation: Practice and Experience , 2015.' mla: 'Rammig, Franz-Josef, and Katharina Stahl. “Online Behavior Classification for Anomaly Detection in Self-x Real-Time Systems.” Concurrency and Computation: Practice and Experience , 2015.' short: 'F.-J. Rammig, K. Stahl, Concurrency and Computation: Practice and Experience (2015).' date_created: 2021-09-29T09:43:32Z date_updated: 2022-01-06T06:56:51Z department: - _id: '672' language: - iso: eng publication: 'Concurrency and Computation: Practice and Experience ' status: public title: Online behavior classification for anomaly detection in self-x real-time systems type: journal_article user_id: '21240' year: '2015' ... --- _id: '25109' author: - first_name: Krishna full_name: Sudhakar, Krishna last_name: Sudhakar - first_name: Yuhong full_name: Zhao, Yuhong last_name: Zhao - first_name: Franz-Josef full_name: Rammig, Franz-Josef last_name: Rammig citation: ama: 'Sudhakar K, Zhao Y, Rammig F-J. Efficient Integration of Online Model Checking into a Small-Footprint Real-Time Operating System. Concurrency and Computation: Practice and Experience . Published online 2015.' apa: 'Sudhakar, K., Zhao, Y., & Rammig, F.-J. (2015). Efficient Integration of Online Model Checking into a Small-Footprint Real-Time Operating System. Concurrency and Computation: Practice and Experience .' bibtex: '@article{Sudhakar_Zhao_Rammig_2015, title={Efficient Integration of Online Model Checking into a Small-Footprint Real-Time Operating System}, journal={Concurrency and Computation: Practice and Experience }, author={Sudhakar, Krishna and Zhao, Yuhong and Rammig, Franz-Josef}, year={2015} }' chicago: 'Sudhakar, Krishna, Yuhong Zhao, and Franz-Josef Rammig. “Efficient Integration of Online Model Checking into a Small-Footprint Real-Time Operating System.” Concurrency and Computation: Practice and Experience , 2015.' ieee: 'K. Sudhakar, Y. Zhao, and F.-J. Rammig, “Efficient Integration of Online Model Checking into a Small-Footprint Real-Time Operating System,” Concurrency and Computation: Practice and Experience , 2015.' mla: 'Sudhakar, Krishna, et al. “Efficient Integration of Online Model Checking into a Small-Footprint Real-Time Operating System.” Concurrency and Computation: Practice and Experience , 2015.' short: 'K. Sudhakar, Y. Zhao, F.-J. Rammig, Concurrency and Computation: Practice and Experience (2015).' date_created: 2021-09-29T09:53:25Z date_updated: 2022-01-06T06:56:51Z department: - _id: '672' language: - iso: eng publication: 'Concurrency and Computation: Practice and Experience ' status: public title: Efficient Integration of Online Model Checking into a Small-Footprint Real-Time Operating System type: journal_article user_id: '21240' year: '2015' ... --- _id: '25110' author: - first_name: M. tech. Mabel Mary full_name: Joy, M. tech. Mabel Mary last_name: Joy - first_name: Franz-Josef full_name: Rammig, Franz-Josef last_name: Rammig citation: ama: Joy M tech. MM, Rammig F-J. A hybrid methodology to detect memory leaks in soft real time embedded systems software. Int J of Embedded Systems. Published online 2015. apa: Joy, M. tech. M. M., & Rammig, F.-J. (2015). A hybrid methodology to detect memory leaks in soft real time embedded systems software. Int. J. of Embedded Systems. bibtex: '@article{Joy_Rammig_2015, title={A hybrid methodology to detect memory leaks in soft real time embedded systems software}, journal={Int. J. of Embedded Systems}, author={Joy, M. tech. Mabel Mary and Rammig, Franz-Josef}, year={2015} }' chicago: Joy, M. tech. Mabel Mary, and Franz-Josef Rammig. “A Hybrid Methodology to Detect Memory Leaks in Soft Real Time Embedded Systems Software.” Int. J. of Embedded Systems, 2015. ieee: M. tech. M. M. Joy and F.-J. Rammig, “A hybrid methodology to detect memory leaks in soft real time embedded systems software,” Int. J. of Embedded Systems, 2015. mla: Joy, M. tech. Mabel Mary, and Franz-Josef Rammig. “A Hybrid Methodology to Detect Memory Leaks in Soft Real Time Embedded Systems Software.” Int. J. of Embedded Systems, 2015. short: M. tech. M.M. Joy, F.-J. Rammig, Int. J. of Embedded Systems (2015). date_created: 2021-09-29T09:55:59Z date_updated: 2022-01-06T06:56:51Z department: - _id: '672' language: - iso: eng publication: Int. J. of Embedded Systems status: public title: A hybrid methodology to detect memory leaks in soft real time embedded systems software type: journal_article user_id: '21240' year: '2015' ... --- _id: '25111' author: - first_name: Yara full_name: Khaluf, Yara last_name: Khaluf - first_name: Mauro full_name: Birattari, Mauro last_name: Birattari - first_name: Franz-Josef full_name: Rammig, Franz-Josef last_name: Rammig citation: ama: Khaluf Y, Birattari M, Rammig F-J. Analysis of long-term swarm performance based on short-term experiments. Springer Jounal Soft Computing . Published online 2015. apa: Khaluf, Y., Birattari, M., & Rammig, F.-J. (2015). Analysis of long-term swarm performance based on short-term experiments. Springer Jounal Soft Computing . bibtex: '@article{Khaluf_Birattari_Rammig_2015, title={Analysis of long-term swarm performance based on short-term experiments}, journal={Springer Jounal Soft Computing }, author={Khaluf, Yara and Birattari, Mauro and Rammig, Franz-Josef}, year={2015} }' chicago: Khaluf, Yara, Mauro Birattari, and Franz-Josef Rammig. “Analysis of Long-Term Swarm Performance Based on Short-Term Experiments.” Springer Jounal Soft Computing , 2015. ieee: Y. Khaluf, M. Birattari, and F.-J. Rammig, “Analysis of long-term swarm performance based on short-term experiments,” Springer Jounal Soft Computing , 2015. mla: Khaluf, Yara, et al. “Analysis of Long-Term Swarm Performance Based on Short-Term Experiments.” Springer Jounal Soft Computing , 2015. short: Y. Khaluf, M. Birattari, F.-J. Rammig, Springer Jounal Soft Computing (2015). date_created: 2021-09-29T09:58:49Z date_updated: 2022-01-06T06:56:51Z department: - _id: '672' language: - iso: eng publication: 'Springer Jounal Soft Computing ' status: public title: Analysis of long-term swarm performance based on short-term experiments type: journal_article user_id: '21240' year: '2015' ... --- _id: '252' abstract: - lang: eng text: 'Video streaming is in high demand by mobile users. In cellular networks, however, the unreliable wireless channel leads to two major problems. Poor channel states degrade video quality and interrupt the playback when a user cannot sufficiently fill its local playout buffer: buffer underruns occur. In contrast, good channel conditions cause common greedy buffering schemes to buffer too much data. Such over-buffering wastes expensive wireless channel capacity. Assuming that we can anticipate future data rates, we plan the quality and download time of video segments ahead. This anticipatory download scheduling avoids buffer underruns by downloading a large number of segments before a drop in available data rate occurs, without wasting wireless capacity by excessive buffering.We developed a practical anticipatory scheduling algorithm for segmented video streaming protocols (e.g., HLS or MPEG DASH). Simulation results and testbed measurements show that our solution essentially eliminates playback interruptions without significantly decreasing video quality.' author: - first_name: Martin full_name: Dräxler, Martin last_name: Dräxler - first_name: Johannes full_name: Blobel, Johannes last_name: Blobel - first_name: Philipp full_name: Dreimann, Philipp last_name: Dreimann - first_name: Stefan full_name: Valentin, Stefan last_name: Valentin - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl citation: ama: 'Dräxler M, Blobel J, Dreimann P, Valentin S, Karl H. SmarterPhones: Anticipatory Download Scheduling for Wireless Video Streaming. In: Proceedings of the 2nd International Conference on Networked Systems (NetSys). ; 2015:1--8. doi:10.1109/NetSys.2015.7089073' apa: 'Dräxler, M., Blobel, J., Dreimann, P., Valentin, S., & Karl, H. (2015). SmarterPhones: Anticipatory Download Scheduling for Wireless Video Streaming. In Proceedings of the 2nd International Conference on Networked Systems (NetSys) (pp. 1--8). https://doi.org/10.1109/NetSys.2015.7089073' bibtex: '@inproceedings{Dräxler_Blobel_Dreimann_Valentin_Karl_2015, title={SmarterPhones: Anticipatory Download Scheduling for Wireless Video Streaming}, DOI={10.1109/NetSys.2015.7089073}, booktitle={Proceedings of the 2nd International Conference on Networked Systems (NetSys)}, author={Dräxler, Martin and Blobel, Johannes and Dreimann, Philipp and Valentin, Stefan and Karl, Holger}, year={2015}, pages={1--8} }' chicago: 'Dräxler, Martin, Johannes Blobel, Philipp Dreimann, Stefan Valentin, and Holger Karl. “SmarterPhones: Anticipatory Download Scheduling for Wireless Video Streaming.” In Proceedings of the 2nd International Conference on Networked Systems (NetSys), 1--8, 2015. https://doi.org/10.1109/NetSys.2015.7089073.' ieee: 'M. Dräxler, J. Blobel, P. Dreimann, S. Valentin, and H. Karl, “SmarterPhones: Anticipatory Download Scheduling for Wireless Video Streaming,” in Proceedings of the 2nd International Conference on Networked Systems (NetSys), 2015, pp. 1--8.' mla: 'Dräxler, Martin, et al. “SmarterPhones: Anticipatory Download Scheduling for Wireless Video Streaming.” Proceedings of the 2nd International Conference on Networked Systems (NetSys), 2015, pp. 1--8, doi:10.1109/NetSys.2015.7089073.' short: 'M. Dräxler, J. Blobel, P. Dreimann, S. Valentin, H. Karl, in: Proceedings of the 2nd International Conference on Networked Systems (NetSys), 2015, pp. 1--8.' date_created: 2017-10-17T12:41:41Z date_updated: 2022-01-06T06:56:55Z ddc: - '040' department: - _id: '75' doi: 10.1109/NetSys.2015.7089073 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:44:45Z date_updated: 2018-03-21T09:44:45Z file_id: '1488' file_name: 252-DBDVK15.pdf file_size: 587685 relation: main_file success: 1 file_date_updated: 2018-03-21T09:44:45Z has_accepted_license: '1' main_file_link: - url: http://ieeexplore.ieee.org/xpls/icp.jsp?arnumber=7089073 page: 1--8 publication: Proceedings of the 2nd International Conference on Networked Systems (NetSys) status: public title: 'SmarterPhones: Anticipatory Download Scheduling for Wireless Video Streaming' type: conference user_id: '15572' year: '2015' ... --- _id: '253' abstract: - lang: eng text: Group signatures, introduced by Chaum and van Heyst [15], are an important primitive in cryptography. In group signature schemes every group member can anonymously sign messages on behalf of the group. In case of disputes a dedicated opening manager is able to trace signatures - he can extract the identity of the producer of a given signature. A formal model for static group signatures schemes and their security is defined by Bellare, Micciancio, and Warinschi [4], the case of dynamic groups is considered by Bellare, Shi, and Zhang [5]. Both models define group signature schemes with a single opening manager. The main difference between these models is that the number of group members in static schemes is fixed, while in dynamic schemes group members can join the group over time. author: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer - first_name: Jakob full_name: Juhnke, Jakob id: '48090' last_name: Juhnke - first_name: Nils full_name: Löken, Nils id: '13703' last_name: Löken citation: ama: 'Blömer J, Juhnke J, Löken N. Short Group Signatures with Distributed Traceability. In: Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS). LNCS. ; 2015:166-180. doi:10.1007/978-3-319-32859-1_14' apa: Blömer, J., Juhnke, J., & Löken, N. (2015). Short Group Signatures with Distributed Traceability. In Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS) (pp. 166–180). https://doi.org/10.1007/978-3-319-32859-1_14 bibtex: '@inproceedings{Blömer_Juhnke_Löken_2015, series={LNCS}, title={Short Group Signatures with Distributed Traceability}, DOI={10.1007/978-3-319-32859-1_14}, booktitle={Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)}, author={Blömer, Johannes and Juhnke, Jakob and Löken, Nils}, year={2015}, pages={166–180}, collection={LNCS} }' chicago: Blömer, Johannes, Jakob Juhnke, and Nils Löken. “Short Group Signatures with Distributed Traceability.” In Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 166–80. LNCS, 2015. https://doi.org/10.1007/978-3-319-32859-1_14. ieee: J. Blömer, J. Juhnke, and N. Löken, “Short Group Signatures with Distributed Traceability,” in Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2015, pp. 166–180. mla: Blömer, Johannes, et al. “Short Group Signatures with Distributed Traceability.” Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2015, pp. 166–80, doi:10.1007/978-3-319-32859-1_14. short: 'J. Blömer, J. Juhnke, N. Löken, in: Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2015, pp. 166–180.' date_created: 2017-10-17T12:41:41Z date_updated: 2022-01-06T06:59:07Z ddc: - '000' department: - _id: '64' doi: 10.1007/978-3-319-32859-1_14 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T14:08:23Z date_updated: 2018-11-02T14:08:23Z file_id: '5262' file_name: ShortGroupSignaturesWithDistri.pdf file_size: 262436 relation: main_file success: 1 file_date_updated: 2018-11-02T14:08:23Z has_accepted_license: '1' language: - iso: eng page: 166-180 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C - _id: '44' name: KogniHome - die mitdenkende Wohnung publication: Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS) related_material: record: - id: '325' relation: other status: public series_title: LNCS status: public title: Short Group Signatures with Distributed Traceability type: conference user_id: '13703' year: '2015' ... --- _id: '19959' author: - first_name: Mostafa full_name: Wahby, Mostafa last_name: Wahby - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: ama: 'Wahby M, Hamann H. On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking. In: Applications of Evolutionary Computation (EvoApplications 2015). ; 2015. doi:10.1007/978-3-319-16549-3_61' apa: 'Wahby, M., & Hamann, H. (2015). On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking. In Applications of Evolutionary Computation (EvoApplications 2015). https://doi.org/10.1007/978-3-319-16549-3_61' bibtex: '@inproceedings{Wahby_Hamann_2015, title={On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking}, DOI={10.1007/978-3-319-16549-3_61}, booktitle={Applications of Evolutionary Computation (EvoApplications 2015)}, author={Wahby, Mostafa and Hamann, Heiko}, year={2015} }' chicago: 'Wahby, Mostafa, and Heiko Hamann. “On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking.” In Applications of Evolutionary Computation (EvoApplications 2015), 2015. https://doi.org/10.1007/978-3-319-16549-3_61.' ieee: 'M. Wahby and H. Hamann, “On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking,” in Applications of Evolutionary Computation (EvoApplications 2015), 2015.' mla: 'Wahby, Mostafa, and Heiko Hamann. “On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking.” Applications of Evolutionary Computation (EvoApplications 2015), 2015, doi:10.1007/978-3-319-16549-3_61.' short: 'M. Wahby, H. Hamann, in: Applications of Evolutionary Computation (EvoApplications 2015), 2015.' date_created: 2020-10-08T12:36:48Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.1007/978-3-319-16549-3_61 language: - iso: eng publication: Applications of Evolutionary Computation (EvoApplications 2015) status: public title: 'On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking' type: conference user_id: '15415' year: '2015' ... --- _id: '19960' abstract: - lang: eng text: Besides the life-as-it-could-be driver of artificial life research there is also the concept of extending natural life by creating hybrids or mixed societies that are built from natural and artificial components. In this paper we motivate and present the research program of the project flora robotica. Our objective is to develop and to investigate closely linked symbiotic relationships between robots and natural plants and to explore the potentials of a plant-robot society able to produce architectural artifacts and living spaces. These robot-plant bio-hybrids create synergies that allow for new functions of plants and robots. They also create novel design opportunities for an architecture that fuses the design and construction phase. The bio-hybrid is an example of mixed societies between 'hard' artificial and 'wet' natural life, which enables an interaction between natural and artificial ecologies. They form an embodied, self-organizing, and distributed cognitive system which is supposed to grow and develop over long periods of time resulting in the creation of meaningful architectural structures. A key idea is to assign equal roles to robots and plants in order to create a highly integrated, symbiotic system. Besides the gain of knowledge, this project has the objective to create a bio-hybrid system with a defined function and application -- growing architectural artifacts. author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Mostafa full_name: Wahby, Mostafa last_name: Wahby - first_name: Thomas full_name: Schmickl, Thomas last_name: Schmickl - first_name: Payam full_name: Zahadat, Payam last_name: Zahadat - first_name: Daniel full_name: Hofstadler, Daniel last_name: Hofstadler - first_name: Kasper full_name: Stoy, Kasper last_name: Stoy - first_name: Sebastian full_name: Risi, Sebastian last_name: Risi - first_name: Andres full_name: Faina, Andres last_name: Faina - first_name: Frank full_name: Veenstra, Frank last_name: Veenstra - first_name: Serge full_name: Kernbach, Serge last_name: Kernbach - first_name: Igor full_name: Kuksin, Igor last_name: Kuksin - first_name: Olga full_name: Kernbach, Olga last_name: Kernbach - first_name: Phil full_name: Ayres, Phil last_name: Ayres - first_name: Przemyslaw full_name: Wojtaszek, Przemyslaw last_name: Wojtaszek citation: ama: 'Hamann H, Wahby M, Schmickl T, et al. Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids. In: Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15). ; 2015. doi:10.1109/ssci.2015.158' apa: Hamann, H., Wahby, M., Schmickl, T., Zahadat, P., Hofstadler, D., Stoy, K., … Wojtaszek, P. (2015). Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids. In Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15). https://doi.org/10.1109/ssci.2015.158 bibtex: '@inproceedings{Hamann_Wahby_Schmickl_Zahadat_Hofstadler_Stoy_Risi_Faina_Veenstra_Kernbach_et al._2015, title={Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids}, DOI={10.1109/ssci.2015.158}, booktitle={Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15)}, author={Hamann, Heiko and Wahby, Mostafa and Schmickl, Thomas and Zahadat, Payam and Hofstadler, Daniel and Stoy, Kasper and Risi, Sebastian and Faina, Andres and Veenstra, Frank and Kernbach, Serge and et al.}, year={2015} }' chicago: Hamann, Heiko, Mostafa Wahby, Thomas Schmickl, Payam Zahadat, Daniel Hofstadler, Kasper Stoy, Sebastian Risi, et al. “Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids.” In Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15), 2015. https://doi.org/10.1109/ssci.2015.158. ieee: H. Hamann et al., “Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids,” in Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15), 2015. mla: Hamann, Heiko, et al. “Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids.” Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15), 2015, doi:10.1109/ssci.2015.158. short: 'H. Hamann, M. Wahby, T. Schmickl, P. Zahadat, D. Hofstadler, K. Stoy, S. Risi, A. Faina, F. Veenstra, S. Kernbach, I. Kuksin, O. Kernbach, P. Ayres, P. Wojtaszek, in: Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15), 2015.' date_created: 2020-10-08T12:44:10Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.1109/ssci.2015.158 language: - iso: eng publication: Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE'15) publication_identifier: isbn: - '9781479975600' publication_status: published status: public title: Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids type: conference user_id: '15415' year: '2015' ... --- _id: '19962' abstract: - lang: eng text: Recent approaches in evolutionary robotics (ER) propose to generate behavioral diversity in order to evolve desired behaviors more easily. These approaches require the definition of a behavioral distance, which often includes task-specific features and hence a priori knowledge. Alternative methods, which do not explicitly force selective pressure towards diversity (SPTD) but still generate it, are known from the field of artificial life, such as in artificial ecologies (AEs). In this study, we investigate how SPTD is generated without task-specific behavioral features or other forms of a priori knowledge and detect how methods of generating SPTD can be transferred from the domain of AE to ER. A promising finding is that in both types of systems, in systems from ER that generate behavioral diversity and also in the investigated speciation model, selective pressure is generated towards unpopulated regions of search space. In a simple case study we investigate the practical implications of these findings and point to options for transferring the idea of self-organizing SPTD in AEs to the domain of ER. author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: ama: 'Hamann H. Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity. Artificial Life. 2015:464-480. doi:10.1162/artl_a_00186' apa: 'Hamann, H. (2015). Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity. Artificial Life, 464–480. https://doi.org/10.1162/artl_a_00186' bibtex: '@article{Hamann_2015, title={Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity}, DOI={10.1162/artl_a_00186}, journal={Artificial Life}, author={Hamann, Heiko}, year={2015}, pages={464–480} }' chicago: 'Hamann, Heiko. “Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity.” Artificial Life, 2015, 464–80. https://doi.org/10.1162/artl_a_00186.' ieee: 'H. Hamann, “Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity,” Artificial Life, pp. 464–480, 2015.' mla: 'Hamann, Heiko. “Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity.” Artificial Life, 2015, pp. 464–80, doi:10.1162/artl_a_00186.' short: H. Hamann, Artificial Life (2015) 464–480. date_created: 2020-10-08T14:36:25Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.1162/artl_a_00186 language: - iso: eng page: 464-480 publication: Artificial Life publication_identifier: issn: - 1064-5462 - 1530-9185 publication_status: published status: public title: 'Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity' type: journal_article user_id: '15415' year: '2015' ... --- _id: '19966' abstract: - lang: eng text: Aggregation is a crucial task in swarm robotics to ensure cooperation. We investigate the task of aggregation on an area specified indirectly by certain environmental features, here it is a light distribution. We extend the original BEECLUST algorithm, that implements an aggregation behavior, to an adaptive variant that automatically adapts to any light conditions. We compare these two control algorithms in a number of swarm robot experiments with different light conditions. The improved, adaptive variant is found to be significantly better in the tested setup. author: - first_name: Mostafa full_name: Wahby, Mostafa last_name: Wahby - first_name: Alexander full_name: Weinhold, Alexander last_name: Weinhold - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: ama: 'Wahby M, Weinhold A, Hamann H. Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings. In: Proceedings of the 9th EAI International Conference on Bio-Inspired Information and Communications Technologies (Formerly BIONETICS). ; 2015. doi:10.4108/eai.3-12-2015.2262877' apa: 'Wahby, M., Weinhold, A., & Hamann, H. (2015). Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings. In Proceedings of the 9th EAI International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS). https://doi.org/10.4108/eai.3-12-2015.2262877' bibtex: '@inproceedings{Wahby_Weinhold_Hamann_2015, title={Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings}, DOI={10.4108/eai.3-12-2015.2262877}, booktitle={Proceedings of the 9th EAI International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS)}, author={Wahby, Mostafa and Weinhold, Alexander and Hamann, Heiko}, year={2015} }' chicago: 'Wahby, Mostafa, Alexander Weinhold, and Heiko Hamann. “Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings.” In Proceedings of the 9th EAI International Conference on Bio-Inspired Information and Communications Technologies (Formerly BIONETICS), 2015. https://doi.org/10.4108/eai.3-12-2015.2262877.' ieee: 'M. Wahby, A. Weinhold, and H. Hamann, “Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings,” in Proceedings of the 9th EAI International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS), 2015.' mla: 'Wahby, Mostafa, et al. “Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings.” Proceedings of the 9th EAI International Conference on Bio-Inspired Information and Communications Technologies (Formerly BIONETICS), 2015, doi:10.4108/eai.3-12-2015.2262877.' short: 'M. Wahby, A. Weinhold, H. Hamann, in: Proceedings of the 9th EAI International Conference on Bio-Inspired Information and Communications Technologies (Formerly BIONETICS), 2015.' date_created: 2020-10-09T13:41:56Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.4108/eai.3-12-2015.2262877 language: - iso: eng publication: Proceedings of the 9th EAI International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS) publication_identifier: isbn: - '9781631901003' publication_status: published status: public title: 'Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings' type: conference user_id: '15415' year: '2015' ... --- _id: '19967' author: - first_name: Mostafa full_name: Wahby, Mostafa last_name: Wahby - first_name: Mohammad full_name: Divband Soorati, Mohammad last_name: Divband Soorati - first_name: Sebastian full_name: von Mammen, Sebastian last_name: von Mammen - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: ama: 'Wahby M, Divband Soorati M, von Mammen S, Hamann H. Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion. In: Proceedings. 25. Computational Intelligence Workshop. ; 2015.' apa: 'Wahby, M., Divband Soorati, M., von Mammen, S., & Hamann, H. (2015). Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion. In Proceedings. 25. Computational Intelligence Workshop.' bibtex: '@inproceedings{Wahby_Divband Soorati_von Mammen_Hamann_2015, title={Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion}, booktitle={Proceedings. 25. Computational Intelligence Workshop}, author={Wahby, Mostafa and Divband Soorati, Mohammad and von Mammen, Sebastian and Hamann, Heiko}, year={2015} }' chicago: 'Wahby, Mostafa, Mohammad Divband Soorati, Sebastian von Mammen, and Heiko Hamann. “Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion.” In Proceedings. 25. Computational Intelligence Workshop, 2015.' ieee: 'M. Wahby, M. Divband Soorati, S. von Mammen, and H. Hamann, “Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion,” in Proceedings. 25. Computational Intelligence Workshop, 2015.' mla: 'Wahby, Mostafa, et al. “Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion.” Proceedings. 25. Computational Intelligence Workshop, 2015.' short: 'M. Wahby, M. Divband Soorati, S. von Mammen, H. Hamann, in: Proceedings. 25. Computational Intelligence Workshop, 2015.' date_created: 2020-10-09T13:50:38Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' language: - iso: eng publication: Proceedings. 25. Computational Intelligence Workshop status: public title: 'Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion' type: conference user_id: '15415' year: '2015' ... --- _id: '19980' abstract: - lang: eng text: Fitness function design is known to be a critical feature of the evolutionary-robotics approach. Potentially, the complexity of evolving a successful controller for a given task can be reduced by integrating a priori knowledge into the fitness function which complicates the comparability of studies in evolutionary robotics. Still, there are only few publications that study the actual effects of different fitness functions on the robot's performance. In this paper, we follow the fitness function classification of Nelson et al. (2009) and investigate a selection of four classes of fitness functions that require different degrees of a priori knowledge. The robot controllers are evolved in simulation using NEAT and we investigate different tasks including obstacle avoidance and (periodic) goal homing. The best evolved controllers were then post-evaluated by examining their potential for adaptation, determining their convergence rates, and using cross-comparisons based on the different fitness function classes. The results confirm that the integration of more a priori knowledge can simplify a task and show that more attention should be paid to fitness function classes when comparing different studies. author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Mohammad full_name: Divband Soorati, Mohammad last_name: Divband Soorati citation: ama: 'Hamann H, Divband Soorati M. The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015). ACM; 2015:153-160. doi:10.1145/2739480.2754676' apa: 'Hamann, H., & Divband Soorati, M. (2015). The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015) (pp. 153–160). ACM. https://doi.org/10.1145/2739480.2754676' bibtex: '@inproceedings{Hamann_Divband Soorati_2015, title={The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge}, DOI={10.1145/2739480.2754676}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015)}, publisher={ACM}, author={Hamann, Heiko and Divband Soorati, Mohammad}, year={2015}, pages={153–160} }' chicago: 'Hamann, Heiko, and Mohammad Divband Soorati. “The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge.” In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015), 153–60. ACM, 2015. https://doi.org/10.1145/2739480.2754676.' ieee: 'H. Hamann and M. Divband Soorati, “The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge,” in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015), 2015, pp. 153–160.' mla: 'Hamann, Heiko, and Mohammad Divband Soorati. “The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge.” Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015), ACM, 2015, pp. 153–60, doi:10.1145/2739480.2754676.' short: 'H. Hamann, M. Divband Soorati, in: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015), ACM, 2015, pp. 153–160.' date_created: 2020-10-12T13:12:25Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.1145/2739480.2754676 language: - iso: eng page: 153-160 publication: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015) publisher: ACM status: public title: 'The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge' type: conference user_id: '15415' year: '2015' ... --- _id: '19988' author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Thomas full_name: Schmickl, Thomas last_name: Schmickl - first_name: Payam full_name: Zahadat, Payam last_name: Zahadat citation: ama: 'Hamann H, Schmickl T, Zahadat P. Evolving Collective Behaviors With Diverse But Predictable Sensor States. In: 13th European Conference on Artificial Life (ECAL 2015). MIT Press; 2015:174. doi:10.7551/978-0-262-33027-5-ch036' apa: Hamann, H., Schmickl, T., & Zahadat, P. (2015). Evolving Collective Behaviors With Diverse But Predictable Sensor States. In 13th European Conference on Artificial Life (ECAL 2015) (p. 174). MIT Press. https://doi.org/10.7551/978-0-262-33027-5-ch036 bibtex: '@inproceedings{Hamann_Schmickl_Zahadat_2015, title={Evolving Collective Behaviors With Diverse But Predictable Sensor States}, DOI={10.7551/978-0-262-33027-5-ch036}, booktitle={13th European Conference on Artificial Life (ECAL 2015)}, publisher={MIT Press}, author={Hamann, Heiko and Schmickl, Thomas and Zahadat, Payam}, year={2015}, pages={174} }' chicago: Hamann, Heiko, Thomas Schmickl, and Payam Zahadat. “Evolving Collective Behaviors With Diverse But Predictable Sensor States.” In 13th European Conference on Artificial Life (ECAL 2015), 174. MIT Press, 2015. https://doi.org/10.7551/978-0-262-33027-5-ch036. ieee: H. Hamann, T. Schmickl, and P. Zahadat, “Evolving Collective Behaviors With Diverse But Predictable Sensor States,” in 13th European Conference on Artificial Life (ECAL 2015), 2015, p. 174. mla: Hamann, Heiko, et al. “Evolving Collective Behaviors With Diverse But Predictable Sensor States.” 13th European Conference on Artificial Life (ECAL 2015), MIT Press, 2015, p. 174, doi:10.7551/978-0-262-33027-5-ch036. short: 'H. Hamann, T. Schmickl, P. Zahadat, in: 13th European Conference on Artificial Life (ECAL 2015), MIT Press, 2015, p. 174.' date_created: 2020-10-13T08:50:38Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.7551/978-0-262-33027-5-ch036 language: - iso: eng page: '174' publication: 13th European Conference on Artificial Life (ECAL 2015) publisher: MIT Press status: public title: Evolving Collective Behaviors With Diverse But Predictable Sensor States type: conference user_id: '15415' year: '2015' ... --- _id: '19989' author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Nikolaus full_name: Correll, Nikolaus last_name: Correll - first_name: Janusz full_name: Kacprzyk, Janusz last_name: Kacprzyk - first_name: Witold full_name: Pedrycz, Witold last_name: Pedrycz citation: ama: 'Hamann H, Correll N, Kacprzyk J, Pedrycz W. Probabilistic Modeling of Swarming Systems. In: Springer Handbook of Computational Intelligence. Springer; 2015:1423-1431. doi:10.1007/978-3-662-43505-2_74' apa: Hamann, H., Correll, N., Kacprzyk, J., & Pedrycz, W. (2015). Probabilistic Modeling of Swarming Systems. In Springer Handbook of Computational Intelligence (pp. 1423–1431). Springer. https://doi.org/10.1007/978-3-662-43505-2_74 bibtex: '@inbook{Hamann_Correll_Kacprzyk_Pedrycz_2015, title={Probabilistic Modeling of Swarming Systems}, DOI={10.1007/978-3-662-43505-2_74}, booktitle={Springer Handbook of Computational Intelligence}, publisher={Springer}, author={Hamann, Heiko and Correll, Nikolaus and Kacprzyk, Janusz and Pedrycz, Witold}, year={2015}, pages={1423–1431} }' chicago: Hamann, Heiko, Nikolaus Correll, Janusz Kacprzyk, and Witold Pedrycz. “Probabilistic Modeling of Swarming Systems.” In Springer Handbook of Computational Intelligence, 1423–31. Springer, 2015. https://doi.org/10.1007/978-3-662-43505-2_74. ieee: H. Hamann, N. Correll, J. Kacprzyk, and W. Pedrycz, “Probabilistic Modeling of Swarming Systems,” in Springer Handbook of Computational Intelligence, Springer, 2015, pp. 1423–1431. mla: Hamann, Heiko, et al. “Probabilistic Modeling of Swarming Systems.” Springer Handbook of Computational Intelligence, Springer, 2015, pp. 1423–31, doi:10.1007/978-3-662-43505-2_74. short: 'H. Hamann, N. Correll, J. Kacprzyk, W. Pedrycz, in: Springer Handbook of Computational Intelligence, Springer, 2015, pp. 1423–1431.' date_created: 2020-10-13T09:04:19Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.1007/978-3-662-43505-2_74 language: - iso: eng page: 1423-1431 publication: Springer Handbook of Computational Intelligence publisher: Springer status: public title: Probabilistic Modeling of Swarming Systems type: book_chapter user_id: '15415' year: '2015' ... --- _id: '19990' author: - first_name: Hongli full_name: Ding, Hongli last_name: Ding - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: ama: 'Ding H, Hamann H. Dependability in Swarm Robotics: Error Detection and Correction. In: First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015). ; 2015.' apa: 'Ding, H., & Hamann, H. (2015). Dependability in Swarm Robotics: Error Detection and Correction. In First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015).' bibtex: '@inproceedings{Ding_Hamann_2015, title={Dependability in Swarm Robotics: Error Detection and Correction}, booktitle={First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015)}, author={Ding, Hongli and Hamann, Heiko}, year={2015} }' chicago: 'Ding, Hongli, and Heiko Hamann. “Dependability in Swarm Robotics: Error Detection and Correction.” In First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015), 2015.' ieee: 'H. Ding and H. Hamann, “Dependability in Swarm Robotics: Error Detection and Correction,” in First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015), 2015.' mla: 'Ding, Hongli, and Heiko Hamann. “Dependability in Swarm Robotics: Error Detection and Correction.” First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015), 2015.' short: 'H. Ding, H. Hamann, in: First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015), 2015.' date_created: 2020-10-13T09:09:20Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' language: - iso: eng publication: First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015) status: public title: 'Dependability in Swarm Robotics: Error Detection and Correction' type: conference user_id: '15415' year: '2015' ... --- _id: '19991' author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Thomas full_name: Schmickl, Thomas last_name: Schmickl - first_name: Daniela full_name: Kengyel, Daniela last_name: Kengyel - first_name: Payam full_name: Zahadat, Payam last_name: Zahadat - first_name: Gerald full_name: Radspieler, Gerald last_name: Radspieler - first_name: Franz full_name: Wotawa, Franz last_name: Wotawa citation: ama: 'Hamann H, Schmickl T, Kengyel D, Zahadat P, Radspieler G, Wotawa F. Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms. In: Principles and Practice of Multi-Agent Systems (PRIMA 2015). ; 2015:201-217.' apa: 'Hamann, H., Schmickl, T., Kengyel, D., Zahadat, P., Radspieler, G., & Wotawa, F. (2015). Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms. In Principles and Practice of Multi-Agent Systems (PRIMA 2015) (pp. 201–217).' bibtex: '@inproceedings{Hamann_Schmickl_Kengyel_Zahadat_Radspieler_Wotawa_2015, title={Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms}, booktitle={Principles and Practice of Multi-Agent Systems (PRIMA 2015)}, author={Hamann, Heiko and Schmickl, Thomas and Kengyel, Daniela and Zahadat, Payam and Radspieler, Gerald and Wotawa, Franz}, year={2015}, pages={201–217} }' chicago: 'Hamann, Heiko, Thomas Schmickl, Daniela Kengyel, Payam Zahadat, Gerald Radspieler, and Franz Wotawa. “Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms.” In Principles and Practice of Multi-Agent Systems (PRIMA 2015), 201–17, 2015.' ieee: 'H. Hamann, T. Schmickl, D. Kengyel, P. Zahadat, G. Radspieler, and F. Wotawa, “Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms,” in Principles and Practice of Multi-Agent Systems (PRIMA 2015), 2015, pp. 201–217.' mla: 'Hamann, Heiko, et al. “Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms.” Principles and Practice of Multi-Agent Systems (PRIMA 2015), 2015, pp. 201–17.' short: 'H. Hamann, T. Schmickl, D. Kengyel, P. Zahadat, G. Radspieler, F. Wotawa, in: Principles and Practice of Multi-Agent Systems (PRIMA 2015), 2015, pp. 201–217.' date_created: 2020-10-13T09:24:32Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' language: - iso: eng page: 201-217 publication: Principles and Practice of Multi-Agent Systems (PRIMA 2015) status: public title: 'Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms' type: conference user_id: '15415' year: '2015' ... --- _id: '19992' author: - first_name: Gabriele full_name: Valentini, Gabriele last_name: Valentini - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: ama: 'Valentini G, Hamann H. Time-variant feedback processes in collective decision-making systems: influence and effect of dynamic neighborhood sizes. Swarm Intelligence. 2015:153-176. doi:10.1007/s11721-015-0108-8' apa: 'Valentini, G., & Hamann, H. (2015). Time-variant feedback processes in collective decision-making systems: influence and effect of dynamic neighborhood sizes. Swarm Intelligence, 153–176. https://doi.org/10.1007/s11721-015-0108-8' bibtex: '@article{Valentini_Hamann_2015, title={Time-variant feedback processes in collective decision-making systems: influence and effect of dynamic neighborhood sizes}, DOI={10.1007/s11721-015-0108-8}, journal={Swarm Intelligence}, author={Valentini, Gabriele and Hamann, Heiko}, year={2015}, pages={153–176} }' chicago: 'Valentini, Gabriele, and Heiko Hamann. “Time-Variant Feedback Processes in Collective Decision-Making Systems: Influence and Effect of Dynamic Neighborhood Sizes.” Swarm Intelligence, 2015, 153–76. https://doi.org/10.1007/s11721-015-0108-8.' ieee: 'G. Valentini and H. Hamann, “Time-variant feedback processes in collective decision-making systems: influence and effect of dynamic neighborhood sizes,” Swarm Intelligence, pp. 153–176, 2015.' mla: 'Valentini, Gabriele, and Heiko Hamann. “Time-Variant Feedback Processes in Collective Decision-Making Systems: Influence and Effect of Dynamic Neighborhood Sizes.” Swarm Intelligence, 2015, pp. 153–76, doi:10.1007/s11721-015-0108-8.' short: G. Valentini, H. Hamann, Swarm Intelligence (2015) 153–176. date_created: 2020-10-13T09:27:48Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.1007/s11721-015-0108-8 language: - iso: eng page: 153-176 publication: Swarm Intelligence publication_identifier: issn: - 1935-3812 - 1935-3820 publication_status: published status: public title: 'Time-variant feedback processes in collective decision-making systems: influence and effect of dynamic neighborhood sizes' type: journal_article user_id: '15415' year: '2015' ... --- _id: '20005' author: - first_name: Marco full_name: Dorigo, Marco last_name: Dorigo - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Gabriele full_name: Valentini, Gabriele last_name: Valentini citation: ama: 'Dorigo M, Hamann H, Valentini G. Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off. In: Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015). ; 2015.' apa: 'Dorigo, M., Hamann, H., & Valentini, G. (2015). Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off. In Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015).' bibtex: '@inproceedings{Dorigo_Hamann_Valentini_2015, title={Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off}, booktitle={Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015)}, author={Dorigo, Marco and Hamann, Heiko and Valentini, Gabriele}, year={2015} }' chicago: 'Dorigo, Marco, Heiko Hamann, and Gabriele Valentini. “Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off.” In Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015), 2015.' ieee: 'M. Dorigo, H. Hamann, and G. Valentini, “Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off,” in Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015), 2015.' mla: 'Dorigo, Marco, et al. “Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off.” Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015), 2015.' short: 'M. Dorigo, H. Hamann, G. Valentini, in: Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015), 2015.' date_created: 2020-10-15T12:29:26Z date_updated: 2022-01-06T06:54:18Z department: - _id: '63' - _id: '238' language: - iso: eng publication: Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015) status: public title: 'Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off' type: conference user_id: '15415' year: '2015' ... --- _id: '20006' author: - first_name: Marco full_name: Dorigo, Marco last_name: Dorigo - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Gabriele full_name: Valentini, Gabriele last_name: Valentini citation: ama: 'Dorigo M, Hamann H, Valentini G. Self-organized collective decisions in a robot swarm. In: AAAI-15 Video Proceedings. ; 2015.' apa: Dorigo, M., Hamann, H., & Valentini, G. (2015). Self-organized collective decisions in a robot swarm. In AAAI-15 Video Proceedings. bibtex: '@inproceedings{Dorigo_Hamann_Valentini_2015, title={Self-organized collective decisions in a robot swarm}, booktitle={AAAI-15 Video Proceedings}, author={Dorigo, Marco and Hamann, Heiko and Valentini, Gabriele}, year={2015} }' chicago: Dorigo, Marco, Heiko Hamann, and Gabriele Valentini. “Self-Organized Collective Decisions in a Robot Swarm.” In AAAI-15 Video Proceedings, 2015. ieee: M. Dorigo, H. Hamann, and G. Valentini, “Self-organized collective decisions in a robot swarm,” in AAAI-15 Video Proceedings, 2015. mla: Dorigo, Marco, et al. “Self-Organized Collective Decisions in a Robot Swarm.” AAAI-15 Video Proceedings, 2015. short: 'M. Dorigo, H. Hamann, G. Valentini, in: AAAI-15 Video Proceedings, 2015.' date_created: 2020-10-15T12:38:13Z date_updated: 2022-01-06T06:54:18Z department: - _id: '63' - _id: '238' language: - iso: eng publication: AAAI-15 Video Proceedings status: public title: Self-organized collective decisions in a robot swarm type: conference user_id: '15415' year: '2015' ... --- _id: '280' abstract: - lang: eng text: The Collaborative Research Centre "On-The-Fly Computing" works on foundations and principles for the vision of the Future Internet. It proposes the paradigm of On-The-Fly Computing, which tackles emerging worldwide service markets. In these markets, service providers trade software, platform, and infrastructure as a service. Service requesters state requirements on services. To satisfy these requirements, the new role of brokers, who are (human) actors building service compositions on the fly, is introduced. Brokers have to specify service compositions formally and comprehensively using a domain-specific language (DSL), and to use service matching for the discovery of the constituent services available in the market. The broker's choice of the DSL and matching approaches influences her success of building compositions as distinctive properties of different service markets play a significant role. In this paper, we propose a new approach of engineering a situation-specific DSL by customizing a comprehensive, modular DSL and its matching for given service market properties. This enables the broker to create market-specific composition specifications and to perform market-specific service matching. As a result, the broker builds service compositions satisfying the requester's requirements more accurately. We evaluated the presented concepts using case studies in service markets for tourism and university management. author: - first_name: Svetlana full_name: Arifulina, Svetlana last_name: Arifulina - first_name: Marie Christin full_name: Platenius, Marie Christin last_name: Platenius - first_name: Felix full_name: Mohr, Felix last_name: Mohr - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels - first_name: Wilhelm full_name: Schäfer, Wilhelm last_name: Schäfer citation: ama: 'Arifulina S, Platenius MC, Mohr F, Engels G, Schäfer W. Market-Specific Service Compositions: Specification and Matching. In: Proceedings of the IEEE 11th World Congress on Services (SERVICES), Visionary Track: Service Composition for the Future Internet. ; 2015:333--340. doi:10.1109/SERVICES.2015.58' apa: 'Arifulina, S., Platenius, M. C., Mohr, F., Engels, G., & Schäfer, W. (2015). Market-Specific Service Compositions: Specification and Matching. In Proceedings of the IEEE 11th World Congress on Services (SERVICES), Visionary Track: Service Composition for the Future Internet (pp. 333--340). https://doi.org/10.1109/SERVICES.2015.58' bibtex: '@inproceedings{Arifulina_Platenius_Mohr_Engels_Schäfer_2015, title={Market-Specific Service Compositions: Specification and Matching}, DOI={10.1109/SERVICES.2015.58}, booktitle={Proceedings of the IEEE 11th World Congress on Services (SERVICES), Visionary Track: Service Composition for the Future Internet}, author={Arifulina, Svetlana and Platenius, Marie Christin and Mohr, Felix and Engels, Gregor and Schäfer, Wilhelm}, year={2015}, pages={333--340} }' chicago: 'Arifulina, Svetlana, Marie Christin Platenius, Felix Mohr, Gregor Engels, and Wilhelm Schäfer. “Market-Specific Service Compositions: Specification and Matching.” In Proceedings of the IEEE 11th World Congress on Services (SERVICES), Visionary Track: Service Composition for the Future Internet, 333--340, 2015. https://doi.org/10.1109/SERVICES.2015.58.' ieee: 'S. Arifulina, M. C. Platenius, F. Mohr, G. Engels, and W. Schäfer, “Market-Specific Service Compositions: Specification and Matching,” in Proceedings of the IEEE 11th World Congress on Services (SERVICES), Visionary Track: Service Composition for the Future Internet, 2015, pp. 333--340.' mla: 'Arifulina, Svetlana, et al. “Market-Specific Service Compositions: Specification and Matching.” Proceedings of the IEEE 11th World Congress on Services (SERVICES), Visionary Track: Service Composition for the Future Internet, 2015, pp. 333--340, doi:10.1109/SERVICES.2015.58.' short: 'S. Arifulina, M.C. Platenius, F. Mohr, G. Engels, W. Schäfer, in: Proceedings of the IEEE 11th World Congress on Services (SERVICES), Visionary Track: Service Composition for the Future Internet, 2015, pp. 333--340.' date_created: 2017-10-17T12:41:46Z date_updated: 2022-01-06T06:57:49Z ddc: - '040' department: - _id: '66' - _id: '76' - _id: '355' doi: 10.1109/SERVICES.2015.58 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:26:04Z date_updated: 2018-03-21T09:26:04Z file_id: '1470' file_name: 280-07196546.pdf file_size: 234260 relation: main_file success: 1 file_date_updated: 2018-03-21T09:26:04Z has_accepted_license: '1' language: - iso: eng page: 333--340 project: - _id: '1' name: SFB 901 - _id: '9' name: SFB 901 - Subprojekt B1 - _id: '10' name: SFB 901 - Subproject B2 - _id: '3' name: SFB 901 - Project Area B publication: 'Proceedings of the IEEE 11th World Congress on Services (SERVICES), Visionary Track: Service Composition for the Future Internet' status: public title: 'Market-Specific Service Compositions: Specification and Matching' type: conference user_id: '477' year: '2015' ... --- _id: '283' abstract: - lang: eng text: Today, software verification is an established analysis method which can provide high guarantees for software safety. However, the resources (time and/or memory) for an exhaustive verification are not always available, and analysis then has to resort to other techniques, like testing. Most often, the already achieved partial verification results arediscarded in this case, and testing has to start from scratch.In this paper, we propose a method for combining verification and testing in which testing only needs to check the residual fraction of an uncompleted verification. To this end, the partial results of a verification run are used to construct a residual program (and residual assertions to be checked on it). The residual program can afterwards be fed into standardtesting tools. The proposed technique is sound modulo the soundness of the testing procedure. Experimental results show that this combinedusage of verification and testing can significantly reduce the effort for the subsequent testing. author: - first_name: Mike full_name: Czech, Mike last_name: Czech - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Czech M, Jakobs M-C, Wehrheim H. Just test what you cannot verify! In: Egyed A, Schaefer I, eds. Fundamental Approaches to Software Engineering. Lecture Notes in Computer Science. ; 2015:100-114. doi:10.1007/978-3-662-46675-9_7' apa: Czech, M., Jakobs, M.-C., & Wehrheim, H. (2015). Just test what you cannot verify! In A. Egyed & I. Schaefer (Eds.), Fundamental Approaches to Software Engineering (pp. 100–114). https://doi.org/10.1007/978-3-662-46675-9_7 bibtex: '@inproceedings{Czech_Jakobs_Wehrheim_2015, series={Lecture Notes in Computer Science}, title={Just test what you cannot verify!}, DOI={10.1007/978-3-662-46675-9_7}, booktitle={Fundamental Approaches to Software Engineering}, author={Czech, Mike and Jakobs, Marie-Christine and Wehrheim, Heike}, editor={Egyed, Alexander and Schaefer, InaEditors}, year={2015}, pages={100–114}, collection={Lecture Notes in Computer Science} }' chicago: Czech, Mike, Marie-Christine Jakobs, and Heike Wehrheim. “Just Test What You Cannot Verify!” In Fundamental Approaches to Software Engineering, edited by Alexander Egyed and Ina Schaefer, 100–114. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-662-46675-9_7. ieee: M. Czech, M.-C. Jakobs, and H. Wehrheim, “Just test what you cannot verify!,” in Fundamental Approaches to Software Engineering, 2015, pp. 100–114. mla: Czech, Mike, et al. “Just Test What You Cannot Verify!” Fundamental Approaches to Software Engineering, edited by Alexander Egyed and Ina Schaefer, 2015, pp. 100–14, doi:10.1007/978-3-662-46675-9_7. short: 'M. Czech, M.-C. Jakobs, H. Wehrheim, in: A. Egyed, I. Schaefer (Eds.), Fundamental Approaches to Software Engineering, 2015, pp. 100–114.' date_created: 2017-10-17T12:41:47Z date_updated: 2022-01-06T06:58:00Z ddc: - '040' department: - _id: '77' doi: 10.1007/978-3-662-46675-9_7 editor: - first_name: Alexander full_name: Egyed, Alexander last_name: Egyed - first_name: Ina full_name: Schaefer, Ina last_name: Schaefer file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:25:36Z date_updated: 2018-03-21T09:25:36Z file_id: '1469' file_name: 283-FASEsubmission38_01.pdf file_size: 391253 relation: main_file success: 1 file_date_updated: 2018-03-21T09:25:36Z has_accepted_license: '1' language: - iso: eng page: 100-114 project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B publication: Fundamental Approaches to Software Engineering series_title: Lecture Notes in Computer Science status: public title: Just test what you cannot verify! type: conference user_id: '477' year: '2015' ... --- _id: '284' abstract: - lang: eng text: In this work, we present the first scalable distributed information system, that is, a system with low storage overhead, that is provably robust against denial-of-service (DoS) attacks by a current insider. We allow a current insider to have complete knowledge about the information system and to have the power to block any ϵ-fraction of its servers by a DoS attack, where ϵ can be chosen up to a constant. The task of the system is to serve any collection of lookup requests with at most one per nonblocked server in an efficient way despite this attack. Previously, scalable solutions were only known for DoS attacks of past insiders, where a past insider only has complete knowledge about some past time point t0 of the information system. Scheideler et al. [Awerbuch and Scheideler 2007; Baumgart et al. 2009] showed that in this case, it is possible to design an information system so that any information that was inserted or last updated after t0 is safe against a DoS attack. But their constructions would not work at all for a current insider. The key idea behind our IRIS system is to make extensive use of coding. More precisely, we present two alternative distributed coding strategies with an at most logarithmic storage overhead that can handle up to a constant fraction of blocked servers. author: - first_name: Martina full_name: Eikel, Martina last_name: Eikel - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Eikel M, Scheideler C. IRIS: A Robust Information System Against Insider DoS Attacks. Transactions on Parallel Computing. 2015;(3):18:1--18:33. doi:10.1145/2809806' apa: 'Eikel, M., & Scheideler, C. (2015). IRIS: A Robust Information System Against Insider DoS Attacks. Transactions on Parallel Computing, (3), 18:1--18:33. https://doi.org/10.1145/2809806' bibtex: '@article{Eikel_Scheideler_2015, title={IRIS: A Robust Information System Against Insider DoS Attacks}, DOI={10.1145/2809806}, number={3}, journal={Transactions on Parallel Computing}, publisher={ACM}, author={Eikel, Martina and Scheideler, Christian}, year={2015}, pages={18:1--18:33} }' chicago: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS Attacks.” Transactions on Parallel Computing, no. 3 (2015): 18:1--18:33. https://doi.org/10.1145/2809806.' ieee: 'M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider DoS Attacks,” Transactions on Parallel Computing, no. 3, pp. 18:1--18:33, 2015.' mla: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS Attacks.” Transactions on Parallel Computing, no. 3, ACM, 2015, pp. 18:1--18:33, doi:10.1145/2809806.' short: M. Eikel, C. Scheideler, Transactions on Parallel Computing (2015) 18:1--18:33. date_created: 2017-10-17T12:41:47Z date_updated: 2022-01-06T06:58:03Z ddc: - '040' department: - _id: '79' doi: 10.1145/2809806 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:25:04Z date_updated: 2018-03-21T09:25:04Z file_id: '1468' file_name: 284-Eikel-Scheideler-ACM2015.pdf file_size: 651726 relation: main_file success: 1 file_date_updated: 2018-03-21T09:25:04Z has_accepted_license: '1' issue: '3' page: 18:1--18:33 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Transactions on Parallel Computing publisher: ACM status: public title: 'IRIS: A Robust Information System Against Insider DoS Attacks' type: journal_article user_id: '477' year: '2015' ... --- _id: '285' abstract: - lang: eng text: We propose an incremental workflow for the verification of parameterized systems modeled as symmetric networks of timed automata. Starting with a small number of timed automata in the network, a safety property is verified using IC3, a state-of-the-art algorithm based on induction.The result of the verification, an inductive strengthening, is reused proposing a candidate inductive strengthening for a larger network.If the candidate is valid, our main theorem states that the safety property holds for all sizes of the network of timed automata. Otherwise the number of automata is increased and the next iteration is started with a new run of IC3.We propose and thoroughly examine optimizations to our workflow, e.g. Feedback mechanisms to speed up the run of IC3. author: - first_name: Tobias full_name: Isenberg, Tobias last_name: Isenberg citation: ama: 'Isenberg T. Incremental Inductive Verification of Parameterized Timed Systems. In: Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD). ; 2015:1-9. doi:10.1109/ACSD.2015.13' apa: Isenberg, T. (2015). Incremental Inductive Verification of Parameterized Timed Systems. In Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD) (pp. 1–9). https://doi.org/10.1109/ACSD.2015.13 bibtex: '@inproceedings{Isenberg_2015, title={Incremental Inductive Verification of Parameterized Timed Systems}, DOI={10.1109/ACSD.2015.13}, booktitle={Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD)}, author={Isenberg, Tobias}, year={2015}, pages={1–9} }' chicago: Isenberg, Tobias. “Incremental Inductive Verification of Parameterized Timed Systems.” In Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD), 1–9, 2015. https://doi.org/10.1109/ACSD.2015.13. ieee: T. Isenberg, “Incremental Inductive Verification of Parameterized Timed Systems,” in Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD), 2015, pp. 1–9. mla: Isenberg, Tobias. “Incremental Inductive Verification of Parameterized Timed Systems.” Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD), 2015, pp. 1–9, doi:10.1109/ACSD.2015.13. short: 'T. Isenberg, in: Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD), 2015, pp. 1–9.' date_created: 2017-10-17T12:41:47Z date_updated: 2022-01-06T06:58:07Z ddc: - '040' department: - _id: '77' doi: 10.1109/ACSD.2015.13 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:23:45Z date_updated: 2018-03-21T09:23:45Z file_id: '1466' file_name: 285-07352419.pdf file_size: 479808 relation: main_file success: 1 file_date_updated: 2018-03-21T09:23:45Z has_accepted_license: '1' language: - iso: eng page: '1-9 ' project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD) status: public title: Incremental Inductive Verification of Parameterized Timed Systems type: conference user_id: '477' year: '2015' ... --- _id: '286' author: - first_name: Benedikt full_name: Kalde, Benedikt last_name: Kalde citation: ama: Kalde B. Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup. Universität Paderborn; 2015. apa: Kalde, B. (2015). Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup. Universität Paderborn. bibtex: '@book{Kalde_2015, title={Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup}, publisher={Universität Paderborn}, author={Kalde, Benedikt}, year={2015} }' chicago: Kalde, Benedikt. Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup. Universität Paderborn, 2015. ieee: B. Kalde, Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup. Universität Paderborn, 2015. mla: Kalde, Benedikt. Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup. Universität Paderborn, 2015. short: B. Kalde, Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:47Z date_updated: 2022-01-06T06:58:10Z department: - _id: '64' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public supervisor: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer title: Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup type: bachelorsthesis user_id: '477' year: '2015' ... --- _id: '2865' author: - first_name: Daniela full_name: Strotmann, Daniela last_name: Strotmann citation: ama: Strotmann D. Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen.; 2015. apa: Strotmann, D. (2015). Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen. bibtex: '@book{Strotmann_2015, title={Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen}, author={Strotmann, Daniela}, year={2015} }' chicago: Strotmann, Daniela. Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen, 2015. ieee: D. Strotmann, Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen. 2015. mla: Strotmann, Daniela. Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen. 2015. short: D. Strotmann, Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen, 2015. date_created: 2018-05-24T13:05:41Z date_updated: 2022-01-06T06:58:12Z department: - _id: '64' status: public supervisor: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer title: Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen type: bachelorsthesis user_id: '25078' year: '2015' ... --- _id: '287' abstract: - lang: eng text: The size of modern data centers is constantly increasing. As it is not economic to interconnect all machines in the data center using a full-bisection-bandwidth network, techniques have to be developed to increase the efficiency of data-center networks. The Software-Defined Network paradigm opened the door for centralized traffic engineering (TE) in such environments. Up to now, there were already a number of TE proposals for SDN-controlled data centers that all work very well. However, these techniques either use a high amount of flow table entries or a high flow installation rate that overwhelms available switching hardware, or they require custom or very expensive end-of-line equipment to be usable in practice. We present HybridTE, a TE technique that uses (uncertain) information about large flows. Using this extra information, our technique has very low hardware requirements while maintaining better performance than existing TE techniques. This enables us to build very low-cost, high performance data-center networks. author: - first_name: Philip full_name: Wette, Philip last_name: Wette - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl citation: ama: 'Wette P, Karl H. HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks. In: Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015). ; 2015:1--7. doi:10.1109/EWSDN.2015.57' apa: 'Wette, P., & Karl, H. (2015). HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks. In Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015) (pp. 1--7). https://doi.org/10.1109/EWSDN.2015.57' bibtex: '@inproceedings{Wette_Karl_2015, title={HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks}, DOI={10.1109/EWSDN.2015.57}, booktitle={Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)}, author={Wette, Philip and Karl, Holger}, year={2015}, pages={1--7} }' chicago: 'Wette, Philip, and Holger Karl. “HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks.” In Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015), 1--7, 2015. https://doi.org/10.1109/EWSDN.2015.57.' ieee: 'P. Wette and H. Karl, “HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks,” in Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015), 2015, pp. 1--7.' mla: 'Wette, Philip, and Holger Karl. “HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks.” Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015), 2015, pp. 1--7, doi:10.1109/EWSDN.2015.57.' short: 'P. Wette, H. Karl, in: Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015), 2015, pp. 1--7.' date_created: 2017-10-17T12:41:48Z date_updated: 2022-01-06T06:58:17Z ddc: - '040' department: - _id: '75' doi: 10.1109/EWSDN.2015.57 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-08T09:55:30Z date_updated: 2018-03-08T09:59:05Z file_id: '1203' file_name: 287-1503.04317v1.pdf file_size: 1625732 relation: main_file file_date_updated: 2018-03-08T09:59:05Z has_accepted_license: '1' page: 1--7 project: - _id: '1' name: SFB 901 - _id: '6' name: SFB 901 - Subprojekt A2 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015) quality_controlled: '1' status: public title: 'HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks' type: conference urn: '2875' user_id: '15572' year: '2015' ... --- _id: '241' abstract: - lang: eng text: Distributed applications are commonly based on overlay networks interconnecting their sites so that they can exchange information. For these overlay networks to preserve their functionality, they should be able to recover from various problems like membership changes or faults. Various self-stabilizing overlay networks have already been proposed in recent years, which have the advantage of being able to recover from any illegal state, but none of these networks can give any guarantees on its functionality while the recovery process is going on. We initiate research on overlay networks that are not only self-stabilizing but that also ensure that searchability is maintained while the recovery process is going on, as long as there are no corrupted messages in the system. More precisely, once a search message from node u to another node v is successfully delivered, all future search messages from u to v succeed as well. We call this property monotonic searchability. We show that in general it is impossible to provide monotonic searchability if corrupted messages are present in the system, which justifies the restriction to system states without corrupted messages. Furthermore, we provide a self-stabilizing protocol for the line for which we can also show monotonic searchability. It turns out that even for the line it is non-trivial to achieve this property. Additionally, we extend our protocol to deal with node departures in terms of the Finite Departure Problem of Foreback et. al (SSS 2014). This makes our protocol even capable of handling node dynamics. author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Alexander full_name: Setzer, Alexander id: '11108' last_name: Setzer - first_name: Thim Frederik full_name: Strothmann, Thim Frederik id: '11319' last_name: Strothmann citation: ama: 'Scheideler C, Setzer A, Strothmann TF. Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures. In: Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS). Leibniz International Proceedings in Informatics (LIPIcs). ; 2015. doi:10.4230/LIPIcs.OPODIS.2015.24' apa: Scheideler, C., Setzer, A., & Strothmann, T. F. (2015). Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures. In Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS). https://doi.org/10.4230/LIPIcs.OPODIS.2015.24 bibtex: '@inproceedings{Scheideler_Setzer_Strothmann_2015, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures}, DOI={10.4230/LIPIcs.OPODIS.2015.24}, booktitle={Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)}, author={Scheideler, Christian and Setzer, Alexander and Strothmann, Thim Frederik}, year={2015}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }' chicago: Scheideler, Christian, Alexander Setzer, and Thim Frederik Strothmann. “Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures.” In Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS). Leibniz International Proceedings in Informatics (LIPIcs), 2015. https://doi.org/10.4230/LIPIcs.OPODIS.2015.24. ieee: C. Scheideler, A. Setzer, and T. F. Strothmann, “Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures,” in Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS), 2015. mla: Scheideler, Christian, et al. “Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures.” Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS), 2015, doi:10.4230/LIPIcs.OPODIS.2015.24. short: 'C. Scheideler, A. Setzer, T.F. Strothmann, in: Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS), 2015.' date_created: 2017-10-17T12:41:39Z date_updated: 2022-01-06T06:56:07Z ddc: - '040' department: - _id: '79' doi: 10.4230/LIPIcs.OPODIS.2015.24 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T10:28:21Z date_updated: 2018-03-21T10:28:21Z file_id: '1497' file_name: 241-ScheidelerSetzerStrothmann2015.pdf file_size: 692363 relation: main_file success: 1 file_date_updated: 2018-03-21T10:28:21Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS) series_title: Leibniz International Proceedings in Informatics (LIPIcs) status: public title: Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures type: conference user_id: '477' year: '2015' ... --- _id: '242' abstract: - lang: eng text: 'A fundamental problem for overlay networks is to safely exclude leaving nodes, i.e., the nodes requesting to leave the overlay network are excluded from it without affecting its connectivity. There are a number of studies for safe node exclusion if the overlay is in a well-defined state, but almost no formal results are known 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 when woken up by an incoming message. We are the first to present a self-stabilizing protocol for the FDP and the FSP that can be combined with a large class of overlay maintenance protocols so that these are then guaranteed to safely exclude leaving nodes from the system from any initial state while operating as specified for the staying nodes. In order to formally define the properties these overlay maintenance protocols have to satisfy, we identify four basic primitives for manipulating edges in an overlay network that might be of independent interest.' author: - first_name: Andreas full_name: Koutsopoulos, Andreas last_name: Koutsopoulos - 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: 'Koutsopoulos A, Scheideler C, Strothmann TF. Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In: Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Lecture Notes in Computer Science. ; 2015:201-216. doi:10.1007/978-3-319-21741-3_14' apa: Koutsopoulos, A., Scheideler, C., & Strothmann, T. F. (2015). Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 201–216). https://doi.org/10.1007/978-3-319-21741-3_14 bibtex: '@inproceedings{Koutsopoulos_Scheideler_Strothmann_2015, series={Lecture Notes in Computer Science}, title={Towards a Universal Approach for the Finite Departure Problem in Overlay Networks}, DOI={10.1007/978-3-319-21741-3_14}, booktitle={Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, author={Koutsopoulos, Andreas and Scheideler, Christian and Strothmann, Thim Frederik}, year={2015}, pages={201–216}, collection={Lecture Notes in Computer Science} }' chicago: Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” In Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 201–16. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-21741-3_14. ieee: A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks,” in Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2015, pp. 201–216. mla: Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2015, pp. 201–16, doi:10.1007/978-3-319-21741-3_14. short: 'A. Koutsopoulos, C. Scheideler, T.F. Strothmann, in: Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2015, pp. 201–216.' date_created: 2017-10-17T12:41:39Z date_updated: 2022-01-06T06:56:10Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-319-21741-3_14 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:59:32Z date_updated: 2018-03-21T09:59:32Z file_id: '1496' file_name: 242-KSS-SSS2015.pdf file_size: 532792 relation: main_file success: 1 file_date_updated: 2018-03-21T09:59:32Z has_accepted_license: '1' language: - iso: eng page: 201-216 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) series_title: Lecture Notes in Computer Science status: public title: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks type: conference user_id: '477' year: '2015' ... --- _id: '243' abstract: - lang: eng text: This paper introduces the problem of communication pattern adaption for a distributed self-adjusting binary search tree. We propose a simple local algorithm, which is closely related to the nearly thirty-year-old idea of splay trees and evaluate its adaption performance in the distributed scenario if different communication patterns are provided.To do so, the process of self-adjustment is modeled similarly to a basic network creation game, in which the nodes want to communicate with only a certain subset of all nodes. We show that, in general, the game (i.e., the process of local adjustments) does not converge, and convergence is related to certain structures of the communication interests, which we call conflicts.We classify conflicts and show that for two communication scenarios in which convergence is guaranteed, the self-adjusting tree performs well.Furthermore, we investigate the different classes of conflicts separately and show that, for a certain class of conflicts, the performance of the tree network is asymptotically as good as the performance for converging instances. However, for the other conflict classes, a distributed self-adjusting binary search tree adapts poorly. author: - first_name: Thim Frederik full_name: Strothmann, Thim Frederik id: '11319' last_name: Strothmann citation: ama: 'Strothmann TF. The impact of communication patterns on distributed locally self-adjusting binary search trees. In: Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM). LNCS. ; 2015:175--186. doi:10.1007/978-3-319-15612-5_16' apa: Strothmann, T. F. (2015). The impact of communication patterns on distributed locally self-adjusting binary search trees. In Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM) (pp. 175--186). https://doi.org/10.1007/978-3-319-15612-5_16 bibtex: '@inproceedings{Strothmann_2015, series={LNCS}, title={The impact of communication patterns on distributed locally self-adjusting binary search trees}, DOI={10.1007/978-3-319-15612-5_16}, booktitle={Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM)}, author={Strothmann, Thim Frederik}, year={2015}, pages={175--186}, collection={LNCS} }' chicago: Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed Locally Self-Adjusting Binary Search Trees.” In Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM), 175--186. LNCS, 2015. https://doi.org/10.1007/978-3-319-15612-5_16. ieee: T. F. Strothmann, “The impact of communication patterns on distributed locally self-adjusting binary search trees,” in Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM), 2015, pp. 175--186. mla: Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed Locally Self-Adjusting Binary Search Trees.” Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM), 2015, pp. 175--186, doi:10.1007/978-3-319-15612-5_16. short: 'T.F. Strothmann, in: Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM), 2015, pp. 175--186.' date_created: 2017-10-17T12:41:39Z date_updated: 2022-01-06T06:56:17Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-319-15612-5_16 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:59:00Z date_updated: 2018-03-21T09:59:00Z file_id: '1495' file_name: 243-Strothmann-Walcom2015.pdf file_size: 1003113 relation: main_file success: 1 file_date_updated: 2018-03-21T09:59:00Z has_accepted_license: '1' language: - iso: eng page: 175--186 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM) series_title: LNCS status: public title: The impact of communication patterns on distributed locally self-adjusting binary search trees type: conference user_id: '477' year: '2015' ... --- _id: '246' author: - first_name: Galina full_name: Besova, Galina last_name: Besova citation: ama: Besova G. Systematic Development and Re-Use of Model Tranformations. Universität Paderborn; 2015. apa: Besova, G. (2015). Systematic Development and Re-Use of Model Tranformations. Universität Paderborn. bibtex: '@book{Besova_2015, title={Systematic Development and Re-Use of Model Tranformations}, publisher={Universität Paderborn}, author={Besova, Galina}, year={2015} }' chicago: Besova, Galina. Systematic Development and Re-Use of Model Tranformations. Universität Paderborn, 2015. ieee: G. Besova, Systematic Development and Re-Use of Model Tranformations. Universität Paderborn, 2015. mla: Besova, Galina. Systematic Development and Re-Use of Model Tranformations. Universität Paderborn, 2015. short: G. Besova, Systematic Development and Re-Use of Model Tranformations, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:40Z date_updated: 2022-01-06T06:56:30Z ddc: - '040' department: - _id: '77' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:47:14Z date_updated: 2018-03-21T09:47:14Z file_id: '1492' file_name: 246-Dissertation_-_Besova.pdf file_size: 10091866 relation: main_file success: 1 file_date_updated: 2018-03-21T09:47:14Z has_accepted_license: '1' project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn related_material: link: - relation: confirmation url: http://digital.ub.uni-paderborn.de/hsx/content/titleinfo/1705899 status: public supervisor: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim title: Systematic Development and Re-Use of Model Tranformations type: dissertation user_id: '477' year: '2015' ... --- _id: '247' abstract: - lang: eng text: 'Multi-rooted trees are becoming the norm for modern data-center networks. In these networks, scalable flow routing is challenging owing to vast number of flows. Current approaches either employ a central controller that can have scalability issues or a scalable decentralized algorithm only considering local information. In this paper we present a new decentralized approach to least-congested path routing in software-defined data center networks that has neither of these issues: By duplicating the initial (or SYN) packet of a flow and estimating the data rate of multiple flows in parallel, we exploit TCP’s habit to fill buffers to find the least congested path. We show that our algorithm significantly improves flow completion time without the need for a central controller or specialized hardware.' author: - first_name: Arne full_name: Schwabe, Arne last_name: Schwabe - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl citation: ama: 'Schwabe A, Karl H. SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics. In: Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015). ; 2015:37-42. doi:10.1109/EWSDN.2015.58' apa: 'Schwabe, A., & Karl, H. (2015). SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics. In Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015) (pp. 37–42). https://doi.org/10.1109/EWSDN.2015.58' bibtex: '@inproceedings{Schwabe_Karl_2015, title={SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics}, DOI={10.1109/EWSDN.2015.58}, booktitle={Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)}, author={Schwabe, Arne and Karl, Holger}, year={2015}, pages={37–42} }' chicago: 'Schwabe, Arne, and Holger Karl. “SynRace: Decentralized Load-Adaptive Multi-Path Routing without Collecting Statistics.” In Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015), 37–42, 2015. https://doi.org/10.1109/EWSDN.2015.58.' ieee: 'A. Schwabe and H. Karl, “SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics,” in Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015), 2015, pp. 37–42.' mla: 'Schwabe, Arne, and Holger Karl. “SynRace: Decentralized Load-Adaptive Multi-Path Routing without Collecting Statistics.” Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015), 2015, pp. 37–42, doi:10.1109/EWSDN.2015.58.' short: 'A. Schwabe, H. Karl, in: Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015), 2015, pp. 37–42.' date_created: 2017-10-17T12:41:40Z date_updated: 2022-01-06T06:56:32Z ddc: - '040' department: - _id: '75' doi: 10.1109/EWSDN.2015.58 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:46:21Z date_updated: 2018-03-21T09:46:21Z file_id: '1491' file_name: 247-07313613.pdf file_size: 277574 relation: main_file success: 1 file_date_updated: 2018-03-21T09:46:21Z has_accepted_license: '1' page: 37-42 project: - _id: '1' name: SFB 901 - _id: '6' name: SFB 901 - Subprojekt A2 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015) status: public title: 'SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics' type: conference user_id: '15504' year: '2015' ... --- _id: '261' author: - first_name: Thorsten full_name: Eisenhofer, Thorsten last_name: Eisenhofer citation: ama: Eisenhofer T. Protokolle zur authentifizierten Schüsselvereinbarung. Universität Paderborn; 2015. apa: Eisenhofer, T. (2015). Protokolle zur authentifizierten Schüsselvereinbarung. Universität Paderborn. bibtex: '@book{Eisenhofer_2015, title={Protokolle zur authentifizierten Schüsselvereinbarung}, publisher={Universität Paderborn}, author={Eisenhofer, Thorsten}, year={2015} }' chicago: Eisenhofer, Thorsten. Protokolle zur authentifizierten Schüsselvereinbarung. Universität Paderborn, 2015. ieee: T. Eisenhofer, Protokolle zur authentifizierten Schüsselvereinbarung. Universität Paderborn, 2015. mla: Eisenhofer, Thorsten. Protokolle zur authentifizierten Schüsselvereinbarung. Universität Paderborn, 2015. short: T. Eisenhofer, Protokolle zur authentifizierten Schüsselvereinbarung, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:43Z date_updated: 2022-01-06T06:57:16Z department: - _id: '64' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public supervisor: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer title: Protokolle zur authentifizierten Schüsselvereinbarung type: bachelorsthesis user_id: '477' year: '2015' ... --- _id: '262' abstract: - lang: eng text: Programs from Proofs" is a generic method which generates new programs out of correctness proofs of given programs. The technique ensures that the new and given program are behaviorally equivalent and that the new program is easily verifiable, thus serving as an alternative to proof-carrying code concepts. So far, this generic method has one instantiation that verifies type-state properties of programs. In this paper, we present a whole range of new instantiations, all based on data ow analyses. More precisely, we show how an imprecise but fast data ow analysis can be enhanced with a predicate analysis as to yield a precise but expensive analysis. Out of the safety proofs of this analysis, we generate new programs, again behaviorally equivalent to the given ones, which are easily verifiable" in the sense that now the data ow analysis alone can yield precise results. An experimental evaluation practically supports our claim of easy verification. author: - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Jakobs M-C, Wehrheim H. Programs from Proofs of Predicated Dataflow Analyses. In: Proceedings of the 30th Annual ACM Symposium on Applied Computing. SAC ’15. ; 2015:1729-1736. doi:10.1145/2695664.2695690' apa: Jakobs, M.-C., & Wehrheim, H. (2015). Programs from Proofs of Predicated Dataflow Analyses. In Proceedings of the 30th Annual ACM Symposium on Applied Computing (pp. 1729–1736). https://doi.org/10.1145/2695664.2695690 bibtex: '@inproceedings{Jakobs_Wehrheim_2015, series={SAC ’15}, title={Programs from Proofs of Predicated Dataflow Analyses}, DOI={10.1145/2695664.2695690}, booktitle={Proceedings of the 30th Annual ACM Symposium on Applied Computing}, author={Jakobs, Marie-Christine and Wehrheim, Heike}, year={2015}, pages={1729–1736}, collection={SAC ’15} }' chicago: Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs of Predicated Dataflow Analyses.” In Proceedings of the 30th Annual ACM Symposium on Applied Computing, 1729–36. SAC ’15, 2015. https://doi.org/10.1145/2695664.2695690. ieee: M.-C. Jakobs and H. Wehrheim, “Programs from Proofs of Predicated Dataflow Analyses,” in Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015, pp. 1729–1736. mla: Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs of Predicated Dataflow Analyses.” Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015, pp. 1729–36, doi:10.1145/2695664.2695690. short: 'M.-C. Jakobs, H. Wehrheim, in: Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015, pp. 1729–1736.' date_created: 2017-10-17T12:41:43Z date_updated: 2022-01-06T06:57:18Z ddc: - '040' department: - _id: '77' doi: 10.1145/2695664.2695690 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:35:34Z date_updated: 2018-03-21T09:35:34Z file_id: '1483' file_name: 262-mainSACfinal.pdf file_size: 554583 relation: main_file success: 1 file_date_updated: 2018-03-21T09:35:34Z has_accepted_license: '1' language: - iso: eng page: 1729-1736 project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 30th Annual ACM Symposium on Applied Computing series_title: SAC '15 status: public title: Programs from Proofs of Predicated Dataflow Analyses type: conference user_id: '477' year: '2015' ... --- _id: '264' author: - first_name: Philip full_name: Wette, Philip last_name: Wette citation: ama: Wette P. Optimizing Software-Defined Networks Using Application-Layer Knowledge. Universität Paderborn; 2015. apa: Wette, P. (2015). Optimizing Software-Defined Networks using Application-Layer Knowledge. Universität Paderborn. bibtex: '@book{Wette_2015, title={Optimizing Software-Defined Networks using Application-Layer Knowledge}, publisher={Universität Paderborn}, author={Wette, Philip}, year={2015} }' chicago: Wette, Philip. Optimizing Software-Defined Networks Using Application-Layer Knowledge. Universität Paderborn, 2015. ieee: P. Wette, Optimizing Software-Defined Networks using Application-Layer Knowledge. Universität Paderborn, 2015. mla: Wette, Philip. Optimizing Software-Defined Networks Using Application-Layer Knowledge. Universität Paderborn, 2015. short: P. Wette, Optimizing Software-Defined Networks Using Application-Layer Knowledge, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:43Z date_updated: 2022-01-06T06:57:20Z ddc: - '040' department: - _id: '75' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:34:36Z date_updated: 2018-03-21T09:34:36Z file_id: '1481' file_name: 264-Dissertation_-_Wette.pdf file_size: 8031107 relation: main_file success: 1 file_date_updated: 2018-03-21T09:34:36Z has_accepted_license: '1' project: - _id: '1' name: SFB 901 - _id: '6' name: SFB 901 - Subprojekt A2 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '2' name: SFB 901 - Project Area A - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public supervisor: - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl title: Optimizing Software-Defined Networks using Application-Layer Knowledge type: dissertation user_id: '477' year: '2015' ... --- _id: '26446' author: - first_name: Hans full_name: Pongratz, Hans last_name: Pongratz - first_name: Reinhard full_name: Keil, Reinhard last_name: Keil citation: ama: Pongratz H, Keil R. DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science EV. Koellen Druck + Verlag GmbH; 2015. apa: Pongratz, H., & Keil, R. (2015). DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science eV. Koellen Druck + Verlag GmbH. bibtex: '@book{Pongratz_Keil_2015, series={GI-Edition Lecture Notes in Informatics (LNI)}, title={DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science eV}, publisher={Koellen Druck + Verlag GmbH}, author={Pongratz, Hans and Keil, Reinhard}, year={2015}, collection={GI-Edition Lecture Notes in Informatics (LNI)} }' chicago: Pongratz, Hans, and Reinhard Keil. DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science EV. GI-Edition Lecture Notes in Informatics (LNI). Koellen Druck + Verlag GmbH, 2015. ieee: H. Pongratz and R. Keil, DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science eV. Koellen Druck + Verlag GmbH, 2015. mla: Pongratz, Hans, and Reinhard Keil. DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science EV. Koellen Druck + Verlag GmbH, 2015. short: H. Pongratz, R. Keil, DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science EV, Koellen Druck + Verlag GmbH, 2015. date_created: 2021-10-18T20:52:45Z date_updated: 2022-01-06T06:57:21Z department: - _id: '71' language: - iso: eng publication_status: published publisher: Koellen Druck + Verlag GmbH series_title: GI-Edition Lecture Notes in Informatics (LNI) status: public title: DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science eV type: book user_id: '71124' year: '2015' ... --- _id: '26449' alternative_title: - 20 years of learning with the World Wide Web - technology and education in dialogue author: - first_name: Felix full_name: Winkelnkemper, Felix id: '3117' last_name: Winkelnkemper - first_name: Andreas full_name: Oberhoff, Andreas last_name: Oberhoff citation: ama: 'Winkelnkemper F, Oberhoff A. WebArena - R {\ “a} spacious structures for {\” u} r the learning locations of the future. In: wedge R, Selke H, eds. Vol 330. Publication series of the Heinz Nixdorf Institute, Paderborn; 2015:103-117.' apa: Winkelnkemper, F., & Oberhoff, A. (2015). WebArena - R {\ “a} spacious structures for {\” u} r the learning locations of the future (R. wedge & H. Selke, Eds.; Vol. 330, pp. 103–117). Publication series of the Heinz Nixdorf Institute, Paderborn. bibtex: '@inproceedings{Winkelnkemper_Oberhoff_2015, title={WebArena - R {\ “a} spacious structures for {\” u} r the learning locations of the future}, volume={330}, publisher={Publication series of the Heinz Nixdorf Institute, Paderborn}, author={Winkelnkemper, Felix and Oberhoff, Andreas}, editor={wedge, Reinhard and Selke, Harald}, year={2015}, pages={103–117} }' chicago: Winkelnkemper, Felix, and Andreas Oberhoff. “WebArena - R {\ ‘A} Spacious Structures for {\’ U} r the Learning Locations of the Future.” edited by Reinhard wedge and Harald Selke, 330:103–17. Publication series of the Heinz Nixdorf Institute, Paderborn, 2015. ieee: F. Winkelnkemper and A. Oberhoff, “WebArena - R {\ ‘a} spacious structures for {\’ u} r the learning locations of the future,” 2015, vol. 330, pp. 103–117. mla: Winkelnkemper, Felix, and Andreas Oberhoff. WebArena - R {\ “A} Spacious Structures for {\” U} r the Learning Locations of the Future. Edited by Reinhard wedge and Harald Selke, vol. 330, Publication series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 103–17. short: 'F. Winkelnkemper, A. Oberhoff, in: R. wedge, H. Selke (Eds.), Publication series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 103–117.' date_created: 2021-10-18T20:56:42Z date_updated: 2022-01-06T06:57:21Z department: - _id: '71' editor: - first_name: 'Reinhard ' full_name: 'wedge, Reinhard ' last_name: wedge - first_name: Harald full_name: Selke, Harald last_name: Selke intvolume: ' 330' language: - iso: eng page: 103-117 publication_status: published publisher: Publication series of the Heinz Nixdorf Institute, Paderborn status: public title: WebArena - R {\ "a} spacious structures for {\" u} r the learning locations of the future type: conference user_id: '71124' volume: 330 year: '2015' ... --- _id: '26531' citation: ama: Keil R, Selke H, eds. 20 Years of Learning with the World Wide Web - Technology and Education in Dialogue. Vol 330. publishing series of the Heinz Nixdorf Institute, Paderborn; 2015. apa: Keil, R., & Selke, H. (Eds.). (2015). 20 years of learning with the World Wide Web - technology and education in dialogue (Vol. 330). publishing series of the Heinz Nixdorf Institute, Paderborn. bibtex: '@book{Keil_Selke_2015, series={Heinz publishing house series Nixdorf Institute, Paderborn}, title={20 years of learning with the World Wide Web - technology and education in dialogue}, volume={330}, publisher={publishing series of the Heinz Nixdorf Institute, Paderborn}, year={2015}, collection={Heinz publishing house series Nixdorf Institute, Paderborn} }' chicago: Keil, Reinhard, and Harald Selke, eds. 20 Years of Learning with the World Wide Web - Technology and Education in Dialogue. Vol. 330. Heinz Publishing House Series Nixdorf Institute, Paderborn. publishing series of the Heinz Nixdorf Institute, Paderborn, 2015. ieee: R. Keil and H. Selke, Eds., 20 years of learning with the World Wide Web - technology and education in dialogue, vol. 330. publishing series of the Heinz Nixdorf Institute, Paderborn, 2015. mla: Keil, Reinhard, and Harald Selke, editors. 20 Years of Learning with the World Wide Web - Technology and Education in Dialogue. publishing series of the Heinz Nixdorf Institute, Paderborn, 2015. short: R. Keil, H. Selke, eds., 20 Years of Learning with the World Wide Web - Technology and Education in Dialogue, publishing series of the Heinz Nixdorf Institute, Paderborn, 2015. date_created: 2021-10-19T14:09:39Z date_updated: 2022-01-06T06:57:22Z department: - _id: '71' editor: - first_name: Reinhard full_name: Keil, Reinhard last_name: Keil - first_name: Harald full_name: Selke, Harald id: '497' last_name: Selke intvolume: ' 330' language: - iso: eng publication_status: published publisher: publishing series of the Heinz Nixdorf Institute, Paderborn series_title: Heinz publishing house series Nixdorf Institute, Paderborn status: public title: 20 years of learning with the World Wide Web - technology and education in dialogue type: book_editor user_id: '71124' volume: 330 year: '2015' ... --- _id: '26532' alternative_title: - 20 years of learning with the World Wide Web - technology and education in dialogue author: - first_name: 'Reinhard ' full_name: 'Keil, Reinhard ' last_name: Keil - first_name: Harald full_name: Selke, Harald id: '497' last_name: Selke citation: ama: 'Keil R, Selke H. Learn with, through and {\ "about the WWW. In: Keil R, Selke H, eds. Vol 330. Publishing series of the Heinz Nixdorf Institute, Paderborn; 2015:1-7.' apa: Keil, R., & Selke, H. (2015). Learn with, through and {\ "about the WWW (R. Keil & H. Selke, Eds.; Vol. 330, pp. 1–7). Publishing series of the Heinz Nixdorf Institute, Paderborn. bibtex: '@inproceedings{Keil_Selke_2015, title={Learn with, through and {\ "about the WWW}, volume={330}, publisher={Publishing series of the Heinz Nixdorf Institute, Paderborn}, author={Keil, Reinhard and Selke, Harald}, editor={Keil, Reinhard and Selke, Harald}, year={2015}, pages={1–7} }' chicago: Keil, Reinhard , and Harald Selke. “Learn with, through and {\ "about the WWW.” edited by Reinhard Keil and Harald Selke, 330:1–7. Publishing series of the Heinz Nixdorf Institute, Paderborn, 2015. ieee: R. Keil and H. Selke, “Learn with, through and {\ "about the WWW,” 2015, vol. 330, pp. 1–7. mla: Keil, Reinhard, and Harald Selke. Learn with, through and {\ "about the WWW. Edited by Reinhard Keil and Harald Selke, vol. 330, Publishing series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 1–7. short: 'R. Keil, H. Selke, in: R. Keil, H. Selke (Eds.), Publishing series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 1–7.' date_created: 2021-10-19T14:13:08Z date_updated: 2022-01-06T06:57:22Z department: - _id: '71' editor: - first_name: Reinhard full_name: Keil, Reinhard last_name: Keil - first_name: Harald full_name: ' Selke, Harald' last_name: ' Selke' intvolume: ' 330' language: - iso: eng page: 1-7 publication_status: published publisher: Publishing series of the Heinz Nixdorf Institute, Paderborn status: public title: Learn with, through and {\ "about the WWW type: conference user_id: '71124' volume: 330 year: '2015' ... --- _id: '26533' alternative_title: - 20 years of learning with the World Wide Web - technology and education in dialogue author: - first_name: 'Reinhard ' full_name: 'Keil, Reinhard ' last_name: Keil - first_name: Harald full_name: Selke, Harald id: '497' last_name: Selke citation: ama: 'Keil R, Selke H. Virtual knowledge {\ “a} ume - From the presentation of content to virtual learning {\” a} tten. In: Keil R, Selke H, eds. Vol 330. publishing series of the Heinz Nixdorf Institute, Paderborn; 2015:39-53.' apa: Keil, R., & Selke, H. (2015). Virtual knowledge {\ “a} ume - From the presentation of content to virtual learning {\” a} tten (R. Keil & H. Selke, Eds.; Vol. 330, pp. 39–53). publishing series of the Heinz Nixdorf Institute, Paderborn. bibtex: '@inproceedings{Keil_Selke_2015, title={Virtual knowledge {\ “a} ume - From the presentation of content to virtual learning {\” a} tten}, volume={330}, publisher={publishing series of the Heinz Nixdorf Institute, Paderborn}, author={Keil, Reinhard and Selke, Harald}, editor={Keil, Reinhard and Selke, Harald}, year={2015}, pages={39–53} }' chicago: Keil, Reinhard , and Harald Selke. “Virtual Knowledge {\ ‘A} Ume - From the Presentation of Content to Virtual Learning {\’ A} Tten.” edited by Reinhard Keil and Harald Selke, 330:39–53. publishing series of the Heinz Nixdorf Institute, Paderborn, 2015. ieee: R. Keil and H. Selke, “Virtual knowledge {\ ‘a} ume - From the presentation of content to virtual learning {\’ a} tten,” 2015, vol. 330, pp. 39–53. mla: Keil, Reinhard, and Harald Selke. Virtual Knowledge {\ “A} Ume - From the Presentation of Content to Virtual Learning {\” A} Tten. Edited by Reinhard Keil and Harald Selke, vol. 330, publishing series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 39–53. short: 'R. Keil, H. Selke, in: R. Keil, H. Selke (Eds.), publishing series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 39–53.' date_created: 2021-10-19T14:19:23Z date_updated: 2022-01-06T06:57:22Z department: - _id: '71' editor: - first_name: Reinhard full_name: Keil, Reinhard last_name: Keil - first_name: Harald full_name: Selke, Harald last_name: Selke intvolume: ' 330' language: - iso: eng page: 39-53 publication_status: published publisher: publishing series of the Heinz Nixdorf Institute, Paderborn status: public title: Virtual knowledge {\ "a} ume - From the presentation of content to virtual learning {\" a} tten type: conference user_id: '71124' volume: 330 year: '2015' ... --- _id: '26534' author: - first_name: Florian full_name: Klompmaker, Florian last_name: Klompmaker citation: ama: Klompmaker F. Development of a Structured Process of Interaction Design for {\ “U} r Nat {\” U} Local User Interfaces. Universitaetsbibliothek Paderborn; 2015. apa: Klompmaker, F. (2015). Development of a structured process of interaction design for {\ “u} r nat {\” u} local user interfaces. Universitaetsbibliothek Paderborn. bibtex: '@book{Klompmaker_2015, place={Universit {\ "a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science}, title={Development of a structured process of interaction design for {\ “u} r nat {\” u} local user interfaces}, publisher={Universitaetsbibliothek Paderborn}, author={Klompmaker, Florian}, year={2015} }' chicago: 'Klompmaker, Florian. Development of a Structured Process of Interaction Design for {\ “U} r Nat {\” U} Local User Interfaces. Universit {\ "a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science: Universitaetsbibliothek Paderborn, 2015.' ieee: 'F. Klompmaker, Development of a structured process of interaction design for {\ “u} r nat {\” u} local user interfaces. Universit {\ "a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science: Universitaetsbibliothek Paderborn, 2015.' mla: Klompmaker, Florian. Development of a Structured Process of Interaction Design for {\ “U} r Nat {\” U} Local User Interfaces. Universitaetsbibliothek Paderborn, 2015. short: F. Klompmaker, Development of a Structured Process of Interaction Design for {\ “U} r Nat {\” U} Local User Interfaces, Universitaetsbibliothek Paderborn, Universit {\ "a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science, 2015. date_created: 2021-10-19T14:22:28Z date_updated: 2022-01-06T06:57:22Z department: - _id: '71' language: - iso: eng place: Universit {\ "a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science publication_status: published publisher: Universitaetsbibliothek Paderborn status: public title: Development of a structured process of interaction design for {\ "u} r nat {\" u} local user interfaces type: dissertation user_id: '71124' year: '2015' ... --- _id: '26536' abstract: - lang: eng text: "Patterns serve to codify design knowledge. By embedding them in a hypothesis-driven design, it is possible to develop them further into sample languages. For this it is necessary to resolve the underlying conflicts in the form of design hypotheses and to validate them empirically in order to enable further use and generalization. In this article, an experiment is presented that describes this procedure and demonstrates the interplay between theory formation and codification of design knowledge using two examples.\r\n" author: - first_name: Christian full_name: Schild, Christian last_name: Schild - first_name: Vanessa full_name: Petrausch, Vanessa last_name: Petrausch citation: ama: 'Schild C, Petrausch V. Empirical validation of design patterns. In: Human and Computer 2015 - Proceedings. De Gruyter Oldenbourg; 2015:173-182.' apa: Schild, C., & Petrausch, V. (2015). Empirical validation of design patterns. Human and Computer 2015 - Proceedings, 173–182. bibtex: '@inproceedings{Schild_Petrausch_2015, place={Berlin}, title={Empirical validation of design patterns}, booktitle={Human and Computer 2015 - Proceedings}, publisher={De Gruyter Oldenbourg}, author={Schild, Christian and Petrausch, Vanessa}, year={2015}, pages={173–182} }' chicago: 'Schild, Christian, and Vanessa Petrausch. “Empirical Validation of Design Patterns.” In Human and Computer 2015 - Proceedings, 173–82. Berlin: De Gruyter Oldenbourg, 2015.' ieee: C. Schild and V. Petrausch, “Empirical validation of design patterns,” in Human and Computer 2015 - Proceedings, 2015, pp. 173–182. mla: Schild, Christian, and Vanessa Petrausch. “Empirical Validation of Design Patterns.” Human and Computer 2015 - Proceedings, De Gruyter Oldenbourg, 2015, pp. 173–82. short: 'C. Schild, V. Petrausch, in: Human and Computer 2015 - Proceedings, De Gruyter Oldenbourg, Berlin, 2015, pp. 173–182.' date_created: 2021-10-19T14:28:44Z date_updated: 2022-01-06T06:57:22Z department: - _id: '71' language: - iso: eng page: 173-182 place: Berlin publication: Human and Computer 2015 - Proceedings publication_status: published publisher: De Gruyter Oldenbourg status: public title: Empirical validation of design patterns type: conference user_id: '71124' year: '2015' ... --- _id: '266' abstract: - lang: eng text: 'Many markets have seen a shift from the idea of buying and moved to leasing instead. Arguably, the latter has been the major catalyst for their success. Ten years ago, research realized this shift and initiated the study of "online leasing problems" by introducing leasing to online optimization problems. Resources required to provide a service in an "online leasing problem" are no more bought but leased for different durations. In this paper, we provide an overview of results that contribute to the understanding of "online resource leasing problems". ' author: - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Markarian C, Meyer auf der Heide F. Online Resource Leasing. In: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC). ; 2015:343-344. doi:10.1145/2767386.2767454' apa: Markarian, C., & Meyer auf der Heide, F. (2015). Online Resource Leasing. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC) (pp. 343–344). https://doi.org/10.1145/2767386.2767454 bibtex: '@inproceedings{Markarian_Meyer auf der Heide_2015, title={Online Resource Leasing}, DOI={10.1145/2767386.2767454}, booktitle={Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)}, author={Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2015}, pages={343–344} }' chicago: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.” In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 343–44, 2015. https://doi.org/10.1145/2767386.2767454. ieee: C. Markarian and F. Meyer auf der Heide, “Online Resource Leasing,” in Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015, pp. 343–344. mla: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.” Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015, pp. 343–44, doi:10.1145/2767386.2767454. short: 'C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015, pp. 343–344.' date_created: 2017-10-17T12:41:44Z date_updated: 2022-01-06T06:57:22Z ddc: - '040' department: - _id: '63' doi: 10.1145/2767386.2767454 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:33:11Z date_updated: 2018-03-21T09:33:11Z file_id: '1478' file_name: 266-p343-markarian.pdf file_size: 679580 relation: main_file success: 1 file_date_updated: 2018-03-21T09:33:11Z has_accepted_license: '1' page: 343-344 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '2' name: SFB 901 - Project Area A - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC) status: public title: Online Resource Leasing type: conference user_id: '15504' year: '2015' ... --- _id: '267' author: - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian citation: ama: Markarian C. Online Resource Leasing. Universität Paderborn; 2015. apa: Markarian, C. (2015). Online Resource Leasing. Universität Paderborn. bibtex: '@book{Markarian_2015, title={Online Resource Leasing}, publisher={Universität Paderborn}, author={Markarian, Christine}, year={2015} }' chicago: Markarian, Christine. Online Resource Leasing. Universität Paderborn, 2015. ieee: C. Markarian, Online Resource Leasing. Universität Paderborn, 2015. mla: Markarian, Christine. Online Resource Leasing. Universität Paderborn, 2015. short: C. Markarian, Online Resource Leasing, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:44Z date_updated: 2022-01-06T06:57:26Z ddc: - '040' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:33:41Z date_updated: 2018-03-21T09:33:41Z file_id: '1479' file_name: 267-Dissertation_-_Markarian.pdf file_size: 1328685 relation: main_file success: 1 file_date_updated: 2018-03-21T09:33:41Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn related_material: link: - relation: confirmation url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-16656 status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Online Resource Leasing type: dissertation user_id: '15415' year: '2015' ... --- _id: '269' abstract: - lang: eng text: Proof-carrying hardware is an approach that has recently been proposed for the efficient verification of reconfigurable modules. We present an application of proof-carrying hardware to guarantee the correct functionality of dynamically reconfigured image processing modules. Our prototype comprises a reconfigurable-system-on-chip with an embedded virtual FPGA fabric. This setup allows us to leverage open source FPGA synthesis and backend tools to produce FPGA configuration bitstreams with an open format and, thus, to demonstrate and experimentally evaluate proof-carrying hardware at the bitstream level. author: - first_name: Tobias full_name: Wiersema, Tobias id: '3118' last_name: Wiersema - first_name: Sen full_name: Wu, Sen last_name: Wu - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: ama: 'Wiersema T, Wu S, Platzner M. On-The-Fly Verification of Reconfigurable Image Processing Modules based on a Proof-Carrying Hardware Approach. In: Proceedings of the International Symposium in Reconfigurable Computing (ARC). LNCS. ; 2015:365--372. doi:10.1007/978-3-319-16214-0_32' apa: Wiersema, T., Wu, S., & Platzner, M. (2015). On-The-Fly Verification of Reconfigurable Image Processing Modules based on a Proof-Carrying Hardware Approach. In Proceedings of the International Symposium in Reconfigurable Computing (ARC) (pp. 365--372). https://doi.org/10.1007/978-3-319-16214-0_32 bibtex: '@inproceedings{Wiersema_Wu_Platzner_2015, series={LNCS}, title={On-The-Fly Verification of Reconfigurable Image Processing Modules based on a Proof-Carrying Hardware Approach}, DOI={10.1007/978-3-319-16214-0_32}, booktitle={Proceedings of the International Symposium in Reconfigurable Computing (ARC)}, author={Wiersema, Tobias and Wu, Sen and Platzner, Marco}, year={2015}, pages={365--372}, collection={LNCS} }' chicago: Wiersema, Tobias, Sen Wu, and Marco Platzner. “On-The-Fly Verification of Reconfigurable Image Processing Modules Based on a Proof-Carrying Hardware Approach.” In Proceedings of the International Symposium in Reconfigurable Computing (ARC), 365--372. LNCS, 2015. https://doi.org/10.1007/978-3-319-16214-0_32. ieee: T. Wiersema, S. Wu, and M. Platzner, “On-The-Fly Verification of Reconfigurable Image Processing Modules based on a Proof-Carrying Hardware Approach,” in Proceedings of the International Symposium in Reconfigurable Computing (ARC), 2015, pp. 365--372. mla: Wiersema, Tobias, et al. “On-The-Fly Verification of Reconfigurable Image Processing Modules Based on a Proof-Carrying Hardware Approach.” Proceedings of the International Symposium in Reconfigurable Computing (ARC), 2015, pp. 365--372, doi:10.1007/978-3-319-16214-0_32. short: 'T. Wiersema, S. Wu, M. Platzner, in: Proceedings of the International Symposium in Reconfigurable Computing (ARC), 2015, pp. 365--372.' date_created: 2017-10-17T12:41:44Z date_updated: 2022-01-06T06:57:30Z ddc: - '040' department: - _id: '78' doi: 10.1007/978-3-319-16214-0_32 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:32:42Z date_updated: 2018-03-21T09:32:42Z file_id: '1477' file_name: 269-paper_53.pdf file_size: 344309 relation: main_file success: 1 file_date_updated: 2018-03-21T09:32:42Z has_accepted_license: '1' language: - iso: eng page: 365--372 project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the International Symposium in Reconfigurable Computing (ARC) series_title: LNCS status: public title: On-The-Fly Verification of Reconfigurable Image Processing Modules based on a Proof-Carrying Hardware Approach type: conference user_id: '477' year: '2015' ... --- _id: '320' abstract: - lang: eng text: 'We consider structural and algorithmic questions related to the Nash dynamics of weighted congestion games. In weighted congestion games with linear latency functions, the existence of pure Nash equilibria is guaranteed by a potential function argument. Unfortunately, this proof of existence is inefficient and computing pure Nash equilibria in such games is a PLS-hard problem even when all players have unit weights. The situation gets worse when superlinear (e.g., quadratic) latency functions come into play; in this case, the Nash dynamics of the game may contain cycles and pure Nash equilibria may not even exist. Given these obstacles, we consider approximate pure Nash equilibria as alternative solution concepts. A ρ--approximate pure Nash equilibrium is a state of a (weighted congestion) game from which no player has any incentive to deviate in order to improve her cost by a multiplicative factor higher than ρ. Do such equilibria exist for small values of ρ? And if so, can we compute them efficiently?We provide positive answers to both questions for weighted congestion games with polynomial latency functions by exploiting an “approximation” of such games by a new class of potential games that we call Ψ-games. This allows us to show that these games have d!-approximate pure Nash equilibria, where d is the maximum degree of the latency functions. Our main technical contribution is an efficient algorithm for computing O(1)-approximate pure Nash equilibria when d is a constant. For games with linear latency functions, the approximation guarantee is 3+√5/2 + Oγ for arbitrarily small γ > 0; for latency functions with maximum degree d≥ 2, it is d2d+o(d). The running time is polynomial in the number of bits in the representation of the game and 1/γ. As a byproduct of our techniques, we also show the following interesting structural statement for weighted congestion games with polynomial latency functions of maximum degree d ≥ 2: polynomially-long sequences of best-response moves from any initial state to a dO(d2)-approximate pure Nash equilibrium exist and can be efficiently identified in such games as long as d is a constant.To the best of our knowledge, these are the first positive algorithmic results for approximate pure Nash equilibria in weighted congestion games. Our techniques significantly extend our recent work on unweighted congestion games through the use of Ψ-games. The concept of approximating nonpotential games by potential ones is interesting in itself and might have further applications.' article_number: '2' author: - first_name: Ioannis full_name: Caragiannis, Ioannis last_name: Caragiannis - first_name: Angelo full_name: Fanelli, Angelo last_name: Fanelli - first_name: Nick full_name: Gravin, Nick last_name: Gravin - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: ama: 'Caragiannis I, Fanelli A, Gravin N, Skopalik A. Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. Transactions on Economics and Computation. 2015;3(1). doi:10.1145/2614687' apa: 'Caragiannis, I., Fanelli, A., Gravin, N., & Skopalik, A. (2015). Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. Transactions on Economics and Computation, 3(1). https://doi.org/10.1145/2614687' bibtex: '@article{Caragiannis_Fanelli_Gravin_Skopalik_2015, title={Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure}, volume={3}, DOI={10.1145/2614687}, number={12}, journal={Transactions on Economics and Computation}, publisher={ACM}, author={Caragiannis, Ioannis and Fanelli, Angelo and Gravin, Nick and Skopalik, Alexander}, year={2015} }' chicago: 'Caragiannis, Ioannis, Angelo Fanelli, Nick Gravin, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.” Transactions on Economics and Computation 3, no. 1 (2015). https://doi.org/10.1145/2614687.' ieee: 'I. Caragiannis, A. Fanelli, N. Gravin, and A. Skopalik, “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure,” Transactions on Economics and Computation, vol. 3, no. 1, 2015.' mla: 'Caragiannis, Ioannis, et al. “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.” Transactions on Economics and Computation, vol. 3, no. 1, 2, ACM, 2015, doi:10.1145/2614687.' short: I. Caragiannis, A. Fanelli, N. Gravin, A. Skopalik, Transactions on Economics and Computation 3 (2015). date_created: 2017-10-17T12:41:54Z date_updated: 2022-01-06T06:59:04Z ddc: - '040' department: - _id: '63' - _id: '541' doi: 10.1145/2614687 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-20T07:40:55Z date_updated: 2018-03-20T07:40:55Z file_id: '1433' file_name: 320-a2-caragiannis.pdf file_size: 260503 relation: main_file success: 1 file_date_updated: 2018-03-20T07:40:55Z has_accepted_license: '1' intvolume: ' 3' issue: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publication: Transactions on Economics and Computation publisher: ACM status: public title: 'Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure' type: journal_article user_id: '477' volume: 3 year: '2015' ... --- _id: '321' author: - first_name: Fabian full_name: Eidens, Fabian id: '25078' last_name: Eidens citation: ama: Eidens F. Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption. Universität Paderborn; 2015. apa: Eidens, F. (2015). Anonymous credential system based on q-Strong Diffie-Hellman Assumption. Universität Paderborn. bibtex: '@book{Eidens_2015, title={Anonymous credential system based on q-Strong Diffie-Hellman Assumption}, publisher={Universität Paderborn}, author={Eidens, Fabian}, year={2015} }' chicago: Eidens, Fabian. Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption. Universität Paderborn, 2015. ieee: F. Eidens, Anonymous credential system based on q-Strong Diffie-Hellman Assumption. Universität Paderborn, 2015. mla: Eidens, Fabian. Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption. Universität Paderborn, 2015. short: F. Eidens, Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:54Z date_updated: 2022-01-06T06:59:05Z ddc: - '040' department: - _id: '64' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-20T07:40:22Z date_updated: 2018-03-20T07:40:22Z file_id: '1432' file_name: 321-eidens_masterthesis_01.pdf file_size: 879285 relation: main_file success: 1 file_date_updated: 2018-03-20T07:40:22Z has_accepted_license: '1' project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public supervisor: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer title: Anonymous credential system based on q-Strong Diffie-Hellman Assumption type: mastersthesis user_id: '477' year: '2015' ... --- _id: '322' abstract: - lang: eng text: Reputation systems are used to compute and publish reputation scores for services or products. We consider reputation systems where users are allowed to rate products that they purchased previously. To obtain trustworthy reputations, they are allowed to rate these products only once. As long as users rate products once, they stay anonymous. Everybody is able to detect users deviating from the rate-products-only-once policy and the anonymity of such dishonest users can be revoked by a system manager. In this paper we present formal models for such reputation systems and their security. Based on group signatures presented by Boneh, Boyen, and Shacham we design an efficient reputation system that meets all our requirements. author: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer - first_name: Jakob full_name: Juhnke, Jakob id: '48090' last_name: Juhnke - first_name: Christina full_name: Kolb, Christina id: '43647' last_name: Kolb citation: ama: 'Blömer J, Juhnke J, Kolb C. Anonymous and Publicly Linkable Reputation Systems. In: Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC). LNCS. ; 2015:478--488. doi:10.1007/978-3-662-47854-7_29' apa: Blömer, J., Juhnke, J., & Kolb, C. (2015). Anonymous and Publicly Linkable Reputation Systems. In Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC) (pp. 478--488). https://doi.org/10.1007/978-3-662-47854-7_29 bibtex: '@inproceedings{Blömer_Juhnke_Kolb_2015, series={LNCS}, title={Anonymous and Publicly Linkable Reputation Systems}, DOI={10.1007/978-3-662-47854-7_29}, booktitle={Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)}, author={Blömer, Johannes and Juhnke, Jakob and Kolb, Christina}, year={2015}, pages={478--488}, collection={LNCS} }' chicago: Blömer, Johannes, Jakob Juhnke, and Christina Kolb. “Anonymous and Publicly Linkable Reputation Systems.” In Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 478--488. LNCS, 2015. https://doi.org/10.1007/978-3-662-47854-7_29. ieee: J. Blömer, J. Juhnke, and C. Kolb, “Anonymous and Publicly Linkable Reputation Systems,” in Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 2015, pp. 478--488. mla: Blömer, Johannes, et al. “Anonymous and Publicly Linkable Reputation Systems.” Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 2015, pp. 478--488, doi:10.1007/978-3-662-47854-7_29. short: 'J. Blömer, J. Juhnke, C. Kolb, in: Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 2015, pp. 478--488.' date_created: 2017-10-17T12:41:54Z date_updated: 2022-01-06T06:59:05Z ddc: - '040' department: - _id: '64' doi: 10.1007/978-3-662-47854-7_29 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-20T07:39:54Z date_updated: 2018-03-20T07:39:54Z file_id: '1431' file_name: 322-546_01.pdf file_size: 499568 relation: main_file success: 1 file_date_updated: 2018-03-20T07:39:54Z has_accepted_license: '1' main_file_link: - open_access: '1' url: https://eprint.iacr.org/2014/546 oa: '1' page: 478--488 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC) series_title: LNCS status: public title: Anonymous and Publicly Linkable Reputation Systems type: conference user_id: '48090' year: '2015' ... --- _id: '323' abstract: - lang: eng text: On-the-fly composition of service-based software solutions is still a challenging task. Even more challenges emerge when facing automatic service composition in markets of composed services for end users. In this paper, we focus on the functional discrepancy between “what a user wants” specified in terms of a request and “what a user gets” when executing a composed service. To meet the challenge of functional discrepancy, we propose the combination of existing symbolic composition approaches with machine learning techniques. We developed a learning recommendation system that expands the capabilities of existing composition algorithms to facilitate adaptivity and consequently reduces functional discrepancy. As a representative of symbolic techniques, an Artificial Intelligence planning based approach produces solutions that are correct with respect to formal specifications. Our learning recommendation system supports the symbolic approach in decision-making. Reinforcement Learning techniques enable the recommendation system to adjust its recommendation strategy over time based on user ratings. We implemented the proposed functionality in terms of a prototypical composition framework. Preliminary results from experiments conducted in the image processing domain illustrate the benefit of combining both complementary techniques. author: - first_name: Alexander full_name: Jungmann, Alexander last_name: Jungmann - first_name: Felix full_name: Mohr, Felix last_name: Mohr citation: ama: Jungmann A, Mohr F. An approach towards adaptive service composition in markets of composed services. Journal of Internet Services and Applications. 2015;(1):1-18. doi:10.1186/s13174-015-0022-8 apa: Jungmann, A., & Mohr, F. (2015). An approach towards adaptive service composition in markets of composed services. Journal of Internet Services and Applications, (1), 1–18. https://doi.org/10.1186/s13174-015-0022-8 bibtex: '@article{Jungmann_Mohr_2015, title={An approach towards adaptive service composition in markets of composed services}, DOI={10.1186/s13174-015-0022-8}, number={1}, journal={Journal of Internet Services and Applications}, publisher={Springer}, author={Jungmann, Alexander and Mohr, Felix}, year={2015}, pages={1–18} }' chicago: 'Jungmann, Alexander, and Felix Mohr. “An Approach towards Adaptive Service Composition in Markets of Composed Services.” Journal of Internet Services and Applications, no. 1 (2015): 1–18. https://doi.org/10.1186/s13174-015-0022-8.' ieee: A. Jungmann and F. Mohr, “An approach towards adaptive service composition in markets of composed services,” Journal of Internet Services and Applications, no. 1, pp. 1–18, 2015. mla: Jungmann, Alexander, and Felix Mohr. “An Approach towards Adaptive Service Composition in Markets of Composed Services.” Journal of Internet Services and Applications, no. 1, Springer, 2015, pp. 1–18, doi:10.1186/s13174-015-0022-8. short: A. Jungmann, F. Mohr, Journal of Internet Services and Applications (2015) 1–18. date_created: 2017-10-17T12:41:55Z date_updated: 2022-01-06T06:59:06Z ddc: - '040' department: - _id: '355' doi: 10.1186/s13174-015-0022-8 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-20T07:39:17Z date_updated: 2018-03-20T07:39:17Z file_id: '1429' file_name: 323-An_approach_towards_adaptive_service_composition_in_markets_of_composed_services.pdf file_size: 2842281 relation: main_file success: 1 file_date_updated: 2018-03-20T07:39:17Z has_accepted_license: '1' issue: '1' language: - iso: eng page: 1-18 project: - _id: '1' name: SFB 901 - _id: '10' name: SFB 901 - Subprojekt B2 - _id: '3' name: SFB 901 - Project Area B publication: Journal of Internet Services and Applications publisher: Springer status: public title: An approach towards adaptive service composition in markets of composed services type: journal_article user_id: '477' year: '2015' ... --- _id: '324' abstract: - lang: eng text: Services are self-contained software components that can beused platform independent and that aim at maximizing software reuse. Abasic concern in service oriented architectures is to measure the reusabilityof services. One of the most important qualities is the functionalreusability, which indicates how relevant the task is that a service solves.Current metrics for functional reusability of software, however, have verylittle explanatory power and do not accomplish this goal.This paper presents a new approach to estimate the functional reusabilityof services based on their relevance. To this end, it denes the degreeto which a service enables the execution of other services as its contri-bution. Based on the contribution, relevance of services is dened as anestimation for their functional reusability. Explanatory power is obtainedby normalizing relevance values with a reference service. The applicationof the metric to a service test set conrms its supposed capabilities. author: - first_name: Felix full_name: Mohr, Felix last_name: Mohr citation: ama: 'Mohr F. A Metric for Functional Reusability of Services. In: Proceedings of the 14th International Conference on Software Reuse (ICSR). LNCS. ; 2015:298--313. doi:10.1007/978-3-319-14130-5_21' apa: Mohr, F. (2015). A Metric for Functional Reusability of Services. In Proceedings of the 14th International Conference on Software Reuse (ICSR) (pp. 298--313). https://doi.org/10.1007/978-3-319-14130-5_21 bibtex: '@inproceedings{Mohr_2015, series={LNCS}, title={A Metric for Functional Reusability of Services}, DOI={10.1007/978-3-319-14130-5_21}, booktitle={Proceedings of the 14th International Conference on Software Reuse (ICSR)}, author={Mohr, Felix}, year={2015}, pages={298--313}, collection={LNCS} }' chicago: Mohr, Felix. “A Metric for Functional Reusability of Services.” In Proceedings of the 14th International Conference on Software Reuse (ICSR), 298--313. LNCS, 2015. https://doi.org/10.1007/978-3-319-14130-5_21. ieee: F. Mohr, “A Metric for Functional Reusability of Services,” in Proceedings of the 14th International Conference on Software Reuse (ICSR), 2015, pp. 298--313. mla: Mohr, Felix. “A Metric for Functional Reusability of Services.” Proceedings of the 14th International Conference on Software Reuse (ICSR), 2015, pp. 298--313, doi:10.1007/978-3-319-14130-5_21. short: 'F. Mohr, in: Proceedings of the 14th International Conference on Software Reuse (ICSR), 2015, pp. 298--313.' date_created: 2017-10-17T12:41:55Z date_updated: 2022-01-06T06:59:07Z ddc: - '040' department: - _id: '355' doi: 10.1007/978-3-319-14130-5_21 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-20T07:38:44Z date_updated: 2018-03-20T07:38:44Z file_id: '1428' file_name: 324-ICSR-Mohr-15.pdf file_size: 569475 relation: main_file success: 1 file_date_updated: 2018-03-20T07:38:44Z has_accepted_license: '1' language: - iso: eng page: 298--313 project: - _id: '1' name: SFB 901 - _id: '10' name: SFB 901 - Subprojekt B2 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 14th International Conference on Software Reuse (ICSR) series_title: LNCS status: public title: A Metric for Functional Reusability of Services type: conference user_id: '477' year: '2015' ... --- _id: '325' author: - first_name: Nils full_name: Löken, Nils id: '13703' last_name: Löken citation: ama: Löken N. A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption. Universität Paderborn; 2015. apa: Löken, N. (2015). A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption. Universität Paderborn. bibtex: '@book{Löken_2015, title={A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption}, publisher={Universität Paderborn}, author={Löken, Nils}, year={2015} }' chicago: Löken, Nils. A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption. Universität Paderborn, 2015. ieee: N. Löken, A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption. Universität Paderborn, 2015. mla: Löken, Nils. A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption. Universität Paderborn, 2015. short: N. Löken, A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:55Z date_updated: 2022-01-06T06:59:07Z department: - _id: '64' project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn related_material: record: - id: '253' relation: other status: public status: public supervisor: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer title: A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption type: mastersthesis user_id: '477' year: '2015' ... --- _id: '326' author: - first_name: Frederic full_name: Heihoff, Frederic last_name: Heihoff citation: ama: Heihoff F. A Group Signature Scheme Based on the LSRW Assumption. Universität Paderborn; 2015. apa: Heihoff, F. (2015). A group signature scheme based on the LSRW assumption. Universität Paderborn. bibtex: '@book{Heihoff_2015, title={A group signature scheme based on the LSRW assumption}, publisher={Universität Paderborn}, author={Heihoff, Frederic}, year={2015} }' chicago: Heihoff, Frederic. A Group Signature Scheme Based on the LSRW Assumption. Universität Paderborn, 2015. ieee: F. Heihoff, A group signature scheme based on the LSRW assumption. Universität Paderborn, 2015. mla: Heihoff, Frederic. A Group Signature Scheme Based on the LSRW Assumption. Universität Paderborn, 2015. short: F. Heihoff, A Group Signature Scheme Based on the LSRW Assumption, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:55Z date_updated: 2022-01-06T06:59:07Z department: - _id: '64' project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public supervisor: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer title: A group signature scheme based on the LSRW assumption type: bachelorsthesis user_id: '477' year: '2015' ... --- _id: '327' abstract: - lang: eng text: We consider the problem of resource discovery in distributed systems. In particular we give an algorithm, such that each node in a network discovers the address of any other node in the network. We model the knowledge of the nodes as a virtual overlay network given by a directed graph such that complete knowledge of all nodes corresponds to a complete graph in the overlay network. Although there are several solutions for resource discovery, our solution is the first that achieves worst-case optimal work for each node, i.e. the number of addresses (O(n)O(n)) or bits (O(nlog⁡n)O(nlog⁡n)) a node receives or sends coincides with the lower bound, while ensuring only a linear runtime (O(n)O(n)) on the number of rounds. author: - first_name: Sebastian full_name: Kniesburges, Sebastian last_name: Kniesburges - first_name: Andreas full_name: Koutsopoulos, Andreas last_name: Koutsopoulos - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: Kniesburges S, Koutsopoulos A, Scheideler C. A deterministic worst-case message complexity optimal solution for resource discovery. Theoretical Computer Science. 2015:67-79. doi:10.1016/j.tcs.2014.11.027 apa: Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2015). A deterministic worst-case message complexity optimal solution for resource discovery. Theoretical Computer Science, 67–79. https://doi.org/10.1016/j.tcs.2014.11.027 bibtex: '@article{Kniesburges_Koutsopoulos_Scheideler_2015, title={A deterministic worst-case message complexity optimal solution for resource discovery}, DOI={10.1016/j.tcs.2014.11.027}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2015}, pages={67–79} }' chicago: Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” Theoretical Computer Science, 2015, 67–79. https://doi.org/10.1016/j.tcs.2014.11.027. ieee: S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A deterministic worst-case message complexity optimal solution for resource discovery,” Theoretical Computer Science, pp. 67–79, 2015. mla: Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” Theoretical Computer Science, Elsevier, 2015, pp. 67–79, doi:10.1016/j.tcs.2014.11.027. short: S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theoretical Computer Science (2015) 67–79. date_created: 2017-10-17T12:41:55Z date_updated: 2022-01-06T06:59:08Z ddc: - '040' department: - _id: '79' doi: 10.1016/j.tcs.2014.11.027 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-20T07:38:02Z date_updated: 2018-03-20T07:38:02Z file_id: '1427' file_name: 327-KKS15-TOCS_01.pdf file_size: 398044 relation: main_file success: 1 file_date_updated: 2018-03-20T07:38:02Z has_accepted_license: '1' page: 67-79 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Theoretical Computer Science publisher: Elsevier status: public title: A deterministic worst-case message complexity optimal solution for resource discovery type: journal_article user_id: '477' year: '2015' ... --- _id: '3343' abstract: - lang: eng text: In this paper we consider an extended variant of query learning where the hidden concept is embedded in some Boolean circuit. This additional processing layer modifies query arguments and answers by fixed transformation functions which are known to the learner. For this scenario, we provide a characterization of the solution space and an ordering on it. We give a compact representation of the minimal and maximal solutions as quantified Boolean formulas and we adapt the original algorithms for exact learning of specific classes of propositional formulas. author: - first_name: Uwe full_name: Bubeck, Uwe last_name: Bubeck - first_name: Hans full_name: Kleine Büning, Hans last_name: Kleine Büning citation: ama: Bubeck U, Kleine Büning H. Learning Boolean Specifications. Artificial Intelligence. 2015:246-257. doi:10.1016/j.artint.2015.09.003 apa: Bubeck, U., & Kleine Büning, H. (2015). Learning Boolean Specifications. Artificial Intelligence, 246–257. https://doi.org/10.1016/j.artint.2015.09.003 bibtex: '@article{Bubeck_Kleine Büning_2015, title={Learning Boolean Specifications}, DOI={10.1016/j.artint.2015.09.003}, journal={Artificial Intelligence}, publisher={Elsevier}, author={Bubeck, Uwe and Kleine Büning, Hans}, year={2015}, pages={246–257} }' chicago: Bubeck, Uwe, and Hans Kleine Büning. “Learning Boolean Specifications.” Artificial Intelligence, 2015, 246–57. https://doi.org/10.1016/j.artint.2015.09.003. ieee: U. Bubeck and H. Kleine Büning, “Learning Boolean Specifications,” Artificial Intelligence, pp. 246–257, 2015. mla: Bubeck, Uwe, and Hans Kleine Büning. “Learning Boolean Specifications.” Artificial Intelligence, Elsevier, 2015, pp. 246–57, doi:10.1016/j.artint.2015.09.003. short: U. Bubeck, H. Kleine Büning, Artificial Intelligence (2015) 246–257. date_created: 2018-06-25T10:43:19Z date_updated: 2022-01-06T06:59:10Z ddc: - '000' department: - _id: '34' doi: 10.1016/j.artint.2015.09.003 keyword: - Query learning - Propositional logic language: - iso: eng page: 246 - 257 project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '10' name: SFB 901 - Subproject B2 publication: Artificial Intelligence publication_identifier: issn: - 0004-3702 publisher: Elsevier status: public title: Learning Boolean Specifications type: journal_article user_id: '315' year: '2015' ... --- _id: '3364' author: - first_name: Christoph full_name: Knorr, Christoph last_name: Knorr citation: ama: Knorr C. Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten. Universität Paderborn; 2015. apa: Knorr, C. (2015). Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten. Universität Paderborn. bibtex: '@book{Knorr_2015, title={Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten}, publisher={Universität Paderborn}, author={Knorr, Christoph}, year={2015} }' chicago: Knorr, Christoph. Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten. Universität Paderborn, 2015. ieee: C. Knorr, Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten. Universität Paderborn, 2015. mla: Knorr, Christoph. Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten. Universität Paderborn, 2015. short: C. Knorr, Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten, Universität Paderborn, 2015. date_created: 2018-06-26T14:06:07Z date_updated: 2022-01-06T06:59:13Z department: - _id: '78' language: - iso: ger project: - _id: '14' name: SFB 901 - Subproject C2 - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public supervisor: - first_name: Achim full_name: Lösch, Achim id: '43646' last_name: Lösch - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner title: Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten type: bachelorsthesis user_id: '477' year: '2015' ... --- _id: '3815' author: - first_name: Henning full_name: Wachsmuth, Henning id: '3900' last_name: Wachsmuth - first_name: Johannes full_name: Kiesel, Johannes last_name: Kiesel - first_name: Benno full_name: Stein, Benno last_name: Stein citation: ama: 'Wachsmuth H, Kiesel J, Stein B. Sentiment Flow - A General Model of Web Review Argumentation. In: Tsujii J, Hajic J, eds. Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing. Lecture Notes in Computer Science. ; 2015:601-611. doi:10.18653/v1/D15-1072' apa: Wachsmuth, H., Kiesel, J., & Stein, B. (2015). Sentiment Flow - A General Model of Web Review Argumentation. In J. Tsujii & J. Hajic (Eds.), Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing (pp. 601–611). https://doi.org/10.18653/v1/D15-1072 bibtex: '@inproceedings{Wachsmuth_Kiesel_Stein_2015, series={Lecture Notes in Computer Science}, title={Sentiment Flow - A General Model of Web Review Argumentation}, DOI={10.18653/v1/D15-1072}, booktitle={Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing}, author={Wachsmuth, Henning and Kiesel, Johannes and Stein, Benno}, editor={Tsujii, Junichi and Hajic, JanEditors}, year={2015}, pages={601–611}, collection={Lecture Notes in Computer Science} }' chicago: Wachsmuth, Henning, Johannes Kiesel, and Benno Stein. “Sentiment Flow - A General Model of Web Review Argumentation.” In Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, edited by Junichi Tsujii and Jan Hajic, 601–11. Lecture Notes in Computer Science, 2015. https://doi.org/10.18653/v1/D15-1072. ieee: H. Wachsmuth, J. Kiesel, and B. Stein, “Sentiment Flow - A General Model of Web Review Argumentation,” in Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, 2015, pp. 601–611. mla: Wachsmuth, Henning, et al. “Sentiment Flow - A General Model of Web Review Argumentation.” Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, edited by Junichi Tsujii and Jan Hajic, 2015, pp. 601–11, doi:10.18653/v1/D15-1072. short: 'H. Wachsmuth, J. Kiesel, B. Stein, in: J. Tsujii, J. Hajic (Eds.), Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, 2015, pp. 601–611.' date_created: 2018-08-02T13:38:41Z date_updated: 2022-01-06T06:59:37Z department: - _id: '600' doi: 10.18653/v1/D15-1072 editor: - first_name: Junichi full_name: Tsujii, Junichi last_name: Tsujii - first_name: Jan full_name: Hajic, Jan last_name: Hajic language: - iso: eng main_file_link: - url: https://www.aclweb.org/anthology/D15-1072.pdf page: 601-611 publication: Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing publication_identifier: isbn: - 978-3-319-25740-2 series_title: Lecture Notes in Computer Science status: public title: Sentiment Flow - A General Model of Web Review Argumentation type: conference user_id: '82920' year: '2015' ... --- _id: '3845' abstract: - lang: eng text: The device principle of a prism-based on-chip spectrometer for TE polarization is introduced. The spectrometer exploits the modal dispersion in planar waveguides in a layout with slab regions having two different thicknesses of the guiding layer. The set-up uses parabolic mirrors, for the collimation of light of the input waveguide and focusing of the light to the receiver waveguides, which relies on total internal reflection at the interface between two such regions. These regions are connected adiabatically to prevent unwanted mode conversion and loss at the edges of the prism. The structure can be fabricated with two wet etching steps. The paper presents basic theory and a general approach for device optimization. The latter is illustrated with a numerical example assuming SiON technology. article_type: original author: - first_name: F. full_name: Civitci, F. last_name: Civitci - first_name: Manfred full_name: Hammer, Manfred id: '48077' last_name: Hammer orcid: 0000-0002-6331-9348 - first_name: H.J.W.M. full_name: Hoekstra, H.J.W.M. last_name: Hoekstra citation: ama: Civitci F, Hammer M, Hoekstra HJWM. Planar prism spectrometer based on adiabatically connected waveguiding slabs. Optics Communications. 2015;365:29-37. doi:10.1016/j.optcom.2015.11.066 apa: Civitci, F., Hammer, M., & Hoekstra, H. J. W. M. (2015). Planar prism spectrometer based on adiabatically connected waveguiding slabs. Optics Communications, 365, 29–37. https://doi.org/10.1016/j.optcom.2015.11.066 bibtex: '@article{Civitci_Hammer_Hoekstra_2015, title={Planar prism spectrometer based on adiabatically connected waveguiding slabs}, volume={365}, DOI={10.1016/j.optcom.2015.11.066}, journal={Optics Communications}, publisher={Elsevier BV}, author={Civitci, F. and Hammer, Manfred and Hoekstra, H.J.W.M.}, year={2015}, pages={29–37} }' chicago: 'Civitci, F., Manfred Hammer, and H.J.W.M. Hoekstra. “Planar Prism Spectrometer Based on Adiabatically Connected Waveguiding Slabs.” Optics Communications 365 (2015): 29–37. https://doi.org/10.1016/j.optcom.2015.11.066.' ieee: F. Civitci, M. Hammer, and H. J. W. M. Hoekstra, “Planar prism spectrometer based on adiabatically connected waveguiding slabs,” Optics Communications, vol. 365, pp. 29–37, 2015. mla: Civitci, F., et al. “Planar Prism Spectrometer Based on Adiabatically Connected Waveguiding Slabs.” Optics Communications, vol. 365, Elsevier BV, 2015, pp. 29–37, doi:10.1016/j.optcom.2015.11.066. short: F. Civitci, M. Hammer, H.J.W.M. Hoekstra, Optics Communications 365 (2015) 29–37. date_created: 2018-08-08T10:27:57Z date_updated: 2022-01-06T06:59:44Z ddc: - '530' department: - _id: '61' doi: 10.1016/j.optcom.2015.11.066 file: - access_level: closed content_type: application/pdf creator: hclaudia date_created: 2018-08-08T10:31:23Z date_updated: 2018-08-08T10:31:23Z file_id: '3846' file_name: 2016 Hammer_Planar prism spectrometer based on adiabatically connected waveguiding slabs.pdf file_size: 1542539 relation: main_file success: 1 file_date_updated: 2018-08-08T10:31:23Z has_accepted_license: '1' intvolume: ' 365' keyword: - tet_topic_waveguide language: - iso: eng page: 29-37 publication: Optics Communications publication_identifier: issn: - 0030-4018 publication_status: published publisher: Elsevier BV status: public title: Planar prism spectrometer based on adiabatically connected waveguiding slabs type: journal_article user_id: '55706' volume: 365 year: '2015' ... --- _id: '3847' abstract: - lang: eng text: "Sheets of slab waveguides with sharp corners are investigated. By means of rigorous\r\nnumerical experiments, we look at oblique incidence of semi-guided plane waves. Radiation losses\r\nvanish beyond a certain critical angle of incidence. One can thus realize lossless propagation through\r\n90-degree corner configurations, where the remaining guided waves are still subject to pronounced\r\nreflection and polarization conversion. A system of two corners can be viewed as a structure akin to\r\na Fabry-Perot-interferometer. By adjusting the distance between the two partial reflectors, here the\r\n90-degree corners, one identifies step-like configurations that transmit the semi-guided plane waves\r\nwithout radiation losses, and virtually without reflections. Simulations of semi-guided beams with\r\nin-plane wide Gaussian profiles show that the effect survives in a true 3-D framework." article_type: original author: - first_name: Manfred full_name: Hammer, Manfred id: '48077' last_name: Hammer orcid: 0000-0002-6331-9348 - first_name: Andre full_name: Hildebrandt, Andre last_name: Hildebrandt - first_name: Jens full_name: Förstner, Jens id: '158' last_name: Förstner orcid: 0000-0001-7059-9862 citation: ama: Hammer M, Hildebrandt A, Förstner J. Full Resonant Transmission of Semiguided Planar Waves Through Slab Waveguide Steps at Oblique Incidence. Journal of Lightwave Technology. 2015;34(3):997-1005. doi:10.1109/jlt.2015.2502431 apa: Hammer, M., Hildebrandt, A., & Förstner, J. (2015). Full Resonant Transmission of Semiguided Planar Waves Through Slab Waveguide Steps at Oblique Incidence. Journal of Lightwave Technology, 34(3), 997–1005. https://doi.org/10.1109/jlt.2015.2502431 bibtex: '@article{Hammer_Hildebrandt_Förstner_2015, title={Full Resonant Transmission of Semiguided Planar Waves Through Slab Waveguide Steps at Oblique Incidence}, volume={34}, DOI={10.1109/jlt.2015.2502431}, number={3}, journal={Journal of Lightwave Technology}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Hammer, Manfred and Hildebrandt, Andre and Förstner, Jens}, year={2015}, pages={997–1005} }' chicago: 'Hammer, Manfred, Andre Hildebrandt, and Jens Förstner. “Full Resonant Transmission of Semiguided Planar Waves Through Slab Waveguide Steps at Oblique Incidence.” Journal of Lightwave Technology 34, no. 3 (2015): 997–1005. https://doi.org/10.1109/jlt.2015.2502431.' ieee: M. Hammer, A. Hildebrandt, and J. Förstner, “Full Resonant Transmission of Semiguided Planar Waves Through Slab Waveguide Steps at Oblique Incidence,” Journal of Lightwave Technology, vol. 34, no. 3, pp. 997–1005, 2015. mla: Hammer, Manfred, et al. “Full Resonant Transmission of Semiguided Planar Waves Through Slab Waveguide Steps at Oblique Incidence.” Journal of Lightwave Technology, vol. 34, no. 3, Institute of Electrical and Electronics Engineers (IEEE), 2015, pp. 997–1005, doi:10.1109/jlt.2015.2502431. short: M. Hammer, A. Hildebrandt, J. Förstner, Journal of Lightwave Technology 34 (2015) 997–1005. date_created: 2018-08-08T10:34:34Z date_updated: 2022-01-06T06:59:44Z ddc: - '530' department: - _id: '61' doi: 10.1109/jlt.2015.2502431 file: - access_level: local content_type: application/pdf creator: hclaudia date_created: 2018-08-08T10:37:19Z date_updated: 2018-09-03T14:43:26Z file_id: '3848' file_name: 2016 Hammer,Hildebrandt,Förstner_Full resonant transmission of semi-guided planar waves.pdf file_size: 606723 relation: main_file file_date_updated: 2018-09-03T14:43:26Z has_accepted_license: '1' intvolume: ' 34' issue: '3' keyword: - tet_topic_waveguide language: - iso: eng page: 997-1005 publication: Journal of Lightwave Technology publication_identifier: issn: - 0733-8724 - 1558-2213 publication_status: published publisher: Institute of Electrical and Electronics Engineers (IEEE) status: public title: Full Resonant Transmission of Semiguided Planar Waves Through Slab Waveguide Steps at Oblique Incidence type: journal_article user_id: '158' volume: 34 year: '2015' ... --- _id: '3879' author: - first_name: Henning full_name: Wachsmuth, Henning id: '3900' last_name: Wachsmuth citation: ama: Wachsmuth H. Text Analysis Pipelines - Towards Ad-Hoc Large-Scale Text Mining.; 2015. doi:http://dx.doi.org/10.1007/978-3-319-25741-9 apa: Wachsmuth, H. (2015). Text Analysis Pipelines - Towards Ad-hoc Large-scale Text Mining. http://dx.doi.org/10.1007/978-3-319-25741-9 bibtex: '@book{Wachsmuth_2015, series={Lecture Notes in Computer Science}, title={Text Analysis Pipelines - Towards Ad-hoc Large-scale Text Mining}, DOI={http://dx.doi.org/10.1007/978-3-319-25741-9}, author={Wachsmuth, Henning}, year={2015}, collection={Lecture Notes in Computer Science} }' chicago: Wachsmuth, Henning. Text Analysis Pipelines - Towards Ad-Hoc Large-Scale Text Mining. Lecture Notes in Computer Science, 2015. http://dx.doi.org/10.1007/978-3-319-25741-9. ieee: H. Wachsmuth, Text Analysis Pipelines - Towards Ad-hoc Large-scale Text Mining. 2015. mla: Wachsmuth, Henning. Text Analysis Pipelines - Towards Ad-Hoc Large-Scale Text Mining. 2015, doi:http://dx.doi.org/10.1007/978-3-319-25741-9. short: H. Wachsmuth, Text Analysis Pipelines - Towards Ad-Hoc Large-Scale Text Mining, 2015. date_created: 2018-08-11T16:15:08Z date_updated: 2022-01-06T06:59:47Z department: - _id: '600' doi: http://dx.doi.org/10.1007/978-3-319-25741-9 language: - iso: eng publication_identifier: isbn: - 978-3-319-25740-2 series_title: Lecture Notes in Computer Science status: public title: Text Analysis Pipelines - Towards Ad-hoc Large-scale Text Mining type: book user_id: '82920' year: '2015' ... --- _id: '3892' abstract: - lang: eng text: Plasmon modes of the exact same individual gold nanoprisms are investigated through combined nanometer-resolved electron energy-loss spectroscopy (EELS) and cathodoluminescence (CL) measurements. We show that CL only probes the radiative modes, in contrast to EELS, which additionally reveals dark modes. The combination of both techniques on the same particles thus provides complementary information and also demonstrates that although the radiative modes give rise to very similar spatial distributions when probed by EELS or CL, their resonant energies appear to be different. We trace this phenomenon back to plasmon dissipation, which affects in different ways the plasmon signatures probed by these techniques. Our experiments are in agreement with electromagnetic numerical simulations and can be further interpreted within the framework of a quasistatic analytical model. We therefore demonstrate that CL and EELS are closely related to optical scattering and extinction, respectively, with the addition of nanometer spatial resolution. article_type: original author: - first_name: Arthur full_name: Losquin, Arthur last_name: Losquin - first_name: Luiz F. full_name: Zagonel, Luiz F. last_name: Zagonel - first_name: Viktor full_name: Myroshnychenko, Viktor id: '46371' last_name: Myroshnychenko - first_name: Benito full_name: Rodríguez-González, Benito last_name: Rodríguez-González - first_name: Marcel full_name: Tencé, Marcel last_name: Tencé - first_name: Leonardo full_name: Scarabelli, Leonardo last_name: Scarabelli - first_name: Jens full_name: Förstner, Jens id: '158' last_name: Förstner orcid: 0000-0001-7059-9862 - first_name: Luis M. full_name: Liz-Marzán, Luis M. last_name: Liz-Marzán - first_name: F. Javier full_name: García de Abajo, F. Javier last_name: García de Abajo - first_name: Odile full_name: Stéphan, Odile last_name: Stéphan - first_name: Mathieu full_name: Kociak, Mathieu last_name: Kociak citation: ama: Losquin A, Zagonel LF, Myroshnychenko V, et al. Unveiling Nanometer Scale Extinction and Scattering Phenomena through Combined Electron Energy Loss Spectroscopy and Cathodoluminescence Measurements. Nano Letters. 2015;15(2):1229-1237. doi:10.1021/nl5043775 apa: Losquin, A., Zagonel, L. F., Myroshnychenko, V., Rodríguez-González, B., Tencé, M., Scarabelli, L., … Kociak, M. (2015). Unveiling Nanometer Scale Extinction and Scattering Phenomena through Combined Electron Energy Loss Spectroscopy and Cathodoluminescence Measurements. Nano Letters, 15(2), 1229–1237. https://doi.org/10.1021/nl5043775 bibtex: '@article{Losquin_Zagonel_Myroshnychenko_Rodríguez-González_Tencé_Scarabelli_Förstner_Liz-Marzán_García de Abajo_Stéphan_et al._2015, title={Unveiling Nanometer Scale Extinction and Scattering Phenomena through Combined Electron Energy Loss Spectroscopy and Cathodoluminescence Measurements}, volume={15}, DOI={10.1021/nl5043775}, number={2}, journal={Nano Letters}, publisher={American Chemical Society (ACS)}, author={Losquin, Arthur and Zagonel, Luiz F. and Myroshnychenko, Viktor and Rodríguez-González, Benito and Tencé, Marcel and Scarabelli, Leonardo and Förstner, Jens and Liz-Marzán, Luis M. and García de Abajo, F. Javier and Stéphan, Odile and et al.}, year={2015}, pages={1229–1237} }' chicago: 'Losquin, Arthur, Luiz F. Zagonel, Viktor Myroshnychenko, Benito Rodríguez-González, Marcel Tencé, Leonardo Scarabelli, Jens Förstner, et al. “Unveiling Nanometer Scale Extinction and Scattering Phenomena through Combined Electron Energy Loss Spectroscopy and Cathodoluminescence Measurements.” Nano Letters 15, no. 2 (2015): 1229–37. https://doi.org/10.1021/nl5043775.' ieee: A. Losquin et al., “Unveiling Nanometer Scale Extinction and Scattering Phenomena through Combined Electron Energy Loss Spectroscopy and Cathodoluminescence Measurements,” Nano Letters, vol. 15, no. 2, pp. 1229–1237, 2015. mla: Losquin, Arthur, et al. “Unveiling Nanometer Scale Extinction and Scattering Phenomena through Combined Electron Energy Loss Spectroscopy and Cathodoluminescence Measurements.” Nano Letters, vol. 15, no. 2, American Chemical Society (ACS), 2015, pp. 1229–37, doi:10.1021/nl5043775. short: A. Losquin, L.F. Zagonel, V. Myroshnychenko, B. Rodríguez-González, M. Tencé, L. Scarabelli, J. Förstner, L.M. Liz-Marzán, F.J. García de Abajo, O. Stéphan, M. Kociak, Nano Letters 15 (2015) 1229–1237. date_created: 2018-08-13T09:32:56Z date_updated: 2022-01-06T06:59:50Z ddc: - '530' department: - _id: '61' doi: 10.1021/nl5043775 file: - access_level: open_access content_type: application/pdf creator: hclaudia date_created: 2018-08-13T09:35:36Z date_updated: 2018-09-04T20:06:07Z file_id: '3893' file_name: 2015-01 Losquin et al_Unveiling Nanometer Scale Extinction and Scattering Phenomena through Combined Electron Energy Loss Spectroscopy and Cathodoluminescence MeasurementsNanoletters_EELS and CL .pdf file_size: 521343 relation: main_file file_date_updated: 2018-09-04T20:06:07Z has_accepted_license: '1' intvolume: ' 15' issue: '2' keyword: - tet_topic_plasmonics language: - iso: eng oa: '1' page: 1229-1237 publication: Nano Letters publication_identifier: issn: - 1530-6984 - 1530-6992 publication_status: published publisher: American Chemical Society (ACS) status: public title: Unveiling Nanometer Scale Extinction and Scattering Phenomena through Combined Electron Energy Loss Spectroscopy and Cathodoluminescence Measurements type: journal_article urn: '38927' user_id: '158' volume: 15 year: '2015' ... --- _id: '3894' abstract: - lang: eng text: "We show how to optically connect guiding layers at different elevations in a 3-D integrated photonic circuit. Transfer of\r\noptical power carried by planar, semi-guided waves is possible without reflections or radiation losses, and over large\r\nvertical distances. This functionality is realized through simple step-like folds of high-contrast dielectric slab waveguides, in combination with oblique wave incidence, and fulfilling a resonance condition. Radiation losses vanish, and polarization conversion is suppressed for TE wave incidence beyond certain critical angles. This can be understood by fundamental arguments resting on a version of Snell’s law. The two 90° corners of a step act as identical partial reflectors in a Fabry–Perot-like resonator setup. By selecting the step height, i.e., the distance between the reflectors, one realizes resonant states with full transmission. Rigorous quasi-analytical simulations\r\nfor typical silicon/silica parameters demonstrate the functioning. Combinations of several step junctions can lead\r\nto other types of optical on-chip connects, e.g., U-turn- or bridge-like configurations." article_type: original author: - first_name: Manfred full_name: Hammer, Manfred id: '48077' last_name: Hammer orcid: 0000-0002-6331-9348 - first_name: Andre full_name: Hildebrandt, Andre last_name: Hildebrandt - first_name: Jens full_name: Förstner, Jens id: '158' last_name: Förstner orcid: 0000-0001-7059-9862 citation: ama: Hammer M, Hildebrandt A, Förstner J. How planar optical waves can be made to climb dielectric steps. Optics Letters. 2015;40(16):3711-3714. doi:10.1364/ol.40.003711 apa: Hammer, M., Hildebrandt, A., & Förstner, J. (2015). How planar optical waves can be made to climb dielectric steps. Optics Letters, 40(16), 3711–3714. https://doi.org/10.1364/ol.40.003711 bibtex: '@article{Hammer_Hildebrandt_Förstner_2015, title={How planar optical waves can be made to climb dielectric steps}, volume={40}, DOI={10.1364/ol.40.003711}, number={16}, journal={Optics Letters}, publisher={The Optical Society}, author={Hammer, Manfred and Hildebrandt, Andre and Förstner, Jens}, year={2015}, pages={3711–3714} }' chicago: 'Hammer, Manfred, Andre Hildebrandt, and Jens Förstner. “How Planar Optical Waves Can Be Made to Climb Dielectric Steps.” Optics Letters 40, no. 16 (2015): 3711–14. https://doi.org/10.1364/ol.40.003711.' ieee: M. Hammer, A. Hildebrandt, and J. Förstner, “How planar optical waves can be made to climb dielectric steps,” Optics Letters, vol. 40, no. 16, pp. 3711–3714, 2015. mla: Hammer, Manfred, et al. “How Planar Optical Waves Can Be Made to Climb Dielectric Steps.” Optics Letters, vol. 40, no. 16, The Optical Society, 2015, pp. 3711–14, doi:10.1364/ol.40.003711. short: M. Hammer, A. Hildebrandt, J. Förstner, Optics Letters 40 (2015) 3711–3714. date_created: 2018-08-13T09:39:06Z date_updated: 2022-01-06T06:59:51Z ddc: - '530' department: - _id: '61' doi: 10.1364/ol.40.003711 file: - access_level: open_access content_type: application/pdf creator: hclaudia date_created: 2018-08-13T09:41:32Z date_updated: 2018-09-04T19:35:48Z file_id: '3895' file_name: 2015-07 Hammer,Hildebrandt,Förstner_How planar optical waves can be made to climb dielectric steps_Optics Letter.pdf file_size: 1504149 relation: main_file file_date_updated: 2018-09-04T19:35:48Z has_accepted_license: '1' intvolume: ' 40' issue: '16' keyword: - tet_topic_waveguide language: - iso: eng oa: '1' page: 3711-3714 publication: Optics Letters publication_identifier: issn: - 0146-9592 - 1539-4794 publication_status: published publisher: The Optical Society status: public title: How planar optical waves can be made to climb dielectric steps type: journal_article urn: '38942' user_id: '158' volume: 40 year: '2015' ... --- _id: '3896' abstract: - lang: eng text: We study the formation of subwavelength solitons in binary metal-dielectric lattices. We show that the transverse modulation of the lattice constant breaks the fundamental plasmonic band and suppresses the discrete diffraction of surface plasmon waves. New types of plasmonic solitons are found, and their characteristics are analyzed. We also demonstrate the existence of photonic-plasmonic vector solitons and elucidate their propagation properties. article_type: original author: - first_name: Yao full_name: Kou, Yao last_name: Kou - first_name: Jens full_name: Förstner, Jens id: '158' last_name: Förstner orcid: 0000-0001-7059-9862 citation: ama: Kou Y, Förstner J. Subwavelength binary plasmonic solitons. Optics Letters. 2015;40(6):851-854. doi:10.1364/ol.40.000851 apa: Kou, Y., & Förstner, J. (2015). Subwavelength binary plasmonic solitons. Optics Letters, 40(6), 851–854. https://doi.org/10.1364/ol.40.000851 bibtex: '@article{Kou_Förstner_2015, title={Subwavelength binary plasmonic solitons}, volume={40}, DOI={10.1364/ol.40.000851}, number={6}, journal={Optics Letters}, publisher={The Optical Society}, author={Kou, Yao and Förstner, Jens}, year={2015}, pages={851–854} }' chicago: 'Kou, Yao, and Jens Förstner. “Subwavelength Binary Plasmonic Solitons.” Optics Letters 40, no. 6 (2015): 851–54. https://doi.org/10.1364/ol.40.000851.' ieee: Y. Kou and J. Förstner, “Subwavelength binary plasmonic solitons,” Optics Letters, vol. 40, no. 6, pp. 851–854, 2015. mla: Kou, Yao, and Jens Förstner. “Subwavelength Binary Plasmonic Solitons.” Optics Letters, vol. 40, no. 6, The Optical Society, 2015, pp. 851–54, doi:10.1364/ol.40.000851. short: Y. Kou, J. Förstner, Optics Letters 40 (2015) 851–854. date_created: 2018-08-13T10:22:12Z date_updated: 2022-01-06T06:59:52Z ddc: - '530' department: - _id: '61' doi: 10.1364/ol.40.000851 file: - access_level: open_access content_type: application/pdf creator: hclaudia date_created: 2018-08-13T10:23:50Z date_updated: 2018-09-04T19:53:37Z file_id: '3897' file_name: 2015-03 Kou,Förstner_Subwavelength binary plasmonic solitons_Optics letters.pdf file_size: 585088 relation: main_file file_date_updated: 2018-09-04T19:53:37Z has_accepted_license: '1' intvolume: ' 40' issue: '6' keyword: - tet_topic_polariton language: - iso: eng oa: '1' page: 851-854 publication: Optics Letters publication_identifier: issn: - 0146-9592 - 1539-4794 publication_status: published publisher: The Optical Society status: public title: Subwavelength binary plasmonic solitons type: journal_article urn: '38960' user_id: '158' volume: 40 year: '2015' ... --- _id: '3900' abstract: - lang: eng text: The coherent state preparation and control of single quantum systems is an important prerequisite for the implementation of functional quantum devices. Prominent examples for such systems are semiconductor quantum dots, which exhibit a fine structure split single exciton state and a V-type three level structure, given by a common ground state and two distinguishable and separately excitable transitions. In this work we introduce a novel concept for the preparation of a robust inversion by the sequential excitation in a V-type system via distinguishable paths. article_type: original author: - first_name: D. full_name: Mantei, D. last_name: Mantei - first_name: Jens full_name: Förstner, Jens id: '158' last_name: Förstner orcid: 0000-0001-7059-9862 - first_name: S. full_name: Gordon, S. last_name: Gordon - first_name: Y. A. full_name: Leier, Y. A. last_name: Leier - first_name: A. K. full_name: Rai, A. K. last_name: Rai - first_name: Dirk full_name: Reuter, Dirk id: '37763' last_name: Reuter - first_name: A. D. full_name: Wieck, A. D. last_name: Wieck - first_name: Artur full_name: Zrenner, Artur id: '606' last_name: Zrenner orcid: 0000-0002-5190-0944 citation: ama: Mantei D, Förstner J, Gordon S, et al. Robust Population Inversion by Polarization Selective Pulsed Excitation. Scientific Reports. 2015;5(1):10313. doi:10.1038/srep10313 apa: Mantei, D., Förstner, J., Gordon, S., Leier, Y. A., Rai, A. K., Reuter, D., … Zrenner, A. (2015). Robust Population Inversion by Polarization Selective Pulsed Excitation. Scientific Reports, 5(1), 10313. https://doi.org/10.1038/srep10313 bibtex: '@article{Mantei_Förstner_Gordon_Leier_Rai_Reuter_Wieck_Zrenner_2015, title={Robust Population Inversion by Polarization Selective Pulsed Excitation}, volume={5}, DOI={10.1038/srep10313}, number={1}, journal={Scientific Reports}, publisher={Springer Nature}, author={Mantei, D. and Förstner, Jens and Gordon, S. and Leier, Y. A. and Rai, A. K. and Reuter, Dirk and Wieck, A. D. and Zrenner, Artur}, year={2015}, pages={10313} }' chicago: 'Mantei, D., Jens Förstner, S. Gordon, Y. A. Leier, A. K. Rai, Dirk Reuter, A. D. Wieck, and Artur Zrenner. “Robust Population Inversion by Polarization Selective Pulsed Excitation.” Scientific Reports 5, no. 1 (2015): 10313. https://doi.org/10.1038/srep10313.' ieee: D. Mantei et al., “Robust Population Inversion by Polarization Selective Pulsed Excitation,” Scientific Reports, vol. 5, no. 1, p. 10313, 2015. mla: Mantei, D., et al. “Robust Population Inversion by Polarization Selective Pulsed Excitation.” Scientific Reports, vol. 5, no. 1, Springer Nature, 2015, p. 10313, doi:10.1038/srep10313. short: D. Mantei, J. Förstner, S. Gordon, Y.A. Leier, A.K. Rai, D. Reuter, A.D. Wieck, A. Zrenner, Scientific Reports 5 (2015) 10313. date_created: 2018-08-13T10:34:17Z date_updated: 2022-01-06T06:59:53Z ddc: - '530' department: - _id: '61' - _id: '15' - _id: '292' - _id: '290' doi: 10.1038/srep10313 file: - access_level: open_access content_type: application/pdf creator: hclaudia date_created: 2018-08-13T10:39:14Z date_updated: 2018-08-21T11:37:12Z file_id: '3901' file_name: 2015-05 Mantei,Förstner,Gordon,Leier,Rai,Reuter,Wieck,Zrenner_Robust Population Inversion by Polarization Selective Pulsed Excitation.pdf file_size: 1089911 relation: main_file file_date_updated: 2018-08-21T11:37:12Z has_accepted_license: '1' intvolume: ' 5' issue: '1' keyword: - tet_topic_qd language: - iso: eng oa: '1' page: '10313' publication: Scientific Reports publication_identifier: issn: - 2045-2322 publication_status: published publisher: Springer Nature status: public title: Robust Population Inversion by Polarization Selective Pulsed Excitation type: journal_article urn: '39004' user_id: '55706' volume: 5 year: '2015' ... --- _id: '290' abstract: - lang: eng text: 'Model transformation is a key concept in model-driven software engineering. The definition of model transformations is usually based on meta-models describing the abstract syntax of languages. While meta-models are thereby able to abstract from uperfluous details of concrete syntax, they often loose structural information inherent in languages, like information on model elements always occurring together in particular shapes. As a consequence, model transformations cannot naturally re-use language structures, thus leading to unnecessary complexity in their development as well as in quality assurance.In this paper, we propose a new approach to model transformation development which allows to simplify the developed transformations and improve their quality via the exploitation of the languages׳ structures. The approach is based on context-free graph grammars and transformations defined by pairing productions of source and target grammars. We show that such transformations have important properties: they terminate and are sound, complete, and deterministic.' author: - first_name: Galina full_name: Besova, Galina last_name: Besova - first_name: Dominik full_name: Steenken, Dominik last_name: Steenken - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Besova G, Steenken D, Wehrheim H. Grammar-based model transformations: Definition, execution, and quality properties. Computer Languages, Systems & Structures. 2015:116-138. doi:10.1016/j.cl.2015.05.003' apa: 'Besova, G., Steenken, D., & Wehrheim, H. (2015). Grammar-based model transformations: Definition, execution, and quality properties. Computer Languages, Systems & Structures, 116–138. https://doi.org/10.1016/j.cl.2015.05.003' bibtex: '@article{Besova_Steenken_Wehrheim_2015, title={Grammar-based model transformations: Definition, execution, and quality properties}, DOI={10.1016/j.cl.2015.05.003}, journal={Computer Languages, Systems & Structures}, publisher={Elsevier}, author={Besova, Galina and Steenken, Dominik and Wehrheim, Heike}, year={2015}, pages={116–138} }' chicago: 'Besova, Galina, Dominik Steenken, and Heike Wehrheim. “Grammar-Based Model Transformations: Definition, Execution, and Quality Properties.” Computer Languages, Systems & Structures, 2015, 116–38. https://doi.org/10.1016/j.cl.2015.05.003.' ieee: 'G. Besova, D. Steenken, and H. Wehrheim, “Grammar-based model transformations: Definition, execution, and quality properties,” Computer Languages, Systems & Structures, pp. 116–138, 2015.' mla: 'Besova, Galina, et al. “Grammar-Based Model Transformations: Definition, Execution, and Quality Properties.” Computer Languages, Systems & Structures, Elsevier, 2015, pp. 116–38, doi:10.1016/j.cl.2015.05.003.' short: G. Besova, D. Steenken, H. Wehrheim, Computer Languages, Systems & Structures (2015) 116–138. date_created: 2017-10-17T12:41:48Z date_updated: 2022-01-06T06:58:43Z ddc: - '040' department: - _id: '77' doi: 10.1016/j.cl.2015.05.003 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:22:03Z date_updated: 2018-03-21T09:22:03Z file_id: '1464' file_name: 290-BSW15-main.pdf file_size: 1329478 relation: main_file success: 1 file_date_updated: 2018-03-21T09:22:03Z has_accepted_license: '1' language: - iso: eng page: 116-138 project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '3' name: SFB 901 - Project Area B publication: Computer Languages, Systems & Structures publisher: Elsevier status: public title: 'Grammar-based model transformations: Definition, execution, and quality properties' type: journal_article user_id: '477' year: '2015' ... --- _id: '2921' author: - first_name: Olivier full_name: Blazy, Olivier last_name: Blazy - first_name: Saqib full_name: Kakvi, Saqib id: '66268' last_name: Kakvi - first_name: Eike full_name: Kiltz, Eike last_name: Kiltz - first_name: Jiaxin full_name: Pan, Jiaxin last_name: Pan citation: ama: 'Blazy O, Kakvi S, Kiltz E, Pan J. Tightly-Secure Signatures from Chameleon Hash Functions. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2015:256-279. doi:10.1007/978-3-662-46447-2_12' apa: 'Blazy, O., Kakvi, S., Kiltz, E., & Pan, J. (2015). Tightly-Secure Signatures from Chameleon Hash Functions. In Lecture Notes in Computer Science (pp. 256–279). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-46447-2_12' bibtex: '@inbook{Blazy_Kakvi_Kiltz_Pan_2015, place={Berlin, Heidelberg}, title={Tightly-Secure Signatures from Chameleon Hash Functions}, DOI={10.1007/978-3-662-46447-2_12}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Blazy, Olivier and Kakvi, Saqib and Kiltz, Eike and Pan, Jiaxin}, year={2015}, pages={256–279} }' chicago: 'Blazy, Olivier, Saqib Kakvi, Eike Kiltz, and Jiaxin Pan. “Tightly-Secure Signatures from Chameleon Hash Functions.” In Lecture Notes in Computer Science, 256–79. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. https://doi.org/10.1007/978-3-662-46447-2_12.' ieee: 'O. Blazy, S. Kakvi, E. Kiltz, and J. Pan, “Tightly-Secure Signatures from Chameleon Hash Functions,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2015, pp. 256–279.' mla: Blazy, Olivier, et al. “Tightly-Secure Signatures from Chameleon Hash Functions.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2015, pp. 256–79, doi:10.1007/978-3-662-46447-2_12. short: 'O. Blazy, S. Kakvi, E. Kiltz, J. Pan, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2015, pp. 256–279.' date_created: 2018-05-25T12:46:08Z date_updated: 2022-01-06T06:58:47Z department: - _id: '558' doi: 10.1007/978-3-662-46447-2_12 extern: '1' main_file_link: - open_access: '1' url: https://eprint.iacr.org/2014/1021.pdf oa: '1' page: 256-279 place: Berlin, Heidelberg publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783662464465' - '9783662464472' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Berlin Heidelberg status: public title: Tightly-Secure Signatures from Chameleon Hash Functions type: book_chapter user_id: '66268' year: '2015' ... --- _id: '297' author: - first_name: Martin full_name: Sosniak, Martin last_name: Sosniak citation: ama: Sosniak M. Evaluation of Pairing Optimization for Embedded Platforms. Universität Paderborn; 2015. apa: Sosniak, M. (2015). Evaluation of Pairing Optimization for Embedded Platforms. Universität Paderborn. bibtex: '@book{Sosniak_2015, title={Evaluation of Pairing Optimization for Embedded Platforms}, publisher={Universität Paderborn}, author={Sosniak, Martin}, year={2015} }' chicago: Sosniak, Martin. Evaluation of Pairing Optimization for Embedded Platforms. Universität Paderborn, 2015. ieee: M. Sosniak, Evaluation of Pairing Optimization for Embedded Platforms. Universität Paderborn, 2015. mla: Sosniak, Martin. Evaluation of Pairing Optimization for Embedded Platforms. Universität Paderborn, 2015. short: M. Sosniak, Evaluation of Pairing Optimization for Embedded Platforms, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:50Z date_updated: 2022-01-06T06:58:49Z department: - _id: '64' project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C - _id: '43' name: Securing the Financial Cloud publisher: Universität Paderborn status: public supervisor: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer title: Evaluation of Pairing Optimization for Embedded Platforms type: mastersthesis user_id: '25078' year: '2015' ... --- _id: '299' author: - first_name: Britta full_name: Gerken, Britta last_name: Gerken citation: ama: Gerken B. Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie. Universität Paderborn; 2015. apa: Gerken, B. (2015). Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie. Universität Paderborn. bibtex: '@book{Gerken_2015, title={Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie}, publisher={Universität Paderborn}, author={Gerken, Britta}, year={2015} }' chicago: Gerken, Britta. Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie. Universität Paderborn, 2015. ieee: B. Gerken, Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie. Universität Paderborn, 2015. mla: Gerken, Britta. Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie. Universität Paderborn, 2015. short: B. Gerken, Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:50Z date_updated: 2022-01-06T06:58:50Z department: - _id: '64' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C - _id: '43' name: Securing the Financial Cloud publisher: Universität Paderborn status: public supervisor: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer title: Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie type: mastersthesis user_id: '477' year: '2015' ... --- _id: '301' author: - first_name: Jan full_name: Bobolz, Jan id: '27207' last_name: Bobolz citation: ama: Bobolz J. Efficient Verifier-Local Revocation for Anonymous Credentials. Universität Paderborn; 2015. apa: Bobolz, J. (2015). Efficient Verifier-Local Revocation for Anonymous Credentials. Universität Paderborn. bibtex: '@book{Bobolz_2015, title={Efficient Verifier-Local Revocation for Anonymous Credentials}, publisher={Universität Paderborn}, author={Bobolz, Jan}, year={2015} }' chicago: Bobolz, Jan. Efficient Verifier-Local Revocation for Anonymous Credentials. Universität Paderborn, 2015. ieee: J. Bobolz, Efficient Verifier-Local Revocation for Anonymous Credentials. Universität Paderborn, 2015. mla: Bobolz, Jan. Efficient Verifier-Local Revocation for Anonymous Credentials. Universität Paderborn, 2015. short: J. Bobolz, Efficient Verifier-Local Revocation for Anonymous Credentials, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:50Z date_updated: 2022-01-06T06:58:51Z ddc: - '040' department: - _id: '64' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-03-20T07:47:11Z date_updated: 2018-07-20T09:54:22Z file_id: '1443' file_name: 301-thesis_jbobolz_final_02.pdf file_size: 1214027 relation: main_file file_date_updated: 2018-07-20T09:54:22Z has_accepted_license: '1' oa: '1' project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public supervisor: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer title: Efficient Verifier-Local Revocation for Anonymous Credentials type: mastersthesis urn: '3016' user_id: '27207' year: '2015' ... --- _id: '302' author: - first_name: Christian full_name: Stroh, Christian last_name: Stroh citation: ama: Stroh C. Efficient Attributes for Pairing-Based Anonymous Credentials. Universität Paderborn; 2015. apa: Stroh, C. (2015). Efficient Attributes for Pairing-Based Anonymous Credentials. Universität Paderborn. bibtex: '@book{Stroh_2015, title={Efficient Attributes for Pairing-Based Anonymous Credentials}, publisher={Universität Paderborn}, author={Stroh, Christian}, year={2015} }' chicago: Stroh, Christian. Efficient Attributes for Pairing-Based Anonymous Credentials. Universität Paderborn, 2015. ieee: C. Stroh, Efficient Attributes for Pairing-Based Anonymous Credentials. Universität Paderborn, 2015. mla: Stroh, Christian. Efficient Attributes for Pairing-Based Anonymous Credentials. Universität Paderborn, 2015. short: C. Stroh, Efficient Attributes for Pairing-Based Anonymous Credentials, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:50Z date_updated: 2022-01-06T06:58:51Z department: - _id: '64' project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public supervisor: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer title: Efficient Attributes for Pairing-Based Anonymous Credentials type: mastersthesis user_id: '477' year: '2015' ... --- _id: '304' author: - first_name: Andreas full_name: Koutsopoulos, Andreas last_name: Koutsopoulos citation: ama: Koutsopoulos A. Dynamics and Efficiency in Topological Self-Stabilization. Universität Paderborn; 2015. apa: Koutsopoulos, A. (2015). Dynamics and Efficiency in Topological Self-Stabilization. Universität Paderborn. bibtex: '@book{Koutsopoulos_2015, title={Dynamics and Efficiency in Topological Self-Stabilization}, publisher={Universität Paderborn}, author={Koutsopoulos, Andreas}, year={2015} }' chicago: Koutsopoulos, Andreas. Dynamics and Efficiency in Topological Self-Stabilization. Universität Paderborn, 2015. ieee: A. Koutsopoulos, Dynamics and Efficiency in Topological Self-Stabilization. Universität Paderborn, 2015. mla: Koutsopoulos, Andreas. Dynamics and Efficiency in Topological Self-Stabilization. Universität Paderborn, 2015. short: A. Koutsopoulos, Dynamics and Efficiency in Topological Self-Stabilization, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:51Z date_updated: 2022-01-06T06:58:53Z ddc: - '040' department: - _id: '79' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-20T07:46:19Z date_updated: 2018-03-20T07:46:19Z file_id: '1441' file_name: 304-Dissertation_-_Koutsopoulos.pdf file_size: 2275834 relation: main_file success: 1 file_date_updated: 2018-03-20T07:46:19Z has_accepted_license: '1' project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subproject A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Dynamics and Efficiency in Topological Self-Stabilization type: dissertation user_id: '15504' year: '2015' ... --- _id: '305' author: - first_name: Sebastian full_name: Kniesburges, Sebastian last_name: Kniesburges citation: ama: Kniesburges S. Distributed Data Structures and the Power of Topological Self-Stabilization. Universität Paderborn; 2015. apa: Kniesburges, S. (2015). Distributed Data Structures and the Power of topological Self-Stabilization. Universität Paderborn. bibtex: '@book{Kniesburges_2015, title={Distributed Data Structures and the Power of topological Self-Stabilization}, publisher={Universität Paderborn}, author={Kniesburges, Sebastian}, year={2015} }' chicago: Kniesburges, Sebastian. Distributed Data Structures and the Power of Topological Self-Stabilization. Universität Paderborn, 2015. ieee: S. Kniesburges, Distributed Data Structures and the Power of topological Self-Stabilization. Universität Paderborn, 2015. mla: Kniesburges, Sebastian. Distributed Data Structures and the Power of Topological Self-Stabilization. Universität Paderborn, 2015. short: S. Kniesburges, Distributed Data Structures and the Power of Topological Self-Stabilization, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:51Z date_updated: 2022-01-06T06:58:54Z ddc: - '040' department: - _id: '79' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-13T09:14:43Z date_updated: 2018-03-13T09:14:43Z file_id: '1206' file_name: 305-Dissertation_-_Kniesburges.pdf file_size: 1709094 relation: main_file success: 1 file_date_updated: 2018-03-13T09:14:43Z has_accepted_license: '1' project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '4' name: SFB 901 - Project Area C - _id: '5' name: SFB 901 - Subproject A1 - _id: '13' name: SFB 901 - Subproject C1 publisher: Universität Paderborn status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Distributed Data Structures and the Power of topological Self-Stabilization type: dissertation user_id: '15504' year: '2015' ... --- _id: '312' author: - first_name: Patrick full_name: Schleiter, Patrick last_name: Schleiter citation: ama: Schleiter P. Constructions of Fully Secure Predicate Encryption Schemes. Universität Paderborn; 2015. apa: Schleiter, P. (2015). Constructions of Fully Secure Predicate Encryption Schemes. Universität Paderborn. bibtex: '@book{Schleiter_2015, title={Constructions of Fully Secure Predicate Encryption Schemes}, publisher={Universität Paderborn}, author={Schleiter, Patrick}, year={2015} }' chicago: Schleiter, Patrick. Constructions of Fully Secure Predicate Encryption Schemes. Universität Paderborn, 2015. ieee: P. Schleiter, Constructions of Fully Secure Predicate Encryption Schemes. Universität Paderborn, 2015. mla: Schleiter, Patrick. Constructions of Fully Secure Predicate Encryption Schemes. Universität Paderborn, 2015. short: P. Schleiter, Constructions of Fully Secure Predicate Encryption Schemes, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:52Z date_updated: 2022-01-06T06:58:57Z ddc: - '040' department: - _id: '64' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-20T07:44:55Z date_updated: 2018-03-20T07:44:55Z file_id: '1439' file_name: 312-MA_2015_Schleiter_Constructions_of_fully_secure_PE_schemes_01.pdf file_size: 721996 relation: main_file success: 1 file_date_updated: 2018-03-20T07:44:55Z has_accepted_license: '1' project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public supervisor: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer title: Constructions of Fully Secure Predicate Encryption Schemes type: mastersthesis user_id: '477' year: '2015' ... --- _id: '3120' author: - first_name: Florian full_name: Böhl, Florian last_name: Böhl - first_name: Dennis full_name: Hofheinz, Dennis last_name: Hofheinz - first_name: Tibor full_name: Jager, Tibor id: '64669' last_name: Jager - first_name: Jessica full_name: Koch, Jessica last_name: Koch - first_name: Christoph full_name: Striecks, Christoph last_name: Striecks citation: ama: 'Böhl F, Hofheinz D, Jager T, Koch J, Striecks C. Confined Guessing: New Signatures From Standard Assumptions. J Cryptology. 2015;(1):176--208. doi:10.1007/s00145-014-9183-z' apa: 'Böhl, F., Hofheinz, D., Jager, T., Koch, J., & Striecks, C. (2015). Confined Guessing: New Signatures From Standard Assumptions. J. Cryptology, (1), 176--208. https://doi.org/10.1007/s00145-014-9183-z' bibtex: '@article{Böhl_Hofheinz_Jager_Koch_Striecks_2015, title={Confined Guessing: New Signatures From Standard Assumptions}, DOI={10.1007/s00145-014-9183-z}, number={1}, journal={J. Cryptology}, author={Böhl, Florian and Hofheinz, Dennis and Jager, Tibor and Koch, Jessica and Striecks, Christoph}, year={2015}, pages={176--208} }' chicago: 'Böhl, Florian, Dennis Hofheinz, Tibor Jager, Jessica Koch, and Christoph Striecks. “Confined Guessing: New Signatures From Standard Assumptions.” J. Cryptology, no. 1 (2015): 176--208. https://doi.org/10.1007/s00145-014-9183-z.' ieee: 'F. Böhl, D. Hofheinz, T. Jager, J. Koch, and C. Striecks, “Confined Guessing: New Signatures From Standard Assumptions,” J. Cryptology, no. 1, pp. 176--208, 2015.' mla: 'Böhl, Florian, et al. “Confined Guessing: New Signatures From Standard Assumptions.” J. Cryptology, no. 1, 2015, pp. 176--208, doi:10.1007/s00145-014-9183-z.' short: F. Böhl, D. Hofheinz, T. Jager, J. Koch, C. Striecks, J. Cryptology (2015) 176--208. date_created: 2018-06-07T09:17:17Z date_updated: 2022-01-06T06:58:57Z department: - _id: '558' doi: 10.1007/s00145-014-9183-z extern: '1' issue: '1' page: 176--208 publication: J. Cryptology status: public title: 'Confined Guessing: New Signatures From Standard Assumptions' type: journal_article user_id: '38235' year: '2015' ... --- _id: '3121' author: - first_name: Tibor full_name: Jager, Tibor id: '64669' last_name: Jager - first_name: Jörg full_name: Schwenk, Jörg last_name: Schwenk - first_name: Juraj full_name: Somorovsky, Juraj last_name: Somorovsky citation: ama: 'Jager T, Schwenk J, Somorovsky J. On the Security of TLS 1.3 and QUIC Against Weaknesses in PKCS#1 v1.5 Encryption. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12-16, 2015. ; 2015:1185--1196. doi:10.1145/2810103.2813657' apa: Jager, T., Schwenk, J., & Somorovsky, J. (2015). On the Security of TLS 1.3 and QUIC Against Weaknesses in PKCS#1 v1.5 Encryption. In Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12-16, 2015 (pp. 1185--1196). https://doi.org/10.1145/2810103.2813657 bibtex: '@inproceedings{Jager_Schwenk_Somorovsky_2015, title={On the Security of TLS 1.3 and QUIC Against Weaknesses in PKCS#1 v1.5 Encryption}, DOI={10.1145/2810103.2813657}, booktitle={Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12-16, 2015}, author={Jager, Tibor and Schwenk, Jörg and Somorovsky, Juraj}, year={2015}, pages={1185--1196} }' chicago: Jager, Tibor, Jörg Schwenk, and Juraj Somorovsky. “On the Security of TLS 1.3 and QUIC Against Weaknesses in PKCS#1 v1.5 Encryption.” In Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12-16, 2015, 1185--1196, 2015. https://doi.org/10.1145/2810103.2813657. ieee: T. Jager, J. Schwenk, and J. Somorovsky, “On the Security of TLS 1.3 and QUIC Against Weaknesses in PKCS#1 v1.5 Encryption,” in Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12-16, 2015, 2015, pp. 1185--1196. mla: Jager, Tibor, et al. “On the Security of TLS 1.3 and QUIC Against Weaknesses in PKCS#1 v1.5 Encryption.” Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12-16, 2015, 2015, pp. 1185--1196, doi:10.1145/2810103.2813657. short: 'T. Jager, J. Schwenk, J. Somorovsky, in: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12-16, 2015, 2015, pp. 1185--1196.' date_created: 2018-06-07T09:17:47Z date_updated: 2022-01-06T06:58:57Z department: - _id: '558' doi: 10.1145/2810103.2813657 extern: '1' page: 1185--1196 publication: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12-16, 2015 status: public title: On the Security of TLS 1.3 and QUIC Against Weaknesses in PKCS#1 v1.5 Encryption type: conference user_id: '38235' year: '2015' ... --- _id: '3122' author: - first_name: Tibor full_name: Jager, Tibor id: '64669' last_name: Jager - first_name: Jörg full_name: Schwenk, Jörg last_name: Schwenk - first_name: Juraj full_name: Somorovsky, Juraj last_name: Somorovsky citation: ama: 'Jager T, Schwenk J, Somorovsky J. Practical Invalid Curve Attacks on TLS-ECDH. In: Computer Security - ESORICS 2015 - 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I. ; 2015:407--425. doi:10.1007/978-3-319-24174-6_21' apa: Jager, T., Schwenk, J., & Somorovsky, J. (2015). Practical Invalid Curve Attacks on TLS-ECDH. In Computer Security - ESORICS 2015 - 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I (pp. 407--425). https://doi.org/10.1007/978-3-319-24174-6_21 bibtex: '@inproceedings{Jager_Schwenk_Somorovsky_2015, title={Practical Invalid Curve Attacks on TLS-ECDH}, DOI={10.1007/978-3-319-24174-6_21}, booktitle={Computer Security - ESORICS 2015 - 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I}, author={Jager, Tibor and Schwenk, Jörg and Somorovsky, Juraj}, year={2015}, pages={407--425} }' chicago: Jager, Tibor, Jörg Schwenk, and Juraj Somorovsky. “Practical Invalid Curve Attacks on TLS-ECDH.” In Computer Security - ESORICS 2015 - 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I, 407--425, 2015. https://doi.org/10.1007/978-3-319-24174-6_21. ieee: T. Jager, J. Schwenk, and J. Somorovsky, “Practical Invalid Curve Attacks on TLS-ECDH,” in Computer Security - ESORICS 2015 - 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I, 2015, pp. 407--425. mla: Jager, Tibor, et al. “Practical Invalid Curve Attacks on TLS-ECDH.” Computer Security - ESORICS 2015 - 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I, 2015, pp. 407--425, doi:10.1007/978-3-319-24174-6_21. short: 'T. Jager, J. Schwenk, J. Somorovsky, in: Computer Security - ESORICS 2015 - 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I, 2015, pp. 407--425.' date_created: 2018-06-07T09:18:33Z date_updated: 2022-01-06T06:58:57Z department: - _id: '558' doi: 10.1007/978-3-319-24174-6_21 extern: '1' page: 407--425 publication: Computer Security - ESORICS 2015 - 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I status: public title: Practical Invalid Curve Attacks on TLS-ECDH type: conference user_id: '38235' year: '2015' ... --- _id: '3123' author: - first_name: Felix full_name: Heuer, Felix last_name: Heuer - first_name: Tibor full_name: Jager, Tibor id: '64669' last_name: Jager - first_name: Eike full_name: Kiltz, Eike last_name: Kiltz - first_name: Sven full_name: Schäge, Sven last_name: Schäge citation: ama: 'Heuer F, Jager T, Kiltz E, Schäge S. On the Selective Opening Security of Practical Public-Key Encryption Schemes. In: Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings. ; 2015:27--51. doi:10.1007/978-3-662-46447-2_2' apa: Heuer, F., Jager, T., Kiltz, E., & Schäge, S. (2015). On the Selective Opening Security of Practical Public-Key Encryption Schemes. In Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings (pp. 27--51). https://doi.org/10.1007/978-3-662-46447-2_2 bibtex: '@inproceedings{Heuer_Jager_Kiltz_Schäge_2015, title={On the Selective Opening Security of Practical Public-Key Encryption Schemes}, DOI={10.1007/978-3-662-46447-2_2}, booktitle={Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings}, author={Heuer, Felix and Jager, Tibor and Kiltz, Eike and Schäge, Sven}, year={2015}, pages={27--51} }' chicago: Heuer, Felix, Tibor Jager, Eike Kiltz, and Sven Schäge. “On the Selective Opening Security of Practical Public-Key Encryption Schemes.” In Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings, 27--51, 2015. https://doi.org/10.1007/978-3-662-46447-2_2. ieee: F. Heuer, T. Jager, E. Kiltz, and S. Schäge, “On the Selective Opening Security of Practical Public-Key Encryption Schemes,” in Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings, 2015, pp. 27--51. mla: Heuer, Felix, et al. “On the Selective Opening Security of Practical Public-Key Encryption Schemes.” Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings, 2015, pp. 27--51, doi:10.1007/978-3-662-46447-2_2. short: 'F. Heuer, T. Jager, E. Kiltz, S. Schäge, in: Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings, 2015, pp. 27--51.' date_created: 2018-06-07T09:19:04Z date_updated: 2022-01-06T06:58:57Z department: - _id: '558' doi: 10.1007/978-3-662-46447-2_2 extern: '1' page: 27--51 publication: Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings status: public title: On the Selective Opening Security of Practical Public-Key Encryption Schemes type: conference user_id: '38235' year: '2015' ... --- _id: '3124' author: - first_name: Florian full_name: Bergsma, Florian last_name: Bergsma - first_name: Tibor full_name: Jager, Tibor id: '64669' last_name: Jager - first_name: Jörg full_name: Schwenk, Jörg last_name: Schwenk citation: ama: 'Bergsma F, Jager T, Schwenk J. One-Round Key Exchange with Strong Security: An Efficient and Generic Construction in the Standard Model. In: Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings. ; 2015:477--494. doi:10.1007/978-3-662-46447-2_21' apa: 'Bergsma, F., Jager, T., & Schwenk, J. (2015). One-Round Key Exchange with Strong Security: An Efficient and Generic Construction in the Standard Model. In Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings (pp. 477--494). https://doi.org/10.1007/978-3-662-46447-2_21' bibtex: '@inproceedings{Bergsma_Jager_Schwenk_2015, title={One-Round Key Exchange with Strong Security: An Efficient and Generic Construction in the Standard Model}, DOI={10.1007/978-3-662-46447-2_21}, booktitle={Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings}, author={Bergsma, Florian and Jager, Tibor and Schwenk, Jörg}, year={2015}, pages={477--494} }' chicago: 'Bergsma, Florian, Tibor Jager, and Jörg Schwenk. “One-Round Key Exchange with Strong Security: An Efficient and Generic Construction in the Standard Model.” In Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings, 477--494, 2015. https://doi.org/10.1007/978-3-662-46447-2_21.' ieee: 'F. Bergsma, T. Jager, and J. Schwenk, “One-Round Key Exchange with Strong Security: An Efficient and Generic Construction in the Standard Model,” in Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings, 2015, pp. 477--494.' mla: 'Bergsma, Florian, et al. “One-Round Key Exchange with Strong Security: An Efficient and Generic Construction in the Standard Model.” Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings, 2015, pp. 477--494, doi:10.1007/978-3-662-46447-2_21.' short: 'F. Bergsma, T. Jager, J. Schwenk, in: Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings, 2015, pp. 477--494.' date_created: 2018-06-07T09:19:47Z date_updated: 2022-01-06T06:58:57Z department: - _id: '558' doi: 10.1007/978-3-662-46447-2_21 extern: '1' page: 477--494 publication: Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings status: public title: 'One-Round Key Exchange with Strong Security: An Efficient and Generic Construction in the Standard Model' type: conference user_id: '38235' year: '2015' ... --- _id: '3125' author: - first_name: Tibor full_name: Jager, Tibor id: '64669' last_name: Jager citation: ama: 'Jager T. Verifiable Random Functions from Weaker Assumptions. In: Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {II}. ; 2015:121--143. doi:10.1007/978-3-662-46497-7_5' apa: Jager, T. (2015). Verifiable Random Functions from Weaker Assumptions. In Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {II} (pp. 121--143). https://doi.org/10.1007/978-3-662-46497-7_5 bibtex: '@inproceedings{Jager_2015, title={Verifiable Random Functions from Weaker Assumptions}, DOI={10.1007/978-3-662-46497-7_5}, booktitle={Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {II}}, author={Jager, Tibor}, year={2015}, pages={121--143} }' chicago: Jager, Tibor. “Verifiable Random Functions from Weaker Assumptions.” In Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {II}, 121--143, 2015. https://doi.org/10.1007/978-3-662-46497-7_5. ieee: T. Jager, “Verifiable Random Functions from Weaker Assumptions,” in Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {II}, 2015, pp. 121--143. mla: Jager, Tibor. “Verifiable Random Functions from Weaker Assumptions.” Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {II}, 2015, pp. 121--143, doi:10.1007/978-3-662-46497-7_5. short: 'T. Jager, in: Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {II}, 2015, pp. 121--143.' date_created: 2018-06-07T09:20:19Z date_updated: 2022-01-06T06:58:57Z department: - _id: '558' doi: 10.1007/978-3-662-46497-7_5 extern: '1' page: 121--143 publication: Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {II} status: public title: Verifiable Random Functions from Weaker Assumptions type: conference user_id: '38235' year: '2015' ...