@misc{74, author = {{Knorr, Christoph}}, publisher = {{Universität Paderborn}}, title = {{{OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten}}}, year = {{2017}}, } @inproceedings{8559, author = {{Liebendörfer, Michael and Hochmuth, Reinhard}}, booktitle = {{Didactics of Mathematics in Higher Education as a Scientific Discipline - Conference Proceedings}}, editor = {{Göller, Robin and Biehler, Rolf and Hochmuth, Reinhard and Rück, Hans-Georg}}, pages = {{286--293}}, publisher = {{Universität Kassel}}, title = {{{Perceived Competence and Incompetence in the First Year of Mathematics Studies: Forms and Situations}}}, year = {{2017}}, } @article{8564, author = {{Liebendörfer, Michael and Schukajlow, Stanislaw}}, issn = {{1863-9690, 1863-9704}}, journal = {{ZDM}}, number = {{3}}, pages = {{355--366}}, title = {{{Interest development during the first year at university: do mathematical beliefs predict interest in mathematics?}}}, doi = {{10.1007/s11858-016-0827-3}}, volume = {{49}}, year = {{2017}}, } @inproceedings{87, abstract = {{Management of complex network services requires flexible and efficient service provisioning as well as optimized handling of continuous changes in the workload of the service.To adapt to changes in the demand, service components need to be replicated (scaling) and allocated to physical resources (placement) dynamically. In this paper, we propose a fullyautomated approach to the joint optimization problem of scaling and placement, 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 andeffectiveness of the proposed approach.}}, author = {{Dräxler, Sevil and Karl, Holger and Mann, Zoltan Adam}}, booktitle = {{Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)}}, title = {{{Joint Optimization of Scaling and Placement of Virtual Network Services}}}, doi = {{10.1109/CCGRID.2017.25}}, year = {{2017}}, } @inproceedings{8752, abstract = {{In this article we develop a gradient-based algorithm for the solution of multiobjective optimization problems with uncertainties. To this end, an additional condition is derived for the descent direction in order to account for inaccuracies in the gradients and then incorporated into a subdivision algorithm for the computation of global solutions to multiobjective optimization problems. Convergence to a superset of the Pareto set is proved and an upper bound for the maximal distance to the set of substationary points is given. Besides the applicability to problems with uncertainties, the algorithm is developed with the intention to use it in combination with model order reduction techniques in order to efficiently solve PDE-constrained multiobjective optimization problems.}}, author = {{Peitz, Sebastian and Dellnitz, Michael}}, booktitle = {{NEO 2016}}, isbn = {{9783319640624}}, issn = {{1860-949X}}, pages = {{159--182}}, title = {{{Gradient-Based Multiobjective Optimization with Uncertainties}}}, doi = {{10.1007/978-3-319-64063-1_7}}, year = {{2017}}, } @misc{88, author = {{Ganesh Athreya, Advait}}, publisher = {{Universität Paderborn}}, title = {{{Instantiating a Predicate Encryption Scheme via Pair Encodings}}}, year = {{2017}}, } @misc{8843, author = {{Jovanovikj, Ivan}}, title = {{{Presentation: Framework for Constructing Context-Specific Migration Methods for Test Cases}}}, year = {{2017}}, } @article{9607, author = {{Kakvi, Saqib and Kiltz, Eike}}, issn = {{0933-2790}}, journal = {{Journal of Cryptology}}, pages = {{276--306}}, title = {{{Optimal Security Proofs for Full Domain Hash, Revisited}}}, doi = {{10.1007/s00145-017-9257-9}}, year = {{2017}}, } @inproceedings{97, abstract = {{Bridging the gap between informal, imprecise, and vague user requirements descriptions and precise formalized specifications is the main task of requirements engineering. Techniques such as interviews or story telling are used when requirements engineers try to identify a user's needs. The requirements specification process is typically done in a dialogue between users, domain experts, and requirements engineers. In our research, we aim at automating the specification of requirements. The idea is to distinguish between untrained users and trained users, and to exploit domain knowledge learned from previous runs of our system. We let untrained users provide unstructured natural language descriptions, while we allow trained users to provide examples of behavioral descriptions. In both cases, our goal is to synthesize formal requirements models similar to statecharts. From requirements specification processes with trained users, behavioral ontologies are learned which are later used to support the requirements specification process for untrained users. Our research method is original in combining natural language processing and search-based techniques for the synthesis of requirements specifications. Our work is embedded in a larger project that aims at automating the whole software development and deployment process in envisioned future software service markets.}}, author = {{van Rooijen, Lorijn and Bäumer, Frederik Simon and Platenius, Marie Christin and Geierhos, Michaela and Hamann, Heiko and Engels, Gregor}}, booktitle = {{2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)}}, isbn = {{978-1-5386-3489-9}}, keywords = {{Software, Unified modeling language, Requirements engineering, Ontologies, Search problems, Natural languages}}, location = {{Lisbon, Portugal}}, pages = {{379--385}}, publisher = {{IEEE}}, title = {{{From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process}}}, doi = {{10.1109/REW.2017.26}}, year = {{2017}}, } @inproceedings{981, abstract = {{Benchmarking and profiling virtual network functions (VNFs) generates input knowledge for resource management decisions taken by management and orchestration systems. Such VNFs are usually not executed in isolation but are often deployed as part of a service function chain (SFC) that connects single functions into complex structures. To manage such chains, isolated performance profiles of single functions have to be combined to get insights into the overall behavior of an SFC. This becomes particularly challenging in highly agile DevOps environments in which profiling processes need to be fully automated and detailed insights about a chain's internal structures are not always available. In this paper, we introduce a fully automatable, flexible, and platform-agnostic profiling system that allows to profile entire SFCs at once. This obviates manual modeling procedures to combine profiling results from single VNFs to reflect SFC performance. We use a case study with different SFC configurations to show that it is hard to model the resulting SFC performance based on single-VNF measurements and that performance interactions between real, non-trivial functions that are deployed in a chain exist. }}, author = {{Peuster, Manuel and Karl, Holger}}, booktitle = {{IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)}}, location = {{Berlin}}, title = {{{Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments}}}, doi = {{10.1109/NFV-SDN.2017.8169826}}, year = {{2017}}, } @inproceedings{983, author = {{Auroux, Sébastien and Scholz, S. and Karl, Holger}}, booktitle = {{Proc. European Wireless}}, title = {{{Assessing Genetic Algorithms for Placing Flow Processing-aware Control Applications}}}, year = {{2017}}, } @article{9919, abstract = {{This is a study of a combined load restoration and generator start-up procedure. The procedure is structured into three stages according to the power system status and the goal of load restoration. Moreover, for each load restoration stage, the proposed algorithm determines a load restoration sequence by considering renewable energy such as solar and wind park to achieve objective functions. The validity and performance of the proposed algorithm is demonstrated through simulations using IEEE-39 network.}}, author = {{Shen, Cong and Kaufmann, Paul and Braun, Martin}}, journal = {{Elsevier International Journal of Electrical Power and Energy Systems (IJEPES)}}, keywords = {{Load restorationRestoration stageRenewable energyVoltage/frequency fluctuations}}, pages = {{287--299}}, title = {{{Three-Stage Power System Restoration Methodology Considering Renewable Energies}}}, doi = {{10.1016/j.ijepes.2017.07.007}}, volume = {{94}}, year = {{2017}}, } @inproceedings{5204, author = {{Späth, Johannes and Ali, Karim and Bodden, Eric}}, booktitle = {{2017 International Conference on Object-Oriented Programming, Languages and Applications (OOPSLA/SPLASH)}}, keywords = {{ATTRACT, ITSECWEBSITE, CROSSING}}, publisher = {{ACM Press}}, title = {{{IDEal: Efficient and Precise Alias-aware Dataflow Analysis}}}, year = {{2017}}, } @article{5209, author = {{Fischer, Andreas and Fuhry, Benny and Kerschbaum, Florian and Bodden, Eric}}, journal = {{CoRR}}, title = {{{Computation on Encrypted Data using Data Flow Authentication}}}, volume = {{abs/1710.00390}}, year = {{2017}}, } @inproceedings{55, abstract = {{We introduce the mobile server problem, inspired by current trends to move computational tasks from cloud structures to multiple devices close to the end user. An example for this are embedded systems in autonomous cars that communicate in order to coordinate their actions. Our model is a variant of the classical Page Migration Problem. Moreformally, we consider a mobile server holding a data page.The server can move in the Euclidean space (of arbitrary dimension). In every round, requests for data items from the page pop up at arbitrary points in the space. The requests are served, each at a cost of the distance from the requesting point and the server, and the mobile server may move, at a cost D times the distance traveled for some constant D . We assume a maximum distance m the server is allowed to move per round. We show that no online algorithm can achieve a competitive ratio independent of the length of the input sequence in this setting. Hence we augment the maximum movement distance of the online algorithms to ( 1 + δ) times the maximum distance of the offline solution. We provide a deterministic algorithm which is simple to describe and works for multiple variants of our problem. The algorithm achieves almost tight competitive ratios independent of the length of the input sequence.}}, author = {{Feldkord, Björn and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}}, pages = {{313--319}}, title = {{{The Mobile Server Problem}}}, doi = {{10.1145/3087556.3087575}}, year = {{2017}}, } @inproceedings{65, abstract = {{Heterogeneous compute nodes in form of CPUs with attached GPU and FPGA accelerators have strongly gained interested in the last years. Applications differ in their execution characteristics and can therefore benefit from such heterogeneous resources in terms of performance or energy consumption. While performance optimization has been the only goal for a long time, nowadays research is more and more focusing on techniques to minimize energy consumption due to rising electricity costs.This paper presents reMinMin, a novel static list scheduling approach for optimizing the total energy consumption for a set of tasks executed on a heterogeneous compute node. reMinMin bases on a new energy model that differentiates between static and dynamic energy components and covers effects of accelerator tasks on the host CPU. The required energy values are retrieved by measurements on the real computing system. In order to evaluate reMinMin, we compare it with two reference implementations on three task sets with different degrees of heterogeneity. In our experiments, MinMin is consistently better than a scheduler optimizing for dynamic energy only, which requires up to 19.43% more energy, and very close to optimal schedules.}}, author = {{Lösch, Achim and Platzner, Marco}}, booktitle = {{Proceedings of the 28th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP)}}, title = {{{reMinMin: A Novel Static Energy-Centric List Scheduling Approach Based on Real Measurements}}}, doi = {{10.1109/ASAP.2017.7995272}}, year = {{2017}}, } @article{6552, author = {{Bause, Fabian and Claes, Leander and Webersen, Manuel and Johannesmann, Sarah and Henning, Bernd}}, issn = {{0171-8096}}, journal = {{tm - Technisches Messen}}, number = {{3}}, title = {{{Viskoelastizität und Anisotropie von Kunststoffen: Ultraschallbasierte Methoden zur Materialparameterbestimmung}}}, doi = {{10.1515/teme-2016-0056}}, volume = {{84}}, year = {{2017}}, } @inproceedings{6556, author = {{Claes, Leander and Chatwell, René Spencer and Vrabec, Jadran and Henning, Bernd}}, booktitle = {{PROCEEDINGS -- AMA Conferences 2017}}, isbn = {{978-3-9816876-4-4}}, pages = {{304--309}}, publisher = {{AMA Service GmbH}}, title = {{{A Spectral Approach to Acoustic Absorption Measurement}}}, doi = {{10.5162/sensor2017/C1.2}}, year = {{2017}}, } @inproceedings{6557, author = {{Claes, Leander and Jäger, Axel and Johannesmann, Sarah and Webersen, Manuel and Kupnik, Mario and Henning, Bernd}}, booktitle = {{PROCEEDINGS -- AMA Conferences 2017}}, isbn = {{978-3-9816876-4-4}}, pages = {{605--610}}, publisher = {{AMA Service GmbH}}, title = {{{Acoustic Material Characterization of Additively Manufactured Components}}}, doi = {{10.5162/sensor2017/P2.9}}, year = {{2017}}, } @inproceedings{6559, author = {{Claes, Leander and Zeipert, Henning and Koppa, Peter and Tröster, Thomas and Henning, Bernd}}, booktitle = {{Proceedings of Meetings on Acoustics}}, pages = {{030004}}, title = {{{Additively manufactured acoustic diffuser structures for ultrasonic measurement applications}}}, doi = {{10.1121/2.0000688}}, year = {{2017}}, }