[{"title":"Anonymous and Publicly Linkable Reputation Systems","date_created":"2017-10-17T12:41:54Z","year":"2015","ddc":["040"],"file":[{"access_level":"closed","file_id":"1431","file_name":"322-546_01.pdf","file_size":499568,"creator":"florida","date_created":"2018-03-20T07:39:54Z","date_updated":"2018-03-20T07:39:54Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"Reputation systems are used to compute and publish reputation scores for services or products. We consider reputation systems where users are allowed to rate products that they purchased previously. To obtain trustworthy reputations, they are allowed to rate these products only once. As long as users rate products once, they stay anonymous. Everybody is able to detect users deviating from the rate-products-only-once policy and the anonymity of such dishonest users can be revoked by a system manager. In this paper we present formal models for such reputation systems and their security. Based on group signatures presented by Boneh, Boyen, and Shacham we design an efficient reputation system that meets all our requirements."}],"publication":"Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2014/546"}],"doi":"10.1007/978-3-662-47854-7_29","author":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"},{"full_name":"Juhnke, Jakob","id":"48090","last_name":"Juhnke","first_name":"Jakob"},{"first_name":"Christina","id":"43647","full_name":"Kolb, Christina","last_name":"Kolb"}],"date_updated":"2022-01-06T06:59:05Z","oa":"1","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>","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>","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} }","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>.","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."},"page":"478--488","has_accepted_license":"1","file_date_updated":"2018-03-20T07:39:54Z","user_id":"48090","series_title":"LNCS","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":"322","status":"public","type":"conference"},{"type":"journal_article","status":"public","department":[{"_id":"355"}],"user_id":"477","_id":"323","project":[{"name":"SFB 901","_id":"1"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"name":"SFB 901 - Project Area B","_id":"3"}],"file_date_updated":"2018-03-20T07:39:17Z","has_accepted_license":"1","page":"1-18","citation":{"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.","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>.","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>","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>.","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.","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>"},"author":[{"first_name":"Alexander","last_name":"Jungmann","full_name":"Jungmann, Alexander"},{"last_name":"Mohr","full_name":"Mohr, Felix","first_name":"Felix"}],"date_updated":"2022-01-06T06:59:06Z","doi":"10.1186/s13174-015-0022-8","publication":"Journal of Internet Services and Applications","file":[{"file_size":2842281,"access_level":"closed","file_id":"1429","file_name":"323-An_approach_towards_adaptive_service_composition_in_markets_of_composed_services.pdf","date_updated":"2018-03-20T07:39:17Z","date_created":"2018-03-20T07:39:17Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"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."}],"language":[{"iso":"eng"}],"ddc":["040"],"issue":"1","year":"2015","date_created":"2017-10-17T12:41:55Z","publisher":"Springer","title":"An approach towards adaptive service composition in markets of composed services"},{"has_accepted_license":"1","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>","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>.","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} }","short":"F. Mohr, in: Proceedings of the 14th International Conference on Software Reuse (ICSR), 2015, pp. 298--313.","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.","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>.","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>"},"author":[{"first_name":"Felix","full_name":"Mohr, Felix","last_name":"Mohr"}],"date_updated":"2022-01-06T06:59:07Z","doi":"10.1007/978-3-319-14130-5_21","type":"conference","status":"public","department":[{"_id":"355"}],"user_id":"477","series_title":"LNCS","_id":"324","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B2","_id":"10"},{"name":"SFB 901 - Project Area B","_id":"3"}],"file_date_updated":"2018-03-20T07:38:44Z","year":"2015","date_created":"2017-10-17T12:41:55Z","title":"A Metric for Functional Reusability of Services","publication":"Proceedings of the 14th International Conference on Software Reuse (ICSR)","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-20T07:38:44Z","creator":"florida","date_updated":"2018-03-20T07:38:44Z","file_id":"1428","access_level":"closed","file_name":"324-ICSR-Mohr-15.pdf","file_size":569475}],"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"}],"language":[{"iso":"eng"}],"ddc":["040"]},{"related_material":{"record":[{"id":"253","relation":"other","status":"public"}]},"citation":{"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} }","mla":"Löken, Nils. <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn, 2015.","short":"N. Löken, A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption, Universität Paderborn, 2015.","apa":"Löken, N. (2015). <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn.","ieee":"N. Löken, <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. 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.","ama":"Löken N. <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn; 2015."},"year":"2015","author":[{"last_name":"Löken","id":"13703","full_name":"Löken, Nils","first_name":"Nils"}],"supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"date_created":"2017-10-17T12:41:55Z","date_updated":"2022-01-06T06:59:07Z","publisher":"Universität Paderborn","title":"A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption","type":"mastersthesis","status":"public","department":[{"_id":"64"}],"user_id":"477","_id":"325","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}]},{"author":[{"first_name":"Frederic","last_name":"Heihoff","full_name":"Heihoff, Frederic"}],"date_created":"2017-10-17T12:41:55Z","supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"date_updated":"2022-01-06T06:59:07Z","publisher":"Universität Paderborn","title":"A group signature scheme based on the LSRW assumption","citation":{"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.","apa":"Heihoff, F. (2015). <i>A group signature scheme based on the LSRW assumption</i>. Universität Paderborn.","ieee":"F. Heihoff, <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.","ama":"Heihoff F. <i>A Group Signature Scheme Based on the LSRW Assumption</i>. Universität Paderborn; 2015."},"year":"2015","department":[{"_id":"64"}],"user_id":"477","_id":"326","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"type":"bachelorsthesis","status":"public"},{"year":"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.","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>.","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} }","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>","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.","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>."},"has_accepted_license":"1","title":"A deterministic worst-case message complexity optimal solution for resource discovery","doi":"10.1016/j.tcs.2014.11.027","date_updated":"2022-01-06T06:59:08Z","publisher":"Elsevier","date_created":"2017-10-17T12:41:55Z","author":[{"first_name":"Sebastian","last_name":"Kniesburges","full_name":"Kniesburges, Sebastian"},{"last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas","first_name":"Andreas"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"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"}],"status":"public","file":[{"file_name":"327-KKS15-TOCS_01.pdf","access_level":"closed","file_id":"1427","file_size":398044,"creator":"florida","date_created":"2018-03-20T07:38:02Z","date_updated":"2018-03-20T07:38:02Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"publication":"Theoretical Computer Science","type":"journal_article","ddc":["040"],"file_date_updated":"2018-03-20T07:38:02Z","_id":"327","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"79"}],"user_id":"477"},{"author":[{"last_name":"Bubeck","full_name":"Bubeck, Uwe","first_name":"Uwe"},{"first_name":"Hans","full_name":"Kleine Büning, Hans","last_name":"Kleine Büning"}],"date_created":"2018-06-25T10:43:19Z","publisher":"Elsevier","date_updated":"2022-01-06T06:59:10Z","doi":"10.1016/j.artint.2015.09.003","title":"Learning Boolean Specifications","publication_identifier":{"issn":["0004-3702"]},"page":"246 - 257","citation":{"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>.","ieee":"U. Bubeck and H. Kleine Büning, “Learning Boolean Specifications,” <i>Artificial Intelligence</i>, pp. 246–257, 2015.","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>","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>","short":"U. Bubeck, H. Kleine Büning, Artificial Intelligence (2015) 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>.","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} }"},"year":"2015","department":[{"_id":"34"}],"user_id":"315","_id":"3343","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"language":[{"iso":"eng"}],"keyword":["Query learning","Propositional logic"],"ddc":["000"],"publication":"Artificial Intelligence","type":"journal_article","status":"public","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","type":"bachelorsthesis","language":[{"iso":"ger"}],"user_id":"477","department":[{"_id":"78"}],"project":[{"name":"SFB 901 - Subproject C2","_id":"14"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"3364","citation":{"mla":"Knorr, Christoph. <i>Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten</i>. Universität Paderborn, 2015.","short":"C. Knorr, Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten, Universität Paderborn, 2015.","bibtex":"@book{Knorr_2015, title={Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten}, publisher={Universität Paderborn}, author={Knorr, Christoph}, year={2015} }","apa":"Knorr, C. (2015). <i>Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten</i>. Universität Paderborn.","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.","ama":"Knorr C. <i>Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten</i>. Universität Paderborn; 2015."},"year":"2015","title":"Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten","date_created":"2018-06-26T14:06:07Z","supervisor":[{"first_name":"Achim","full_name":"Lösch, Achim","id":"43646","last_name":"Lösch"},{"first_name":"Marco","full_name":"Platzner, Marco","id":"398","last_name":"Platzner"}],"author":[{"last_name":"Knorr","full_name":"Knorr, Christoph","first_name":"Christoph"}],"date_updated":"2022-01-06T06:59:13Z","publisher":"Universität Paderborn"},{"year":"2015","page":"601-611","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>","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} }","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>.","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."},"publication_identifier":{"isbn":["978-3-319-25740-2"]},"title":"Sentiment Flow - A General Model of Web Review Argumentation","doi":"10.18653/v1/D15-1072","main_file_link":[{"url":"https://www.aclweb.org/anthology/D15-1072.pdf"}],"date_updated":"2022-01-06T06:59:37Z","author":[{"id":"3900","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning"},{"first_name":"Johannes","full_name":"Kiesel, Johannes","last_name":"Kiesel"},{"first_name":"Benno","full_name":"Stein, Benno","last_name":"Stein"}],"date_created":"2018-08-02T13:38:41Z","editor":[{"last_name":"Tsujii","full_name":"Tsujii, Junichi","first_name":"Junichi"},{"last_name":"Hajic","full_name":"Hajic, Jan","first_name":"Jan"}],"status":"public","publication":"Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing","type":"conference","language":[{"iso":"eng"}],"_id":"3815","department":[{"_id":"600"}],"user_id":"82920","series_title":"Lecture Notes in Computer Science"},{"type":"journal_article","status":"public","user_id":"55706","department":[{"_id":"61"}],"_id":"3845","file_date_updated":"2018-08-08T10:31:23Z","article_type":"original","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["0030-4018"]},"citation":{"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>","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.","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>.","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.","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>"},"page":"29-37","intvolume":"       365","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"},{"last_name":"Hoekstra","full_name":"Hoekstra, H.J.W.M.","first_name":"H.J.W.M."}],"volume":365,"date_updated":"2022-01-06T06:59:44Z","doi":"10.1016/j.optcom.2015.11.066","publication":"Optics Communications","file":[{"date_created":"2018-08-08T10:31:23Z","creator":"hclaudia","date_updated":"2018-08-08T10:31:23Z","access_level":"closed","file_name":"2016  Hammer_Planar prism spectrometer based on adiabatically connected waveguiding slabs.pdf","file_id":"3846","file_size":1542539,"content_type":"application/pdf","relation":"main_file","success":1}],"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."}],"language":[{"iso":"eng"}],"ddc":["530"],"keyword":["tet_topic_waveguide"],"year":"2015","date_created":"2018-08-08T10:27:57Z","publisher":"Elsevier BV","title":"Planar prism spectrometer based on adiabatically connected waveguiding slabs"},{"status":"public","type":"journal_article","article_type":"original","file_date_updated":"2018-09-03T14:43:26Z","_id":"3847","user_id":"158","department":[{"_id":"61"}],"citation":{"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>","short":"M. Hammer, A. Hildebrandt, J. Förstner, Journal of Lightwave Technology 34 (2015) 997–1005.","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>.","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} }","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>","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>."},"intvolume":"        34","page":"997-1005","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["0733-8724","1558-2213"]},"doi":"10.1109/jlt.2015.2502431","date_updated":"2022-01-06T06:59:44Z","author":[{"id":"48077","full_name":"Hammer, Manfred","last_name":"Hammer","orcid":"0000-0002-6331-9348","first_name":"Manfred"},{"full_name":"Hildebrandt, Andre","last_name":"Hildebrandt","first_name":"Andre"},{"orcid":"0000-0001-7059-9862","last_name":"Förstner","full_name":"Förstner, Jens","id":"158","first_name":"Jens"}],"volume":34,"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":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2018-09-03T14:43:26Z","date_created":"2018-08-08T10:37:19Z","creator":"hclaudia","file_size":606723,"file_id":"3848","file_name":"2016 Hammer,Hildebrandt,Förstner_Full resonant transmission of semi-guided planar waves.pdf","access_level":"local"}],"publication":"Journal of Lightwave Technology","ddc":["530"],"keyword":["tet_topic_waveguide"],"language":[{"iso":"eng"}],"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"},{"status":"public","type":"book","language":[{"iso":"eng"}],"user_id":"82920","series_title":"Lecture Notes in Computer Science","department":[{"_id":"600"}],"_id":"3879","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} }","short":"H. Wachsmuth, Text Analysis Pipelines - Towards Ad-Hoc Large-Scale Text Mining, 2015.","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>","ieee":"H. Wachsmuth, <i>Text Analysis Pipelines - Towards Ad-hoc Large-scale Text Mining</i>. 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>.","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>"},"year":"2015","publication_identifier":{"isbn":["978-3-319-25740-2"]},"doi":"http://dx.doi.org/10.1007/978-3-319-25741-9","title":"Text Analysis Pipelines - Towards Ad-hoc Large-scale Text Mining","author":[{"full_name":"Wachsmuth, Henning","id":"3900","last_name":"Wachsmuth","first_name":"Henning"}],"date_created":"2018-08-11T16:15:08Z","date_updated":"2022-01-06T06:59:47Z"},{"doi":"10.1021/nl5043775","author":[{"last_name":"Losquin","full_name":"Losquin, Arthur","first_name":"Arthur"},{"last_name":"Zagonel","full_name":"Zagonel, Luiz F.","first_name":"Luiz F."},{"full_name":"Myroshnychenko, Viktor","id":"46371","last_name":"Myroshnychenko","first_name":"Viktor"},{"first_name":"Benito","full_name":"Rodríguez-González, Benito","last_name":"Rodríguez-González"},{"last_name":"Tencé","full_name":"Tencé, Marcel","first_name":"Marcel"},{"last_name":"Scarabelli","full_name":"Scarabelli, Leonardo","first_name":"Leonardo"},{"id":"158","full_name":"Förstner, Jens","last_name":"Förstner","orcid":"0000-0001-7059-9862","first_name":"Jens"},{"full_name":"Liz-Marzán, Luis M.","last_name":"Liz-Marzán","first_name":"Luis M."},{"first_name":"F. Javier","full_name":"García de Abajo, F. Javier","last_name":"García de Abajo"},{"last_name":"Stéphan","full_name":"Stéphan, Odile","first_name":"Odile"},{"full_name":"Kociak, Mathieu","last_name":"Kociak","first_name":"Mathieu"}],"volume":15,"date_updated":"2022-01-06T06:59:50Z","oa":"1","citation":{"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>.","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.","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>","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.","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} }","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>.","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>"},"page":"1229-1237","intvolume":"        15","publication_status":"published","publication_identifier":{"issn":["1530-6984","1530-6992"]},"has_accepted_license":"1","file_date_updated":"2018-09-04T20:06:07Z","article_type":"original","user_id":"158","department":[{"_id":"61"}],"_id":"3892","status":"public","urn":"38927","type":"journal_article","title":"Unveiling Nanometer Scale Extinction and Scattering Phenomena through Combined Electron Energy Loss Spectroscopy and Cathodoluminescence Measurements","date_created":"2018-08-13T09:32:56Z","publisher":"American Chemical Society (ACS)","year":"2015","issue":"2","language":[{"iso":"eng"}],"ddc":["530"],"keyword":["tet_topic_plasmonics"],"file":[{"relation":"main_file","content_type":"application/pdf","file_size":521343,"file_id":"3893","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","date_updated":"2018-09-04T20:06:07Z","creator":"hclaudia","date_created":"2018-08-13T09:35:36Z"}],"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"}],"publication":"Nano Letters"},{"publication":"Optics Letters","abstract":[{"lang":"eng","text":"We show how to optically connect guiding layers at different elevations in a 3-D integrated photonic circuit. Transfer of\r\noptical power carried by planar, semi-guided waves is possible without reflections or radiation losses, and over large\r\nvertical distances. This functionality is realized through simple step-like folds of high-contrast dielectric slab waveguides, in combination with oblique wave incidence, and fulfilling a resonance condition. Radiation losses vanish, and polarization conversion is suppressed for TE wave incidence beyond certain critical angles. This can be understood by fundamental arguments resting on a version of Snell’s law. The two 90° corners of a step act as identical partial reflectors in a Fabry–Perot-like resonator setup. By selecting the step height, i.e., the distance between the reflectors, one realizes resonant states with full transmission. Rigorous quasi-analytical simulations\r\nfor typical silicon/silica parameters demonstrate the functioning. Combinations of several step junctions can lead\r\nto other types of optical on-chip connects, e.g., U-turn- or bridge-like configurations."}],"file":[{"date_updated":"2018-09-04T19:35:48Z","creator":"hclaudia","date_created":"2018-08-13T09:41:32Z","file_size":1504149,"access_level":"open_access","file_id":"3895","file_name":"2015-07 Hammer,Hildebrandt,Förstner_How planar optical waves can be made to climb dielectric steps_Optics Letter.pdf","content_type":"application/pdf","relation":"main_file"}],"keyword":["tet_topic_waveguide"],"ddc":["530"],"language":[{"iso":"eng"}],"issue":"16","year":"2015","publisher":"The Optical Society","date_created":"2018-08-13T09:39:06Z","title":"How planar optical waves can be made to climb dielectric steps","type":"journal_article","urn":"38942","status":"public","_id":"3894","department":[{"_id":"61"}],"user_id":"158","article_type":"original","file_date_updated":"2018-09-04T19:35:48Z","has_accepted_license":"1","publication_identifier":{"issn":["0146-9592","1539-4794"]},"publication_status":"published","page":"3711-3714","intvolume":"        40","citation":{"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>","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.","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>.","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} }","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>.","short":"M. Hammer, A. Hildebrandt, J. Förstner, Optics Letters 40 (2015) 3711–3714.","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>"},"oa":"1","date_updated":"2022-01-06T06:59:51Z","volume":40,"author":[{"orcid":"0000-0002-6331-9348","last_name":"Hammer","full_name":"Hammer, Manfred","id":"48077","first_name":"Manfred"},{"last_name":"Hildebrandt","full_name":"Hildebrandt, Andre","first_name":"Andre"},{"full_name":"Förstner, Jens","id":"158","orcid":"0000-0001-7059-9862","last_name":"Förstner","first_name":"Jens"}],"doi":"10.1364/ol.40.003711"},{"type":"journal_article","urn":"38960","status":"public","_id":"3896","department":[{"_id":"61"}],"user_id":"158","article_type":"original","file_date_updated":"2018-09-04T19:53:37Z","publication_identifier":{"issn":["0146-9592","1539-4794"]},"has_accepted_license":"1","publication_status":"published","intvolume":"        40","page":"851-854","citation":{"apa":"Kou, Y., &#38; Förstner, J. (2015). Subwavelength binary plasmonic solitons. <i>Optics Letters</i>, <i>40</i>(6), 851–854. <a href=\"https://doi.org/10.1364/ol.40.000851\">https://doi.org/10.1364/ol.40.000851</a>","mla":"Kou, Yao, and Jens Förstner. “Subwavelength Binary Plasmonic Solitons.” <i>Optics Letters</i>, vol. 40, no. 6, The Optical Society, 2015, pp. 851–54, doi:<a href=\"https://doi.org/10.1364/ol.40.000851\">10.1364/ol.40.000851</a>.","short":"Y. Kou, J. Förstner, Optics Letters 40 (2015) 851–854.","bibtex":"@article{Kou_Förstner_2015, title={Subwavelength binary plasmonic solitons}, volume={40}, DOI={<a href=\"https://doi.org/10.1364/ol.40.000851\">10.1364/ol.40.000851</a>}, number={6}, journal={Optics Letters}, publisher={The Optical Society}, author={Kou, Yao and Förstner, Jens}, year={2015}, pages={851–854} }","ieee":"Y. Kou and J. Förstner, “Subwavelength binary plasmonic solitons,” <i>Optics Letters</i>, vol. 40, no. 6, pp. 851–854, 2015.","chicago":"Kou, Yao, and Jens Förstner. “Subwavelength Binary Plasmonic Solitons.” <i>Optics Letters</i> 40, no. 6 (2015): 851–54. <a href=\"https://doi.org/10.1364/ol.40.000851\">https://doi.org/10.1364/ol.40.000851</a>.","ama":"Kou Y, Förstner J. Subwavelength binary plasmonic solitons. <i>Optics Letters</i>. 2015;40(6):851-854. doi:<a href=\"https://doi.org/10.1364/ol.40.000851\">10.1364/ol.40.000851</a>"},"date_updated":"2022-01-06T06:59:52Z","oa":"1","volume":40,"author":[{"full_name":"Kou, Yao","last_name":"Kou","first_name":"Yao"},{"first_name":"Jens","full_name":"Förstner, Jens","id":"158","orcid":"0000-0001-7059-9862","last_name":"Förstner"}],"doi":"10.1364/ol.40.000851","publication":"Optics Letters","abstract":[{"text":"We study the formation of subwavelength solitons in binary metal-dielectric lattices. We show that the transverse modulation of the lattice constant breaks the fundamental plasmonic band and suppresses the discrete diffraction of surface plasmon waves. New types of plasmonic solitons are found, and their characteristics are analyzed. We also demonstrate the existence of photonic-plasmonic vector solitons and elucidate their propagation properties.","lang":"eng"}],"file":[{"creator":"hclaudia","date_created":"2018-08-13T10:23:50Z","date_updated":"2018-09-04T19:53:37Z","access_level":"open_access","file_id":"3897","file_name":"2015-03 Kou,Förstner_Subwavelength binary plasmonic solitons_Optics letters.pdf","file_size":585088,"content_type":"application/pdf","relation":"main_file"}],"keyword":["tet_topic_polariton"],"ddc":["530"],"language":[{"iso":"eng"}],"issue":"6","year":"2015","publisher":"The Optical Society","date_created":"2018-08-13T10:22:12Z","title":"Subwavelength binary plasmonic solitons"},{"publisher":"Springer Nature","date_created":"2018-08-13T10:34:17Z","title":"Robust Population Inversion by Polarization Selective Pulsed Excitation","issue":"1","year":"2015","ddc":["530"],"keyword":["tet_topic_qd"],"language":[{"iso":"eng"}],"publication":"Scientific Reports","abstract":[{"text":"The coherent state preparation and control of single quantum systems is an important prerequisite for the implementation of functional quantum devices. Prominent examples for such systems are semiconductor quantum dots, which exhibit a fine structure split single exciton state and a V-type three level structure, given by a common ground state and two distinguishable and separately excitable transitions. In this work we introduce a novel concept for the preparation of a robust inversion by the sequential excitation in a V-type system via distinguishable paths.","lang":"eng"}],"file":[{"file_size":1089911,"access_level":"open_access","file_id":"3901","file_name":"2015-05 Mantei,Förstner,Gordon,Leier,Rai,Reuter,Wieck,Zrenner_Robust Population Inversion by Polarization Selective Pulsed Excitation.pdf","date_updated":"2018-08-21T11:37:12Z","date_created":"2018-08-13T10:39:14Z","creator":"hclaudia","relation":"main_file","content_type":"application/pdf"}],"oa":"1","date_updated":"2022-01-06T06:59:53Z","author":[{"first_name":"D.","last_name":"Mantei","full_name":"Mantei, D."},{"first_name":"Jens","full_name":"Förstner, Jens","id":"158","orcid":"0000-0001-7059-9862","last_name":"Förstner"},{"first_name":"S.","full_name":"Gordon, S.","last_name":"Gordon"},{"first_name":"Y. A.","full_name":"Leier, Y. A.","last_name":"Leier"},{"last_name":"Rai","full_name":"Rai, A. K.","first_name":"A. K."},{"full_name":"Reuter, Dirk","id":"37763","last_name":"Reuter","first_name":"Dirk"},{"first_name":"A. D.","full_name":"Wieck, A. D.","last_name":"Wieck"},{"orcid":"0000-0002-5190-0944","last_name":"Zrenner","id":"606","full_name":"Zrenner, Artur","first_name":"Artur"}],"volume":5,"doi":"10.1038/srep10313","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["2045-2322"]},"citation":{"apa":"Mantei, D., Förstner, J., Gordon, S., Leier, Y. A., Rai, A. K., Reuter, D., … Zrenner, A. (2015). Robust Population Inversion by Polarization Selective Pulsed Excitation. <i>Scientific Reports</i>, <i>5</i>(1), 10313. <a href=\"https://doi.org/10.1038/srep10313\">https://doi.org/10.1038/srep10313</a>","short":"D. Mantei, J. Förstner, S. Gordon, Y.A. Leier, A.K. Rai, D. Reuter, A.D. Wieck, A. Zrenner, Scientific Reports 5 (2015) 10313.","bibtex":"@article{Mantei_Förstner_Gordon_Leier_Rai_Reuter_Wieck_Zrenner_2015, title={Robust Population Inversion by Polarization Selective Pulsed Excitation}, volume={5}, DOI={<a href=\"https://doi.org/10.1038/srep10313\">10.1038/srep10313</a>}, number={1}, journal={Scientific Reports}, publisher={Springer Nature}, author={Mantei, D. and Förstner, Jens and Gordon, S. and Leier, Y. A. and Rai, A. K. and Reuter, Dirk and Wieck, A. D. and Zrenner, Artur}, year={2015}, pages={10313} }","mla":"Mantei, D., et al. “Robust Population Inversion by Polarization Selective Pulsed Excitation.” <i>Scientific Reports</i>, vol. 5, no. 1, Springer Nature, 2015, p. 10313, doi:<a href=\"https://doi.org/10.1038/srep10313\">10.1038/srep10313</a>.","ama":"Mantei D, Förstner J, Gordon S, et al. Robust Population Inversion by Polarization Selective Pulsed Excitation. <i>Scientific Reports</i>. 2015;5(1):10313. doi:<a href=\"https://doi.org/10.1038/srep10313\">10.1038/srep10313</a>","chicago":"Mantei, D., Jens Förstner, S. Gordon, Y. A. Leier, A. K. Rai, Dirk Reuter, A. D. Wieck, and Artur Zrenner. “Robust Population Inversion by Polarization Selective Pulsed Excitation.” <i>Scientific Reports</i> 5, no. 1 (2015): 10313. <a href=\"https://doi.org/10.1038/srep10313\">https://doi.org/10.1038/srep10313</a>.","ieee":"D. Mantei <i>et al.</i>, “Robust Population Inversion by Polarization Selective Pulsed Excitation,” <i>Scientific Reports</i>, vol. 5, no. 1, p. 10313, 2015."},"intvolume":"         5","page":"10313","_id":"3900","user_id":"55706","department":[{"_id":"61"},{"_id":"15"},{"_id":"292"},{"_id":"290"}],"article_type":"original","file_date_updated":"2018-08-21T11:37:12Z","type":"journal_article","urn":"39004","status":"public"},{"doi":"10.1016/j.cl.2015.05.003","title":"Grammar-based model transformations: Definition, execution, and quality properties","author":[{"first_name":"Galina","last_name":"Besova","full_name":"Besova, Galina"},{"first_name":"Dominik","full_name":"Steenken, Dominik","last_name":"Steenken"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"date_created":"2017-10-17T12:41:48Z","date_updated":"2022-01-06T06:58:43Z","publisher":"Elsevier","page":"116-138","citation":{"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>","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>.","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} }","short":"G. Besova, D. Steenken, H. Wehrheim, Computer Languages, Systems &#38; Structures (2015) 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>","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.","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>."},"year":"2015","has_accepted_license":"1","file_date_updated":"2018-03-21T09:22:03Z","language":[{"iso":"eng"}],"ddc":["040"],"department":[{"_id":"77"}],"user_id":"477","_id":"290","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"290-BSW15-main.pdf","file_id":"1464","file_size":1329478,"creator":"florida","date_created":"2018-03-21T09:22:03Z","date_updated":"2018-03-21T09:22:03Z"}],"abstract":[{"lang":"eng","text":"Model transformation is a key concept in model-driven software engineering. The definition of model transformations is usually based on meta-models describing the abstract syntax of languages. While meta-models are thereby able to abstract from uperfluous details of concrete syntax, they often loose structural information inherent in languages, like information on model elements always occurring together in particular shapes. As a consequence, model transformations cannot naturally re-use language structures, thus leading to unnecessary complexity in their development as well as in quality assurance.In this paper, we propose a new approach to model transformation development which allows to simplify the developed transformations and improve their quality via the exploitation of the languages׳ structures. The approach is based on context-free graph grammars and transformations defined by pairing productions of source and target grammars. We show that such transformations have important properties: they terminate and are sound, complete, and deterministic."}],"publication":"Computer Languages, Systems & Structures","type":"journal_article"},{"type":"book_chapter","publication":"Lecture Notes in Computer Science","status":"public","_id":"2921","user_id":"66268","department":[{"_id":"558"}],"extern":"1","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783662464465","9783662464472"]},"place":"Berlin, Heidelberg","year":"2015","citation":{"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.","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>.","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>","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>","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} }","short":"O. Blazy, S. Kakvi, E. Kiltz, J. Pan, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2015, pp. 256–279.","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>."},"page":"256-279","oa":"1","date_updated":"2022-01-06T06:58:47Z","publisher":"Springer Berlin Heidelberg","date_created":"2018-05-25T12:46:08Z","author":[{"first_name":"Olivier","last_name":"Blazy","full_name":"Blazy, Olivier"},{"last_name":"Kakvi","id":"66268","full_name":"Kakvi, Saqib","first_name":"Saqib"},{"first_name":"Eike","last_name":"Kiltz","full_name":"Kiltz, Eike"},{"first_name":"Jiaxin","full_name":"Pan, Jiaxin","last_name":"Pan"}],"title":"Tightly-Secure Signatures from Chameleon Hash Functions","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2014/1021.pdf"}],"doi":"10.1007/978-3-662-46447-2_12"},{"_id":"297","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"43","name":"Securing the Financial Cloud"}],"department":[{"_id":"64"}],"user_id":"25078","type":"mastersthesis","status":"public","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:58:49Z","supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"date_created":"2017-10-17T12:41:50Z","author":[{"last_name":"Sosniak","full_name":"Sosniak, Martin","first_name":"Martin"}],"title":"Evaluation of Pairing Optimization for Embedded Platforms","year":"2015","citation":{"mla":"Sosniak, Martin. <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} }","short":"M. Sosniak, Evaluation of Pairing Optimization for Embedded Platforms, Universität Paderborn, 2015.","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.","chicago":"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."}},{"language":[{"iso":"ger"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"43","name":"Securing the Financial Cloud"}],"_id":"299","user_id":"477","department":[{"_id":"64"}],"status":"public","type":"mastersthesis","title":"Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:58:50Z","date_created":"2017-10-17T12:41:50Z","supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"author":[{"first_name":"Britta","full_name":"Gerken, Britta","last_name":"Gerken"}],"year":"2015","citation":{"chicago":"Gerken, Britta. <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn, 2015.","ieee":"B. Gerken, <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn, 2015.","ama":"Gerken B. <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn; 2015.","apa":"Gerken, B. (2015). <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn.","short":"B. Gerken, Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie, Universität Paderborn, 2015.","bibtex":"@book{Gerken_2015, title={Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie}, publisher={Universität Paderborn}, author={Gerken, Britta}, year={2015} }","mla":"Gerken, Britta. <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn, 2015."}}]