[{"author":[{"first_name":"Reinhard ","last_name":"Keil","full_name":"Keil, Reinhard "},{"full_name":"Selke, Harald","first_name":"Harald","last_name":"Selke","id":"497"}],"title":"Virtual knowledge {\\ \"a} ume - From the presentation of content to virtual learning {\\\" a} tten","year":"2015","status":"public","intvolume":"       330","date_updated":"2022-01-06T06:57:22Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"26533","publisher":"publishing series of the Heinz Nixdorf Institute, Paderborn","page":"39-53","editor":[{"full_name":"Keil, Reinhard","last_name":"Keil","first_name":"Reinhard"},{"last_name":"Selke","first_name":"Harald","full_name":"Selke, Harald"}],"alternative_title":["20 years of learning with the World Wide Web - technology and education in dialogue"],"volume":330,"user_id":"71124","citation":{"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} }","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.","mla":"Keil, Reinhard, and Harald Selke. <i>Virtual Knowledge {\\ “A} Ume - From the Presentation of Content to Virtual Learning {\\” A} Tten</i>. 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.","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.","apa":"Keil, R., &#38; Selke, H. (2015). <i>Virtual knowledge {\\ “a} ume - From the presentation of content to virtual learning {\\” a} tten</i> (R. Keil &#38; H. Selke, Eds.; Vol. 330, pp. 39–53). publishing series of the Heinz Nixdorf Institute, Paderborn."},"date_created":"2021-10-19T14:19:23Z","department":[{"_id":"71"}],"type":"conference"},{"citation":{"mla":"Klompmaker, Florian. <i>Development of a Structured Process of Interaction Design for {\\ “U} r Nat {\\” U} Local User Interfaces</i>. Universitaetsbibliothek Paderborn, 2015.","ama":"Klompmaker F. <i>Development of a Structured Process of Interaction Design for {\\ “U} r Nat {\\” U} Local User Interfaces</i>. Universitaetsbibliothek Paderborn; 2015.","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} }","apa":"Klompmaker, F. (2015). <i>Development of a structured process of interaction design for {\\ “u} r nat {\\” u} local user interfaces</i>. Universitaetsbibliothek Paderborn.","ieee":"F. Klompmaker, <i>Development of a structured process of interaction design for {\\ “u} r nat {\\” u} local user interfaces</i>. Universit {\\ \"a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science: 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.","chicago":"Klompmaker, Florian. <i>Development of a Structured Process of Interaction Design for {\\ “U} r Nat {\\” U} Local User Interfaces</i>. Universit {\\ \"a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science: Universitaetsbibliothek Paderborn, 2015."},"type":"dissertation","department":[{"_id":"71"}],"date_created":"2021-10-19T14:22:28Z","place":"Universit {\\ \"a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science","publication_status":"published","date_updated":"2022-01-06T06:57:22Z","status":"public","year":"2015","title":"Development of a structured process of interaction design for {\\ \"u} r nat {\\\" u} local user interfaces","author":[{"full_name":"Klompmaker, Florian","first_name":"Florian","last_name":"Klompmaker"}],"user_id":"71124","language":[{"iso":"eng"}],"_id":"26534","publisher":"Universitaetsbibliothek Paderborn"},{"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"}],"citation":{"short":"C. Schild, V. Petrausch, in: Human and Computer 2015 - Proceedings, De Gruyter Oldenbourg, Berlin, 2015, pp. 173–182.","chicago":"Schild, Christian, and Vanessa Petrausch. “Empirical Validation of Design Patterns.” In <i>Human and Computer 2015 - Proceedings</i>, 173–82. Berlin: De Gruyter Oldenbourg, 2015.","apa":"Schild, C., &#38; Petrausch, V. (2015). Empirical validation of design patterns. <i>Human and Computer 2015 - Proceedings</i>, 173–182.","ieee":"C. Schild and V. Petrausch, “Empirical validation of design patterns,” in <i>Human and Computer 2015 - Proceedings</i>, 2015, pp. 173–182.","ama":"Schild C, Petrausch V. Empirical validation of design patterns. In: <i>Human and Computer 2015 - Proceedings</i>. De Gruyter Oldenbourg; 2015: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} }","mla":"Schild, Christian, and Vanessa Petrausch. “Empirical Validation of Design Patterns.” <i>Human and Computer 2015 - Proceedings</i>, De Gruyter Oldenbourg, 2015, pp. 173–82."},"publication":"Human and Computer 2015 - Proceedings","department":[{"_id":"71"}],"type":"conference","date_created":"2021-10-19T14:28:44Z","place":"Berlin","publication_status":"published","date_updated":"2022-01-06T06:57:22Z","author":[{"last_name":"Schild","first_name":"Christian","full_name":"Schild, Christian"},{"first_name":"Vanessa","last_name":"Petrausch","full_name":"Petrausch, Vanessa"}],"title":"Empirical validation of design patterns","status":"public","year":"2015","user_id":"71124","publisher":"De Gruyter Oldenbourg","_id":"26536","language":[{"iso":"eng"}],"page":"173-182"},{"has_accepted_license":"1","date_updated":"2022-01-06T06:57:22Z","author":[{"id":"37612","first_name":"Christine","last_name":"Markarian","full_name":"Markarian, Christine"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"status":"public","title":"Online Resource Leasing","year":"2015","user_id":"15504","doi":"10.1145/2767386.2767454","ddc":["040"],"_id":"266","page":"343-344","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - Project Area C"}],"abstract":[{"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\". ","lang":"eng"}],"citation":{"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.","chicago":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.” In <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>, 343–44, 2015. <a href=\"https://doi.org/10.1145/2767386.2767454\">https://doi.org/10.1145/2767386.2767454</a>.","ieee":"C. Markarian and F. Meyer auf der Heide, “Online Resource Leasing,” in <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>, 2015, pp. 343–344.","apa":"Markarian, C., &#38; Meyer auf der Heide, F. (2015). Online Resource Leasing. In <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i> (pp. 343–344). <a href=\"https://doi.org/10.1145/2767386.2767454\">https://doi.org/10.1145/2767386.2767454</a>","bibtex":"@inproceedings{Markarian_Meyer auf der Heide_2015, title={Online Resource Leasing}, DOI={<a href=\"https://doi.org/10.1145/2767386.2767454\">10.1145/2767386.2767454</a>}, 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} }","ama":"Markarian C, Meyer auf der Heide F. Online Resource Leasing. In: <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>. ; 2015:343-344. doi:<a href=\"https://doi.org/10.1145/2767386.2767454\">10.1145/2767386.2767454</a>","mla":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.” <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>, 2015, pp. 343–44, doi:<a href=\"https://doi.org/10.1145/2767386.2767454\">10.1145/2767386.2767454</a>."},"file_date_updated":"2018-03-21T09:33:11Z","publication":"Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)","department":[{"_id":"63"}],"type":"conference","date_created":"2017-10-17T12:41:44Z","file":[{"file_name":"266-p343-markarian.pdf","file_size":679580,"access_level":"closed","relation":"main_file","date_updated":"2018-03-21T09:33:11Z","file_id":"1478","success":1,"content_type":"application/pdf","creator":"florida","date_created":"2018-03-21T09:33:11Z"}]},{"file_date_updated":"2018-03-21T09:33:41Z","citation":{"mla":"Markarian, Christine. <i>Online Resource Leasing</i>. Universität Paderborn, 2015.","ama":"Markarian C. <i>Online Resource Leasing</i>. Universität Paderborn; 2015.","bibtex":"@book{Markarian_2015, title={Online Resource Leasing}, publisher={Universität Paderborn}, author={Markarian, Christine}, year={2015} }","apa":"Markarian, C. (2015). <i>Online Resource Leasing</i>. Universität Paderborn.","ieee":"C. Markarian, <i>Online Resource Leasing</i>. Universität Paderborn, 2015.","chicago":"Markarian, Christine. <i>Online Resource Leasing</i>. Universität Paderborn, 2015.","short":"C. Markarian, Online Resource Leasing, Universität Paderborn, 2015."},"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"related_material":{"link":[{"relation":"confirmation","url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-16656"}]},"project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"4","name":"SFB 901 - Project Area C"}],"file":[{"creator":"florida","date_created":"2018-03-21T09:33:41Z","relation":"main_file","date_updated":"2018-03-21T09:33:41Z","file_name":"267-Dissertation_-_Markarian.pdf","access_level":"closed","file_size":1328685,"file_id":"1479","success":1,"content_type":"application/pdf"}],"date_created":"2017-10-17T12:41:44Z","type":"dissertation","department":[{"_id":"63"}],"year":"2015","title":"Online Resource Leasing","status":"public","author":[{"last_name":"Markarian","first_name":"Christine","full_name":"Markarian, Christine","id":"37612"}],"date_updated":"2022-01-06T06:57:26Z","has_accepted_license":"1","publisher":"Universität Paderborn","_id":"267","language":[{"iso":"eng"}],"user_id":"15415","ddc":["040"]},{"status":"public","has_accepted_license":"1","page":"365--372","_id":"269","ddc":["040"],"user_id":"477","file_date_updated":"2018-03-21T09:32:42Z","citation":{"short":"T. Wiersema, S. Wu, M. Platzner, in: Proceedings of the International Symposium in Reconfigurable Computing (ARC), 2015, pp. 365--372.","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 <i>Proceedings of the International Symposium in Reconfigurable Computing (ARC)</i>, 365--372. LNCS, 2015. <a href=\"https://doi.org/10.1007/978-3-319-16214-0_32\">https://doi.org/10.1007/978-3-319-16214-0_32</a>.","apa":"Wiersema, T., Wu, S., &#38; Platzner, M. (2015). On-The-Fly Verification of Reconfigurable Image Processing Modules based on a Proof-Carrying Hardware Approach. In <i>Proceedings of the International Symposium in Reconfigurable Computing (ARC)</i> (pp. 365--372). <a href=\"https://doi.org/10.1007/978-3-319-16214-0_32\">https://doi.org/10.1007/978-3-319-16214-0_32</a>","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 <i>Proceedings of the International Symposium in Reconfigurable Computing (ARC)</i>, 2015, pp. 365--372.","ama":"Wiersema T, Wu S, Platzner M. On-The-Fly Verification of Reconfigurable Image Processing Modules based on a Proof-Carrying Hardware Approach. In: <i>Proceedings of the International Symposium in Reconfigurable Computing (ARC)</i>. LNCS. ; 2015:365--372. doi:<a href=\"https://doi.org/10.1007/978-3-319-16214-0_32\">10.1007/978-3-319-16214-0_32</a>","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={<a href=\"https://doi.org/10.1007/978-3-319-16214-0_32\">10.1007/978-3-319-16214-0_32</a>}, 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} }","mla":"Wiersema, Tobias, et al. “On-The-Fly Verification of Reconfigurable Image Processing Modules Based on a Proof-Carrying Hardware Approach.” <i>Proceedings of the International Symposium in Reconfigurable Computing (ARC)</i>, 2015, pp. 365--372, doi:<a href=\"https://doi.org/10.1007/978-3-319-16214-0_32\">10.1007/978-3-319-16214-0_32</a>."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"name":"SFB 901 - Project Area B","_id":"3"}],"year":"2015","title":"On-The-Fly Verification of Reconfigurable Image Processing Modules based on a Proof-Carrying Hardware Approach","author":[{"id":"3118","first_name":"Tobias","last_name":"Wiersema","full_name":"Wiersema, Tobias"},{"full_name":"Wu, Sen","first_name":"Sen","last_name":"Wu"},{"id":"398","full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner"}],"date_updated":"2022-01-06T06:57:30Z","language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-319-16214-0_32","publication":"Proceedings of the International Symposium in Reconfigurable Computing (ARC)","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."}],"file":[{"file_id":"1477","success":1,"content_type":"application/pdf","file_name":"269-paper_53.pdf","access_level":"closed","file_size":344309,"relation":"main_file","date_updated":"2018-03-21T09:32:42Z","date_created":"2018-03-21T09:32:42Z","creator":"florida"}],"date_created":"2017-10-17T12:41:44Z","type":"conference","department":[{"_id":"78"}]},{"title":"Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure","year":"2015","author":[{"last_name":"Caragiannis","first_name":"Ioannis","full_name":"Caragiannis, Ioannis"},{"full_name":"Fanelli, Angelo","last_name":"Fanelli","first_name":"Angelo"},{"full_name":"Gravin, Nick","first_name":"Nick","last_name":"Gravin"},{"id":"40384","full_name":"Skopalik, Alexander","first_name":"Alexander","last_name":"Skopalik"}],"date_updated":"2022-01-06T06:59:04Z","intvolume":"         3","article_number":"2","language":[{"iso":"eng"}],"doi":"10.1145/2614687","publication":"Transactions on Economics and Computation","issue":"1","abstract":[{"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.","lang":"eng"}],"file":[{"date_created":"2018-03-20T07:40:55Z","creator":"florida","success":1,"content_type":"application/pdf","file_id":"1433","date_updated":"2018-03-20T07:40:55Z","relation":"main_file","file_size":260503,"access_level":"closed","file_name":"320-a2-caragiannis.pdf"}],"date_created":"2017-10-17T12:41:54Z","type":"journal_article","department":[{"_id":"63"},{"_id":"541"}],"status":"public","has_accepted_license":"1","publisher":"ACM","_id":"320","ddc":["040"],"user_id":"477","volume":3,"file_date_updated":"2018-03-20T07:40:55Z","citation":{"mla":"Caragiannis, Ioannis, et al. “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.” <i>Transactions on Economics and Computation</i>, vol. 3, no. 1, 2, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2614687\">10.1145/2614687</a>.","bibtex":"@article{Caragiannis_Fanelli_Gravin_Skopalik_2015, title={Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure}, volume={3}, DOI={<a href=\"https://doi.org/10.1145/2614687\">10.1145/2614687</a>}, number={12}, journal={Transactions on Economics and Computation}, publisher={ACM}, author={Caragiannis, Ioannis and Fanelli, Angelo and Gravin, Nick and Skopalik, Alexander}, year={2015} }","ama":"Caragiannis I, Fanelli A, Gravin N, Skopalik A. Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. <i>Transactions on Economics and Computation</i>. 2015;3(1). doi:<a href=\"https://doi.org/10.1145/2614687\">10.1145/2614687</a>","ieee":"I. Caragiannis, A. Fanelli, N. Gravin, and A. Skopalik, “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure,” <i>Transactions on Economics and Computation</i>, vol. 3, no. 1, 2015.","apa":"Caragiannis, I., Fanelli, A., Gravin, N., &#38; Skopalik, A. (2015). Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. <i>Transactions on Economics and Computation</i>, <i>3</i>(1). <a href=\"https://doi.org/10.1145/2614687\">https://doi.org/10.1145/2614687</a>","short":"I. Caragiannis, A. Fanelli, N. Gravin, A. Skopalik, Transactions on Economics and Computation 3 (2015).","chicago":"Caragiannis, Ioannis, Angelo Fanelli, Nick Gravin, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.” <i>Transactions on Economics and Computation</i> 3, no. 1 (2015). <a href=\"https://doi.org/10.1145/2614687\">https://doi.org/10.1145/2614687</a>."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"type":"mastersthesis","department":[{"_id":"64"}],"file":[{"date_updated":"2018-03-20T07:40:22Z","relation":"main_file","file_size":879285,"access_level":"closed","file_name":"321-eidens_masterthesis_01.pdf","success":1,"content_type":"application/pdf","file_id":"1432","creator":"florida","date_created":"2018-03-20T07:40:22Z"}],"date_created":"2017-10-17T12:41:54Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"file_date_updated":"2018-03-20T07:40:22Z","citation":{"short":"F. Eidens, Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption, Universität Paderborn, 2015.","chicago":"Eidens, Fabian. <i>Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn, 2015.","ieee":"F. Eidens, <i>Anonymous credential system based on q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn, 2015.","apa":"Eidens, F. (2015). <i>Anonymous credential system based on q-Strong Diffie-Hellman Assumption</i>. 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} }","ama":"Eidens F. <i>Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn; 2015.","mla":"Eidens, Fabian. <i>Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn, 2015."},"supervisor":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}],"user_id":"477","ddc":["040"],"publisher":"Universität Paderborn","_id":"321","date_updated":"2022-01-06T06:59:05Z","has_accepted_license":"1","status":"public","year":"2015","title":"Anonymous credential system based on q-Strong Diffie-Hellman Assumption","author":[{"first_name":"Fabian","last_name":"Eidens","full_name":"Eidens, Fabian","id":"25078"}]},{"citation":{"apa":"Blömer, J., Juhnke, J., &#38; Kolb, C. (2015). Anonymous and Publicly Linkable Reputation Systems. In <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i> (pp. 478--488). <a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">https://doi.org/10.1007/978-3-662-47854-7_29</a>","ieee":"J. Blömer, J. Juhnke, and C. Kolb, “Anonymous and Publicly Linkable Reputation Systems,” in <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i>, 2015, pp. 478--488.","chicago":"Blömer, Johannes, Jakob Juhnke, and Christina Kolb. “Anonymous and Publicly Linkable Reputation Systems.” In <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i>, 478--488. LNCS, 2015. <a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">https://doi.org/10.1007/978-3-662-47854-7_29</a>.","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.","mla":"Blömer, Johannes, et al. “Anonymous and Publicly Linkable Reputation Systems.” <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i>, 2015, pp. 478--488, doi:<a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">10.1007/978-3-662-47854-7_29</a>.","ama":"Blömer J, Juhnke J, Kolb C. Anonymous and Publicly Linkable Reputation Systems. In: <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i>. LNCS. ; 2015:478--488. doi:<a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">10.1007/978-3-662-47854-7_29</a>","bibtex":"@inproceedings{Blömer_Juhnke_Kolb_2015, series={LNCS}, title={Anonymous and Publicly Linkable Reputation Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">10.1007/978-3-662-47854-7_29</a>}, 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} }"},"file_date_updated":"2018-03-20T07:39:54Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"oa":"1","status":"public","has_accepted_license":"1","_id":"322","page":"478--488","ddc":["040"],"user_id":"48090","publication":"Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)","abstract":[{"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.","lang":"eng"}],"date_created":"2017-10-17T12:41:54Z","file":[{"date_created":"2018-03-20T07:39:54Z","creator":"florida","file_id":"1431","success":1,"content_type":"application/pdf","file_name":"322-546_01.pdf","file_size":499568,"access_level":"closed","relation":"main_file","date_updated":"2018-03-20T07:39:54Z"}],"department":[{"_id":"64"}],"type":"conference","author":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"},{"last_name":"Juhnke","first_name":"Jakob","full_name":"Juhnke, Jakob","id":"48090"},{"first_name":"Christina","last_name":"Kolb","full_name":"Kolb, Christina","id":"43647"}],"year":"2015","title":"Anonymous and Publicly Linkable Reputation Systems","date_updated":"2022-01-06T06:59:05Z","series_title":"LNCS","main_file_link":[{"url":"https://eprint.iacr.org/2014/546","open_access":"1"}],"doi":"10.1007/978-3-662-47854-7_29"},{"year":"2015","title":"An approach towards adaptive service composition in markets of composed services","author":[{"full_name":"Jungmann, Alexander","first_name":"Alexander","last_name":"Jungmann"},{"last_name":"Mohr","first_name":"Felix","full_name":"Mohr, Felix"}],"date_updated":"2022-01-06T06:59:06Z","language":[{"iso":"eng"}],"doi":"10.1186/s13174-015-0022-8","issue":"1","publication":"Journal of Internet Services and Applications","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."}],"file":[{"creator":"florida","date_created":"2018-03-20T07:39:17Z","file_name":"323-An_approach_towards_adaptive_service_composition_in_markets_of_composed_services.pdf","file_size":2842281,"access_level":"closed","relation":"main_file","date_updated":"2018-03-20T07:39:17Z","file_id":"1429","content_type":"application/pdf","success":1}],"date_created":"2017-10-17T12:41:55Z","type":"journal_article","department":[{"_id":"355"}],"status":"public","has_accepted_license":"1","page":"1-18","_id":"323","publisher":"Springer","ddc":["040"],"user_id":"477","file_date_updated":"2018-03-20T07:39:17Z","citation":{"ama":"Jungmann A, Mohr F. An approach towards adaptive service composition in markets of composed services. <i>Journal of Internet Services and Applications</i>. 2015;(1):1-18. doi:<a href=\"https://doi.org/10.1186/s13174-015-0022-8\">10.1186/s13174-015-0022-8</a>","short":"A. Jungmann, F. Mohr, Journal of Internet Services and Applications (2015) 1–18.","chicago":"Jungmann, Alexander, and Felix Mohr. “An Approach towards Adaptive Service Composition in Markets of Composed Services.” <i>Journal of Internet Services and Applications</i>, no. 1 (2015): 1–18. <a href=\"https://doi.org/10.1186/s13174-015-0022-8\">https://doi.org/10.1186/s13174-015-0022-8</a>.","bibtex":"@article{Jungmann_Mohr_2015, title={An approach towards adaptive service composition in markets of composed services}, DOI={<a href=\"https://doi.org/10.1186/s13174-015-0022-8\">10.1186/s13174-015-0022-8</a>}, number={1}, journal={Journal of Internet Services and Applications}, publisher={Springer}, author={Jungmann, Alexander and Mohr, Felix}, year={2015}, pages={1–18} }","mla":"Jungmann, Alexander, and Felix Mohr. “An Approach towards Adaptive Service Composition in Markets of Composed Services.” <i>Journal of Internet Services and Applications</i>, no. 1, Springer, 2015, pp. 1–18, doi:<a href=\"https://doi.org/10.1186/s13174-015-0022-8\">10.1186/s13174-015-0022-8</a>.","apa":"Jungmann, A., &#38; Mohr, F. (2015). An approach towards adaptive service composition in markets of composed services. <i>Journal of Internet Services and Applications</i>, (1), 1–18. <a href=\"https://doi.org/10.1186/s13174-015-0022-8\">https://doi.org/10.1186/s13174-015-0022-8</a>","ieee":"A. Jungmann and F. Mohr, “An approach towards adaptive service composition in markets of composed services,” <i>Journal of Internet Services and Applications</i>, no. 1, pp. 1–18, 2015."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"_id":"3","name":"SFB 901 - Project Area B"}]},{"file":[{"creator":"florida","date_created":"2018-03-20T07:38:44Z","relation":"main_file","date_updated":"2018-03-20T07:38:44Z","file_name":"324-ICSR-Mohr-15.pdf","file_size":569475,"access_level":"closed","file_id":"1428","content_type":"application/pdf","success":1}],"date_created":"2017-10-17T12:41:55Z","type":"conference","department":[{"_id":"355"}],"publication":"Proceedings of the 14th International Conference on Software Reuse (ICSR)","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."}],"language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-319-14130-5_21","title":"A Metric for Functional Reusability of Services","year":"2015","author":[{"full_name":"Mohr, Felix","last_name":"Mohr","first_name":"Felix"}],"date_updated":"2022-01-06T06:59:07Z","file_date_updated":"2018-03-20T07:38:44Z","citation":{"ama":"Mohr F. A Metric for Functional Reusability of Services. In: <i>Proceedings of the 14th International Conference on Software Reuse (ICSR)</i>. LNCS. ; 2015:298--313. doi:<a href=\"https://doi.org/10.1007/978-3-319-14130-5_21\">10.1007/978-3-319-14130-5_21</a>","bibtex":"@inproceedings{Mohr_2015, series={LNCS}, title={A Metric for Functional Reusability of Services}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-14130-5_21\">10.1007/978-3-319-14130-5_21</a>}, booktitle={Proceedings of the 14th International Conference on Software Reuse (ICSR)}, author={Mohr, Felix}, year={2015}, pages={298--313}, collection={LNCS} }","mla":"Mohr, Felix. “A Metric for Functional Reusability of Services.” <i>Proceedings of the 14th International Conference on Software Reuse (ICSR)</i>, 2015, pp. 298--313, doi:<a href=\"https://doi.org/10.1007/978-3-319-14130-5_21\">10.1007/978-3-319-14130-5_21</a>.","short":"F. Mohr, in: Proceedings of the 14th International Conference on Software Reuse (ICSR), 2015, pp. 298--313.","chicago":"Mohr, Felix. “A Metric for Functional Reusability of Services.” In <i>Proceedings of the 14th International Conference on Software Reuse (ICSR)</i>, 298--313. LNCS, 2015. <a href=\"https://doi.org/10.1007/978-3-319-14130-5_21\">https://doi.org/10.1007/978-3-319-14130-5_21</a>.","apa":"Mohr, F. (2015). A Metric for Functional Reusability of Services. In <i>Proceedings of the 14th International Conference on Software Reuse (ICSR)</i> (pp. 298--313). <a href=\"https://doi.org/10.1007/978-3-319-14130-5_21\">https://doi.org/10.1007/978-3-319-14130-5_21</a>","ieee":"F. Mohr, “A Metric for Functional Reusability of Services,” in <i>Proceedings of the 14th International Conference on Software Reuse (ICSR)</i>, 2015, pp. 298--313."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"name":"SFB 901 - Project Area B","_id":"3"}],"page":"298--313","_id":"324","ddc":["040"],"user_id":"477","status":"public","has_accepted_license":"1"},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"related_material":{"record":[{"relation":"other","id":"253","status":"public"}]},"citation":{"ieee":"N. Löken, <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn, 2015.","apa":"Löken, N. (2015). <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn.","short":"N. Löken, A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption, Universität Paderborn, 2015.","chicago":"Löken, Nils. <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn, 2015.","mla":"Löken, Nils. <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn, 2015.","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} }","ama":"Löken N. <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn; 2015."},"supervisor":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}],"department":[{"_id":"64"}],"type":"mastersthesis","date_created":"2017-10-17T12:41:55Z","date_updated":"2022-01-06T06:59:07Z","author":[{"full_name":"Löken, Nils","last_name":"Löken","first_name":"Nils","id":"13703"}],"title":"A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption","year":"2015","status":"public","user_id":"477","_id":"325","publisher":"Universität Paderborn"},{"_id":"326","publisher":"Universität Paderborn","user_id":"477","status":"public","title":"A group signature scheme based on the LSRW assumption","year":"2015","author":[{"first_name":"Frederic","last_name":"Heihoff","full_name":"Heihoff, Frederic"}],"date_updated":"2022-01-06T06:59:07Z","date_created":"2017-10-17T12:41:55Z","type":"bachelorsthesis","department":[{"_id":"64"}],"supervisor":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"}],"citation":{"short":"F. Heihoff, A Group Signature Scheme Based on the LSRW Assumption, Universität Paderborn, 2015.","chicago":"Heihoff, Frederic. <i>A Group Signature Scheme Based on the LSRW Assumption</i>. Universität Paderborn, 2015.","ieee":"F. Heihoff, <i>A group signature scheme based on the LSRW assumption</i>. Universität Paderborn, 2015.","apa":"Heihoff, F. (2015). <i>A group signature scheme based on the LSRW assumption</i>. 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} }","ama":"Heihoff F. <i>A Group Signature Scheme Based on the LSRW Assumption</i>. Universität Paderborn; 2015.","mla":"Heihoff, Frederic. <i>A Group Signature Scheme Based on the LSRW Assumption</i>. Universität Paderborn, 2015."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}]},{"status":"public","has_accepted_license":"1","publisher":"Elsevier","_id":"327","page":"67-79","user_id":"477","ddc":["040"],"citation":{"chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” <i>Theoretical Computer Science</i>, 2015, 67–79. <a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">https://doi.org/10.1016/j.tcs.2014.11.027</a>.","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theoretical Computer Science (2015) 67–79.","apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2015). A deterministic worst-case message complexity optimal solution for resource discovery. <i>Theoretical Computer Science</i>, 67–79. <a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">https://doi.org/10.1016/j.tcs.2014.11.027</a>","ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A deterministic worst-case message complexity optimal solution for resource discovery,” <i>Theoretical Computer Science</i>, pp. 67–79, 2015.","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. A deterministic worst-case message complexity optimal solution for resource discovery. <i>Theoretical Computer Science</i>. 2015:67-79. doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">10.1016/j.tcs.2014.11.027</a>","bibtex":"@article{Kniesburges_Koutsopoulos_Scheideler_2015, title={A deterministic worst-case message complexity optimal solution for resource discovery}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">10.1016/j.tcs.2014.11.027</a>}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2015}, pages={67–79} }","mla":"Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” <i>Theoretical Computer Science</i>, Elsevier, 2015, pp. 67–79, doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">10.1016/j.tcs.2014.11.027</a>."},"file_date_updated":"2018-03-20T07:38:02Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"author":[{"first_name":"Sebastian","last_name":"Kniesburges","full_name":"Kniesburges, Sebastian"},{"last_name":"Koutsopoulos","first_name":"Andreas","full_name":"Koutsopoulos, Andreas"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"title":"A deterministic worst-case message complexity optimal solution for resource discovery","year":"2015","date_updated":"2022-01-06T06:59:08Z","doi":"10.1016/j.tcs.2014.11.027","publication":"Theoretical Computer Science","abstract":[{"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.","lang":"eng"}],"date_created":"2017-10-17T12:41:55Z","file":[{"date_created":"2018-03-20T07:38:02Z","creator":"florida","content_type":"application/pdf","success":1,"file_id":"1427","date_updated":"2018-03-20T07:38:02Z","relation":"main_file","file_size":398044,"access_level":"closed","file_name":"327-KKS15-TOCS_01.pdf"}],"department":[{"_id":"79"}],"type":"journal_article"},{"publisher":"Universität Paderborn","_id":"3364","language":[{"iso":"ger"}],"user_id":"477","title":"Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten","status":"public","year":"2015","author":[{"last_name":"Knorr","first_name":"Christoph","full_name":"Knorr, Christoph"}],"date_updated":"2022-01-06T06:59:13Z","date_created":"2018-06-26T14:06:07Z","type":"bachelorsthesis","department":[{"_id":"78"}],"supervisor":[{"last_name":"Lösch","first_name":"Achim","full_name":"Lösch, Achim","id":"43646"},{"id":"398","first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco"}],"citation":{"short":"C. Knorr, Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten, Universität Paderborn, 2015.","chicago":"Knorr, Christoph. <i>Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten</i>. Universität Paderborn, 2015.","apa":"Knorr, C. (2015). <i>Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten</i>. Universität Paderborn.","ieee":"C. Knorr, <i>Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten</i>. Universität Paderborn, 2015.","ama":"Knorr C. <i>Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten</i>. Universität Paderborn; 2015.","bibtex":"@book{Knorr_2015, title={Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten}, publisher={Universität Paderborn}, author={Knorr, Christoph}, year={2015} }","mla":"Knorr, Christoph. <i>Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten</i>. Universität Paderborn, 2015."},"project":[{"_id":"14","name":"SFB 901 - Subproject C2"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"}]},{"publication":"Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing","citation":{"mla":"Wachsmuth, Henning, et al. “Sentiment Flow - A General Model of Web Review Argumentation.” <i>Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing</i>, edited by Junichi Tsujii and Jan Hajic, 2015, pp. 601–11, doi:<a href=\"https://doi.org/10.18653/v1/D15-1072\">10.18653/v1/D15-1072</a>.","ama":"Wachsmuth H, Kiesel J, Stein B. Sentiment Flow - A General Model of Web Review Argumentation. In: Tsujii J, Hajic J, eds. <i>Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing</i>. Lecture Notes in Computer Science. ; 2015:601-611. doi:<a href=\"https://doi.org/10.18653/v1/D15-1072\">10.18653/v1/D15-1072</a>","bibtex":"@inproceedings{Wachsmuth_Kiesel_Stein_2015, series={Lecture Notes in Computer Science}, title={Sentiment Flow - A General Model of Web Review Argumentation}, DOI={<a href=\"https://doi.org/10.18653/v1/D15-1072\">10.18653/v1/D15-1072</a>}, 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} }","apa":"Wachsmuth, H., Kiesel, J., &#38; Stein, B. (2015). Sentiment Flow - A General Model of Web Review Argumentation. In J. Tsujii &#38; J. Hajic (Eds.), <i>Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing</i> (pp. 601–611). <a href=\"https://doi.org/10.18653/v1/D15-1072\">https://doi.org/10.18653/v1/D15-1072</a>","ieee":"H. Wachsmuth, J. Kiesel, and B. Stein, “Sentiment Flow - A General Model of Web Review Argumentation,” in <i>Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing</i>, 2015, pp. 601–611.","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.","chicago":"Wachsmuth, Henning, Johannes Kiesel, and Benno Stein. “Sentiment Flow - A General Model of Web Review Argumentation.” In <i>Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing</i>, edited by Junichi Tsujii and Jan Hajic, 601–11. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.18653/v1/D15-1072\">https://doi.org/10.18653/v1/D15-1072</a>."},"date_created":"2018-08-02T13:38:41Z","type":"conference","department":[{"_id":"600"}],"year":"2015","status":"public","title":"Sentiment Flow - A General Model of Web Review Argumentation","author":[{"id":"3900","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning"},{"first_name":"Johannes","last_name":"Kiesel","full_name":"Kiesel, Johannes"},{"first_name":"Benno","last_name":"Stein","full_name":"Stein, Benno"}],"publication_identifier":{"isbn":["978-3-319-25740-2"]},"date_updated":"2022-01-06T06:59:37Z","page":"601-611","main_file_link":[{"url":"https://www.aclweb.org/anthology/D15-1072.pdf"}],"language":[{"iso":"eng"}],"_id":"3815","series_title":"Lecture Notes in Computer Science","user_id":"82920","doi":"10.18653/v1/D15-1072","editor":[{"first_name":"Junichi","last_name":"Tsujii","full_name":"Tsujii, Junichi"},{"first_name":"Jan","last_name":"Hajic","full_name":"Hajic, Jan"}]},{"citation":{"bibtex":"@book{Wachsmuth_2015, series={Lecture Notes in Computer Science}, title={Text Analysis Pipelines - Towards Ad-hoc Large-scale Text Mining}, DOI={<a href=\"http://dx.doi.org/10.1007/978-3-319-25741-9\">http://dx.doi.org/10.1007/978-3-319-25741-9</a>}, author={Wachsmuth, Henning}, year={2015}, collection={Lecture Notes in Computer Science} }","ama":"Wachsmuth H. <i>Text Analysis Pipelines - Towards Ad-Hoc Large-Scale Text Mining</i>.; 2015. doi:<a href=\"http://dx.doi.org/10.1007/978-3-319-25741-9\">http://dx.doi.org/10.1007/978-3-319-25741-9</a>","mla":"Wachsmuth, Henning. <i>Text Analysis Pipelines - Towards Ad-Hoc Large-Scale Text Mining</i>. 2015, doi:<a href=\"http://dx.doi.org/10.1007/978-3-319-25741-9\">http://dx.doi.org/10.1007/978-3-319-25741-9</a>.","short":"H. Wachsmuth, Text Analysis Pipelines - Towards Ad-Hoc Large-Scale Text Mining, 2015.","chicago":"Wachsmuth, Henning. <i>Text Analysis Pipelines - Towards Ad-Hoc Large-Scale Text Mining</i>. Lecture Notes in Computer Science, 2015. <a href=\"http://dx.doi.org/10.1007/978-3-319-25741-9\">http://dx.doi.org/10.1007/978-3-319-25741-9</a>.","ieee":"H. Wachsmuth, <i>Text Analysis Pipelines - Towards Ad-hoc Large-scale Text Mining</i>. 2015.","apa":"Wachsmuth, H. (2015). <i>Text Analysis Pipelines - Towards Ad-hoc Large-scale Text Mining</i>. <a href=\"http://dx.doi.org/10.1007/978-3-319-25741-9\">http://dx.doi.org/10.1007/978-3-319-25741-9</a>"},"date_created":"2018-08-11T16:15:08Z","department":[{"_id":"600"}],"type":"book","publication_identifier":{"isbn":["978-3-319-25740-2"]},"author":[{"id":"3900","first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning"}],"title":"Text Analysis Pipelines - Towards Ad-hoc Large-scale Text Mining","status":"public","year":"2015","date_updated":"2022-01-06T06:59:47Z","series_title":"Lecture Notes in Computer Science","_id":"3879","language":[{"iso":"eng"}],"doi":"http://dx.doi.org/10.1007/978-3-319-25741-9","user_id":"82920"},{"file_date_updated":"2018-03-21T09:22:03Z","citation":{"bibtex":"@article{Besova_Steenken_Wehrheim_2015, title={Grammar-based model transformations: Definition, execution, and quality properties}, DOI={<a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">10.1016/j.cl.2015.05.003</a>}, journal={Computer Languages, Systems &#38; Structures}, publisher={Elsevier}, author={Besova, Galina and Steenken, Dominik and Wehrheim, Heike}, year={2015}, pages={116–138} }","ama":"Besova G, Steenken D, Wehrheim H. Grammar-based model transformations: Definition, execution, and quality properties. <i>Computer Languages, Systems &#38; Structures</i>. 2015:116-138. doi:<a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">10.1016/j.cl.2015.05.003</a>","mla":"Besova, Galina, et al. “Grammar-Based Model Transformations: Definition, Execution, and Quality Properties.” <i>Computer Languages, Systems &#38; Structures</i>, Elsevier, 2015, pp. 116–38, doi:<a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">10.1016/j.cl.2015.05.003</a>.","short":"G. Besova, D. Steenken, H. Wehrheim, Computer Languages, Systems &#38; Structures (2015) 116–138.","chicago":"Besova, Galina, Dominik Steenken, and Heike Wehrheim. “Grammar-Based Model Transformations: Definition, Execution, and Quality Properties.” <i>Computer Languages, Systems &#38; Structures</i>, 2015, 116–38. <a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">https://doi.org/10.1016/j.cl.2015.05.003</a>.","ieee":"G. Besova, D. Steenken, and H. Wehrheim, “Grammar-based model transformations: Definition, execution, and quality properties,” <i>Computer Languages, Systems &#38; Structures</i>, pp. 116–138, 2015.","apa":"Besova, G., Steenken, D., &#38; Wehrheim, H. (2015). Grammar-based model transformations: Definition, execution, and quality properties. <i>Computer Languages, Systems &#38; Structures</i>, 116–138. <a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">https://doi.org/10.1016/j.cl.2015.05.003</a>"},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"page":"116-138","_id":"290","publisher":"Elsevier","user_id":"477","ddc":["040"],"status":"public","has_accepted_license":"1","file":[{"creator":"florida","date_created":"2018-03-21T09:22:03Z","file_name":"290-BSW15-main.pdf","access_level":"closed","file_size":1329478,"relation":"main_file","date_updated":"2018-03-21T09:22:03Z","file_id":"1464","content_type":"application/pdf","success":1}],"date_created":"2017-10-17T12:41:48Z","type":"journal_article","department":[{"_id":"77"}],"publication":"Computer Languages, Systems & Structures","abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"doi":"10.1016/j.cl.2015.05.003","title":"Grammar-based model transformations: Definition, execution, and quality properties","year":"2015","author":[{"last_name":"Besova","first_name":"Galina","full_name":"Besova, Galina"},{"first_name":"Dominik","last_name":"Steenken","full_name":"Steenken, Dominik"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"date_updated":"2022-01-06T06:58:43Z"},{"extern":"1","publication":"Lecture Notes in Computer Science","type":"book_chapter","department":[{"_id":"558"}],"date_created":"2018-05-25T12:46:08Z","date_updated":"2022-01-06T06:58:47Z","publication_status":"published","year":"2015","title":"Tightly-Secure Signatures from Chameleon Hash Functions","author":[{"last_name":"Blazy","first_name":"Olivier","full_name":"Blazy, Olivier"},{"id":"66268","full_name":"Kakvi, Saqib","first_name":"Saqib","last_name":"Kakvi"},{"last_name":"Kiltz","first_name":"Eike","full_name":"Kiltz, Eike"},{"last_name":"Pan","first_name":"Jiaxin","full_name":"Pan, Jiaxin"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783662464465","9783662464472"]},"doi":"10.1007/978-3-662-46447-2_12","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2014/1021.pdf"}],"citation":{"mla":"Blazy, Olivier, et al. “Tightly-Secure Signatures from Chameleon Hash Functions.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2015, pp. 256–79, doi:<a href=\"https://doi.org/10.1007/978-3-662-46447-2_12\">10.1007/978-3-662-46447-2_12</a>.","bibtex":"@inbook{Blazy_Kakvi_Kiltz_Pan_2015, place={Berlin, Heidelberg}, title={Tightly-Secure Signatures from Chameleon Hash Functions}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-46447-2_12\">10.1007/978-3-662-46447-2_12</a>}, 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} }","ama":"Blazy O, Kakvi S, Kiltz E, Pan J. Tightly-Secure Signatures from Chameleon Hash Functions. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2015:256-279. doi:<a href=\"https://doi.org/10.1007/978-3-662-46447-2_12\">10.1007/978-3-662-46447-2_12</a>","ieee":"O. Blazy, S. Kakvi, E. Kiltz, and J. Pan, “Tightly-Secure Signatures from Chameleon Hash Functions,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2015, pp. 256–279.","apa":"Blazy, O., Kakvi, S., Kiltz, E., &#38; Pan, J. (2015). Tightly-Secure Signatures from Chameleon Hash Functions. In <i>Lecture Notes in Computer Science</i> (pp. 256–279). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-662-46447-2_12\">https://doi.org/10.1007/978-3-662-46447-2_12</a>","short":"O. Blazy, S. Kakvi, E. Kiltz, J. Pan, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2015, pp. 256–279.","chicago":"Blazy, Olivier, Saqib Kakvi, Eike Kiltz, and Jiaxin Pan. “Tightly-Secure Signatures from Chameleon Hash Functions.” In <i>Lecture Notes in Computer Science</i>, 256–79. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. <a href=\"https://doi.org/10.1007/978-3-662-46447-2_12\">https://doi.org/10.1007/978-3-662-46447-2_12</a>."},"oa":"1","place":"Berlin, Heidelberg","status":"public","user_id":"66268","page":"256-279","_id":"2921","publisher":"Springer Berlin Heidelberg"},{"author":[{"full_name":"Sosniak, Martin","first_name":"Martin","last_name":"Sosniak"}],"status":"public","title":"Evaluation of Pairing Optimization for Embedded Platforms","year":"2015","date_updated":"2022-01-06T06:58:49Z","_id":"297","publisher":"Universität Paderborn","user_id":"25078","supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"}],"citation":{"apa":"Sosniak, M. (2015). <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn.","ieee":"M. Sosniak, <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn, 2015.","short":"M. Sosniak, Evaluation of Pairing Optimization for Embedded Platforms, Universität Paderborn, 2015.","chicago":"Sosniak, Martin. <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn, 2015.","mla":"Sosniak, Martin. <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn, 2015.","ama":"Sosniak M. <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn; 2015.","bibtex":"@book{Sosniak_2015, title={Evaluation of Pairing Optimization for Embedded Platforms}, publisher={Universität Paderborn}, author={Sosniak, Martin}, year={2015} }"},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"43","name":"Securing the Financial Cloud"}],"date_created":"2017-10-17T12:41:50Z","department":[{"_id":"64"}],"type":"mastersthesis"}]