@inproceedings{3588,
  abstract     = {{In scientific computing, unstructured meshes are a crucial foundation for the simulation of real-world physical phenomena. Compared to regular grids, they allow resembling the computational domain with a much higher accuracy, which in turn leads to more efficient computations.<br />There exists a wealth of supporting libraries and frameworks that aid programmers with the implementation of applications working on such grids, each built on top of existing parallelization technologies. However, many approaches require the programmer to introduce a different programming paradigm into their application or provide different variants of the code. SYCL is a new programming standard providing a remedy to this dilemma by building on standard C ++17 with its so-called single-source approach: Programmers write standard C ++ code and expose parallelism using C++17 keywords. The application is<br />then transformed into a concrete implementation by the SYCL implementation. By encapsulating the OpenCL ecosystem, different SYCL implementations enable not only the programming of CPUs but also of heterogeneous platforms such as GPUs or other devices. For the first time, this paper showcases a SYCL-<br />based solver for the nodal Discontinuous Galerkin method for Maxwell’s equations on unstructured meshes. We compare our solution to a previous C-based implementation with respect to programmability and performance on heterogeneous platforms.<br}},
  author       = {{Afzal, Ayesha and Schmitt, Christian and Alhaddad, Samer and Grynko, Yevgen and Teich, Jürgen and Förstner, Jens and Hannig, Frank}},
  booktitle    = {{Proceedings of the 29th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP)}},
  isbn         = {{978-1-5386-7479-6}},
  keywords     = {{tet_topic_hpc}},
  pages        = {{49--56}},
  title        = {{{Solving Maxwell's Equations with Modern C++ and SYCL: A Case Study}}},
  doi          = {{10.1109/ASAP.2018.8445127}},
  year         = {{2018}},
}

@phdthesis{3720,
  abstract     = {{Traditional cache design uses a consolidated block of memory address bits to index a cache set, equivalent to the use of modulo functions. While this module-based mapping scheme is widely used in contemporary cache structures due to the simplicity of its hardware design and its good performance for sequences of consecutive addresses, its use may not be satisfactory for a variety of application domains having different characteristics.This thesis presents a new type of cache mapping scheme, motivated by programmable capabilities combined with Nature-inspired optimization of reconfigurable hardware. This research has focussed on an FPGA-based evolvable cache structure of the first level cache in a multi-core processor architecture, able to dynamically change cache indexing. To solve the challenge of reconfigurable cache mappings, a programmable Boolean circuit based on a combination of Look-up Table (LUT) memory elements is proposed. Focusing on optimization aspects at the system level, a Performance Measurement Infrastructure is introduced that is able to monitor the underlying microarchitectural metrics, and an adaptive evaluation strategy is presented that leverages on Evolutionary Algorithms, that is not only capable of evolving application-specific address-to-cache-index mappings for level one split caches but also of reducing optimization times. Putting this all together and prototyping in an FPGA for a LEON3/Linux-based multi-core processor, the creation of a system architecture reduces cache misses and improves performance over the use of conventional caches.}},
  author       = {{Ho, Nam}},
  pages        = {{139}},
  publisher    = {{Universität Paderborn}},
  title        = {{{FPGA-based Reconfigurable Cache Mapping Schemes: Design and Optimization}}},
  doi          = {{10.17619/UNIPB/1-376}},
  year         = {{2018}},
}

@article{3740,
  abstract     = {{Oblique propagation of semi-guided waves across slab waveguide structures with bent corners is investigated. A critical angle can be defined beyond which all radiation losses are suppressed. Additionally an increase of the curvature radius of the bends also leads to low-loss configurations for incidence angles below that critical angle. A combination of two bent corner systems represents a step-like structure, behaving like a Fabry-Perot interferometer, with two partial reflectors separated by the vertical height between the horizontal slabs. We numerically analyse typical high-index-contrast Si/SiO2 structures for their reflectance and transmittance properties. When increasing the curvature radius the resonant effect becomes less relevant such that full transmittance is reached with less critical conditions on the vertical distance or the incidence angle. For practical interest 3-D problems are considered, where the structures are excited by the fundamental mode of a wide, shallow rib waveguide. High transmittance levels can be observed also for these 3-D configurations depending on the width of the rib.}},
  author       = {{Ebers, Lena and Hammer, Manfred and Förstner, Jens}},
  journal      = {{Optics Express}},
  keywords     = {{tet_topic_waveguide}},
  number       = {{14}},
  pages        = {{18621--18632}},
  publisher    = {{OSA Publishing}},
  title        = {{{Oblique incidence of semi-guided planar waves on slab waveguide steps: effects of rounded edges}}},
  doi          = {{10.1364/OE.26.018621}},
  volume       = {{26}},
  year         = {{2018}},
}

@inproceedings{3804,
  author       = {{Al Khatib, Khalid and Wachsmuth, Henning and Lang, Kevin and Herpel, Jakob and Hagen, Matthias and Stein, Benno}},
  booktitle    = {{Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)}},
  pages        = {{2545--2555}},
  title        = {{{Modeling Deliberative Argumentation Strategies on Wikipedia}}},
  year         = {{2018}},
}

@inproceedings{3806,
  author       = {{Habernal, Ivan and Wachsmuth, Henning and Gurevych, Iryna and Stein, Benno}},
  booktitle    = {{Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers)}},
  pages        = {{386--396}},
  title        = {{{Before Name-Calling: Dynamics and Triggers of Ad Hominem Fallacies in Web Argumentation}}},
  year         = {{2018}},
}

