@article{3830, abstract = {{The modal properties of curved dielectric slab waveguides are investigated. We consider quasi-confined, attenuated modes that propagate at oblique angles with respect to the axis through the center of curvature. Our analytical model describes the transition from scalar 2-D TE/TM bend modes to lossless spiral waves at near-axis propagation angles, with a continuum of vectorial attenuated spiral modes in between. Modal solutions are characterized in terms of directional wavenumbers and attenuation constants. Examples for vectorial mode profiles illustrate the effects of oblique wave propagation along the curved slab segments. For the regime of lossless spiral waves, the relation with the guided modes of corresponding dielectric tubes is demonstrated.}}, author = {{Ebers, Lena and Hammer, Manfred and Förstner, Jens}}, issn = {{0306-8919}}, journal = {{Optical and Quantum Electronics}}, keywords = {{tet_topic_waveguide}}, number = {{4}}, pages = {{49:176}}, publisher = {{Springer Nature}}, title = {{{Spiral modes supported by circular dielectric tubes and tube segments}}}, doi = {{10.1007/s11082-017-1011-x}}, volume = {{49}}, year = {{2017}}, } @article{3832, abstract = {{Controlling light emission out of subwavelength nanoslit/aperture structures is of great important for highly integrated photonic circuits. Here we propose a new method to achieve direction-tunable emission based on a compact metallic microcavity with double nanoslit. Our method combines the principles of Young’s interference and surface plasmon polaritons interference. We show that the direction of the far-field beam can be controlled over a wide range of angles by manipulating the frequency and relative phase of light arriving at the two slits, which holds promise for applications in the ultracompact optoelectronic devices.}}, author = {{Song, Xiaohong and Wang, Nini and Yan, Ming and Lin, Cheng and Förstner, Jens and Yang, Weifeng}}, issn = {{1094-4087}}, journal = {{Optics Express}}, keywords = {{tet_topic_plasmonics}}, number = {{12}}, pages = {{13207--13214}}, publisher = {{The Optical Society}}, title = {{{Direction-tunable enhanced emission from a subwavelength metallic double-nanoslit structure}}}, doi = {{10.1364/oe.25.013207}}, volume = {{25}}, year = {{2017}}, } @inbook{3836, abstract = {{We apply the Discontinuous Galerkin Time Domain (DGTD) method for numerical simulations of the second harmonic generation from various metallic nanostructures. A Maxwell–Vlasov hydrodynamic model is used to describe the nonlinear effects in the motion of the excited free electrons in a metal. The results are compared with the corresponding experimental measurements for split-ring resonators and plasmonic gap antennas.}}, author = {{Grynko, Yevgen and Förstner, Jens}}, booktitle = {{Recent Trends in Computational Photonics}}, editor = {{Agrawal, Arti}}, isbn = {{9783319554372}}, issn = {{0342-4111}}, keywords = {{tet_topic_numerics, tet_topic_shg, tet_topic_meta}}, pages = {{261--284}}, publisher = {{Springer International Publishing}}, title = {{{Simulation of Second Harmonic Generation from Photonic Nanostructures Using the Discontinuous Galerkin Time Domain Method}}}, doi = {{10.1007/978-3-319-55438-9_9}}, year = {{2017}}, } @article{3872, abstract = {{This paper considers the problem of how to efficiently share a wireless medium which is subject to harsh external interference or even jamming. So far, this problem is understood only in simplistic single-hop or unit disk graph models. We in this paper initiate the study of MAC protocols for the SINR interference model (a.k.a. physical model). This paper makes two contributions. First, we introduce a new adversarial SINR model which captures a wide range of interference phenomena. Concretely, we consider a powerful, adaptive adversary which can jam nodes at arbitrary times and which is only limited by some energy budget. Our second contribution is a distributed MAC protocol called Sade which provably achieves a constant competitive throughput in this environment: we show that, with high probability, the protocol ensures that a constant fraction of the non-blocked time periods is used for successful transmissions.}}, author = {{Ogierman, Adrian and Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}}, issn = {{0178-2770}}, journal = {{Distributed Computing}}, number = {{3}}, pages = {{241--254}}, publisher = {{Springer Nature}}, title = {{{Sade: competitive MAC under adversarial SINR}}}, doi = {{10.1007/s00446-017-0307-1}}, volume = {{31}}, year = {{2017}}, } @inproceedings{3881, author = {{Wachsmuth, Henning and Naderi, Nona and Hou, Yufang and Bilu, Yonatan and Prabhakaran, Vinodkumar and Thijm, Tim Alberdingk and Hirst, Graeme and Stein, Benno}}, booktitle = {{Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers}}, pages = {{176--187}}, title = {{{Computational Argumentation Quality Assessment in Natural Language}}}, year = {{2017}}, } @article{3882, author = {{Wachsmuth, Henning and Stein, Benno}}, issn = {{1533-5399}}, journal = {{Special Section of the ACM Transactions on Internet Technology: Argumentation in Social Media}}, number = {{3}}, pages = {{1--24}}, title = {{{A Universal Model for Discourse-Level Argumentation Analysis}}}, year = {{2017}}, } @inproceedings{3883, author = {{Wachsmuth, Henning and Naderi, Nona and Habernal, Ivan and Hou, Yufang and Hirst, Graeme and Gurevych, Iryna and Stein, Benno}}, booktitle = {{Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)}}, pages = {{250--255}}, title = {{{Argumentation Quality Assessment: Theory vs. Practice}}}, doi = {{10.18653/v1/P17-2039}}, year = {{2017}}, } @inproceedings{3904, author = {{Hagen, Matthias and Kiesel, Johannes and Alshomary, Milad and Stein, Benno}}, booktitle = {{Working Notes of CLEF 2017 - Conference and Labs of the Evaluation Forum}}, title = {{{Webis at the CLEF 2017 Dynamic Search Lab}}}, year = {{2017}}, } @phdthesis{2908, author = {{Bujna, Kathrin}}, publisher = {{Universität Paderborn}}, title = {{{Soft Clustering Algorithms - Theoretical and Practical Improvements}}}, doi = {{10.17619/UNIPB/1-226}}, year = {{2017}}, } @inproceedings{2967, author = {{Blömer, Johannes and Liske, Gennadij}}, booktitle = {{Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)}}, isbn = {{9783319724522}}, issn = {{0302-9743}}, pages = {{438--453}}, publisher = {{Springer International Publishing}}, title = {{{Subtleties in Security Definitions for Predicate Encryption with Public Index}}}, doi = {{10.1007/978-3-319-72453-9_35}}, volume = {{10693}}, year = {{2017}}, } @article{3108, author = {{Jager, Tibor and Kohlar, Florian and Schäge, Sven and Schwenk, Jörg}}, journal = {{J. Cryptology}}, number = {{4}}, pages = {{1276----1324}}, title = {{{Authenticated Confidential Channel Establishment and the Security of TLS-DHE}}}, doi = {{10.1007/s00145-016-9248-2}}, year = {{2017}}, } @inproceedings{3109, author = {{Hale, Britta and Jager, Tibor and Lauer, Sebastian and Schwenk, Jörg}}, booktitle = {{Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings}}, pages = {{20----38}}, title = {{{Simple Security Definitions for and Constructions of 0-RTT Key Exchange}}}, doi = {{10.1007/978-3-319-61204-1_2}}, year = {{2017}}, } @inproceedings{3110, author = {{Günther, Felix and Hale, Britta and Jager, Tibor and Lauer, Sebastian}}, booktitle = {{Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part III}}, pages = {{519----548}}, title = {{{0-RTT Key Exchange with Full Forward Secrecy}}}, doi = {{10.1007/978-3-319-56617-7_18}}, year = {{2017}}, } @inproceedings{3111, author = {{Jager, Tibor and Stam, Martijn and Stanley-Oakes, Ryan and Warinschi, Bogdan}}, booktitle = {{Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I}}, pages = {{409----441}}, title = {{{Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy}}}, doi = {{10.1007/978-3-319-70500-2_14}}, year = {{2017}}, } @inproceedings{3155, author = {{Töws, Manuel and Wehrheim, Heike}}, booktitle = {{Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi'an, China, November 13-17, 2017, Proceedings}}, editor = {{Duan, Zhenhua and Ong, Luke}}, pages = {{362----378}}, title = {{{Policy Dependent and Independent Information Flow Analyses}}}, doi = {{10.1007/978-3-319-68690-5_22}}, year = {{2017}}, } @inproceedings{3156, author = {{König, Jürgen and Wehrheim, Heike}}, booktitle = {{Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings}}, editor = {{Van Hung, Dang and Kapur, Deepak}}, pages = {{118----135}}, title = {{{Value-Based or Conflict-Based? Opacity Definitions for STMs}}}, doi = {{10.1007/978-3-319-67729-3_8}}, year = {{2017}}, } @inproceedings{2741, author = {{Ali Ashraf, Shehzad and Wang, Y.-P. Eric and Eldessoki, Sameh and Holfeld, Bernd and Parruca, Donald and Serror, Martin and Gross, James}}, publisher = {{Proceedings of 23th European Wireless Conference 2017, 17- 19.05.2017}}, title = {{{From Radio Design to System Evaluations for Ultra-Reliable and Low-Latency Communication }}}, year = {{2017}}, } @inproceedings{112, abstract = {{We study a model of selfish resource allocation that seeks to incorporate dependencies among resources as they exist in in modern networked environments. Our model is inspired by utility functions with constant elasticity of substitution (CES) which is a well-studied model in economics. We consider congestion games with different aggregation functions. In particular, we study $L_p$ norms and analyze the existence and complexity of (approximate) pure Nash equilibria. Additionally, we give an almost tight characterization based on monotonicity properties to describe the set of aggregation functions that guarantee the existence of pure Nash equilibria.}}, author = {{Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}}, booktitle = {{Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)}}, pages = {{222----233}}, title = {{{Congestion Games with Complementarities}}}, doi = {{10.1007/978-3-319-57586-5_19}}, year = {{2017}}, } @inproceedings{113, abstract = {{We study the computation of approximate pure Nash equilibria in Shapley value (SV) weighted congestion games, introduced in [19]. This class of games considers weighted congestion games in which Shapley values are used as an alternative (to proportional shares) for distributing the total cost of each resource among its users. We focus on the interesting subclass of such games with polynomial resource cost functions and present an algorithm that computes approximate pure Nash equilibria with a polynomial number of strategy updates. Since computing a single strategy update is hard, we apply sampling techniques which allow us to achieve polynomial running time. The algorithm builds on the algorithmic ideas of [7], however, to the best of our knowledge, this is the first algorithmic result on computation of approximate equilibria using other than proportional shares as player costs in this setting. We present a novel relation that approximates the Shapley value of a player by her proportional share and vice versa. As side results, we upper bound the approximate price of anarchy of such games and significantly improve the best known factor for computing approximate pure Nash equilibria in weighted congestion games of [7].}}, author = {{Feldotto, Matthias and Gairing, Martin and Kotsialou, Grammateia and Skopalik, Alexander}}, booktitle = {{Proceedings of the 13th International Conference on Web and Internet Economics (WINE)}}, title = {{{Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games}}}, doi = {{10.1007/978-3-319-71924-5_14}}, year = {{2017}}, } @inproceedings{114, abstract = {{Proof witnesses are proof artifacts showing correctness of programs wrt. safety properties. The recent past has seen a rising interest in witnesses as (a) proofs in a proof-carrying-code context, (b) certificates for the correct functioning of verification tools, or simply (c) exchange formats for (partial) verification results. As witnesses in all theses scenarios need to be stored and processed, witnesses are required to be as small as possible. However, software verification tools – the prime suppliers of witnesses – do not necessarily construct small witnesses. In this paper, we present a formal account of proof witnesses. We introduce the concept of weakenings, reducing the complexity of proof witnesses while preserving the ability of witnessing safety. We develop aweakening technique for a specific class of program analyses, and prove it to be sound. Finally, we experimentally demonstrate our weakening technique to indeed achieve a size reduction of proof witnesses.}}, author = {{Jakobs, Marie-Christine and Wehrheim, Heike}}, booktitle = {{NASA Formal Methods: 9th International Symposium}}, editor = {{Barrett, Clark and Davies, Misty and Kahsai, Temesghen}}, pages = {{389--403}}, title = {{{Compact Proof Witnesses}}}, doi = {{10.1007/978-3-319-57288-8_28}}, year = {{2017}}, }