[{"publication":"Human and Computer 2015 - Proceedings","type":"conference","status":"public","abstract":[{"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","lang":"eng"}],"department":[{"_id":"71"}],"user_id":"71124","_id":"26536","language":[{"iso":"eng"}],"publication_status":"published","page":"173-182","citation":{"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.","short":"C. Schild, V. Petrausch, in: Human and Computer 2015 - Proceedings, De Gruyter Oldenbourg, Berlin, 2015, pp. 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} }","apa":"Schild, C., &#38; Petrausch, V. (2015). Empirical validation of design patterns. <i>Human and Computer 2015 - Proceedings</i>, 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.","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."},"year":"2015","place":"Berlin","author":[{"first_name":"Christian","last_name":"Schild","full_name":"Schild, Christian"},{"first_name":"Vanessa","full_name":"Petrausch, Vanessa","last_name":"Petrausch"}],"date_created":"2021-10-19T14:28:44Z","date_updated":"2022-01-06T06:57:22Z","publisher":"De Gruyter Oldenbourg","title":"Empirical validation of design patterns"},{"user_id":"15504","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"266","file_date_updated":"2018-03-21T09:33:11Z","ddc":["040"],"type":"conference","publication":"Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)","file":[{"date_created":"2018-03-21T09:33:11Z","creator":"florida","date_updated":"2018-03-21T09:33:11Z","file_name":"266-p343-markarian.pdf","file_id":"1478","access_level":"closed","file_size":679580,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","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"}],"author":[{"first_name":"Christine","full_name":"Markarian, Christine","id":"37612","last_name":"Markarian"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_created":"2017-10-17T12:41:44Z","date_updated":"2022-01-06T06:57:22Z","doi":"10.1145/2767386.2767454","title":"Online Resource Leasing","has_accepted_license":"1","citation":{"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>","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.","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>.","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} }","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.","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>.","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>"},"page":"343-344","year":"2015"},{"title":"Online Resource Leasing","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:57:26Z","date_created":"2017-10-17T12:41:44Z","author":[{"last_name":"Markarian","id":"37612","full_name":"Markarian, Christine","first_name":"Christine"}],"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"year":"2015","citation":{"ama":"Markarian C. <i>Online Resource Leasing</i>. Universität Paderborn; 2015.","ieee":"C. Markarian, <i>Online Resource Leasing</i>. Universität Paderborn, 2015.","chicago":"Markarian, Christine. <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} }","short":"C. Markarian, Online Resource Leasing, Universität Paderborn, 2015.","mla":"Markarian, Christine. <i>Online Resource Leasing</i>. Universität Paderborn, 2015.","apa":"Markarian, C. (2015). <i>Online Resource Leasing</i>. Universität Paderborn."},"has_accepted_license":"1","related_material":{"link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-16656","relation":"confirmation"}]},"ddc":["040"],"file_date_updated":"2018-03-21T09:33:41Z","language":[{"iso":"eng"}],"_id":"267","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"63"}],"user_id":"15415","status":"public","file":[{"date_created":"2018-03-21T09:33:41Z","creator":"florida","date_updated":"2018-03-21T09:33:41Z","file_id":"1479","file_name":"267-Dissertation_-_Markarian.pdf","access_level":"closed","file_size":1328685,"content_type":"application/pdf","relation":"main_file","success":1}],"type":"dissertation"},{"date_created":"2017-10-17T12:41:44Z","title":"On-The-Fly Verification of Reconfigurable Image Processing Modules based on a Proof-Carrying Hardware Approach","year":"2015","language":[{"iso":"eng"}],"ddc":["040"],"publication":"Proceedings of the International Symposium in Reconfigurable Computing (ARC)","file":[{"date_updated":"2018-03-21T09:32:42Z","date_created":"2018-03-21T09:32:42Z","creator":"florida","file_size":344309,"file_id":"1477","access_level":"closed","file_name":"269-paper_53.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"lang":"eng","text":"Proof-carrying hardware is an approach that has recently been proposed for the efficient verification of reconfigurable modules. We present an application of proof-carrying hardware to guarantee the correct functionality of dynamically reconfigured image processing modules. Our prototype comprises a reconfigurable-system-on-chip with an embedded virtual FPGA fabric. This setup allows us to leverage open source FPGA synthesis and backend tools to produce FPGA configuration bitstreams with an open format and, thus, to demonstrate and experimentally evaluate proof-carrying hardware at the bitstream level."}],"author":[{"first_name":"Tobias","full_name":"Wiersema, Tobias","id":"3118","last_name":"Wiersema"},{"first_name":"Sen","last_name":"Wu","full_name":"Wu, Sen"},{"last_name":"Platzner","full_name":"Platzner, Marco","id":"398","first_name":"Marco"}],"date_updated":"2022-01-06T06:57:30Z","doi":"10.1007/978-3-319-16214-0_32","has_accepted_license":"1","citation":{"ama":"Wiersema T, Wu S, Platzner M. On-The-Fly Verification of Reconfigurable Image Processing Modules based on a Proof-Carrying Hardware Approach. In: <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>","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.","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>","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>.","short":"T. Wiersema, S. Wu, M. Platzner, in: Proceedings of the International Symposium in Reconfigurable Computing (ARC), 2015, pp. 365--372."},"page":"365--372","series_title":"LNCS","user_id":"477","department":[{"_id":"78"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"269","file_date_updated":"2018-03-21T09:32:42Z","type":"conference","status":"public"},{"intvolume":"         3","citation":{"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} }","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>.","short":"I. Caragiannis, A. Fanelli, N. Gravin, A. Skopalik, Transactions on Economics and Computation 3 (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>","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>","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>.","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."},"has_accepted_license":"1","doi":"10.1145/2614687","date_updated":"2022-01-06T06:59:04Z","volume":3,"author":[{"first_name":"Ioannis","full_name":"Caragiannis, Ioannis","last_name":"Caragiannis"},{"last_name":"Fanelli","full_name":"Fanelli, Angelo","first_name":"Angelo"},{"last_name":"Gravin","full_name":"Gravin, Nick","first_name":"Nick"},{"last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384","first_name":"Alexander"}],"status":"public","type":"journal_article","article_number":"2","file_date_updated":"2018-03-20T07:40:55Z","_id":"320","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"},{"_id":"541"}],"user_id":"477","year":"2015","issue":"1","title":"Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure","publisher":"ACM","date_created":"2017-10-17T12:41:54Z","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_updated":"2018-03-20T07:40:55Z","date_created":"2018-03-20T07:40:55Z","creator":"florida","file_size":260503,"file_name":"320-a2-caragiannis.pdf","access_level":"closed","file_id":"1433","content_type":"application/pdf","success":1,"relation":"main_file"}],"publication":"Transactions on Economics and Computation","ddc":["040"],"language":[{"iso":"eng"}]},{"type":"mastersthesis","status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"1432","file_name":"321-eidens_masterthesis_01.pdf","file_size":879285,"creator":"florida","date_created":"2018-03-20T07:40:22Z","date_updated":"2018-03-20T07:40:22Z"}],"_id":"321","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"64"}],"user_id":"477","ddc":["040"],"file_date_updated":"2018-03-20T07:40:22Z","has_accepted_license":"1","year":"2015","citation":{"ama":"Eidens F. <i>Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption</i>. 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.","short":"F. Eidens, Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption, Universität Paderborn, 2015.","bibtex":"@book{Eidens_2015, title={Anonymous credential system based on q-Strong Diffie-Hellman Assumption}, publisher={Universität Paderborn}, author={Eidens, Fabian}, year={2015} }","mla":"Eidens, Fabian. <i>Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn, 2015."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:05Z","date_created":"2017-10-17T12:41:54Z","supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"author":[{"last_name":"Eidens","full_name":"Eidens, Fabian","id":"25078","first_name":"Fabian"}],"title":"Anonymous credential system based on q-Strong Diffie-Hellman Assumption"},{"citation":{"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>.","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} }","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>.","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>"},"page":"478--488","has_accepted_license":"1","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2014/546"}],"doi":"10.1007/978-3-662-47854-7_29","date_updated":"2022-01-06T06:59:05Z","oa":"1","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"},{"full_name":"Juhnke, Jakob","id":"48090","last_name":"Juhnke","first_name":"Jakob"},{"first_name":"Christina","last_name":"Kolb","full_name":"Kolb, Christina","id":"43647"}],"status":"public","type":"conference","file_date_updated":"2018-03-20T07:39:54Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"322","user_id":"48090","series_title":"LNCS","department":[{"_id":"64"}],"year":"2015","title":"Anonymous and Publicly Linkable Reputation Systems","date_created":"2017-10-17T12:41:54Z","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"}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-20T07:39:54Z","creator":"florida","date_updated":"2018-03-20T07:39:54Z","file_id":"1431","access_level":"closed","file_name":"322-546_01.pdf","file_size":499568}],"publication":"Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)","ddc":["040"]},{"issue":"1","year":"2015","publisher":"Springer","date_created":"2017-10-17T12:41:55Z","title":"An approach towards adaptive service composition in markets of composed services","publication":"Journal of Internet Services and Applications","abstract":[{"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.","lang":"eng"}],"file":[{"file_size":2842281,"file_id":"1429","access_level":"closed","file_name":"323-An_approach_towards_adaptive_service_composition_in_markets_of_composed_services.pdf","date_updated":"2018-03-20T07:39:17Z","creator":"florida","date_created":"2018-03-20T07:39:17Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"ddc":["040"],"language":[{"iso":"eng"}],"has_accepted_license":"1","citation":{"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>.","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.","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>","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>","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} }","short":"A. Jungmann, F. Mohr, Journal of Internet Services and Applications (2015) 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>."},"page":"1-18","date_updated":"2022-01-06T06:59:06Z","author":[{"full_name":"Jungmann, Alexander","last_name":"Jungmann","first_name":"Alexander"},{"last_name":"Mohr","full_name":"Mohr, Felix","first_name":"Felix"}],"doi":"10.1186/s13174-015-0022-8","type":"journal_article","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B2","_id":"10"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"323","user_id":"477","department":[{"_id":"355"}],"file_date_updated":"2018-03-20T07:39:17Z"},{"status":"public","type":"conference","file_date_updated":"2018-03-20T07:38:44Z","department":[{"_id":"355"}],"series_title":"LNCS","user_id":"477","_id":"324","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B2","_id":"10"},{"_id":"3","name":"SFB 901 - Project Area B"}],"page":"298--313","citation":{"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>","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>.","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.","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>"},"has_accepted_license":"1","doi":"10.1007/978-3-319-14130-5_21","author":[{"full_name":"Mohr, Felix","last_name":"Mohr","first_name":"Felix"}],"date_updated":"2022-01-06T06:59:07Z","file":[{"creator":"florida","date_created":"2018-03-20T07:38:44Z","date_updated":"2018-03-20T07:38:44Z","file_name":"324-ICSR-Mohr-15.pdf","access_level":"closed","file_id":"1428","file_size":569475,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"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.","lang":"eng"}],"publication":"Proceedings of the 14th International Conference on Software Reuse (ICSR)","language":[{"iso":"eng"}],"ddc":["040"],"year":"2015","title":"A Metric for Functional Reusability of Services","date_created":"2017-10-17T12:41:55Z"},{"date_created":"2017-10-17T12:41:55Z","supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"author":[{"first_name":"Nils","full_name":"Löken, Nils","id":"13703","last_name":"Löken"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:07Z","title":"A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption","related_material":{"record":[{"id":"253","relation":"other","status":"public"}]},"citation":{"chicago":"Löken, Nils. <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn, 2015.","ieee":"N. Löken, <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn, 2015.","ama":"Löken N. <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.","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} }"},"year":"2015","user_id":"477","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"325","type":"mastersthesis","status":"public"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"326","user_id":"477","department":[{"_id":"64"}],"type":"bachelorsthesis","status":"public","date_updated":"2022-01-06T06:59:07Z","publisher":"Universität Paderborn","author":[{"last_name":"Heihoff","full_name":"Heihoff, Frederic","first_name":"Frederic"}],"date_created":"2017-10-17T12:41:55Z","supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"title":"A group signature scheme based on the LSRW assumption","year":"2015","citation":{"ama":"Heihoff F. <i>A Group Signature Scheme Based on the LSRW Assumption</i>. 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} }","short":"F. Heihoff, A Group Signature Scheme Based on the LSRW Assumption, Universität Paderborn, 2015.","mla":"Heihoff, Frederic. <i>A Group Signature Scheme Based on the LSRW Assumption</i>. Universität Paderborn, 2015."}},{"page":"67-79","citation":{"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>","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theoretical Computer Science (2015) 67–79.","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>.","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>.","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>"},"year":"2015","has_accepted_license":"1","doi":"10.1016/j.tcs.2014.11.027","title":"A deterministic worst-case message complexity optimal solution for resource discovery","author":[{"full_name":"Kniesburges, Sebastian","last_name":"Kniesburges","first_name":"Sebastian"},{"first_name":"Andreas","full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2017-10-17T12:41:55Z","date_updated":"2022-01-06T06:59:08Z","publisher":"Elsevier","status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-20T07:38:02Z","creator":"florida","date_created":"2018-03-20T07:38:02Z","file_size":398044,"access_level":"closed","file_name":"327-KKS15-TOCS_01.pdf","file_id":"1427"}],"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"}],"publication":"Theoretical Computer Science","type":"journal_article","file_date_updated":"2018-03-20T07:38:02Z","ddc":["040"],"department":[{"_id":"79"}],"user_id":"477","_id":"327","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"publication":"Artificial Intelligence","type":"journal_article","abstract":[{"text":"In this paper we consider an extended variant of query learning where the hidden concept is embedded in some Boolean circuit. This additional processing layer modifies query arguments and answers by fixed transformation functions which are known to the learner. For this scenario, we provide a characterization of the solution space and an ordering on it. We give a compact representation of the minimal and maximal solutions as quantified Boolean formulas and we adapt the original algorithms for exact learning of specific classes of propositional formulas.","lang":"eng"}],"status":"public","_id":"3343","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"department":[{"_id":"34"}],"user_id":"315","keyword":["Query learning","Propositional logic"],"ddc":["000"],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0004-3702"]},"year":"2015","page":"246 - 257","citation":{"apa":"Bubeck, U., &#38; Kleine Büning, H. (2015). Learning Boolean Specifications. <i>Artificial Intelligence</i>, 246–257. <a href=\"https://doi.org/10.1016/j.artint.2015.09.003\">https://doi.org/10.1016/j.artint.2015.09.003</a>","bibtex":"@article{Bubeck_Kleine Büning_2015, title={Learning Boolean Specifications}, DOI={<a href=\"https://doi.org/10.1016/j.artint.2015.09.003\">10.1016/j.artint.2015.09.003</a>}, journal={Artificial Intelligence}, publisher={Elsevier}, author={Bubeck, Uwe and Kleine Büning, Hans}, year={2015}, pages={246–257} }","mla":"Bubeck, Uwe, and Hans Kleine Büning. “Learning Boolean Specifications.” <i>Artificial Intelligence</i>, Elsevier, 2015, pp. 246–57, doi:<a href=\"https://doi.org/10.1016/j.artint.2015.09.003\">10.1016/j.artint.2015.09.003</a>.","short":"U. Bubeck, H. Kleine Büning, Artificial Intelligence (2015) 246–257.","ieee":"U. Bubeck and H. Kleine Büning, “Learning Boolean Specifications,” <i>Artificial Intelligence</i>, pp. 246–257, 2015.","chicago":"Bubeck, Uwe, and Hans Kleine Büning. “Learning Boolean Specifications.” <i>Artificial Intelligence</i>, 2015, 246–57. <a href=\"https://doi.org/10.1016/j.artint.2015.09.003\">https://doi.org/10.1016/j.artint.2015.09.003</a>.","ama":"Bubeck U, Kleine Büning H. Learning Boolean Specifications. <i>Artificial Intelligence</i>. 2015:246-257. doi:<a href=\"https://doi.org/10.1016/j.artint.2015.09.003\">10.1016/j.artint.2015.09.003</a>"},"date_updated":"2022-01-06T06:59:10Z","publisher":"Elsevier","date_created":"2018-06-25T10:43:19Z","author":[{"full_name":"Bubeck, Uwe","last_name":"Bubeck","first_name":"Uwe"},{"last_name":"Kleine Büning","full_name":"Kleine Büning, Hans","first_name":"Hans"}],"title":"Learning Boolean Specifications","doi":"10.1016/j.artint.2015.09.003"},{"citation":{"ama":"Knorr C. <i>Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten</i>. Universität Paderborn; 2015.","chicago":"Knorr, Christoph. <i>Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten</i>. Universität Paderborn, 2015.","ieee":"C. Knorr, <i>Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten</i>. Universität Paderborn, 2015.","mla":"Knorr, Christoph. <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} }","short":"C. Knorr, Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten, Universität Paderborn, 2015.","apa":"Knorr, C. (2015). <i>Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten</i>. Universität Paderborn."},"year":"2015","author":[{"full_name":"Knorr, Christoph","last_name":"Knorr","first_name":"Christoph"}],"date_created":"2018-06-26T14:06:07Z","supervisor":[{"id":"43646","full_name":"Lösch, Achim","last_name":"Lösch","first_name":"Achim"},{"full_name":"Platzner, Marco","id":"398","last_name":"Platzner","first_name":"Marco"}],"date_updated":"2022-01-06T06:59:13Z","publisher":"Universität Paderborn","title":"Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten","type":"bachelorsthesis","status":"public","user_id":"477","department":[{"_id":"78"}],"project":[{"_id":"14","name":"SFB 901 - Subproject C2"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"3364","language":[{"iso":"ger"}]},{"editor":[{"first_name":"Junichi","full_name":"Tsujii, Junichi","last_name":"Tsujii"},{"full_name":"Hajic, Jan","last_name":"Hajic","first_name":"Jan"}],"status":"public","type":"conference","publication":"Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing","language":[{"iso":"eng"}],"_id":"3815","user_id":"82920","series_title":"Lecture Notes in Computer Science","department":[{"_id":"600"}],"year":"2015","citation":{"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>","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.","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>.","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>","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.","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>.","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} }"},"page":"601-611","publication_identifier":{"isbn":["978-3-319-25740-2"]},"title":"Sentiment Flow - A General Model of Web Review Argumentation","main_file_link":[{"url":"https://www.aclweb.org/anthology/D15-1072.pdf"}],"doi":"10.18653/v1/D15-1072","date_updated":"2022-01-06T06:59:37Z","date_created":"2018-08-02T13:38:41Z","author":[{"full_name":"Wachsmuth, Henning","id":"3900","last_name":"Wachsmuth","first_name":"Henning"},{"last_name":"Kiesel","full_name":"Kiesel, Johannes","first_name":"Johannes"},{"first_name":"Benno","full_name":"Stein, Benno","last_name":"Stein"}]},{"year":"2015","title":"Planar prism spectrometer based on adiabatically connected waveguiding slabs","date_created":"2018-08-08T10:27:57Z","publisher":"Elsevier BV","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1542539,"file_id":"3846","access_level":"closed","file_name":"2016  Hammer_Planar prism spectrometer based on adiabatically connected waveguiding slabs.pdf","date_updated":"2018-08-08T10:31:23Z","date_created":"2018-08-08T10:31:23Z","creator":"hclaudia"}],"abstract":[{"lang":"eng","text":"The device principle of a prism-based on-chip spectrometer for TE polarization is introduced. The spectrometer exploits the modal dispersion in planar waveguides in a layout with slab regions having two different thicknesses of the guiding layer. The set-up uses parabolic mirrors, for the collimation of light of the input waveguide and focusing of the light to the receiver waveguides, which relies on total internal reflection at the interface between two such regions. These regions are connected adiabatically to prevent unwanted mode conversion and loss at the edges of the prism. The structure can be fabricated with two wet etching steps. The paper presents basic theory and a general approach for device optimization. The latter is illustrated with a numerical example assuming SiON technology."}],"publication":"Optics Communications","language":[{"iso":"eng"}],"ddc":["530"],"keyword":["tet_topic_waveguide"],"citation":{"apa":"Civitci, F., Hammer, M., &#38; Hoekstra, H. J. W. M. (2015). Planar prism spectrometer based on adiabatically connected waveguiding slabs. <i>Optics Communications</i>, <i>365</i>, 29–37. <a href=\"https://doi.org/10.1016/j.optcom.2015.11.066\">https://doi.org/10.1016/j.optcom.2015.11.066</a>","bibtex":"@article{Civitci_Hammer_Hoekstra_2015, title={Planar prism spectrometer based on adiabatically connected waveguiding slabs}, volume={365}, DOI={<a href=\"https://doi.org/10.1016/j.optcom.2015.11.066\">10.1016/j.optcom.2015.11.066</a>}, journal={Optics Communications}, publisher={Elsevier BV}, author={Civitci, F. and Hammer, Manfred and Hoekstra, H.J.W.M.}, year={2015}, pages={29–37} }","mla":"Civitci, F., et al. “Planar Prism Spectrometer Based on Adiabatically Connected Waveguiding Slabs.” <i>Optics Communications</i>, vol. 365, Elsevier BV, 2015, pp. 29–37, doi:<a href=\"https://doi.org/10.1016/j.optcom.2015.11.066\">10.1016/j.optcom.2015.11.066</a>.","short":"F. Civitci, M. Hammer, H.J.W.M. Hoekstra, Optics Communications 365 (2015) 29–37.","chicago":"Civitci, F., Manfred Hammer, and H.J.W.M. Hoekstra. “Planar Prism Spectrometer Based on Adiabatically Connected Waveguiding Slabs.” <i>Optics Communications</i> 365 (2015): 29–37. <a href=\"https://doi.org/10.1016/j.optcom.2015.11.066\">https://doi.org/10.1016/j.optcom.2015.11.066</a>.","ieee":"F. Civitci, M. Hammer, and H. J. W. M. Hoekstra, “Planar prism spectrometer based on adiabatically connected waveguiding slabs,” <i>Optics Communications</i>, vol. 365, pp. 29–37, 2015.","ama":"Civitci F, Hammer M, Hoekstra HJWM. Planar prism spectrometer based on adiabatically connected waveguiding slabs. <i>Optics Communications</i>. 2015;365:29-37. doi:<a href=\"https://doi.org/10.1016/j.optcom.2015.11.066\">10.1016/j.optcom.2015.11.066</a>"},"page":"29-37","intvolume":"       365","publication_status":"published","publication_identifier":{"issn":["0030-4018"]},"has_accepted_license":"1","doi":"10.1016/j.optcom.2015.11.066","author":[{"last_name":"Civitci","full_name":"Civitci, F.","first_name":"F."},{"orcid":"0000-0002-6331-9348","last_name":"Hammer","id":"48077","full_name":"Hammer, Manfred","first_name":"Manfred"},{"first_name":"H.J.W.M.","last_name":"Hoekstra","full_name":"Hoekstra, H.J.W.M."}],"volume":365,"date_updated":"2022-01-06T06:59:44Z","status":"public","type":"journal_article","file_date_updated":"2018-08-08T10:31:23Z","article_type":"original","user_id":"55706","department":[{"_id":"61"}],"_id":"3845"},{"citation":{"mla":"Hammer, Manfred, et al. “Full Resonant Transmission of Semiguided Planar Waves Through Slab Waveguide Steps at Oblique Incidence.” <i>Journal of Lightwave Technology</i>, vol. 34, no. 3, Institute of Electrical and Electronics Engineers (IEEE), 2015, pp. 997–1005, doi:<a href=\"https://doi.org/10.1109/jlt.2015.2502431\">10.1109/jlt.2015.2502431</a>.","short":"M. Hammer, A. Hildebrandt, J. Förstner, Journal of Lightwave Technology 34 (2015) 997–1005.","bibtex":"@article{Hammer_Hildebrandt_Förstner_2015, title={Full Resonant Transmission of Semiguided Planar Waves Through Slab Waveguide Steps at Oblique Incidence}, volume={34}, DOI={<a href=\"https://doi.org/10.1109/jlt.2015.2502431\">10.1109/jlt.2015.2502431</a>}, number={3}, journal={Journal of Lightwave Technology}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Hammer, Manfred and Hildebrandt, Andre and Förstner, Jens}, year={2015}, pages={997–1005} }","apa":"Hammer, M., Hildebrandt, A., &#38; Förstner, J. (2015). Full Resonant Transmission of Semiguided Planar Waves Through Slab Waveguide Steps at Oblique Incidence. <i>Journal of Lightwave Technology</i>, <i>34</i>(3), 997–1005. <a href=\"https://doi.org/10.1109/jlt.2015.2502431\">https://doi.org/10.1109/jlt.2015.2502431</a>","ieee":"M. Hammer, A. Hildebrandt, and J. Förstner, “Full Resonant Transmission of Semiguided Planar Waves Through Slab Waveguide Steps at Oblique Incidence,” <i>Journal of Lightwave Technology</i>, vol. 34, no. 3, pp. 997–1005, 2015.","chicago":"Hammer, Manfred, Andre Hildebrandt, and Jens Förstner. “Full Resonant Transmission of Semiguided Planar Waves Through Slab Waveguide Steps at Oblique Incidence.” <i>Journal of Lightwave Technology</i> 34, no. 3 (2015): 997–1005. <a href=\"https://doi.org/10.1109/jlt.2015.2502431\">https://doi.org/10.1109/jlt.2015.2502431</a>.","ama":"Hammer M, Hildebrandt A, Förstner J. Full Resonant Transmission of Semiguided Planar Waves Through Slab Waveguide Steps at Oblique Incidence. <i>Journal of Lightwave Technology</i>. 2015;34(3):997-1005. doi:<a href=\"https://doi.org/10.1109/jlt.2015.2502431\">10.1109/jlt.2015.2502431</a>"},"page":"997-1005","intvolume":"        34","publication_status":"published","publication_identifier":{"issn":["0733-8724","1558-2213"]},"has_accepted_license":"1","doi":"10.1109/jlt.2015.2502431","date_updated":"2022-01-06T06:59:44Z","author":[{"first_name":"Manfred","last_name":"Hammer","orcid":"0000-0002-6331-9348","id":"48077","full_name":"Hammer, Manfred"},{"full_name":"Hildebrandt, Andre","last_name":"Hildebrandt","first_name":"Andre"},{"full_name":"Förstner, Jens","id":"158","orcid":"0000-0001-7059-9862","last_name":"Förstner","first_name":"Jens"}],"volume":34,"status":"public","type":"journal_article","article_type":"original","file_date_updated":"2018-09-03T14:43:26Z","_id":"3847","user_id":"158","department":[{"_id":"61"}],"year":"2015","issue":"3","title":"Full Resonant Transmission of Semiguided Planar Waves Through Slab Waveguide Steps at Oblique Incidence","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","date_created":"2018-08-08T10:34:34Z","abstract":[{"lang":"eng","text":"Sheets of slab waveguides with sharp corners are investigated. By means of rigorous\r\nnumerical experiments, we look at oblique incidence of semi-guided plane waves. Radiation losses\r\nvanish beyond a certain critical angle of incidence. One can thus realize lossless propagation through\r\n90-degree corner configurations, where the remaining guided waves are still subject to pronounced\r\nreflection and polarization conversion. A system of two corners can be viewed as a structure akin to\r\na Fabry-Perot-interferometer. By adjusting the distance between the two partial reflectors, here the\r\n90-degree corners, one identifies step-like configurations that transmit the semi-guided plane waves\r\nwithout radiation losses, and virtually without reflections. Simulations of semi-guided beams with\r\nin-plane wide Gaussian profiles show that the effect survives in a true 3-D framework."}],"file":[{"file_size":606723,"access_level":"local","file_id":"3848","file_name":"2016 Hammer,Hildebrandt,Förstner_Full resonant transmission of semi-guided planar waves.pdf","date_updated":"2018-09-03T14:43:26Z","creator":"hclaudia","date_created":"2018-08-08T10:37:19Z","relation":"main_file","content_type":"application/pdf"}],"publication":"Journal of Lightwave Technology","ddc":["530"],"keyword":["tet_topic_waveguide"],"language":[{"iso":"eng"}]},{"publication_identifier":{"isbn":["978-3-319-25740-2"]},"year":"2015","citation":{"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>","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.","short":"H. Wachsmuth, Text Analysis Pipelines - Towards Ad-Hoc Large-Scale Text Mining, 2015.","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} }","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>.","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_updated":"2022-01-06T06:59:47Z","date_created":"2018-08-11T16:15:08Z","author":[{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","id":"3900","first_name":"Henning"}],"title":"Text Analysis Pipelines - Towards Ad-hoc Large-scale Text Mining","doi":"http://dx.doi.org/10.1007/978-3-319-25741-9","type":"book","status":"public","_id":"3879","department":[{"_id":"600"}],"user_id":"82920","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}]},{"ddc":["530"],"keyword":["tet_topic_plasmonics"],"language":[{"iso":"eng"}],"publication":"Nano Letters","abstract":[{"text":"Plasmon modes of the exact same individual gold nanoprisms are investigated through combined nanometer-resolved electron energy-loss spectroscopy (EELS) and cathodoluminescence (CL) measurements. We show that CL only probes the radiative modes, in contrast to EELS, which additionally reveals dark modes. The combination of both techniques on the same particles thus provides complementary information and also demonstrates that although the radiative modes give rise to very similar spatial distributions when probed by EELS or CL, their resonant energies appear to be different. We trace this phenomenon back to plasmon dissipation, which affects in different ways the plasmon signatures probed by these techniques. Our experiments are in agreement with electromagnetic numerical simulations and can be further interpreted within the framework of a quasistatic analytical model. We therefore demonstrate that CL and EELS are closely related to optical scattering and extinction, respectively, with the addition of nanometer spatial resolution.","lang":"eng"}],"file":[{"date_updated":"2018-09-04T20:06:07Z","creator":"hclaudia","date_created":"2018-08-13T09:35:36Z","file_size":521343,"access_level":"open_access","file_name":"2015-01 Losquin et al_Unveiling Nanometer Scale Extinction and Scattering Phenomena through Combined Electron Energy Loss Spectroscopy and Cathodoluminescence MeasurementsNanoletters_EELS and CL .pdf","file_id":"3893","content_type":"application/pdf","relation":"main_file"}],"publisher":"American Chemical Society (ACS)","date_created":"2018-08-13T09:32:56Z","title":"Unveiling Nanometer Scale Extinction and Scattering Phenomena through Combined Electron Energy Loss Spectroscopy and Cathodoluminescence Measurements","issue":"2","year":"2015","_id":"3892","user_id":"158","department":[{"_id":"61"}],"article_type":"original","file_date_updated":"2018-09-04T20:06:07Z","type":"journal_article","urn":"38927","status":"public","oa":"1","date_updated":"2022-01-06T06:59:50Z","author":[{"first_name":"Arthur","full_name":"Losquin, Arthur","last_name":"Losquin"},{"first_name":"Luiz F.","full_name":"Zagonel, Luiz F.","last_name":"Zagonel"},{"first_name":"Viktor","full_name":"Myroshnychenko, Viktor","id":"46371","last_name":"Myroshnychenko"},{"first_name":"Benito","last_name":"Rodríguez-González","full_name":"Rodríguez-González, Benito"},{"last_name":"Tencé","full_name":"Tencé, Marcel","first_name":"Marcel"},{"first_name":"Leonardo","full_name":"Scarabelli, Leonardo","last_name":"Scarabelli"},{"first_name":"Jens","full_name":"Förstner, Jens","id":"158","last_name":"Förstner","orcid":"0000-0001-7059-9862"},{"first_name":"Luis M.","full_name":"Liz-Marzán, Luis M.","last_name":"Liz-Marzán"},{"full_name":"García de Abajo, F. Javier","last_name":"García de Abajo","first_name":"F. Javier"},{"first_name":"Odile","full_name":"Stéphan, Odile","last_name":"Stéphan"},{"first_name":"Mathieu","last_name":"Kociak","full_name":"Kociak, Mathieu"}],"volume":15,"doi":"10.1021/nl5043775","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["1530-6984","1530-6992"]},"citation":{"mla":"Losquin, Arthur, et al. “Unveiling Nanometer Scale Extinction and Scattering Phenomena through Combined Electron Energy Loss Spectroscopy and Cathodoluminescence Measurements.” <i>Nano Letters</i>, vol. 15, no. 2, American Chemical Society (ACS), 2015, pp. 1229–37, doi:<a href=\"https://doi.org/10.1021/nl5043775\">10.1021/nl5043775</a>.","bibtex":"@article{Losquin_Zagonel_Myroshnychenko_Rodríguez-González_Tencé_Scarabelli_Förstner_Liz-Marzán_García de Abajo_Stéphan_et al._2015, title={Unveiling Nanometer Scale Extinction and Scattering Phenomena through Combined Electron Energy Loss Spectroscopy and Cathodoluminescence Measurements}, volume={15}, DOI={<a href=\"https://doi.org/10.1021/nl5043775\">10.1021/nl5043775</a>}, number={2}, journal={Nano Letters}, publisher={American Chemical Society (ACS)}, author={Losquin, Arthur and Zagonel, Luiz F. and Myroshnychenko, Viktor and Rodríguez-González, Benito and Tencé, Marcel and Scarabelli, Leonardo and Förstner, Jens and Liz-Marzán, Luis M. and García de Abajo, F. Javier and Stéphan, Odile and et al.}, year={2015}, pages={1229–1237} }","short":"A. Losquin, L.F. Zagonel, V. Myroshnychenko, B. Rodríguez-González, M. Tencé, L. Scarabelli, J. Förstner, L.M. Liz-Marzán, F.J. García de Abajo, O. Stéphan, M. Kociak, Nano Letters 15 (2015) 1229–1237.","apa":"Losquin, A., Zagonel, L. F., Myroshnychenko, V., Rodríguez-González, B., Tencé, M., Scarabelli, L., … Kociak, M. (2015). Unveiling Nanometer Scale Extinction and Scattering Phenomena through Combined Electron Energy Loss Spectroscopy and Cathodoluminescence Measurements. <i>Nano Letters</i>, <i>15</i>(2), 1229–1237. <a href=\"https://doi.org/10.1021/nl5043775\">https://doi.org/10.1021/nl5043775</a>","ama":"Losquin A, Zagonel LF, Myroshnychenko V, et al. Unveiling Nanometer Scale Extinction and Scattering Phenomena through Combined Electron Energy Loss Spectroscopy and Cathodoluminescence Measurements. <i>Nano Letters</i>. 2015;15(2):1229-1237. doi:<a href=\"https://doi.org/10.1021/nl5043775\">10.1021/nl5043775</a>","ieee":"A. Losquin <i>et al.</i>, “Unveiling Nanometer Scale Extinction and Scattering Phenomena through Combined Electron Energy Loss Spectroscopy and Cathodoluminescence Measurements,” <i>Nano Letters</i>, vol. 15, no. 2, pp. 1229–1237, 2015.","chicago":"Losquin, Arthur, Luiz F. Zagonel, Viktor Myroshnychenko, Benito Rodríguez-González, Marcel Tencé, Leonardo Scarabelli, Jens Förstner, et al. “Unveiling Nanometer Scale Extinction and Scattering Phenomena through Combined Electron Energy Loss Spectroscopy and Cathodoluminescence Measurements.” <i>Nano Letters</i> 15, no. 2 (2015): 1229–37. <a href=\"https://doi.org/10.1021/nl5043775\">https://doi.org/10.1021/nl5043775</a>."},"intvolume":"        15","page":"1229-1237"},{"date_created":"2018-08-13T09:39:06Z","publisher":"The Optical Society","title":"How planar optical waves can be made to climb dielectric steps","issue":"16","year":"2015","language":[{"iso":"eng"}],"keyword":["tet_topic_waveguide"],"ddc":["530"],"publication":"Optics Letters","file":[{"date_updated":"2018-09-04T19:35:48Z","date_created":"2018-08-13T09:41:32Z","creator":"hclaudia","file_size":1504149,"file_name":"2015-07 Hammer,Hildebrandt,Förstner_How planar optical waves can be made to climb dielectric steps_Optics Letter.pdf","access_level":"open_access","file_id":"3895","content_type":"application/pdf","relation":"main_file"}],"abstract":[{"text":"We show how to optically connect guiding layers at different elevations in a 3-D integrated photonic circuit. Transfer of\r\noptical power carried by planar, semi-guided waves is possible without reflections or radiation losses, and over large\r\nvertical distances. This functionality is realized through simple step-like folds of high-contrast dielectric slab waveguides, in combination with oblique wave incidence, and fulfilling a resonance condition. Radiation losses vanish, and polarization conversion is suppressed for TE wave incidence beyond certain critical angles. This can be understood by fundamental arguments resting on a version of Snell’s law. The two 90° corners of a step act as identical partial reflectors in a Fabry–Perot-like resonator setup. By selecting the step height, i.e., the distance between the reflectors, one realizes resonant states with full transmission. Rigorous quasi-analytical simulations\r\nfor typical silicon/silica parameters demonstrate the functioning. Combinations of several step junctions can lead\r\nto other types of optical on-chip connects, e.g., U-turn- or bridge-like configurations.","lang":"eng"}],"volume":40,"author":[{"first_name":"Manfred","full_name":"Hammer, Manfred","id":"48077","last_name":"Hammer","orcid":"0000-0002-6331-9348"},{"first_name":"Andre","last_name":"Hildebrandt","full_name":"Hildebrandt, Andre"},{"id":"158","full_name":"Förstner, Jens","last_name":"Förstner","orcid":"0000-0001-7059-9862","first_name":"Jens"}],"date_updated":"2022-01-06T06:59:51Z","oa":"1","doi":"10.1364/ol.40.003711","publication_identifier":{"issn":["0146-9592","1539-4794"]},"has_accepted_license":"1","publication_status":"published","page":"3711-3714","intvolume":"        40","citation":{"chicago":"Hammer, Manfred, Andre Hildebrandt, and Jens Förstner. “How Planar Optical Waves Can Be Made to Climb Dielectric Steps.” <i>Optics Letters</i> 40, no. 16 (2015): 3711–14. <a href=\"https://doi.org/10.1364/ol.40.003711\">https://doi.org/10.1364/ol.40.003711</a>.","ieee":"M. Hammer, A. Hildebrandt, and J. Förstner, “How planar optical waves can be made to climb dielectric steps,” <i>Optics Letters</i>, vol. 40, no. 16, pp. 3711–3714, 2015.","ama":"Hammer M, Hildebrandt A, Förstner J. How planar optical waves can be made to climb dielectric steps. <i>Optics Letters</i>. 2015;40(16):3711-3714. doi:<a href=\"https://doi.org/10.1364/ol.40.003711\">10.1364/ol.40.003711</a>","apa":"Hammer, M., Hildebrandt, A., &#38; Förstner, J. (2015). How planar optical waves can be made to climb dielectric steps. <i>Optics Letters</i>, <i>40</i>(16), 3711–3714. <a href=\"https://doi.org/10.1364/ol.40.003711\">https://doi.org/10.1364/ol.40.003711</a>","short":"M. Hammer, A. Hildebrandt, J. Förstner, Optics Letters 40 (2015) 3711–3714.","mla":"Hammer, Manfred, et al. “How Planar Optical Waves Can Be Made to Climb Dielectric Steps.” <i>Optics Letters</i>, vol. 40, no. 16, The Optical Society, 2015, pp. 3711–14, doi:<a href=\"https://doi.org/10.1364/ol.40.003711\">10.1364/ol.40.003711</a>.","bibtex":"@article{Hammer_Hildebrandt_Förstner_2015, title={How planar optical waves can be made to climb dielectric steps}, volume={40}, DOI={<a href=\"https://doi.org/10.1364/ol.40.003711\">10.1364/ol.40.003711</a>}, number={16}, journal={Optics Letters}, publisher={The Optical Society}, author={Hammer, Manfred and Hildebrandt, Andre and Förstner, Jens}, year={2015}, pages={3711–3714} }"},"department":[{"_id":"61"}],"user_id":"158","_id":"3894","file_date_updated":"2018-09-04T19:35:48Z","article_type":"original","type":"journal_article","status":"public","urn":"38942"}]