@inproceedings{3807,
  author       = {{Habernal, Ivan and Wachsmuth, Henning and Gurevych, Iryna and Stein, Benno}},
  booktitle    = {{Proceedings of The 12th International Workshop on Semantic Evaluation}},
  pages        = {{763--772}},
  title        = {{{SemEval-2018 Task 12: The Argument Reasoning Comprehension Task}}},
  year         = {{2018}},
}

@inproceedings{3821,
  author       = {{Wachsmuth, Henning and Syed, Shahbaz and Stein, Benno}},
  booktitle    = {{Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)}},
  pages        = {{241--251}},
  title        = {{{Retrieval of the Best Counterargument without Prior Topic Knowledge}}},
  year         = {{2018}},
}

@misc{3851,
  author       = {{Koop, Samuel}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Congestion Games mit gewichteten Strategien}}},
  year         = {{2018}},
}

@inproceedings{3852,
  abstract     = {{In automated machine learning (AutoML), the process of engineering machine learning applications with respect to a specific problem is (partially) automated.
Various AutoML tools have already been introduced to provide out-of-the-box machine learning functionality.
More specifically, by selecting machine learning algorithms and optimizing their hyperparameters, these tools produce a machine learning pipeline tailored to the problem at hand.
Except for TPOT, all of these tools restrict the maximum number of processing steps of such a pipeline.
However, as TPOT follows an evolutionary approach, it suffers from performance issues when dealing with larger datasets.
In this paper, we present an alternative approach leveraging a hierarchical planning to configure machine learning pipelines that are unlimited in length.
We evaluate our approach and find its performance to be competitive with other AutoML tools, including TPOT.}},
  author       = {{Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}},
  booktitle    = {{ICML 2018 AutoML Workshop}},
  keywords     = {{automated machine learning, complex pipelines, hierarchical planning}},
  location     = {{Stockholm, Sweden}},
  title        = {{{ML-Plan for Unlimited-Length Machine Learning Pipelines}}},
  year         = {{2018}},
}

@proceedings{3874,
  editor       = {{Scheideler, Christian and Fineman, Jeremy T.}},
  isbn         = {{978-1-4503-5799-9}},
  location     = {{Vienna, Austria}},
  publisher    = {{ACM}},
  title        = {{{Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures}}},
  year         = {{2018}},
}

@inproceedings{2965,
  author       = {{Blömer, Johannes and Löken, Nils}},
  booktitle    = {{Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018}},
  isbn         = {{978-1-4503-6448-5}},
  location     = {{Hamburg, Germany}},
  pages        = {{25:1----25:10}},
  publisher    = {{ACM}},
  title        = {{{Cloud Architectures for Searchable Encryption}}},
  doi          = {{10.1145/3230833.3230853}},
  year         = {{2018}},
}

@inproceedings{3105,
  author       = {{Derler, David and Jager, Tibor and Slamanig, Daniel and Striecks, Christoph}},
  booktitle    = {{Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III}},
  pages        = {{425----455}},
  title        = {{{Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange}}},
  doi          = {{10.1007/978-3-319-78372-7_14}},
  year         = {{2018}},
}

@article{3152,
  abstract     = {{To adapt to continuously changing workloads in networks, components of the running network services may need to be replicated (scaling the network service) and allocated to physical resources (placement) dynamically, also necessitating dynamic re-routing of flows between service components. In this paper, we propose JASPER, a fully automated approach to jointly optimizing scaling, placement, and routing for complex network services, consisting of multiple (virtualized) components. JASPER handles multiple network services that share the same substrate network; services can be dynamically added or removed and dynamic workload changes are handled. Our approach lets service designers specify their services on a high level of abstraction using service templates. JASPER automatically makes scaling, placement and routing decisions, enabling quick reaction to changes. We formalize the problem, analyze its complexity, and develop two algorithms to solve it. Extensive empirical results show the applicability and effectiveness of the proposed approach.}},
  author       = {{Dräxler, Sevil and Karl, Holger and Mann, Zoltan Adam}},
  journal      = {{IEEE Transactions on Network and Service Management}},
  publisher    = {{IEEE}},
  title        = {{{JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services}}},
  doi          = {{10.1109/TNSM.2018.2846572}},
  year         = {{2018}},
}

@article{3153,
  author       = {{Doherty, Simon and Derrick, John and Dongol, Brijesh and Wehrheim, Heike}},
  journal      = {{CoRR}},
  title        = {{{Causal Linearizability: Compositionality for Partially Ordered Executions}}},
  year         = {{2018}},
}

