@misc{278, author = {{Feldmann, Michael}}, publisher = {{Universität Paderborn}}, title = {{{Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs}}}, year = {{2015}}, } @inproceedings{279, abstract = {{Service discovery in global software markets is performed by brokers who act as intermediaries between service consumers and service providers.In order to discover services, brokers apply service matching for determining whether the specification of a provided service satisfies the consumer's requirements.Brokers can already choose between a lot of different service matching approaches considering different service properties (structural, behavioral, and non-functional properties).Different matching approaches can be combined into configurable matching processes leading to a high matching quality (e.g., accurate matching results). However, this combination and configuration is a manual procedure and has to be repeated for different consumers' or market requirements regarding matching quality. In this paper, we propose our framework MatchBox, which supports a broker in reusing existing matching approaches and combining them in a model-driven way based on a reconfigurable model of the matching process.Using this reconfigurable model, MatchBox takes care of control and data flow between matching approaches and executes the modeled processes automatically.As a case study, we integrated eleven matchers into MatchBox to demonstrate that it remains flexibility and reduces effort for a broker at the same time.}}, author = {{Platenius, Marie Christin and Arifulina, Svetlana and Schäfer, Wilhelm}}, booktitle = {{Proceedings of the 18th International ACM Sigsoft Symposium on Component-Based Software Engineering (CBSE'15)}}, pages = {{75--84}}, title = {{{MatchBox: A Framework for Dynamic Configuration of Service Matching Processes}}}, doi = {{10.1145/2737166.2737174}}, year = {{2015}}, } @techreport{20977, author = {{Schäfer, Wilhelm and Dziwok, Stefan and Pohlmann, Uwe and Bobolz, Jan and Czech, Mike and Dann, Andreas Peter and Geismann, Johannes and Hüwe, Marcus and Krieger, Arthur and Piskachev, Goran and Schubert, David and Wohlrab, Rebekka}}, title = {{{Seminar Theses of the Project Group Cybertron}}}, year = {{2015}}, } @inproceedings{20979, author = {{Stockmann, Lars}}, booktitle = {{Proceedings of the Doctoral Symposium of the ACM/IEEE 18th International Conference on Model Driven Engineering Languages and Systems}}, editor = {{Chechik, Marsha and Kolovos, Dimitris}}, title = {{{Debugging Models in the Context of Automotive Software Development}}}, year = {{2015}}, } @inproceedings{17425, author = {{Berssenbrügge, Jan and Wiederkehr, Olga and Jähn, Claudius and Fischer, Matthias}}, booktitle = {{12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung}}, pages = {{65--78}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts}}, title = {{{Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme}}}, volume = {{343}}, year = {{2015}}, } @inproceedings{17427, author = {{Jähn, Claudius and Fischer, Matthias and Gerges, Maria and Berssenbrügge, Jan}}, booktitle = {{12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung}}, pages = {{107--120}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts}}, title = {{{Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell}}}, volume = {{342}}, year = {{2015}}, } @book{17431, editor = {{Gausemeier, Jürgen and Grafe, Michael and Meyer auf der Heide, Friedhelm}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts}}, title = {{{Augmented & Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR}}}, volume = {{342}}, year = {{2015}}, } @article{17657, abstract = {{Inter-datacenter transfers of non-interactive but timely large flows over a private (managed) network is an important problem faced by many cloud service providers. The considered flows are non-interactive because they do not explicitly target the end users. However, most of them must be performed on a timely basis and are associated with a deadline. We propose to schedule these flows by a centralized controller, which determines when to transmit each flow and which path to use. Two scheduling models are presented in this paper. In the first, the controller also determines the rate of each flow, while in the second bandwidth is assigned by the network according to the TCP rules. We develop scheduling algorithms for both models and compare their complexity and performance.}}, author = {{Cohen, R. and Polevoy, Gleb}}, issn = {{2168-7161}}, journal = {{Cloud Computing, IEEE Transactions on}}, keywords = {{Approximation algorithms, Approximation methods, Bandwidth, Cloud computing, Routing, Schedules, Scheduling}}, number = {{99}}, pages = {{1--1}}, title = {{{Inter-Datacenter Scheduling of Large Data Flows}}}, doi = {{10.1109/TCC.2015.2487964}}, volume = {{PP}}, year = {{2015}}, } @article{17658, abstract = {{Abstract We study the problem of bandwidth allocation with multiple interferences. In this problem the input consists of a set of users and a set of base stations. Each user has a list of requests, each consisting of a base station, a frequency demand, and a profit that may be gained by scheduling this request. The goal is to find a maximum profit set of user requests S that satisfies the following conditions: (i) S contains at most one request per user, (ii) the frequency sets allotted to requests in S that correspond to the same base station are pairwise non-intersecting, and (iii) the QoS received by any user at any frequency is reasonable according to an interference model. In this paper we consider two variants of bandwidth allocation with multiple interferences. In the first each request specifies a demand that can be satisfied by any subset of frequencies that is large enough. In the second each request specifies a specific frequency interval. Furthermore, we consider two interference models, multiplicative and additive. We show that these problems are extremely hard to approximate if the interferences depend on both the interfered and the interfering base stations. On the other hand, we provide constant factor approximation algorithms for both variants of bandwidth allocation with multiple interferences for the case where the interferences depend only on the interfering base stations. We also consider a restrictive special case that is closely related to the Knapsack problem. We show that this special case is NP-hard and that it admits an FPTAS. }}, author = {{Bar-Yehuda, Reuven and Polevoy, Gleb and Rawitz, Dror}}, issn = {{0166-218X}}, journal = {{Discrete Applied Mathematics }}, keywords = {{Local ratio}}, pages = {{23 -- 36}}, publisher = {{Elsevier}}, title = {{{Bandwidth allocation in cellular networks with multiple interferences}}}, doi = {{http://dx.doi.org/10.1016/j.dam.2015.05.013}}, volume = {{194}}, year = {{2015}}, } @article{1772, author = {{Torresen, Jim and Plessl, Christian and Yao, Xin}}, journal = {{IEEE Computer}}, keywords = {{self-awareness, self-expression}}, number = {{7}}, pages = {{18--20}}, publisher = {{IEEE Computer Society}}, title = {{{Self-Aware and Self-Expressive Systems – Guest Editor's Introduction}}}, doi = {{10.1109/MC.2015.205}}, volume = {{48}}, year = {{2015}}, } @misc{1794, abstract = {{Demands for computational power and energy efficiency of computing devices are steadily increasing. At the same time, following classic methods to increase speed and reduce energy consumption of these devices becomes increasingly difficult, bringing alternative methods into focus. One of these methods is approximate computing which utilizes the fact that small errors in computations are acceptable in many applications in order to allow acceleration of these computations or to increase energy efficiency. This thesis develops elements of a workflow that can be followed to apply approximate computing to existing applications. It proposes a novel heuristic approach to the localization of code paths that are suitable to approximate computing based on findings in recent research. Additionally, an approach to identification of approximable instructions within these code paths is proposed and used to implement simulation of approximation. The parts of the workflow are implemented with the goal to lay the foundation for a partly automated toolflow. Evaluation of the developed techniques shows that the proposed methods can help providing a convenient workflow, facilitating the first steps into the application of approximate computing.}}, author = {{Lass, Michael}}, publisher = {{Paderborn University}}, title = {{{Localization and Analysis of Code Paths Suitable for Acceleration using Approximate Computing}}}, year = {{2015}}, } @inproceedings{239, abstract = {{We report on the construction of the Wikidata Vandalism Corpus WDVC-2015, the first corpus for vandalism in knowledge bases. Our corpus is based on the entire revision history of Wikidata, the knowledge base underlying Wikipedia. Among Wikidata's 24 million manual revisions, we have identified more than 100,000 cases of vandalism. An in-depth corpus analysis lays the groundwork for research and development on automatic vandalism detection in public knowledge bases. Our analysis shows that 58% of the vandalism revisions can be found in the textual portions of Wikidata, and the remainder in structural content, e.g., subject-predicate-object triples. Moreover, we find that some vandals also target Wikidata content whose manipulation may impact content displayed on Wikipedia, revealing potential vulnerabilities. Given today's importance of knowledge bases for information systems, this shows that public knowledge bases must be used with caution.}}, author = {{Heindorf, Stefan and Potthast, Martin and Stein, Benno and Engels, Gregor}}, booktitle = {{Proceedings of the 38th International ACM Conference on Research and Development in Information Retrieval (SIGIR 15)}}, pages = {{831----834}}, title = {{{Towards Vandalism Detection in Knowledge Bases: Corpus Construction and Analysis}}}, doi = {{10.1145/2766462.2767804}}, year = {{2015}}, } @inproceedings{240, abstract = {{We consider online leasing problems in which demands arrive over time and need to be served by leasing resources. We introduce a new model for these problems such that a resource can be leased for K different durations each incurring a different cost (longer leases cost less per time unit). Each demand i can be served anytime between its arrival ai and its deadline ai+di by a leased resource. The objective is to meet all deadlines while minimizing the total leasing costs. This model is a natural generalization of Meyerson’s ParkingPermitProblem (FOCS 2005) in which di=0 for all i. We propose an online algorithm that is Θ(K+dmaxlmin)-competitive where dmax and lmin denote the largest di and the shortest available lease length, respectively. We also extend the SetCoverLeasing problem by deadlines and give a competitive online algorithm which also improves on existing solutions for the original SetCoverLeasing problem.}}, author = {{Li, Shouwei and Mäcker, Alexander and Markarian, Christine and Meyer auf der Heide, Friedhelm and Riechers, Sören}}, booktitle = {{Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON)}}, pages = {{277----288}}, title = {{{Towards Flexible Demands in Online Leasing Problems}}}, doi = {{10.1007/978-3-319-21398-9_22}}, year = {{2015}}, } @techreport{20832, author = {{Schäfer, Wilhelm and Dziwok, Stefan and Pohlmann, Uwe and Bobolz, Jan and Czech, Mike and Dann, Andreas Peter and Geismann, Johannes and Hüwe, Marcus and Krieger, Arthur and Piskachev, Goran and Schubert, David and Wohlrab, Rebekka}}, title = {{{Seminar Theses of the Project Group Cybertron}}}, year = {{2015}}, } @misc{20833, author = {{Geismann, Johannes}}, publisher = {{Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik}}, title = {{{Multi-Core Execution of Safety-Critical Component-Based Software}}}, year = {{2015}}, } @inproceedings{20902, abstract = {{Die Komplexität moderner Fahrzeuge steigt aufgrund der zunehmenden Anzahl von Funktionen, die durch elektronische Systeme umgesetzt werden. Insbesondere nehmen die Abhängigkeiten zwischen den an der Entwicklung beteiligten Fachdisziplinen und der Softwareanteil massiv zu. Wir haben einen für die Automobilindustrie angepassten, zum Reifegradmodell Automotive SPICE konformen Prozess für die Entwicklung von Steuergeräten konzipiert, der ein fachdisziplinübergreifendes Systems Engineering und einen systematischen Übergang in die Softwareentwicklung unterstützt. Im Kontext dieses Entwicklungsprozess beschreiben wir in diesem Beitrag den Übergang vom UML-basierten Softwareentwurf zum in der Automobilindustrie etablierten AUTOSAR-Standard mit Hilfe einer automatischen Modelltransformation. So werden fehleranfällige und zeitaufwändige manuelle Tätigkeiten reduziert. Wir haben die Generierung von AUTOSAR-Modellen gemeinsam mit dem international tätigen Automobilzulieferer Hella KGaA Hueck & Co. in seriennahen Entwicklungsprojekten praktisch erprobt und Zeit- und Kostenersparnisse festgestellt.}}, author = {{Meyer, Jan and Holtmann, Jörg and Koch, Thorsten and Meyer, Matthias}}, booktitle = {{10. Paderborner Workshop Entwurf mechatronischer Systeme}}, editor = {{Gausemeier, Jürgen and Dumitrescu, Roman and Rammig, Franz-Josef and Schäfer, Wilhelm and Trächtler, Ansgar}}, pages = {{159–172}}, publisher = {{Heinz Nixdorf Institut}}, title = {{{Generierung von AUTOSAR-Modellen aus UML-Spezifikationen}}}, volume = {{343}}, year = {{2015}}, } @misc{18003, author = {{Götte, Thorsten}}, publisher = {{Universität Paderborn}}, title = {{{Covering and Bridging im selbstorganisierenden Partikelsystem Amoebabot}}}, year = {{2015}}, } @misc{18004, author = {{Isenberg, Daniel}}, title = {{{3D-Nesting in der SLM-Technologie}}}, year = {{2015}}, } @misc{18005, author = {{Korfmacher, Christian}}, publisher = {{Universität Paderborn}}, title = {{{Implementierung und Analyse von Cone-DHT}}}, year = {{2015}}, } @misc{18006, author = {{Sundermeier, Jannik}}, publisher = {{Universität Paderborn}}, title = {{{Implementierung eines selbststabilisierenden verteilten Stacks}}}, year = {{2015}}, }