@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{29460,
  abstract     = {{STT-RAM cells can be considered as an alternative or a hybrid addition to today's SRAM-based cache memories. This is mostly because of their scalability and low leakage power. Moreover, their data storing mechanism (storing the value as resistance) makes them very suitable and applicable for multivalue cache architectures. This feature results in system performance enhancement without any area overhead. On the other hand, the required two-step read/write procedure in multilevel cells results in a non-uniform time access and energy and power overhead on the system. In this paper, we propose a new architecture to dynamically swap data between soft (fast read access) and hard (slow read access) bits in ML cell. Moreover, by reconfiguring cache block size, the proposed architecture can switch between ML and SL modes at runtime. In other words, the swapping method places the hot part of each cache block into soft-bits and the less accessed part into the hard-bits. The SL/ML switching method benefits from the low latency and energy of SL mode and the high storing capacity of ML mode at the same time. Although experimental results show that our proposed method slightly increases the miss rate compared with the conventional ML caches, the performance and energy are improved by 4.9% and 6.5%, respectively. Also, the storage overhead of our method is about 1% that is negligible.}},
  author       = {{Rezaeizadeh Rookerd, Ramin and Sadeghi-Kohan, Somayeh and Navabi, Zainalabedin}},
  booktitle    = {{Proceedings of the 2018 on Great Lakes Symposium on VLSI}},
  publisher    = {{ACM}},
  title        = {{{Performance and Energy Enhancement through an Online Single/Multi Level Mode Switching Cache Architecture}}},
  doi          = {{10.1145/3194554.3194599}},
  year         = {{2018}},
}

@article{8753,
  abstract     = {{In a wide range of applications it is desirable to optimally control a dynamical system with respect to concurrent, potentially competing goals. This gives rise to a multiobjective optimal control problem where, instead of computing a single optimal solution, the set of optimal compromises, the so-called Pareto set, has to be approximated. When the problem under consideration is described by a partial differential equation (PDE), as is the case for fluid flow, the computational cost rapidly increases and makes its direct treatment infeasible. Reduced order modeling is a very popular method to reduce the computational cost, in particular in a multi query context such as uncertainty quantification, parameter estimation or optimization. In this article, we show how to combine reduced order modeling and multiobjective optimal control techniques in order to efficiently solve multiobjective optimal control problems constrained by PDEs. We consider a global, derivative free optimization method as well as a local, gradient-based approach for which the optimality system is derived in two different ways. The methods are compared with regard to the solution quality as well as the computational effort and they are illustrated using the example of the flow around a cylinder and a backward-facing-step channel flow.}},
  author       = {{Peitz, Sebastian and Ober-Blöbaum, Sina and Dellnitz, Michael}},
  issn         = {{0167-8019}},
  journal      = {{Acta Applicandae Mathematicae}},
  number       = {{1}},
  pages        = {{171–199}},
  title        = {{{Multiobjective Optimal Control Methods for the Navier-Stokes Equations Using Reduced Order Modeling}}},
  doi          = {{10.1007/s10440-018-0209-7}},
  volume       = {{161}},
  year         = {{2018}},
}

@inproceedings{29425,
  author       = {{Jiménez, F. and Ober-Blöbaum, Sina}},
  booktitle    = {{6th European Conference on Computational Mechanics}},
  title        = {{{Necessary optimality conditions for optimally controlled dissipative mechanical systems modelled through fractional derivatives}}},
  year         = {{2018}},
}

@inproceedings{29427,
  author       = {{Jiménez, F. and Ober-Blöbaum, Sina}},
  booktitle    = {{6th IFAC Workshop on Lagrangian and Hamiltonian Methods for Nonlinear Control LHMNC 2018}},
  pages        = {{50--55}},
  title        = {{{A fractional variational approach for modelling dissipative mechanical systems continuous and discrete settings}}},
  volume       = {{51(3)}},
  year         = {{2018}},
}

@inproceedings{30632,
  author       = {{Vogt, Thorsten and Badeda, Julia and Böcker, Joachim and Sauer, Dirk Uwe}},
  booktitle    = {{2017 IEEE 12th International Conference on Power Electronics and Drive Systems (PEDS)}},
  publisher    = {{IEEE}},
  title        = {{{Consideration on primary control reserve provision by industrial microgrids in grid-coupled operation}}},
  doi          = {{10.1109/peds.2017.8289189}},
  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{4575,
  author       = {{Sprenger, Alexander and Hellebrand, Sybille}},
  booktitle    = {{2018 IEEE 21st International Symposium on Design and Diagnostics of Electronic Circuits & Systems (DDECS)}},
  isbn         = {{9781538657546}},
  publisher    = {{IEEE}},
  title        = {{{Tuning Stochastic Space Compaction to Faster-than-at-Speed Test}}},
  doi          = {{10.1109/ddecs.2018.00020}},
  year         = {{2018}},
}

@inproceedings{10575,
  author       = {{Liu, Chang and Schneider, Eric and Kampmann, Matthias and Hellebrand, Sybille and Wunderlich, Hans-Joachim}},
  booktitle    = {{27th IEEE Asian Test Symposium (ATS'18)}},
  isbn         = {{9781538694664}},
  title        = {{{Extending Aging Monitors for Early Life and Wear-Out Failure Prevention}}},
  doi          = {{10.1109/ats.2018.00028}},
  year         = {{2018}},
}

@inproceedings{31371,
  author       = {{Hoffmann, Max}},
  booktitle    = {{Beiträge zum Mathematikunterricht 2018}},
  pages        = {{815--818}},
  publisher    = {{WTM-Verlag}},
  title        = {{{Schnittstellenaufgaben im Praxiseinsatz: Aufgabenbeispiel zur „Bleistiftstetigkeit“ und allgemeine Überlegungen zu möglichen Problemen beim Einsatz solcher Aufgaben}}},
  doi          = {{10.17877/DE290R-19412}},
  year         = {{2018}},
}

@article{31375,
  author       = {{Grieser, Daniel and Hoffmann, Max and Koepf, Wolfram and Kramer, Jürg}},
  journal      = {{Der Mathematikunterricht}},
  pages        = {{48–54}},
  title        = {{{Anfängervorlesungen}}},
  volume       = {{64 (5)}},
  year         = {{2018}},
}

@misc{31382,
  author       = {{Hoffmann, Max}},
  booktitle    = {{Mathematische Semesterberichte}},
  pages        = {{299–301}},
  title        = {{{Rezension: Dörte Haftendorn: Kurven erkunden und verstehen – Mit GeoGebra und anderen Werkzeugen}}},
  doi          = {{10.1007/s00591-018-0222-y}},
  volume       = {{65}},
  year         = {{2018}},
}

@book{31380,
  editor       = {{Greefrath, Gilbert and Hoffmann, Max and Koepf, Wolfram}},
  title        = {{{Der Mathematikunterricht 64 (5): Mathematik in Schule und Hochschule – wie groß ist die Lücke und wie gehen wir mit ihr um?}}},
  year         = {{2018}},
}

@article{33335,
  abstract     = {{For a class of one-dimensional autoregressive sequences (Xn), we consider the tail behaviour of the stopping time T0=min{n≥1:Xn≤0}. We discuss existing general analytical approaches to this and related problems and propose a new one, which is based on a renewal-type decomposition for the moment generating function of T0 and on the analytical Fredholm alternative. Using this method, we show that Px(T0=n)∼V(x)Rn0 for some 0<R0<1 and a positive R0-harmonic function V. Further, we prove that our conditions on the tail behaviour of the innovations are sharp in the sense that fatter tails produce non-exponential decay factors.}},
  author       = {{Hinrichs, Günter and Kolb, Martin and Wachtel, Vitali}},
  journal      = {{Journal of Theoretical Probability}},
  pages        = {{65–102}},
  publisher    = {{Springer Science + Business Media}},
  title        = {{{Persistence of one-dimensional AR(1)-processes}}},
  doi          = {{https://link.springer.com/article/10.1007/s10959-018-0850-0}},
  volume       = {{33}},
  year         = {{2018}},
}

@inproceedings{5831,
  abstract     = {{Many websites offer links to social media sites for convenient content sharing. Unfortunately, those sharing capabilities are quite restricted and it is seldom possible to share content with other services, like those provided by a user's favorite applications or smart devices. In this paper, we present Semantic Data Mediator (SDM) --- a flexible middleware linking a vast number of services to millions of websites. Based on reusable repositories of service descriptions defined by the crowd, users can easily fill a personal registry with their favorite services, which can then be linked to websites by SDM. For this, SDM leverages semantic data, which is already available on millions of websites due to search engine optimization. Further support for our approach from website or service developers is not required. To enable the use of a broad range of services, data conversion services are automatically composed by SDM to transform data according to the needs of the different services. In addition to linking web services, various service adapters allow services of applications and smart devices to be linked as well. We have fully implemented our approach and present a real-world case study demonstrating its feasibility and usefulness.}},
  author       = {{Wolters, Dennis and Heindorf, Stefan and Kirchhoff, Jonas and Engels, Gregor}},
  booktitle    = {{Service-Oriented Computing -- ICSOC 2017 Workshops}},
  editor       = {{Braubach, Lars and Murillo, Juan M. and Kaviani, Nima and Lama, Manuel and Burgueño, Loli and Moha, Naouel and Oriol, Marc}},
  isbn         = {{978-3-319-91764-1}},
  pages        = {{388--392}},
  publisher    = {{Springer International Publishing}},
  title        = {{{Semantic Data Mediator: Linking Services to Websites}}},
  doi          = {{10.1007/978-3-319-91764-1_36}},
  year         = {{2018}},
}

@inproceedings{1379,
  author       = {{Seemann, Nina and Geierhos, Michaela and Merten, Marie-Luis and Tophinke, Doris and Wever, Marcel Dominik and Hüllermeier, Eyke}},
  booktitle    = {{Postersession Computerlinguistik der 40. Jahrestagung der Deutschen Gesellschaft für Sprachwissenschaft}},
  editor       = {{Eckart, Kerstin  and Schlechtweg, Dominik }},
  location     = {{Stuttgart, Germany}},
  title        = {{{Supporting the Cognitive Process in Annotation Tasks}}},
  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}},
}

