@inproceedings{5741, author = {{Yigitbas, Enes and Grün, Silas and Sauer, Stefan and Engels, Gregor}}, booktitle = {{Ubiquitous Computing and Ambient Intelligence - 11th International Conference, UCAmI 2017, Philadelphia, PA, USA, November 7-10, 2017, Proceedings}}, pages = {{624--635}}, title = {{{Model-Driven Context Management for Self-adaptive User Interfaces}}}, doi = {{10.1007/978-3-319-67585-5\_61}}, year = {{2017}}, } @inproceedings{5769, abstract = {{Information Flow Analysis (IFA) aims at detecting illegal flows of information between program entities. “Legality” is therein specified in terms of various security policies. For the analysis, this opens up two possibilities: building generic, policy independent and building specific, policy dependent IFAs. While the former needs to track all dependencies between program entities, the latter allows for a reduced and thus more efficient analysis. In this paper, we start out by formally defining a policy independent information flow analysis. Next, we show how to specialize this IFA via policy specific variable tracking, and prove soundness of the specialization. We furthermore investigate refinement relationships between policies, allowing an IFA for one policy to be employed for its refinements. As policy refinement depends on concrete program entities, we additionally propose a precomputation of policy refinement conditions, enabling an efficient refinement check for concrete programs.}}, author = {{Töws, Manuel and Wehrheim, Heike}}, booktitle = {{Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods (ICFEM 2017)}}, isbn = {{9783319686899}}, issn = {{0302-9743}}, pages = {{362--378}}, publisher = {{Springer International Publishing}}, title = {{{Policy Dependent and Independent Information Flow Analyses}}}, doi = {{10.1007/978-3-319-68690-5_22}}, year = {{2017}}, } @article{58, 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 define the service structure in a flexible way that enables changing the order of functions in case the functionality of the service is not influenced by this, and propose a YANG data model for expressing this flexibility. Flexible structures allow the network orchestration system to choose the optimal composition of service components that for example gives the best results for placement of services in the network. When number of flexible services and number of components in each service increase, combinatorial explosion limits the practical use of this flexibility. In this paper, we describe a selection heuristic that gives a Pareto set of the possible compositions of a service as well as possible combinations of different services, with respect to different optimization objectives. Moreover, we present a heuristic algorithm for placement of a combination of services, which aims at placing service components along shortest paths that have enough capacity for accommodating the services. By applying these solutions, we show that allowing flexibility in the service structure is feasible.}}, author = {{Dräxler, Sevil and Karl, Holger}}, journal = {{International Journal of Network Management}}, number = {{2}}, pages = {{1----16}}, publisher = {{Wiley Online Library}}, title = {{{Specification, Composition, and Placement of Network Services with Flexible Structures}}}, doi = {{10.1002/nem.1963}}, year = {{2017}}, } @inproceedings{5830, abstract = {{A lot of people are managing multiple computing devices suited for different purposes, like private and work devices. Integrating applications running on different devices is often a problem, because the services provided by those applications are not meant to be integrated. In this demonstration, we present our XDAI-A framework which enables cross-device integration of services provided by Android apps. The framework uses adapters to convert Android-internal service interfaces of existing apps into external services with a platform-independent interface that can be accessed from applications on other devices and even other platforms. Our ready-to-use framework does not require to alter existing Android apps, since the adapters are installed separately. For the convenient specification of adapters, our framework comes with a domain-specific language (DSL). Additionally, we provide an infrastructure to find and integrate devices and their applications' services.}}, author = {{Wolters, Dennis and Kirchhoff, Jonas and Gerth, Christian and Engels, Gregor}}, booktitle = {{Service-Oriented Computing -- ICSOC 2016 Workshops}}, editor = {{Drira, Khalil and Wang, Hongbing and Yu, Qi and Wang, Yan and Yan, Yuhong and Charoy, François and Mendling, Jan and Mohamed, Mohamed and Wang, Zhongjie and Bhiri, Sami}}, isbn = {{978-3-319-68136-8}}, pages = {{203--206}}, publisher = {{Springer International Publishing}}, title = {{{XDAI-A: Framework for Enabling Cross-Device Integration of Android Apps}}}, doi = {{10.1007/978-3-319-68136-8_25}}, year = {{2017}}, } @inproceedings{59, abstract = {{We consider a scheduling problem on $m$ identical processors sharing an arbitrarily divisible resource. In addition to assigning jobs to processors, the scheduler must distribute the resource among the processors (e.g., for three processors in shares of 20\%, 15\%, and 65\%) and adjust this distribution over time. Each job $j$ comes with a size $p_j \in \mathbb{R}$ and a resource requirement $r_j > 0$. Jobs do not benefit when receiving a share larger than $r_j$ of the resource. But providing them with a fraction of the resource requirement causes a linear decrease in the processing efficiency. We seek a (non-preemptive) job and resource assignment minimizing the makespan.Our main result is an efficient approximation algorithm which achieves an approximation ratio of $2 + 1/(m-2)$. It can be improved to an (asymptotic) ratio of $1 + 1/(m-1)$ if all jobs have unit size. Our algorithms also imply new results for a well-known bin packing problem with splittable items and a restricted number of allowed item parts per bin.Based upon the above solution, we also derive an approximation algorithm with similar guarantees for a setting in which we introduce so-called tasks each containing several jobs and where we are interested in the average completion time of tasks (a task is completed when all its jobs are completed).}}, author = {{Kling, Peter and Mäcker, Alexander and Riechers, Sören and Skopalik, Alexander}}, booktitle = {{Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}}, pages = {{123----132}}, title = {{{Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource}}}, doi = {{10.1145/3087556.3087578}}, year = {{2017}}, } @proceedings{5980, editor = {{Scheideler, Christian and Taghi Hajiaghayi, Mohammad}}, isbn = {{978-1-4503-4593-4}}, publisher = {{ACM}}, title = {{{Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017}}}, doi = {{10.1145/3087556}}, year = {{2017}}, } @misc{60, author = {{Niehus, David}}, publisher = {{Universität Paderborn}}, title = {{{Semantically Secure Attribute-based Searchable Encryption}}}, year = {{2017}}, } @phdthesis{61, author = {{Strothmann, Thim Frederik}}, publisher = {{Universität Paderborn}}, title = {{{Self-* Algorithms for Distributed Systems}}}, doi = {{10.17619/UNIPB/1-150}}, year = {{2017}}, } @inbook{6255, author = {{Fischer, Holger Gerhard and Engler, Michael and Sauer, Stefan}}, booktitle = {{Design, User Experience, and Usability: Theory, Methodology, and Management}}, isbn = {{9783319586335}}, issn = {{0302-9743}}, location = {{Vancouver, Canada}}, pages = {{570--583}}, publisher = {{Springer International Publishing}}, title = {{{A Human-Centered Perspective on Software Quality: Acceptance Criteria for Work 4.0}}}, doi = {{10.1007/978-3-319-58634-2_42}}, volume = {{10288}}, year = {{2017}}, } @inproceedings{6256, author = {{Fischer, Holger Gerhard and Senft, Björn and Stahl, Katharina}}, booktitle = {{Wissenschafts- und Industrieforum 2017 - Intelligente Technische Systeme}}, editor = {{Bodden, Eric and Dressler, Falko and Dumitrescu, Roman and Gausemeier, Jürgen and Meyer auf der Heide, Friedhelm and Scheytt, Christoph and Trächtler, Ansgar}}, isbn = {{978-3-942647-88-5}}, pages = {{197--210}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts}}, title = {{{Akzeptierte Assistenzsysteme in der Arbeitswelt 4.0 durch systematisches Human-Centered Software Engineering}}}, doi = {{10.17619/UNIPB/1-93}}, volume = {{369}}, year = {{2017}}, } @proceedings{6305, editor = {{Hess, Steffen and Fischer, Holger Gerhard}}, publisher = {{Gesellschaft für Informatik e.V. und German UPA e.V.}}, title = {{{Mensch und Computer 2017 - Usability Professionals. Tagungsband}}}, year = {{2017}}, } @article{64, abstract = {{A current trend in networking and cloud computing is to provide compute resources at widely distributed sites; this is exemplified by developments such as Network Function Virtualisation. This paves the way for wide-area service deployments with improved service quality: e.g. user-perceived response times can be reduced by offering services at nearby sites. But always assigning users to the nearest site can be a bad decision if this site is already highly utilised. This paper formalises two related decisions of allocating compute resources at different sites and assigning users to them with the goal of minimising the response times while the total number of resources to be allocated is limited – a non-linear capacitated Facility Location Problem with integrated queuing systems. To efficiently handle its non-linearity, we introduce five linear problem linearisations and adapt the currently best heuristic for a similar scenario to our scenario. All six approaches are compared in experiments for solution quality and solving time. Surprisingly, our best optimisation formulation outperforms the heuristic in both time and quality. Additionally, we evaluate the influence of distributions of available compute resources in the network on the response time: The time was halved for some configurations. The presented formulation techniques for our problem linearisations are applicable to a broader optimisation domain.}}, author = {{Keller, Matthias and Karl, Holger}}, journal = {{IEEE Transactions on Network and Service Management}}, number = {{1}}, pages = {{121----135}}, publisher = {{IEEE}}, title = {{{Response-Time-Optimised Service Deployment: MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate Mixed-integer Functions}}}, doi = {{10.1109/TNSM.2016.2611590}}, year = {{2017}}, } @misc{699, author = {{Sundermeier, Jannik}}, publisher = {{Universität Paderborn}}, title = {{{Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions}}}, year = {{2017}}, } @inproceedings{70, author = {{Feldkord, Björn and Markarian, Christine and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}}, pages = {{17 -- 31}}, title = {{{Price Fluctuations in Online Leasing}}}, doi = {{10.1007/978-3-319-71147-8_2}}, year = {{2017}}, } @misc{700, author = {{Knollmann, Till}}, publisher = {{Universität Paderborn}}, title = {{{A Self-Stabilizing Protocol for Graphs of Diameter Two}}}, year = {{2017}}, } @misc{701, author = {{Götte, Thorsten}}, publisher = {{Universität Paderborn}}, title = {{{Self-Stabilizing Spanners for Tree Metrics}}}, year = {{2017}}, } @article{7011, author = {{Hottung, André and Tanaka, Shunji and Tierney, Kevin}}, journal = {{CoRR abs/1709.09972}}, title = {{{Deep Learning Assisted Heuristic Tree Search for the Container Pre-marshalling Problem}}}, year = {{2017}}, } @article{7012, author = {{Fazal-Baqaie, Masud and Güldali, Baris and Oberthür, Simon}}, journal = {{CSE@SE 2017}}, pages = {{18--21}}, title = {{{Towards DevOps in Multi-provider Projects}}}, year = {{2017}}, } @phdthesis{703, author = {{Podlipyan, Pavel}}, publisher = {{Universität Paderborn}}, title = {{{Local Algorithms for the Continuous Gathering Problem}}}, doi = {{10.17619/UNIPB/1-230}}, year = {{2017}}, } @phdthesis{704, author = {{Riechers, Sören}}, publisher = {{Universität Paderborn}}, title = {{{Scheduling with Scarce Resources}}}, doi = {{10.17619/UNIPB/1-231}}, year = {{2017}}, }