@inproceedings{6650, author = {{Bendfeld, Jörg and Balluff, Stefan and Krauter, Stefan}}, booktitle = {{Wissenschaftliche Verhandlungen 2016 der Deutschen Physikalischen Gesellschaft Regensburg}}, location = {{Regensburg}}, title = {{{Systemvergleich zur zeitlich und örtlich hochaufgelösten Einstrahlungsmessung}}}, year = {{2016}}, } @inproceedings{6651, author = {{Krauter, Stefan and Wendtland, S. and Weber, T. and Berghold, J. and Grunow, Paul}}, booktitle = {{Proceedings of the 31st European Photovoltaic Solar Energy Conference and Exhibition, München (Deutschland), 20.–24. Juni 2016, S. 2265–2270.}}, location = {{München}}, title = {{{Shadowing Investigations on Thin Film Modules}}}, year = {{2016}}, } @inproceedings{6652, author = {{Klaus, Tobias and Schmitz, E.A. and Klusmann, B. and Piper, M. and Krauter, Stefan and Rongen, L. and Gruber, R. and Nkrumah, I. and Ampong, K. and Donkor, M. and Tamakloe, R.}}, booktitle = {{Proceedings of the 31st European Photovoltaic Solar Energy Conference and Exhibition, München (Deutschland), 20.–24. Juni 2016, S. 3048–3049}}, location = {{München}}, title = {{{Start-Up Factory Kumasi (Ghana) – Paderborn (Germany): Smart Tropical House KNUST, Kumasi, Ghana}}}, year = {{2016}}, } @inproceedings{6653, author = {{Krauter, Stefan and Bendfeld, Jörg}}, booktitle = {{Proceedings of the 31st European Photovoltaic Solar Energy Conference and Exhibition, München (Deutschland), 20.–24. Juni 2016, S. 1508–1511}}, location = {{München}}, title = {{{Deviations of results for energy yield from efficiency rankings of micro-inverters}}}, year = {{2016}}, } @inbook{6654, author = {{Kazmerski, L. and Renne, D and Kazem, H. and Sopian, D.K. and Al-Bastaki, N. and Haji, S. and Mohd, D. and Othman, Y.H. and Hoffmann, W. and Krauter, Stefan and Swift-Hook, D.T. and Book, T.}}, booktitle = {{Renewable Energy in the Service of Mankind Vol II}}, publisher = {{Springer: International Publishing Switzerland, First Edition. Springer}}, title = {{{Photovoltaics and the Energy System: Adaptation of layout and load.}}}, year = {{2016}}, } @article{6655, author = {{Japs, Ewald and Sonnenrein, Gerrit and Krauter, Stefan and Vrabec, Jadran}}, journal = {{Solar Energy}}, pages = {{51--59}}, publisher = {{Elsevier}}, title = {{{Experimental study of phase change materials for photovoltaic modules: Energy performance and economic yield for the EPEX spot market}}}, volume = {{140}}, year = {{2016}}, } @inproceedings{6660, author = {{Balluff, Stefan and Bendfeld, Jörg and Krauter, Stefan}}, booktitle = {{2015 International Conference on Renewable Energy Research and Applications (ICRERA)}}, isbn = {{9781479999828}}, location = {{Palermo, Italy}}, publisher = {{IEEE}}, title = {{{Short term wind and energy prediction for offshore wind farms using neural networks}}}, doi = {{10.1109/icrera.2015.7418440}}, year = {{2016}}, } @article{6736, author = {{Böttcher, Stefan and Hartel, Rita and Wolters, Dennis}}, issn = {{0306-4379}}, journal = {{Information Systems}}, pages = {{198--213}}, publisher = {{Elsevier BV}}, title = {{{S2CX: From relational data via SQL/XML to (Un-)Compressed XML}}}, doi = {{10.1016/j.is.2015.09.011}}, volume = {{56}}, year = {{2016}}, } @inproceedings{6739, author = {{Wolters, Dennis and Gerth, Christian and Engels, Gregor}}, booktitle = {{Proceedings of the CAiSE'18 Forum at the 28th International Conference on Advanced Information Systems Engineering (CAiSE'16)}}, pages = {{89--96}}, publisher = {{CEUR-WS.org}}, title = {{{Modeling Cross-Device Systems with Use Case Diagrams}}}, volume = {{1612}}, year = {{2016}}, } @article{6766, author = {{Jovanovikj, Ivan and Güldali, Baris and Grieger, Marvin}}, journal = {{Softwaretechnik-Trends}}, location = {{Bremen}}, number = {{3}}, title = {{{Towards Applying Model-based Testing in Test Case Migration}}}, volume = {{36}}, year = {{2016}}, } @article{6768, author = {{Jovanovikj, Ivan and Grieger, Marvin and Güldali, Baris and Teetz, Alexander}}, journal = {{Softwaretechnik-Trends, Proceedings of the 3rd Workshop Model-Based and Model-Driven Software Modernization (MMSM)}}, location = {{Karlsruhe}}, number = {{3}}, title = {{{Reengineering of Legacy Test Cases: Problem Domain & Scenarios}}}, volume = {{36}}, year = {{2016}}, } @misc{688, author = {{Kutzias, Damian}}, publisher = {{Universität Paderborn}}, title = {{{Friendship Processes in Network Creation Games}}}, year = {{2016}}, } @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}}, }