@misc{689, author = {{Schaefer, Johannes Sebastian}}, publisher = {{Universität Paderborn}}, title = {{{Routing Algorithms on Delayed Networks for Disaster Management Support}}}, year = {{2016}}, } @article{6977, author = {{Kremer, H.-Hugo and Büchter, K. and Buchmann, U.}}, journal = {{bwp@ Berufs- und Wirtschaftspädagogik - online}}, number = {{30}}, title = {{{Inklusion in der beruflichen Bildung}}}, year = {{2016}}, } @unpublished{16450, abstract = {{In this paper, we solve the local gathering problem of a swarm of $n$ indistinguishable, point-shaped robots on a two dimensional grid in asymptotically optimal time $\mathcal{O}(n)$ in the fully synchronous $\mathcal{FSYNC}$ time model. Given an arbitrarily distributed (yet connected) swarm of robots, the gathering problem on the grid is to locate all robots within a $2\times 2$-sized area that is not known beforehand. Two robots are connected if they are vertical or horizontal neighbors on the grid. The locality constraint means that no global control, no compass, no global communication and only local vision is available; hence, a robot can only see its grid neighbors up to a constant $L_1$-distance, which also limits its movements. A robot can move to one of its eight neighboring grid cells and if two or more robots move to the same location they are \emph{merged} to be only one robot. The locality constraint is the significant challenging issue here, since robot movements must not harm the (only globally checkable) swarm connectivity. For solving the gathering problem, we provide a synchronous algorithm -- executed by every robot -- which ensures that robots merge without breaking the swarm connectivity. In our model, robots can obtain a special state, which marks such a robot to be performing specific connectivity preserving movements in order to allow later merge operations of the swarm. Compared to the grid, for gathering in the Euclidean plane for the same robot and time model the best known upper bound is $\mathcal{O}(n^2)$.}}, author = {{Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}}, booktitle = {{arXiv:1602.03303}}, title = {{{Asymptotically Optimal Gathering on a Grid}}}, year = {{2016}}, } @inbook{16579, author = {{Dellnitz, Michael and Eckstein, Julian and Flaßkamp, Kathrin and Friedel, Patrick and Horenkamp, Christian and Köhler, Ulrich and Ober-Blöbaum, Sina and Peitz, Sebastian and Tiemeyer, Sebastian}}, booktitle = {{Mathematics in Industry}}, isbn = {{9783319234120}}, issn = {{1612-3956}}, title = {{{Multiobjective Optimal Control Methods for the Development of an Intelligent Cruise Control}}}, doi = {{10.1007/978-3-319-23413-7_87}}, year = {{2016}}, } @article{16580, author = {{Ziessler, Adrian and Molo, Mirko Hessel-Von and Dellnitz, Michael}}, issn = {{2158-2491}}, journal = {{Journal of Computational Dynamics}}, pages = {{5--5}}, title = {{{On the computation of attractors for delay differential equations}}}, doi = {{10.3934/jcd.2016005}}, year = {{2016}}, } @inproceedings{166, abstract = {{Network function virtualization and software-defined networking allow services consisting of virtual network functions to be designed and implemented with great flexibility by facilitating automatic deployments, migrations, and reconfigurations for services and their components. For extended flexibility, we go beyond seeing services as a fixed chain of functions. We present a YANG model for describing the service structure in deployment requests in a flexible way that enables changing the order of functions in case the order of traversing them does not affect the functionality of the service. Upon receiving such requests, the network orchestration system can choose the optimal composition of service components that gives the best results for placement of services in the network. This introduces new complexities to the placement problem by greatly increasing the number of possible ways a service can be composed. In this paper, we describe a heuristic solution that selects a Pareto set of the possible compositions of a service as well as possible combinations of different services, with respect to different resource requirements of the services. Our evaluations show that the selected combinations consist of representative samples of possible structures and requirements and therefore, can result in optimal or close-to-optimal placement results.}}, author = {{Dräxler, Sevil and Karl, Holger}}, booktitle = {{Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)}}, pages = {{184----192}}, title = {{{Placement of Services with Flexible Structures Specified by a YANG Data Model}}}, doi = {{10.1109/NETSOFT.2016.7502412}}, year = {{2016}}, } @phdthesis{167, author = {{Günther, Peter}}, publisher = {{Universität Paderborn}}, title = {{{Physical attacks on pairing-based cryptography}}}, year = {{2016}}, } @inproceedings{169, abstract = {{We apply methods of genetic programming to a general problem from software engineering, namely example-based generation of specifications. In particular, we focus on model transformation by example. The definition and implementation of model transformations is a task frequently carried out by domain experts, hence, a (semi-)automatic approach is desirable. This application is challenging because the underlying search space has rich semantics, is high-dimensional, and unstructured. Hence, a computationally brute-force approach would be unscalable and potentially infeasible. To address that problem, we develop a sophisticated approach of designing complex mutation operators. We define ‘patterns’ for constructing mutation operators and report a successful case study. Furthermore, the code of the evolved model transformation is required to have high maintainability and extensibility, that is, the code should be easily readable by domain experts. We report an evaluation of this approach in a software engineering case study.}}, author = {{Kühne, Thomas and Hamann, Heiko and Arifulina, Svetlana and Engels, Gregor}}, booktitle = {{Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)}}, pages = {{278----293}}, title = {{{Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application}}}, doi = {{10.1007/978-3-319-30668-1_18}}, year = {{2016}}, } @misc{1695, author = {{Krimphove, Dieter}}, booktitle = {{Zeitschrift für das gesamte Genossenschaftswesen ZFGG }}, number = {{Heft 1}}, pages = {{54--57}}, title = {{{Lang/Weidmüller: Genossenschaftsfesetz. Gesetz betreffend des Erwerbs- und Wirtschaftsgenossenschaften (Kommentar) 38. Auflage}}}, volume = {{Bd. 66}}, year = {{2016}}, } @article{16954, author = {{Hanske, Jonas and Aleksić, Stevan and Ballaschk, Martin and Jurk, Marcel and Shanina, Elena and Beerbaum, Monika and Schmieder, Peter and Keller, Bettina G. and Rademacher, Christoph}}, issn = {{0002-7863}}, journal = {{Journal of the American Chemical Society}}, keywords = {{pc2-ressources}}, pages = {{12176--12186}}, title = {{{Intradomain Allosteric Network Modulates Calcium Affinity of the C-Type Lectin Receptor Langerin}}}, doi = {{10.1021/jacs.6b05458}}, year = {{2016}}, } @inproceedings{170, abstract = {{We present PAndA2, an extendable, static analysis tool for Android apps which examines permission related security threats like overprivilege, existence of permission redelegation and permission flows. PAndA2 comes along with a textual and graphical visualization of the analysis result and even supports the comparison of analysis results for different android app versions.}}, author = {{Jakobs, Marie-Christine and Töws, Manuel and Pauck, Felix}}, booktitle = {{Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems}}, editor = {{Ishikawa F, Romanovsky A, Troubitsyna E}}, title = {{{PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper)}}}, year = {{2016}}, } @phdthesis{172, author = {{Stapel, Florian}}, publisher = {{Universität Paderborn}}, title = {{{Ontology-based representation of abstract optimization models for model formulation and system generation}}}, year = {{2016}}, } @misc{10612, author = {{Cedric Mertens, Jan}}, publisher = {{Paderborn University}}, title = {{{Sprint Diagnostic with RTK-GPS \& IMU Sensor Fusion}}}, year = {{2016}}, } @misc{10616, author = {{Nassery, Abdul Sami}}, publisher = {{Paderborn University}}, title = {{{Implementation of Bilinear Pairings on Reconfigurable Hardware}}}, year = {{2016}}, } @misc{10617, author = {{Amin, Omair}}, publisher = {{Paderborn University}}, title = {{{Acceleration of EMTP for Distribution Networks on Data Flow Machines using the Latency Insertion Method}}}, year = {{2016}}, } @inproceedings{10622, author = {{Anwer, Jahanzeb and Platzner, Marco}}, booktitle = {{Euromicro Conference on Digital System Design (DSD)}}, title = {{{Boolean Difference Based Reliability Evaluation of Fault Tolerant Circuit Structures on FPGAs}}}, doi = {{10.1109/DSD.2016.35}}, year = {{2016}}, } @inproceedings{10631, author = {{Boschmann, Alexander and Dosen, Strahinja and Werner, Andreas and Raies, Ali and Farina, Dario}}, booktitle = {{Proc. IEEE Int. Conf. Biomed. Health Informatics (BHI)}}, title = {{{A novel immersive augmented reality system for prosthesis training and assessment}}}, year = {{2016}}, } @article{10661, author = {{Graf, Tobias and Platzner, Marco}}, journal = {{Journal Theoretical Computer Science}}, pages = {{53--62}}, publisher = {{Elsevier}}, title = {{{Adaptive playouts for online learning of policies during Monte Carlo Tree Search}}}, doi = {{10.1016/j.tcs.2016.06.029}}, volume = {{644}}, year = {{2016}}, } @misc{10695, author = {{Horstmann, Jens}}, publisher = {{Paderborn University}}, title = {{{Beschleunigte Simulation elektrischer Stromnetze mit GPUs}}}, year = {{2016}}, } @article{10705, author = {{Ma, Chenjie and Kaufmann, Paul and Töbermann, J.-Christian and Braun, Martin}}, journal = {{Renewable Energy}}, number = {{(part 2)}}, pages = {{946--953}}, publisher = {{Elsevier}}, title = {{{Optimal Generation Dispatch of Distributed Generators Considering Fair Contribution to Grid Voltage Control}}}, doi = {{10.1016/j.renene.2015.07.083}}, volume = {{87}}, year = {{2016}}, }