@unpublished{2711,
  abstract     = {{In recent years, researchers have developed a number of tools to conduct
taint analysis of Android applications. While all the respective papers aim at
providing a thorough empirical evaluation, comparability is hindered by varying
or unclear evaluation targets. Sometimes, the apps used for evaluation are not
precisely described. In other cases, authors use an established benchmark but
cover it only partially. In yet other cases, the evaluations differ in terms of
the data leaks searched for, or lack a ground truth to compare against. All
those limitations make it impossible to truly compare the tools based on those
published evaluations.
  We thus present ReproDroid, a framework allowing the accurate comparison of
Android taint analysis tools. ReproDroid supports researchers in inferring the
ground truth for data leaks in apps, in automatically applying tools to
benchmarks, and in evaluating the obtained results. We use ReproDroid to
comparatively evaluate on equal grounds the six prominent taint analysis tools
Amandroid, DIALDroid, DidFail, DroidSafe, FlowDroid and IccTA. The results are
largely positive although four tools violate some promises concerning features
and accuracy. Finally, we contribute to the area of unbiased benchmarking with
a new and improved version of the open test suite DroidBench.}},
  author       = {{Pauck, Felix and Bodden, Eric and Wehrheim, Heike}},
  booktitle    = {{arXiv:1804.02903}},
  title        = {{{Do Android Taint Analysis Tools Keep their Promises?}}},
  year         = {{2018}},
}

@phdthesis{1138,
  author       = {{Gmyr, Robert}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Distributed Algorithms for Overlay Networks and Programmable Matter}}},
  doi          = {{10.17619/UNIPB/1-265}},
  year         = {{2018}},
}

@inproceedings{1163,
  abstract     = {{In this paper we present two major results:
First, we introduce the first self-stabilizing version of a supervised overlay network (as introduced in~\cite{DBLP:conf/ispan/KothapalliS05}) by presenting a self-stabilizing supervised skip ring.
Secondly, we show how to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing publish-subscribe system.
That is, in addition to stabilizing the overlay network, every subscriber of a topic will eventually know all of the publications that have been issued so far for that topic. The communication work needed to processes a subscribe or unsubscribe operation is just a constant in a legitimate state, and the communication work of checking whether the system is still in a legitimate state is just a constant on expectation for the supervisor as well as any process in the system.
}},
  author       = {{Feldmann, Michael and Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik}},
  booktitle    = {{Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)}},
  keywords     = {{Topological Self-stabilization, Supervised Overlay, Publish-Subscribe System}},
  location     = {{Vancouver}},
  publisher    = {{IEEE}},
  title        = {{{Self-Stabilizing Supervised Publish-Subscribe Systems}}},
  doi          = {{10.1109/IPDPS.2018.00114}},
  year         = {{2018}},
}

@inproceedings{1164,
  abstract     = {{We propose a distributed protocol for a queue, called Skueue, which spreads its data fairly onto multiple processes, avoiding bottlenecks in high throughput scenarios.
Skueuecan be used in highly dynamic environments, through the addition of join and leave requests to the standard queue operations enqueue and dequeue.
Furthermore Skueue satisfies sequential consistency in the asynchronous message passing model.
Scalability is achieved by aggregating multiple requests to a batch, which can then be processed in a distributed fashion without hurting the queue semantics.
Operations in Skueue need a logarithmic number of rounds w.h.p. until they are processed, even under a high rate of incoming requests.}},
  author       = {{Feldmann, Michael and Scheideler, Christian and Setzer, Alexander}},
  booktitle    = {{Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)}},
  location     = {{Vancouver}},
  publisher    = {{IEEE}},
  title        = {{{Skueue: A Scalable and Sequentially Consistent Distributed Queue}}},
  doi          = {{10.1109/IPDPS.2018.00113}},
  year         = {{2018}},
}

@unpublished{1165,
  author       = {{Witschen, Linus Matthias and Wiersema, Tobias and Platzner, Marco}},
  booktitle    = {{4th Workshop On Approximate Computing (WAPCO 2018)}},
  title        = {{{Making the Case for Proof-carrying Approximate Circuits}}},
  year         = {{2018}},
}

@inproceedings{2109,
  abstract     = {{In multinomial classification, reduction techniques are commonly used to decompose the original learning problem into several simpler problems. For example, by recursively bisecting the original set of classes, so-called nested dichotomies define a set of binary classification problems that are organized in the structure of a binary tree. In contrast to the existing one-shot heuristics for constructing nested dichotomies and motivated by recent work on algorithm configuration, we propose a genetic algorithm for optimizing the structure of such dichotomies. A key component of this approach is the proposed genetic representation that facilitates the application of standard genetic operators, while still supporting the exchange of partial solutions under recombination. We evaluate the approach in an extensive experimental study, showing that it yields classifiers with superior generalization performance.}},
  author       = {{Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018}},
  keywords     = {{Classification, Hierarchical Decomposition, Indirect Encoding}},
  location     = {{Kyoto, Japan}},
  publisher    = {{ACM}},
  title        = {{{Ensembles of Evolved Nested Dichotomies for Classification}}},
  doi          = {{10.1145/3205455.3205562}},
  year         = {{2018}},
}