@article{21938, author = {{Nüske, Feliks and Wu, Hao and Prinz, Jan-Hendrik and Wehmeyer, Christoph and Clementi, Cecilia and Noé, Frank}}, issn = {{0021-9606}}, journal = {{The Journal of Chemical Physics}}, title = {{{Markov state models from short non-equilibrium simulations—Analysis and correction of estimation bias}}}, doi = {{10.1063/1.4976518}}, year = {{2017}}, } @article{21939, author = {{Wu, Hao and Nüske, Feliks and Paul, Fabian and Klus, Stefan and Koltai, Péter and Noé, Frank}}, issn = {{0021-9606}}, journal = {{The Journal of Chemical Physics}}, title = {{{Variational Koopman models: Slow collective variables and molecular kinetics from short off-equilibrium simulations}}}, doi = {{10.1063/1.4979344}}, year = {{2017}}, } @article{90, abstract = {{We propose and extend an approach for the verification of safety properties for parameterized timed systems modeled as networks of timed automata. For this task, we introduce an incremental workflow that is based on our algorithm IC3 with Zones. It proceeds in a cycle in which single models of the system are verified, and the verification results are employed for the reasoning about the entire system. Starting with the smallest instances, the verification of the safety property is carried out fast and efficient. On successful verification, the algorithm produces an inductive strengthening of the safety property. We reuse this result and try to reason about the entire parameterized timed system. To this end, we extrapolate the inductive strengthening into a candidate for the next-larger model. In case this candidate is a valid inductive strengthening for the next larger model, our main theorem reasons about all models of the parameterized timed system, stating that the safety property holds true for all models. Otherwise, the main cycle starts over with the verification of the next larger model. This workflow is iterated indefinitely, until able to reason about the entire parameterized timed system, until a counterexample trace is found, or until the single models become too large to be handled in the verification. We reuse the intermediate results in a Feedback-loop in order to accelerate the verification runs for the single models. Furthermore, we consider an extended formalism in comparison to our previous publications.}}, author = {{Isenberg, Tobias}}, journal = {{ACM Transactions on Embedded Computing Systems}}, number = {{2}}, pages = {{47:1--47:24}}, publisher = {{ACM}}, title = {{{Incremental Inductive Verification of Parameterized Timed Systems}}}, doi = {{10.1145/2984640}}, year = {{2017}}, } @proceedings{7749, editor = {{Carmona , Josep and Engels, Gregor and Kumar, Akhil }}, publisher = {{Springer}}, title = {{{Business Process Management - 15th International Conference, BPM 2017, Barcelona, Spain, September 10-15, 2017, Proceedings Lecture Notes in Computer Science}}}, volume = {{10445}}, year = {{2017}}, } @proceedings{7750, editor = {{Carmona , Josep and Engels, Gregor and Kumar, Akhil }}, publisher = {{Springer}}, title = {{{Business Process Management Forum - BPM Forum 2017, Barcelona, Spain, September 10 - 15, 2017, Proceedings Lecture Notes in Business Information Processing 297}}}, volume = {{297}}, year = {{2017}}, } @book{7751, editor = {{Spalazzese, Romina and Christin Platenius, Marie and Becker, Steffen and Persson, Per and Engels, Gregor}}, title = {{{Message from the IoT-ASAP Chairs}}}, doi = {{10.1109/ICSAW.2017.67}}, year = {{2017}}, } @proceedings{7754, 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}}, } @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}}, }