@inproceedings{7755, author = {{Mendes, Jorge and Cunha, Jacome and Duarte, Francisco and Engels, Gregor and Saraiva, Joao and Sauer, Stefan}}, booktitle = {{2017 IEEE/ACM 39th International Conference on Software Engineering Companion (ICSE-C)}}, isbn = {{9781538615898}}, publisher = {{IEEE}}, title = {{{Towards systematic spreadsheet construction processes}}}, doi = {{10.1109/icse-c.2017.141}}, year = {{2017}}, } @inproceedings{7767, author = {{Schumacher, Jan}}, booktitle = {{Beiträge zum Mathematikunterricht 2017}}, editor = {{Kortenkamp, Ulrich and Kuzle, Ana}}, publisher = {{WTM-Verlag}}, title = {{{Sinnkonstruktion beim Erkunden von Mustern und Strukturen}}}, year = {{2017}}, } @inproceedings{78, abstract = {{The Internet of Things (IoT) connects the things of our everyday life and supports usin our common activities.Several markets for IoT services have been created. These markets enable IoT users to search and compose services in order to support an IoT activity.However, existing IoT markets like IFTTT (If This Then That) are not convenient for users with respect to service discovery and composition.The objective of On-the-fly (OTF) computing is to configure and provide software markets that fulfill individual users' wishes by the automatic on-the-fly composition of single services.The architecture framework of On-the-fly computing markets helps architects to systematically develop these systems in different domains.In this paper, we use our OTF architectural framework to examine the requirements of a reference architecture for IoT markets.Furthermore, we perform a comparison between the architecture of IFTTT as an existing IoT market with this reference architecture. The results show how existing IoT markets can be improved. In return, the practical knowledge of IFTTT is taken to the reference architecture.This knowledge helps to overcome the limitations of today's IoT markets or creating new markets in the future.}}, author = {{Jazayeri, Bahar and Schwichtenberg, Simon}}, booktitle = {{Proceedings of the International Conference on Software Architecture (ICSA) IoT-ASAP Workshop}}, pages = {{120----127}}, publisher = {{IEEE}}, title = {{{On-The-Fly Computing Meets IoT Markets - Towards a Reference Architecture}}}, doi = {{10.1109/ICSAW.2017.59}}, year = {{2017}}, } @inproceedings{79, abstract = {{Consider a problem in which $n$ jobs that are classified into $k$ types arrive over time at their release times and are to be scheduled on a single machine so as to minimize the maximum flow time.The machine requires a setup taking $s$ time units whenever it switches from processing jobs of one type to jobs of a different type.We consider the problem as an online problem where each job is only known to the scheduler as soon as it arrives and where the processing time of a job only becomes known upon its completion (non-clairvoyance).We are interested in the potential of simple ``greedy-like'' algorithms.We analyze a modification of the FIFO strategy and show its competitiveness to be $\Theta(\sqrt{n})$, which is optimal for the considered class of algorithms.For $k=2$ types it achieves a constant competitiveness.Our main insight is obtained by an analysis of the smoothed competitiveness.If processing times $p_j$ are independently perturbed to $\hat p_j = (1+X_j)p_j$, we obtain a competitiveness of $O(\sigma^{-2} \log^2 n)$ when $X_j$ is drawn from a uniform or a (truncated) normal distribution with standard deviation $\sigma$.The result proves that bad instances are fragile and ``practically'' one might expect a much better performance than given by the $\Omega(\sqrt{n})$-bound.}}, author = {{Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}}, booktitle = {{Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)}}, pages = {{207--222}}, publisher = {{Springer}}, title = {{{Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times}}}, doi = {{10.1007/978-3-319-89441-6}}, volume = {{10787}}, year = {{2017}}, } @inproceedings{8073, author = {{Grieger, Marvin and Fazal-Baqaie, Masud and Engels, Gregor and Klenke, Markus}}, booktitle = {{Software Engineering 2017}}, pages = {{65--66}}, title = {{{Concept-Based Engineering of Situation-Specific Migration Methods}}}, year = {{2017}}, } @misc{81, author = {{Luo, Linghui}}, publisher = {{Universität Paderborn}}, title = {{{MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained}}}, year = {{2017}}, } @inproceedings{82, abstract = {{Many graph problems such as maximum cut, chromatic number, hamiltonian cycle, and edge dominating set are known to be fixed-parameter tractable (FPT) when parameterized by the treewidth of the input graphs, but become W-hard with respect to the clique-width parameter. Recently, Gajarský et al. proposed a new parameter called modular-width using the notion of modular decomposition of graphs. They showed that the chromatic number problem and the partitioning into paths problem, and hence hamiltonian path and hamiltonian cycle, are FPT when parameterized by this parameter. In this paper, we study modular-width in parameterized parallel complexity and show that the weighted maximum clique problem and the maximum matching problem are fixed-parameter parallel-tractable (FPPT) when parameterized by this parameter.}}, author = {{Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}}, booktitle = {{Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW)}}, pages = {{139--150}}, title = {{{Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity}}}, doi = {{10.1007/978-3-319-59605-1_13}}, year = {{2017}}, } @inproceedings{8225, author = {{Mendes, Jorge and Cunha, Jácome and Duarte, Francisco and Engels, Gregor and Saraiva, Joao and Sauer, Stefan}}, booktitle = {{Proceedings of the 39th International Conference on Software Engineering, {ICSE} 2017, Buenos Aires, Argentina, May 20-28, 2017 - Companion Volume}}, pages = {{123--127}}, publisher = {{IEEE}}, title = {{{Systematic spreadsheet construction processes}}}, doi = {{http://dx.doi.org/10.1109/VLHCC.2017.8103459}}, year = {{2017}}, } @misc{5694, author = {{Schnitker, Nino Noel}}, publisher = {{Universität Paderborn}}, title = {{{Genetischer Algorithmus zur Erstellung von Ensembles von Nested Dichotomies}}}, year = {{2017}}, } @inproceedings{5695, author = {{Jazayeri, Bahar and Schwichtenberg, Simon}}, booktitle = {{Proceedings of Softwaretechnik-Trends Workshops}}, publisher = {{Gesellschaft für Informatik eV, Fachgruppe PARS}}, title = {{{On the Necessity of an Architecture Framework for On-The-Fly Computing}}}, volume = {{37}}, year = {{2017}}, } @inproceedings{5722, author = {{Gupta, Pritha and Hetzer, Alexander and Tornede, Tanja and Gottschalk, Sebastian and Kornelsen, Andreas and Osterbrink, Sebastian and Pfannschmidt, Karlson and Hüllermeier, Eyke}}, location = {{Rostock}}, title = {{{jPL: A Java-based Software Framework for Preference Learning}}}, year = {{2017}}, } @misc{5724, author = {{Hetzer, Alexander and Tornede, Tanja}}, publisher = {{Universität Paderborn}}, title = {{{Solving the Container Pre-Marshalling Problem using Reinforcement Learning and Structured Output Prediction}}}, year = {{2017}}, } @inproceedings{5740, author = {{Yigitbas, Enes and Sauer, Stefan and Engels, Gregor}}, booktitle = {{Proceedings of the {ACM} {SIGCHI} Symposium on Engineering Interactive Computing Systems, {EICS} 2017, Lisbon, Portugal, June 26-29, 2017}}, pages = {{99--104}}, title = {{{Adapt-UI: an IDE supporting model-driven development of self-adaptive UIs}}}, doi = {{10.1145/3102113.3102144}}, year = {{2017}}, } @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}}, }