@misc{5968, author = {{N, N}}, publisher = {{Universität Paderborn}}, title = {{{Wie werden elektronische Verhandlungen durch Präferenzen beeinflusst?}}}, year = {{2018}}, } @misc{5966, author = {{N, N}}, publisher = {{Universität Paderborn}}, title = {{{Bitcoins disruptives Potenzial im elektronischem Zahlungsverkehr}}}, year = {{2018}}, } @misc{5969, author = {{N, N}}, publisher = {{Universität Paderborn}}, title = {{{Diskriminierung in sozialen Netzwerken durch Versionierung}}}, year = {{2018}}, } @misc{5965, author = {{N, N}}, publisher = {{Universität Paderborn}}, title = {{{School Choice in Theory}}}, year = {{2018}}, } @misc{9924, author = {{N, N}}, publisher = {{Universität Paderborn}}, title = {{{Punktesystem für Zuwanderung in Deutschland nach Vorbild von Kanada}}}, year = {{2018}}, } @misc{9926, author = {{N, N}}, publisher = {{Universität Paderborn}}, title = {{{Agenda setting in jury decision by sequential majority voting}}}, year = {{2018}}, } @misc{9925, author = {{N, N}}, publisher = {{Universität Paderborn}}, title = {{{Verbindung Terrorismusforschung und Spieltheorie}}}, year = {{2018}}, } @misc{5417, abstract = {{Molecular Dynamic (MD) simulations are computationally intensive and accelerating them using specialized hardware is a topic of investigation in many studies. One of the routines in the critical path of MD simulations is the three-dimensional Fast Fourier Transformation (FFT3d). The potential in accelerating FFT3d using hardware is usually bound by bandwidth and memory. Therefore, designing a high throughput solution for an FPGA that overcomes this problem is challenging. In this thesis, the feasibility of offloading FFT3d computations to FPGA implemented using OpenCL is investigated. In order to mask the latency in memory access, an FFT3d that overlaps computation with communication is designed. The implementa- tion of this design is synthesized for the Arria 10 GX 1150 FPGA and evaluated with the FFTW benchmark. Analysis shows a better performance using FPGA over CPU for larger FFT sizes, with the 643 FFT showing a 70% improvement in runtime using FPGAs. This FFT3d design is integrated with CP2K to explore the potential in accelerating molecular dynamic simulations. Evaluation of CP2K simulations using FPGA shows a 41% improvement in runtime in FFT3d computations over CPU for larger FFT3d designs.}}, author = {{Ramaswami, Arjun}}, keywords = {{FFT: FPGA, CP2K, OpenCL}}, publisher = {{Universität Paderborn}}, title = {{{Accelerating Molecular Dynamic Simulations by Offloading Fast Fourier Transformations to FPGA}}}, year = {{2018}}, } @inproceedings{11710, author = {{Chen, Wei-Fan and Wachsmuth, Henning and Al Khatib, Khalid and Stein, Benno}}, booktitle = {{Proceedings of the 11th International Conference on Natural Language Generation}}, pages = {{79--88}}, publisher = {{Association for Computational Linguistics}}, title = {{{Learning to Flip the Bias of News Headlines}}}, year = {{2018}}, } @inproceedings{14873, author = {{Chen, Wei-Fan and Hagen, Matthias and Stein, Benno and Potthast, Martin}}, booktitle = {{Proceedings of the 41st International ACM SIGIR Conference on Research & Development in Information Retrieval}}, pages = {{1033--1036}}, title = {{{A User Study on Snippet Generation: Text Reuse vs. Paraphrases}}}, year = {{2018}}, } @inproceedings{14885, author = {{Potthast, Martin and Chen, Wei-Fan and Hagen, Matthias and Stein, Benno}}, booktitle = {{Proceedings of the Second International Workshop on Recent Trends in News Information Retrieval}}, pages = {{3--5}}, title = {{{A Plan for Ancillary Copyright: Original Snippets.}}}, year = {{2018}}, } @inproceedings{3873, author = {{Blömer, Johannes and Eidens, Fabian and Juhnke, Jakob}}, booktitle = {{The International Conference on Cryptology And Network Security (CANS)}}, isbn = {{978-3-030-00434-7}}, location = {{Naples, Italy}}, pages = {{235--255}}, publisher = {{Springer}}, title = {{{Enhanced Security of Attribute-Based Signatures}}}, doi = {{10.1007/978-3-030-00434-7_12}}, volume = {{11124}}, year = {{2018}}, } @inproceedings{2379, abstract = {{In this paper, we introduce the notion of delegatable attribute-based anonymous credentials (DAAC). Such systems offer fine-grained anonymous access control and they give the credential holder the ability to issue more restricted credentials to other users. In our model, credentials are parameterized with attributes that (1) express what the credential holder himself has been certified and (2) define which attributes he may issue to others. Furthermore, we present a practical construction of DAAC. For this construction, we deviate from the usual approach of embedding a certificate chain in the credential. Instead, we introduce a novel approach for which we identify a new primitive we call dynamically malleable signatures (DMS) as the main ingredient. This primitive may be of independent interest. We also give a first instantiation of DMS with efficient protocols. }}, author = {{Blömer, Johannes and Bobolz, Jan}}, booktitle = {{ACNS 2018 Applied Cryptography & Network security}}, location = {{Leuven, Belgium}}, title = {{{Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures}}}, doi = {{10.1007/978-3-319-93387-0_12}}, year = {{2018}}, } @phdthesis{1209, abstract = {{My dissertation deals with the Gathering problem for swarms of n point-shaped robots on a grid, in which all robots of the swarm are supposed to gather at a previously undefined point. Special attention is paid to the strong limitation of robot capabilities. These include in particular the lack of global control, a global compass, global visibility and (global) communication skills. Furthermore, all robots are identical. The robots are given only local abilities. This includes a constant range of vision. The robots all work completely synchronously. In this work we present and analyze three different Gathering strategies in different robot models. We formally prove correctness and total running time: Chapter 4 focuses on minimizing the available robot capabilities. The underlying strategy completes the gathering in O(n^2) time. For the following Chapters 5 and 6, the aim is to optimize the total running time under using only local robot capabilities: We additionally allow a constant-sized memory and a constant number of locally visible statuses (lights, flags). For the strategies of both chapters we show an asymptotically optimal running time of O(n). Unlike in Chapters 4 and 5, we additionally restrict connectivity and vision to an initially given chain connectivity in Chapter 6, where two chain neighbors must have a distance of 1 from each other. A robot can only see and interact with a constant number of its direct chain neighbors.}}, author = {{Jung, Daniel}}, isbn = {{978-3-942647-99-1}}, publisher = {{Universität Paderborn}}, title = {{{Local Strategies for Swarm Formations on a Grid}}}, doi = {{10.17619/UNIPB/1-271}}, year = {{2018}}, } @misc{37703, author = {{Olemedo Aragon, Karen Elisabeth}}, title = {{{Cartel Cases in the EU Financial Derivatives Market - The Role of Facilitating Factors}}}, year = {{2018}}, } @inproceedings{1588, abstract = {{The exploration of FPGAs as accelerators for scientific simulations has so far mostly been focused on small kernels of methods working on regular data structures, for example in the form of stencil computations for finite difference methods. In computational sciences, often more advanced methods are employed that promise better stability, convergence, locality and scaling. Unstructured meshes are shown to be more effective and more accurate, compared to regular grids, in representing computation domains of various shapes. Using unstructured meshes, the discontinuous Galerkin method preserves the ability to perform explicit local update operations for simulations in the time domain. In this work, we investigate FPGAs as target platform for an implementation of the nodal discontinuous Galerkin method to find time-domain solutions of Maxwell's equations in an unstructured mesh. When maximizing data reuse and fitting constant coefficients into suitably partitioned on-chip memory, high computational intensity allows us to implement and feed wide data paths with hundreds of floating point operators. By decoupling off-chip memory accesses from the computations, high memory bandwidth can be sustained, even for the irregular access pattern required by parts of the application. Using the Intel/Altera OpenCL SDK for FPGAs, we present different implementation variants for different polynomial orders of the method. In different phases of the algorithm, either computational or bandwidth limits of the Arria 10 platform are almost reached, thus outperforming a highly multithreaded CPU implementation by around 2x.}}, author = {{Kenter, Tobias and Mahale, Gopinath and Alhaddad, Samer and Grynko, Yevgen and Schmitt, Christian and Afzal, Ayesha and Hannig, Frank and Förstner, Jens and Plessl, Christian}}, booktitle = {{Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)}}, keywords = {{tet_topic_hpc}}, publisher = {{IEEE}}, title = {{{OpenCL-based FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method for Unstructured Meshes}}}, doi = {{10.1109/FCCM.2018.00037}}, year = {{2018}}, } @inproceedings{1204, author = {{Riebler, Heinrich and Vaz, Gavin Francis and Kenter, Tobias and Plessl, Christian}}, booktitle = {{Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)}}, isbn = {{9781450349826}}, keywords = {{htrop}}, publisher = {{ACM}}, title = {{{Automated Code Acceleration Targeting Heterogeneous OpenCL Devices}}}, doi = {{10.1145/3178487.3178534}}, year = {{2018}}, } @inproceedings{2851, author = {{Markarian, Christine}}, booktitle = {{International Conference on Operations Research (OR)}}, location = {{Berlin}}, title = {{{Leasing with Uncertainty}}}, doi = {{10.1007/978-3-319-89920-6_57}}, year = {{2017}}, } @inproceedings{2696, author = {{Zimmermann, Steffen and Herrmann, Philipp and Kundisch, Dennis and Nault, Barrie}}, booktitle = {{Workshop Theory in Economics of Information Systems (TEIS)}}, location = {{Sonoma, USA}}, title = {{{Decomposing the Variance of Online Consumer Ratings and the Impact on Price and Demand}}}, year = {{2017}}, } @misc{3291, abstract = {{The microservice architecture uses independently running microservices as build- ing blocks for applications. These microservices are clearly bounded for each other and expose their functionality through, for instance, RESTful application inter- faces. Particularly the clear boundaries between microservices enable the reuse of microservice throughout different projects. Because of the increasing use of microservices, the composition of multiple microservices in service composition becomes a more important task. A challenging area in developing service compo- sitions is that it involves two distinct layers with few junctions. On the one hand, describes a service composition a business process, which involves multiple com- ponents. On the other hand, involves the implementation of a service composition topics like service discovery and message exchange protocols since the microser- vices involved in a service composition are located within a network environment. In this Bachelor’s Thesis, I describe a descriptions language to abstractly describe the business logic of a service composition. Furthermore, I describe a genera- tion process, which compiles this abstract description to a working microservice realizing the specified service composition. In addition to that, I provide an im- plementation of the generation process, as a proof of concept, and test it within a Kubernetes-based cluster environment.}}, author = {{Schürmann, Andreas}}, publisher = {{Universität Paderborn}}, title = {{{Microservice-based Execution Environment for Service Compositions}}}, year = {{2017}}, }