--- _id: '4351' abstract: - lang: eng text: "\tWe extend the concept of monotonic searchability~\\cite{DBLP:conf/opodis/ScheidelerSS15}~\\cite{DBLP:conf/wdag/ScheidelerSS16} for self-stabilizing systems from one to multiple dimensions.\r\n\tA system is self-stabilizing if it can recover to a legitimate state from any initial illegal state.\r\n\tThese kind of systems are most often used in distributed applications.\r\n\tMonotonic searchability provides guarantees when searching for nodes while the recovery process is going on.\r\n\tMore precisely, if a search request started at some node $u$ succeeds in reaching its destination $v$, then all future search requests from $u$ to $v$ succeed as well.\r\n\tAlthough there already exists a self-stabilizing protocol for a two-dimensional topology~\\cite{DBLP:journals/tcs/JacobRSS12} and an universal approach for monotonic searchability~\\cite{DBLP:conf/wdag/ScheidelerSS16}, it is not clear how both of these concepts fit together effectively.\r\n\tThe latter concept even comes with some restrictive assumptions on messages, which is not the case for our protocol.\r\n\tWe propose a simple novel protocol for a self-stabilizing two-dimensional quadtree that satisfies monotonic searchability.\r\n\tOur protocol can easily be extended to higher dimensions and offers routing in $\\mathcal O(\\log n)$ hops for any search request.\r\n" author: - first_name: Michael full_name: Feldmann, Michael id: '23538' last_name: Feldmann - first_name: Christina full_name: Kolb, Christina id: '43647' last_name: Kolb - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Feldmann M, Kolb C, Scheideler C. Self-stabilizing Overlays for high-dimensional Monotonic Searchability. In: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Vol 11201. Lecture Notes in Computer Science. Springer, Cham; 2018:16-31. doi:10.1007/978-3-030-03232-6_2' apa: Feldmann, M., Kolb, C., & Scheideler, C. (2018). Self-stabilizing Overlays for high-dimensional Monotonic Searchability. In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 11201, pp. 16–31). Springer, Cham. https://doi.org/10.1007/978-3-030-03232-6_2 bibtex: '@inproceedings{Feldmann_Kolb_Scheideler_2018, series={Lecture Notes in Computer Science}, title={Self-stabilizing Overlays for high-dimensional Monotonic Searchability}, volume={11201}, DOI={10.1007/978-3-030-03232-6_2}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann, Michael and Kolb, Christina and Scheideler, Christian}, year={2018}, pages={16–31}, collection={Lecture Notes in Computer Science} }' chicago: Feldmann, Michael, Christina Kolb, and Christian Scheideler. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.” In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 11201:16–31. Lecture Notes in Computer Science. Springer, Cham, 2018. https://doi.org/10.1007/978-3-030-03232-6_2. ieee: M. Feldmann, C. Kolb, and C. Scheideler, “Self-stabilizing Overlays for high-dimensional Monotonic Searchability,” in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2018, vol. 11201, pp. 16–31. mla: Feldmann, Michael, et al. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.” Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), vol. 11201, Springer, Cham, 2018, pp. 16–31, doi:10.1007/978-3-030-03232-6_2. short: 'M. Feldmann, C. Kolb, C. Scheideler, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2018, pp. 16–31.' date_created: 2018-09-04T14:15:39Z date_updated: 2022-01-06T07:00:58Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-030-03232-6_2 external_id: arxiv: - '1808.10300' file: - access_level: closed content_type: application/pdf creator: mfeldma2 date_created: 2018-10-31T13:24:17Z date_updated: 2018-10-31T13:24:17Z file_id: '5210' file_name: Feldmann2018_Chapter_Self-stabilizingOverlaysForHig.pdf file_size: 329823 relation: main_file success: 1 file_date_updated: 2018-10-31T13:24:17Z has_accepted_license: '1' intvolume: ' 11201' language: - iso: eng page: '16-31 ' project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) publication_identifier: unknown: - 978-3-030-03231-9 publisher: Springer, Cham series_title: Lecture Notes in Computer Science status: public title: Self-stabilizing Overlays for high-dimensional Monotonic Searchability type: conference user_id: '23538' volume: 11201 year: '2018' ... --- _id: '4375' abstract: - lang: eng text: "We present a peer-to-peer network that supports the efficient processing of orthogonal range queries $R=\\bigtimes_{i=1}^{d}[a_i,\\,b_i]$ in a $d$-dimensional point space.\\\\\r\nThe network is the same for each dimension, namely a distance halving network like the one introduced by Naor and Wieder (ACM TALG'07).\r\nWe show how to execute such range queries using $\\mathcal{O}\\left(2^{d'}d\\,\\log m + d\\,|R|\\right)$ hops (and the same number of messages) in total. Here $[m]^d$ is the ground set, $|R|$ is the size and $d'$ the dimension of the queried range.\r\nFurthermore, if the peers form a distributed network, the query can be answered in $\\mathcal{O}\\left(d\\,\\log m + d\\,\\sum_{i=1}^{d}(b_i-a_i+1)\\right)$ communication rounds.\r\nOur algorithms are based on a mapping of the Hilbert Curve through $[m]^d$ to the peers." author: - first_name: Markus full_name: Benter, Markus last_name: Benter - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Alexander full_name: Setzer, Alexander id: '11108' last_name: Setzer - first_name: Jannik full_name: Sundermeier, Jannik id: '38705' last_name: Sundermeier citation: ama: 'Benter M, Knollmann T, Meyer auf der Heide F, Setzer A, Sundermeier J. A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). ; 2018. doi:10.1007/978-3-030-19759-9_4' apa: Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., & Sundermeier, J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). Helsinki. https://doi.org/10.1007/978-3-030-19759-9_4 bibtex: '@inproceedings{Benter_Knollmann_Meyer auf der Heide_Setzer_Sundermeier_2018, title={A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension}, DOI={10.1007/978-3-030-19759-9_4}, booktitle={Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)}, author={Benter, Markus and Knollmann, Till and Meyer auf der Heide, Friedhelm and Setzer, Alexander and Sundermeier, Jannik}, year={2018} }' chicago: Benter, Markus, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander Setzer, and Jannik Sundermeier. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” In Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018. https://doi.org/10.1007/978-3-030-19759-9_4. ieee: M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, and J. Sundermeier, “A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension,” in Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), Helsinki, 2018. mla: Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018, doi:10.1007/978-3-030-19759-9_4. short: 'M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, J. Sundermeier, in: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018.' conference: end_date: 2018-08-21 location: Helsinki name: 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD) start_date: 2018-08-20 date_created: 2018-09-11T05:26:59Z date_updated: 2022-01-06T07:01:00Z ddc: - '000' department: - _id: '63' - _id: '79' doi: 10.1007/978-3-030-19759-9_4 file: - access_level: closed content_type: application/pdf creator: tillk date_created: 2018-11-27T10:03:33Z date_updated: 2018-11-27T10:03:33Z file_id: '5863' file_name: A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension.pdf file_size: 1122875 relation: main_file success: 1 file_date_updated: 2018-11-27T10:03:33Z has_accepted_license: '1' keyword: - Distributed Storage - Multi-Dimensional Range Queries - Peer-to-Peer - Hilbert Curve language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD) status: public title: A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension type: conference user_id: '14955' year: '2018' ... --- _id: '4999' author: - first_name: Felix full_name: Pauck, Felix id: '22398' last_name: Pauck - first_name: Eric full_name: Bodden, Eric id: '59256' last_name: Bodden orcid: 0000-0003-3470-3647 - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Pauck F, Bodden E, Wehrheim H. Do Android taint analysis tools keep their promises? In: Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018. ACM Press; 2018. doi:10.1145/3236024.3236029' apa: Pauck, F., Bodden, E., & Wehrheim, H. (2018). Do Android taint analysis tools keep their promises? In Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018. ACM Press. https://doi.org/10.1145/3236024.3236029 bibtex: '@inproceedings{Pauck_Bodden_Wehrheim_2018, title={Do Android taint analysis tools keep their promises?}, DOI={10.1145/3236024.3236029}, booktitle={Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018}, publisher={ACM Press}, author={Pauck, Felix and Bodden, Eric and Wehrheim, Heike}, year={2018} }' chicago: Pauck, Felix, Eric Bodden, and Heike Wehrheim. “Do Android Taint Analysis Tools Keep Their Promises?” In Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018. ACM Press, 2018. https://doi.org/10.1145/3236024.3236029. ieee: F. Pauck, E. Bodden, and H. Wehrheim, “Do Android taint analysis tools keep their promises?,” in Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018, 2018. mla: Pauck, Felix, et al. “Do Android Taint Analysis Tools Keep Their Promises?” Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018, ACM Press, 2018, doi:10.1145/3236024.3236029. short: 'F. Pauck, E. Bodden, H. Wehrheim, in: Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018, ACM Press, 2018.' date_created: 2018-10-30T08:03:17Z date_updated: 2022-01-06T07:01:34Z ddc: - '004' department: - _id: '77' - _id: '76' doi: 10.1145/3236024.3236029 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T13:37:38Z date_updated: 2018-11-02T13:37:38Z file_id: '5251' file_name: fse18main-id76-p.pdf file_size: 524169 relation: main_file success: 1 file_date_updated: 2018-11-02T13:37:38Z has_accepted_license: '1' language: - iso: eng project: - _id: '3' name: SFB 901 - Project Area B - _id: '12' name: SFB 901 - Subproject B4 - _id: '1' name: SFB 901 publication: Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering - ESEC/FSE 2018 publication_identifier: isbn: - '9781450355735' publication_status: published publisher: ACM Press status: public title: Do Android taint analysis tools keep their promises? type: conference user_id: '477' year: '2018' ... --- _id: '5203' author: - first_name: Stefan full_name: Krüger, Stefan last_name: Krüger - first_name: Johannes full_name: Späth, Johannes last_name: Späth - first_name: Karim full_name: Ali, Karim last_name: Ali - first_name: Eric full_name: Bodden, Eric id: '59256' last_name: Bodden orcid: 0000-0003-3470-3647 - first_name: Mira full_name: Mezini, Mira last_name: Mezini citation: ama: 'Krüger S, Späth J, Ali K, Bodden E, Mezini M. CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic APIs. In: European Conference on Object-Oriented Programming (ECOOP). ; 2018:10:1-10:27.' apa: 'Krüger, S., Späth, J., Ali, K., Bodden, E., & Mezini, M. (2018). CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic APIs. In European Conference on Object-Oriented Programming (ECOOP) (pp. 10:1-10:27).' bibtex: '@inproceedings{Krüger_Späth_Ali_Bodden_Mezini_2018, title={CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic APIs}, booktitle={European Conference on Object-Oriented Programming (ECOOP)}, author={Krüger, Stefan and Späth, Johannes and Ali, Karim and Bodden, Eric and Mezini, Mira}, year={2018}, pages={10:1-10:27} }' chicago: 'Krüger, Stefan, Johannes Späth, Karim Ali, Eric Bodden, and Mira Mezini. “CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic APIs.” In European Conference on Object-Oriented Programming (ECOOP), 10:1-10:27, 2018.' ieee: 'S. Krüger, J. Späth, K. Ali, E. Bodden, and M. Mezini, “CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic APIs,” in European Conference on Object-Oriented Programming (ECOOP), 2018, pp. 10:1-10:27.' mla: 'Krüger, Stefan, et al. “CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic APIs.” European Conference on Object-Oriented Programming (ECOOP), 2018, pp. 10:1-10:27.' short: 'S. Krüger, J. Späth, K. Ali, E. Bodden, M. Mezini, in: European Conference on Object-Oriented Programming (ECOOP), 2018, pp. 10:1-10:27.' date_created: 2018-10-31T12:37:29Z date_updated: 2022-01-06T07:01:44Z ddc: - '000' department: - _id: '76' file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T13:51:05Z date_updated: 2018-11-02T13:51:05Z file_id: '5255' file_name: ksa+18crysl.pdf file_size: 747259 relation: main_file success: 1 file_date_updated: 2018-11-02T13:51:05Z has_accepted_license: '1' keyword: - ITSECWEBSITE - CROSSING language: - iso: eng main_file_link: - url: http://bodden.de/pubs/ksa+18crysl.pdf page: 10:1-10:27 project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '12' name: SFB 901 - Subproject B4 publication: European Conference on Object-Oriented Programming (ECOOP) status: public title: 'CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic APIs' type: conference user_id: '477' year: '2018' ... --- _id: '5216' 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. To rigorously study self-stabilizing solutions to this problem, the Finite Departure Problem (FDP) has been proposed [9]. In the FDP we are given a network of processes in an arbitrary state, and the goal is to eventually arrive at (and stay in) a state in which all leaving processes irrevocably decided to leave the system while for all weakly-connected components in the initial overlay network, all staying processes in that component will still form a weakly connected component. In the standard interconnection model, the FDP is known to be unsolvable by local control protocols, so oracles have been investigated that allow the problem to be solved [9]. To avoid the use of oracles, we introduce a new interconnection model based on relays. Despite the relay model appearing to be rather restrictive, we show that it is universal, i.e., it is possible to transform any weakly-connected topology into any other weakly-connected topology, which is important for being a useful interconnection model for overlay networks. Apart from this, our model allows processes to grant and revoke access rights, which is why we believe it to be of interest beyond the scope of this paper. We show how to implement the relay layer in a self-stabilizing way and identify properties protocols need to satisfy so that the relay layer can recover while serving protocol requests. 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 citation: ama: 'Scheideler C, Setzer A. Relays: A New Approach for the Finite Departure Problem in Overlay Networks. In: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018). ; 2018. doi:10.1007/978-3-030-03232-6_16' apa: 'Scheideler, C., & Setzer, A. (2018). Relays: A New Approach for the Finite Departure Problem in Overlay Networks. In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018). Tokyo, Japan. https://doi.org/10.1007/978-3-030-03232-6_16' bibtex: '@inproceedings{Scheideler_Setzer_2018, title={Relays: A New Approach for the Finite Departure Problem in Overlay Networks}, DOI={10.1007/978-3-030-03232-6_16}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)}, author={Scheideler, Christian and Setzer, Alexander}, year={2018} }' chicago: 'Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for the Finite Departure Problem in Overlay Networks.” In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018. https://doi.org/10.1007/978-3-030-03232-6_16.' ieee: 'C. Scheideler and A. Setzer, “Relays: A New Approach for the Finite Departure Problem in Overlay Networks,” in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), Tokyo, Japan, 2018.' mla: 'Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for the Finite Departure Problem in Overlay Networks.” Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018, doi:10.1007/978-3-030-03232-6_16.' short: 'C. Scheideler, A. Setzer, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018.' conference: location: Tokyo, Japan name: 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018) date_created: 2018-10-31T13:33:05Z date_updated: 2022-01-06T07:01:47Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-030-03232-6_16 file: - access_level: closed content_type: application/pdf creator: asetzer date_created: 2018-10-31T15:51:45Z date_updated: 2018-10-31T16:09:48Z file_id: '5223' file_name: Scheideler-Setzer2018_Chapter_RelaysANewApproachForTheFinite.pdf file_size: 369818 relation: main_file file_date_updated: 2018-10-31T16:09:48Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '13' name: SFB 901 - Subproject C1 publication: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018) publication_status: published status: public title: 'Relays: A New Approach for the Finite Departure Problem in Overlay Networks' type: conference user_id: '11108' year: '2018' ... --- _id: '5222' abstract: - lang: eng text: 'We present a self-stabilizing protocol for an overlay network that constructs the Minimum Spanning Tree (MST) for an underlay that is modeled by a weighted tree. The weight of an overlay edge between two nodes is the weighted length of their shortest path in the tree. We rigorously prove that our protocol works correctly under asynchronous and non-FIFO message delivery. Further, the protocol stabilizes after O(N^2) asynchronous rounds where N is the number of nodes in the overlay. ' author: - first_name: Thorsten full_name: Götte, Thorsten id: '34727' last_name: Götte - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Alexander full_name: Setzer, Alexander id: '11108' last_name: Setzer citation: ama: 'Götte T, Scheideler C, Setzer A. On Underlay-Aware Self-Stabilizing Overlay Networks. In: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018). Vol 11201. Lecture Notes in Computer Science. Springer; 2018:50-64.' apa: 'Götte, T., Scheideler, C., & Setzer, A. (2018). On Underlay-Aware Self-Stabilizing Overlay Networks. In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018) (Vol. 11201, pp. 50–64). Tokyo, Japan: Springer.' bibtex: '@inproceedings{Götte_Scheideler_Setzer_2018, series={Lecture Notes in Computer Science}, title={On Underlay-Aware Self-Stabilizing Overlay Networks}, volume={11201}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)}, publisher={Springer}, author={Götte, Thorsten and Scheideler, Christian and Setzer, Alexander}, year={2018}, pages={50–64}, collection={Lecture Notes in Computer Science} }' chicago: Götte, Thorsten, Christian Scheideler, and Alexander Setzer. “On Underlay-Aware Self-Stabilizing Overlay Networks.” In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 11201:50–64. Lecture Notes in Computer Science. Springer, 2018. ieee: T. Götte, C. Scheideler, and A. Setzer, “On Underlay-Aware Self-Stabilizing Overlay Networks,” in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), Tokyo, Japan, 2018, vol. 11201, pp. 50–64. mla: Götte, Thorsten, et al. “On Underlay-Aware Self-Stabilizing Overlay Networks.” Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), vol. 11201, Springer, 2018, pp. 50–64. short: 'T. Götte, C. Scheideler, A. Setzer, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), Springer, 2018, pp. 50–64.' conference: location: Tokyo, Japan name: ' 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)' date_created: 2018-10-31T15:44:30Z date_updated: 2022-01-06T07:01:47Z ddc: - '040' department: - _id: '79' file: - access_level: closed content_type: application/pdf creator: thgoette date_created: 2018-10-31T15:59:26Z date_updated: 2018-10-31T15:59:26Z file_id: '5224' file_name: sss18_camera.pdf file_size: 367812 relation: main_file success: 1 file_date_updated: 2018-10-31T15:59:26Z has_accepted_license: '1' intvolume: ' 11201' language: - iso: eng page: 50-64 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018) publisher: Springer series_title: Lecture Notes in Computer Science status: public title: On Underlay-Aware Self-Stabilizing Overlay Networks type: conference user_id: '477' volume: 11201 year: '2018' ... --- _id: '5368' author: - first_name: Moritz full_name: Jochmaring, Moritz last_name: Jochmaring citation: ama: Jochmaring M. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn; 2018. apa: Jochmaring, M. (2018). Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten. Universität Paderborn. bibtex: '@book{Jochmaring_2018, title={Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}, publisher={Universität Paderborn}, author={Jochmaring, Moritz}, year={2018} }' chicago: Jochmaring, Moritz. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn, 2018. ieee: M. Jochmaring, Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten. Universität Paderborn, 2018. mla: Jochmaring, Moritz. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn, 2018. short: M. Jochmaring, Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn, 2018. date_created: 2018-11-06T06:21:37Z date_updated: 2022-01-06T07:01:50Z department: - _id: '79' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publisher: Universität Paderborn status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten type: bachelorsthesis user_id: '477' year: '2018' ... --- _id: '5403' author: - first_name: Marcel full_name: Geromel, Marcel last_name: Geromel citation: ama: Geromel M. Mobile Facility Leasing. Universität Paderborn; 2018. apa: Geromel, M. (2018). Mobile Facility Leasing. Universität Paderborn. bibtex: '@book{Geromel_2018, title={Mobile Facility Leasing}, publisher={Universität Paderborn}, author={Geromel, Marcel}, year={2018} }' chicago: Geromel, Marcel. Mobile Facility Leasing. Universität Paderborn, 2018. ieee: M. Geromel, Mobile Facility Leasing. Universität Paderborn, 2018. mla: Geromel, Marcel. Mobile Facility Leasing. Universität Paderborn, 2018. short: M. Geromel, Mobile Facility Leasing, Universität Paderborn, 2018. date_created: 2018-11-07T09:20:59Z date_updated: 2022-01-06T07:01:51Z department: - _id: '63' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publisher: Universität Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Mobile Facility Leasing type: bachelorsthesis user_id: '477' year: '2018' ... --- _id: '5404' author: - first_name: Patrick Irenäus full_name: Kolpaczki, Patrick Irenäus last_name: Kolpaczki citation: ama: Kolpaczki PI. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn; 2018. apa: Kolpaczki, P. I. (2018). Online Algorithmen für das k-Page Migration Problem. Universität Paderborn. bibtex: '@book{Kolpaczki_2018, title={Online Algorithmen für das k-Page Migration Problem}, publisher={Universität Paderborn}, author={Kolpaczki, Patrick Irenäus}, year={2018} }' chicago: Kolpaczki, Patrick Irenäus. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn, 2018. ieee: P. I. Kolpaczki, Online Algorithmen für das k-Page Migration Problem. Universität Paderborn, 2018. mla: Kolpaczki, Patrick Irenäus. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn, 2018. short: P.I. Kolpaczki, Online Algorithmen Für Das K-Page Migration Problem, Universität Paderborn, 2018. date_created: 2018-11-07T09:23:17Z date_updated: 2022-01-06T07:01:51Z department: - _id: '63' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publisher: Universität Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Online Algorithmen für das k-Page Migration Problem type: bachelorsthesis user_id: '477' year: '2018' ... --- _id: '5414' author: - first_name: Tasneem full_name: Filmwala, Tasneem last_name: Filmwala citation: ama: Filmwala T. Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate It on FPGA Platform. Universität Paderborn; 2018. apa: Filmwala, T. (2018). Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate it on FPGA Platform. Universität Paderborn. bibtex: '@book{Filmwala_2018, title={Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate it on FPGA Platform}, publisher={Universität Paderborn}, author={Filmwala, Tasneem}, year={2018} }' chicago: Filmwala, Tasneem. Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate It on FPGA Platform. Universität Paderborn, 2018. ieee: T. Filmwala, Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate it on FPGA Platform. Universität Paderborn, 2018. mla: Filmwala, Tasneem. Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate It on FPGA Platform. Universität Paderborn, 2018. short: T. Filmwala, Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate It on FPGA Platform, Universität Paderborn, 2018. date_created: 2018-11-07T15:14:26Z date_updated: 2022-01-06T07:01:52Z department: - _id: '27' - _id: '518' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '14' name: SFB 901 - Subproject C2 publisher: Universität Paderborn status: public supervisor: - first_name: Christian full_name: Plessl, Christian id: '16153' last_name: Plessl orcid: 0000-0001-5728-9982 title: Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate it on FPGA Platform type: mastersthesis user_id: '477' year: '2018' ... --- _id: '5421' author: - first_name: Onkar full_name: Gadewar, Onkar last_name: Gadewar citation: ama: Gadewar O. Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL. Universität Paderborn; 2018. apa: Gadewar, O. (2018). Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL. Universität Paderborn. bibtex: '@book{Gadewar_2018, title={Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL}, publisher={Universität Paderborn}, author={Gadewar, Onkar}, year={2018} }' chicago: Gadewar, Onkar. Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL. Universität Paderborn, 2018. ieee: O. Gadewar, Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL. Universität Paderborn, 2018. mla: Gadewar, Onkar. Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL. Universität Paderborn, 2018. short: O. Gadewar, Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL, Universität Paderborn, 2018. date_created: 2018-11-07T16:16:56Z date_updated: 2022-01-06T07:01:53Z department: - _id: '27' - _id: '518' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '14' name: SFB 901 - Subproject C2 publisher: Universität Paderborn status: public supervisor: - first_name: Christian full_name: Plessl, Christian id: '16153' last_name: Plessl orcid: 0000-0001-5728-9982 title: Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL type: mastersthesis user_id: '477' year: '2018' ... --- _id: '5426' author: - first_name: Oliver full_name: von Heißen, Oliver last_name: von Heißen citation: ama: von Heißen O. Implementierung und Analyse von Searchable Encryption.; 2018. apa: von Heißen, O. (2018). Implementierung und Analyse von Searchable Encryption. bibtex: '@book{von Heißen_2018, title={Implementierung und Analyse von Searchable Encryption}, author={von Heißen, Oliver}, year={2018} }' chicago: Heißen, Oliver von. Implementierung und Analyse von Searchable Encryption, 2018. ieee: O. von Heißen, Implementierung und Analyse von Searchable Encryption. 2018. mla: von Heißen, Oliver. Implementierung und Analyse von Searchable Encryption. 2018. short: O. von Heißen, Implementierung und Analyse von Searchable Encryption, 2018. date_created: 2018-11-08T10:13:08Z date_updated: 2022-01-06T07:01:53Z department: - _id: '64' extern: '1' language: - iso: ger status: public supervisor: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer title: Implementierung und Analyse von Searchable Encryption type: bachelorsthesis user_id: '13703' year: '2018' ... --- _id: '5438' author: - first_name: Kristian full_name: Gjøsteen, Kristian last_name: Gjøsteen - first_name: Tibor full_name: Jager, Tibor id: '64669' last_name: Jager citation: ama: 'Gjøsteen K, Jager T. Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange. In: Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II. ; 2018. doi:10.1007/978-3-319-96881-0_4' apa: Gjøsteen, K., & Jager, T. (2018). Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange. In Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II. https://doi.org/10.1007/978-3-319-96881-0_4 bibtex: '@inproceedings{Gjøsteen_Jager_2018, title={Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange}, DOI={10.1007/978-3-319-96881-0_4}, booktitle={Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II}, author={Gjøsteen, Kristian and Jager, Tibor}, year={2018} }' chicago: Gjøsteen, Kristian, and Tibor Jager. “Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange.” In Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II, 2018. https://doi.org/10.1007/978-3-319-96881-0_4. ieee: K. Gjøsteen and T. Jager, “Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange,” in Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II, 2018. mla: Gjøsteen, Kristian, and Tibor Jager. “Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange.” Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II, 2018, doi:10.1007/978-3-319-96881-0_4. short: 'K. Gjøsteen, T. Jager, in: Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II, 2018.' date_created: 2018-11-08T12:47:45Z date_updated: 2022-01-06T07:01:53Z ddc: - '006' department: - _id: '558' doi: 10.1007/978-3-319-96881-0_4 file: - access_level: closed content_type: application/octet-stream creator: abirke date_created: 2018-11-08T12:53:03Z date_updated: 2018-11-08T12:53:03Z file_id: '5440' file_name: 2018-543 file_size: 486642 relation: main_file file_date_updated: 2018-11-08T12:53:03Z has_accepted_license: '1' language: - iso: eng main_file_link: - url: https://eprint.iacr.org/2018/543.pdf publication: Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II publication_status: published status: public title: Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange type: conference user_id: '38235' year: '2018' ... --- _id: '5442' author: - first_name: Tibor full_name: Jager, Tibor id: '64669' last_name: Jager - first_name: Saqib full_name: Kakvi, Saqib id: '66268' last_name: Kakvi - first_name: Alexander full_name: May, Alexander last_name: May citation: ama: 'Jager T, Kakvi S, May A. On the Security of the PKCS#1 v1.5 Signature Scheme. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18. ACM Press; 2018. doi:10.1145/3243734.3243798' apa: Jager, T., Kakvi, S., & May, A. (2018). On the Security of the PKCS#1 v1.5 Signature Scheme. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18. ACM Press. https://doi.org/10.1145/3243734.3243798 bibtex: '@inproceedings{Jager_Kakvi_May_2018, title={On the Security of the PKCS#1 v1.5 Signature Scheme}, DOI={10.1145/3243734.3243798}, booktitle={Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18}, publisher={ACM Press}, author={Jager, Tibor and Kakvi, Saqib and May, Alexander}, year={2018} }' chicago: Jager, Tibor, Saqib Kakvi, and Alexander May. “On the Security of the PKCS#1 v1.5 Signature Scheme.” In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18. ACM Press, 2018. https://doi.org/10.1145/3243734.3243798. ieee: T. Jager, S. Kakvi, and A. May, “On the Security of the PKCS#1 v1.5 Signature Scheme,” in Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18, 2018. mla: Jager, Tibor, et al. “On the Security of the PKCS#1 v1.5 Signature Scheme.” Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18, ACM Press, 2018, doi:10.1145/3243734.3243798. short: 'T. Jager, S. Kakvi, A. May, in: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18, ACM Press, 2018.' date_created: 2018-11-08T12:56:04Z date_updated: 2022-01-06T07:01:54Z ddc: - '006' department: - _id: '558' doi: 10.1145/3243734.3243798 file: - access_level: closed content_type: application/pdf creator: abirke date_created: 2018-11-08T12:57:34Z date_updated: 2018-11-08T12:57:34Z file_id: '5443' file_name: 2018-855.pdf file_size: 481982 relation: main_file success: 1 file_date_updated: 2018-11-08T12:57:34Z has_accepted_license: '1' language: - iso: eng main_file_link: - url: https://eprint.iacr.org/2018/855.pdf publication: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security - CCS '18 publication_identifier: isbn: - '9781450356930' publication_status: published publisher: ACM Press status: public title: On the Security of the PKCS#1 v1.5 Signature Scheme type: conference user_id: '38235' year: '2018' ... --- _id: '5530' abstract: - lang: eng text: Software companies nowadays create ecosystems of users and third-party providers around their platforms. They often provide online stores so that the third-party developments can be exposed to users directly. The resulting ecosystems differ significantly from each other in their architectural designs because their providers differ in terms of business goals and contexts. Until now, this architectural diversity and rationale behind it are not well-understood. Therefore, it is not clear which software features contribute to ecosystem’s success with respect to certain business goals and context. This hinders systematic creation of ecosystems in the future. Thus, decision-making becomes too risky; for future ecosystem providers, which may lead to creation of inefficient ecosystems that lack critical features, and for third-party providers to rely on ad-hoc choices while deciding on suitability of an ecosystem for their future career. In this paper, we introduce three design patterns for store- oriented software ecosystems by classifying the design decisions, business goals, and context of 111 store-oriented software ecosystems. Each design pattern provides an architectural solution to achieve a different business goal while supporting a different context. We discuss how the design patterns are applied together in order to achieve more business goals. Our work supports ecosystem and third-party providers by sharing practice-proven architectural solutions, helping them to take informed architectural decisions and reduce technical risks. author: - first_name: Bahar full_name: Jazayeri, Bahar id: '36399' last_name: Jazayeri - first_name: Olaf full_name: Zimmermann, Olaf last_name: Zimmermann - first_name: Jochen full_name: Küster, Jochen last_name: Küster - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch - first_name: Daniel full_name: Szopinski, Daniel id: '36372' last_name: Szopinski citation: ama: 'Jazayeri B, Zimmermann O, Küster J, Engels G, Kundisch D, Szopinski D. Patterns of Store-oriented Software Ecosystems: Detection, Classification, and Analysis of Design Options. In: The Latin American Conference on Pattern Languages of Programs (SLPLoP). To appear. Valparaíso, Chile: ACM. To appear; 2018.' apa: 'Jazayeri, B., Zimmermann, O., Küster, J., Engels, G., Kundisch, D., & Szopinski, D. (2018). Patterns of Store-oriented Software Ecosystems: Detection, Classification, and Analysis of Design Options. In The Latin American Conference on Pattern Languages of Programs (SLPLoP). Valparaíso, Chile: ACM. To appear.' bibtex: '@inproceedings{Jazayeri_Zimmermann_Küster_Engels_Kundisch_Szopinski_2018, place={Valparaíso, Chile}, series={To appear}, title={Patterns of Store-oriented Software Ecosystems: Detection, Classification, and Analysis of Design Options}, booktitle={The Latin American Conference on Pattern Languages of Programs (SLPLoP)}, publisher={ACM. To appear}, author={Jazayeri, Bahar and Zimmermann, Olaf and Küster, Jochen and Engels, Gregor and Kundisch, Dennis and Szopinski, Daniel}, year={2018}, collection={To appear} }' chicago: 'Jazayeri, Bahar, Olaf Zimmermann, Jochen Küster, Gregor Engels, Dennis Kundisch, and Daniel Szopinski. “Patterns of Store-Oriented Software Ecosystems: Detection, Classification, and Analysis of Design Options.” In The Latin American Conference on Pattern Languages of Programs (SLPLoP). To Appear. Valparaíso, Chile: ACM. To appear, 2018.' ieee: 'B. Jazayeri, O. Zimmermann, J. Küster, G. Engels, D. Kundisch, and D. Szopinski, “Patterns of Store-oriented Software Ecosystems: Detection, Classification, and Analysis of Design Options,” in The Latin American Conference on Pattern Languages of Programs (SLPLoP), 2018.' mla: 'Jazayeri, Bahar, et al. “Patterns of Store-Oriented Software Ecosystems: Detection, Classification, and Analysis of Design Options.” The Latin American Conference on Pattern Languages of Programs (SLPLoP), ACM. To appear, 2018.' short: 'B. Jazayeri, O. Zimmermann, J. Küster, G. Engels, D. Kundisch, D. Szopinski, in: The Latin American Conference on Pattern Languages of Programs (SLPLoP), ACM. To appear, Valparaíso, Chile, 2018.' conference: end_date: 2018-11-23 start_date: 2018-11-20 date_created: 2018-11-12T16:02:14Z date_updated: 2022-01-06T07:01:57Z ddc: - '000' department: - _id: '66' - _id: '276' file: - access_level: closed content_type: application/pdf creator: bahareh date_created: 2018-11-29T23:41:07Z date_updated: 2018-11-29T23:41:07Z file_id: '5983' file_name: Jazayerietal-SLPLoP18.pdf file_size: 514038 relation: main_file success: 1 file_date_updated: 2018-11-29T23:41:07Z has_accepted_license: '1' language: - iso: eng place: Valparaíso, Chile project: - _id: '1' name: SFB 901 - _id: '17' name: SFB 901 - Subproject C5 - _id: '4' name: SFB 901 - Project Area C publication: The Latin American Conference on Pattern Languages of Programs (SLPLoP) publisher: ACM. To appear series_title: To appear status: public title: 'Patterns of Store-oriented Software Ecosystems: Detection, Classification, and Analysis of Design Options' type: conference user_id: '36399' year: '2018' ... --- _id: '5547' author: - 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 citation: ama: 'Lösch A, Platzner M. A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute Nodes. In: 2018 IEEE 29th International Conference on Application-Specific Systems, Architectures and Processors (ASAP). IEEE; 2018. doi:10.1109/asap.2018.8445098' apa: 'Lösch, A., & Platzner, M. (2018). A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute Nodes. In 2018 IEEE 29th International Conference on Application-specific Systems, Architectures and Processors (ASAP). Milan, Italy: IEEE. https://doi.org/10.1109/asap.2018.8445098' bibtex: '@inproceedings{Lösch_Platzner_2018, title={A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute Nodes}, DOI={10.1109/asap.2018.8445098}, booktitle={2018 IEEE 29th International Conference on Application-specific Systems, Architectures and Processors (ASAP)}, publisher={IEEE}, author={Lösch, Achim and Platzner, Marco}, year={2018} }' chicago: Lösch, Achim, and Marco Platzner. “A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute Nodes.” In 2018 IEEE 29th International Conference on Application-Specific Systems, Architectures and Processors (ASAP). IEEE, 2018. https://doi.org/10.1109/asap.2018.8445098. ieee: A. Lösch and M. Platzner, “A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute Nodes,” in 2018 IEEE 29th International Conference on Application-specific Systems, Architectures and Processors (ASAP), Milan, Italy, 2018. mla: Lösch, Achim, and Marco Platzner. “A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute Nodes.” 2018 IEEE 29th International Conference on Application-Specific Systems, Architectures and Processors (ASAP), IEEE, 2018, doi:10.1109/asap.2018.8445098. short: 'A. Lösch, M. Platzner, in: 2018 IEEE 29th International Conference on Application-Specific Systems, Architectures and Processors (ASAP), IEEE, 2018.' conference: end_date: 2018-07-12 location: Milan, Italy name: The 29th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors start_date: 2018-07-10 date_created: 2018-11-14T09:26:53Z date_updated: 2022-01-06T07:01:59Z ddc: - '040' department: - _id: '78' doi: 10.1109/asap.2018.8445098 file: - access_level: closed content_type: application/pdf creator: aloesch date_created: 2018-11-14T09:40:42Z date_updated: 2018-11-14T09:40:42Z file_id: '5552' file_name: loesch_asap2018.pdf file_size: 2464949 relation: main_file success: 1 file_date_updated: 2018-11-14T09:40:42Z has_accepted_license: '1' language: - iso: eng project: - _id: '14' name: SFB 901 - Subproject C2 - _id: '4' name: SFB 901 - Project Area C - _id: '1' name: SFB 901 publication: 2018 IEEE 29th International Conference on Application-specific Systems, Architectures and Processors (ASAP) publication_identifier: isbn: - '9781538674796' publication_status: published publisher: IEEE status: public title: A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute Nodes type: conference user_id: '43646' year: '2018' ... --- _id: '6483' author: - first_name: Manuel full_name: Peuster, Manuel id: '13271' last_name: Peuster - first_name: Stefan Balthasar full_name: Schneider, Stefan Balthasar id: '35343' last_name: Schneider orcid: 0000-0001-8210-4011 - first_name: Frederic full_name: Christ, Frederic last_name: Christ - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl citation: ama: 'Peuster M, Schneider SB, Christ F, Karl H. A Prototyping Platform to Validate and Verify Network Service Header-based Service Chains. In: IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp. Verona: IEEE; 2018.' apa: 'Peuster, M., Schneider, S. B., Christ, F., & Karl, H. (2018). A Prototyping Platform to Validate and Verify Network Service Header-based Service Chains. In IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp. Verona: IEEE.' bibtex: '@inproceedings{Peuster_Schneider_Christ_Karl_2018, place={Verona}, title={A Prototyping Platform to Validate and Verify Network Service Header-based Service Chains}, booktitle={IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp}, publisher={IEEE}, author={Peuster, Manuel and Schneider, Stefan Balthasar and Christ, Frederic and Karl, Holger}, year={2018} }' chicago: 'Peuster, Manuel, Stefan Balthasar Schneider, Frederic Christ, and Holger Karl. “A Prototyping Platform to Validate and Verify Network Service Header-Based Service Chains.” In IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp. Verona: IEEE, 2018.' ieee: M. Peuster, S. B. Schneider, F. Christ, and H. Karl, “A Prototyping Platform to Validate and Verify Network Service Header-based Service Chains,” in IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp, Verona, 2018. mla: Peuster, Manuel, et al. “A Prototyping Platform to Validate and Verify Network Service Header-Based Service Chains.” IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp, IEEE, 2018. short: 'M. Peuster, S.B. Schneider, F. Christ, H. Karl, in: IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp, IEEE, Verona, 2018.' conference: end_date: 2018-11-29 location: Verona name: IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp start_date: 2018-11-27 date_created: 2019-01-04T07:47:19Z date_updated: 2022-01-06T07:03:07Z ddc: - '000' department: - _id: '75' file: - access_level: open_access content_type: application/pdf creator: peuster date_created: 2019-01-04T07:46:21Z date_updated: 2019-01-04T07:46:21Z file_id: '6484' file_name: main_for_ris.pdf file_size: 541469 relation: main_file file_date_updated: 2019-01-04T07:46:21Z has_accepted_license: '1' language: - iso: eng oa: '1' place: Verona project: - _id: '28' grant_number: '761493' name: 5G Development and validation platform for global industry-specific network services and Apps - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '16' name: SFB 901 - Subproject C4 publication: IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp publisher: IEEE status: public title: A Prototyping Platform to Validate and Verify Network Service Header-based Service Chains type: conference user_id: '35343' year: '2018' ... --- _id: '6485' author: - first_name: Raphael Vicente full_name: Rosa, Raphael Vicente last_name: Rosa - first_name: Christian Esteve full_name: Rothenberg, Christian Esteve last_name: Rothenberg - first_name: Manuel full_name: Peuster, Manuel id: '13271' last_name: Peuster - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl citation: ama: Rosa RV, Rothenberg CE, Peuster M, Karl H. Methodology for VNF Benchmarking Automation. IETF apa: Rosa, R. V., Rothenberg, C. E., Peuster, M., & Karl, H. (n.d.). Methodology for VNF Benchmarking Automation. IETF. bibtex: '@book{Rosa_Rothenberg_Peuster_Karl, title={Methodology for VNF Benchmarking Automation}, publisher={IETF}, author={Rosa, Raphael Vicente and Rothenberg, Christian Esteve and Peuster, Manuel and Karl, Holger} }' chicago: Rosa, Raphael Vicente, Christian Esteve Rothenberg, Manuel Peuster, and Holger Karl. Methodology for VNF Benchmarking Automation. IETF, n.d. ieee: R. V. Rosa, C. E. Rothenberg, M. Peuster, and H. Karl, Methodology for VNF Benchmarking Automation. IETF. mla: Rosa, Raphael Vicente, et al. Methodology for VNF Benchmarking Automation. IETF. short: R.V. Rosa, C.E. Rothenberg, M. Peuster, H. Karl, Methodology for VNF Benchmarking Automation, IETF, n.d. date_created: 2019-01-04T07:53:50Z date_updated: 2022-01-06T07:03:07Z department: - _id: '75' language: - iso: eng main_file_link: - open_access: '1' url: https://datatracker.ietf.org/doc/draft-rosa-bmwg-vnfbench/ oa: '1' project: - _id: '28' grant_number: '761493' name: 5G Development and validation platform for global industry-specific network services and Apps publication_status: draft publisher: IETF report_number: draft-rosa-bmwg-vnfbench status: public title: Methodology for VNF Benchmarking Automation type: report user_id: '13271' year: '2018' ... --- _id: '6516' author: - first_name: Jan Cedric full_name: Mertens, Jan Cedric last_name: Mertens - first_name: Alexander full_name: Boschmann, Alexander last_name: Boschmann - first_name: M. full_name: Schmidt, M. last_name: Schmidt - first_name: Christian full_name: Plessl, Christian id: '16153' last_name: Plessl orcid: 0000-0001-5728-9982 citation: ama: Mertens JC, Boschmann A, Schmidt M, Plessl C. Sprint diagnostic with GPS and inertial sensor fusion. Sports Engineering. 2018;21(4):441-451. doi:10.1007/s12283-018-0291-0 apa: Mertens, J. C., Boschmann, A., Schmidt, M., & Plessl, C. (2018). Sprint diagnostic with GPS and inertial sensor fusion. Sports Engineering, 21(4), 441–451. https://doi.org/10.1007/s12283-018-0291-0 bibtex: '@article{Mertens_Boschmann_Schmidt_Plessl_2018, title={Sprint diagnostic with GPS and inertial sensor fusion}, volume={21}, DOI={10.1007/s12283-018-0291-0}, number={4}, journal={Sports Engineering}, publisher={Springer Nature}, author={Mertens, Jan Cedric and Boschmann, Alexander and Schmidt, M. and Plessl, Christian}, year={2018}, pages={441–451} }' chicago: 'Mertens, Jan Cedric, Alexander Boschmann, M. Schmidt, and Christian Plessl. “Sprint Diagnostic with GPS and Inertial Sensor Fusion.” Sports Engineering 21, no. 4 (2018): 441–51. https://doi.org/10.1007/s12283-018-0291-0.' ieee: J. C. Mertens, A. Boschmann, M. Schmidt, and C. Plessl, “Sprint diagnostic with GPS and inertial sensor fusion,” Sports Engineering, vol. 21, no. 4, pp. 441–451, 2018. mla: Mertens, Jan Cedric, et al. “Sprint Diagnostic with GPS and Inertial Sensor Fusion.” Sports Engineering, vol. 21, no. 4, Springer Nature, 2018, pp. 441–51, doi:10.1007/s12283-018-0291-0. short: J.C. Mertens, A. Boschmann, M. Schmidt, C. Plessl, Sports Engineering 21 (2018) 441–451. date_created: 2019-01-08T17:44:43Z date_updated: 2022-01-06T07:03:09Z ddc: - '000' department: - _id: '27' - _id: '518' doi: 10.1007/s12283-018-0291-0 file: - access_level: closed content_type: application/pdf creator: plessl date_created: 2019-01-08T17:47:06Z date_updated: 2019-01-08T17:47:06Z file_id: '6517' file_name: plessl18_sportseng.pdf file_size: 2141021 relation: main_file file_date_updated: 2019-01-08T17:47:06Z has_accepted_license: '1' intvolume: ' 21' issue: '4' language: - iso: eng page: 441-451 publication: Sports Engineering publication_identifier: issn: - 1369-7072 - 1460-2687 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Sprint diagnostic with GPS and inertial sensor fusion type: journal_article user_id: '16153' volume: 21 year: '2018' ... --- _id: '6597' author: - first_name: Jakob full_name: Juhnke, Jakob id: '48090' last_name: Juhnke citation: ama: Juhnke J. Models and Constructions for Secure Reputation Systems. Universität Paderborn; 2018. doi:10.17619/UNIPB/1-570 apa: Juhnke, J. (2018). Models and Constructions for Secure Reputation Systems. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-570 bibtex: '@book{Juhnke_2018, title={Models and Constructions for Secure Reputation Systems}, DOI={10.17619/UNIPB/1-570}, publisher={Universität Paderborn}, author={Juhnke, Jakob}, year={2018} }' chicago: Juhnke, Jakob. Models and Constructions for Secure Reputation Systems. Universität Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-570. ieee: J. Juhnke, Models and Constructions for Secure Reputation Systems. Universität Paderborn, 2018. mla: Juhnke, Jakob. Models and Constructions for Secure Reputation Systems. Universität Paderborn, 2018, doi:10.17619/UNIPB/1-570. short: J. Juhnke, Models and Constructions for Secure Reputation Systems, Universität Paderborn, 2018. date_created: 2019-01-10T07:51:07Z date_updated: 2022-01-06T07:03:13Z department: - _id: '64' doi: 10.17619/UNIPB/1-570 language: - iso: eng project: - _id: '13' name: SFB 901 - Subproject C1 - _id: '4' name: SFB 901 - Project Area C - _id: '1' name: SFB 901 publisher: Universität Paderborn status: public supervisor: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer title: Models and Constructions for Secure Reputation Systems type: dissertation user_id: '477' year: '2018' ...