@inproceedings{14883, author = {{Ku, Lun-Wei and Chen, Wei-Fan}}, booktitle = {{Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Tutorial Abstracts}}, pages = {{5--8}}, title = {{{Chinese Textual Sentiment Analysis: Datasets, Resources and Tools}}}, year = {{2016}}, } @inproceedings{149, abstract = {{In this paper we consider a strategic variant of the online facility location problem. Given is a graph in which each node serves two roles: it is a strategic client stating requests as well as a potential location for a facility. In each time step one client states a request which induces private costs equal to the distance to the closest facility. Before serving, the clients may collectively decide to open new facilities, sharing the corresponding price. Instead of optimizing the global costs, each client acts selfishly. The prices of new facilities vary between nodes and also change over time, but are always bounded by some fixed value α. Both the requests as well as the facility prices are given by an online sequence and are not known in advance.We characterize the optimal strategies of the clients and analyze their overall performance in comparison to a centralized offline solution. If all players optimize their own competitiveness, the global performance of the system is O(√α⋅α) times worse than the offline optimum. A restriction to a natural subclass of strategies improves this result to O(α). We also show that for fixed facility costs, we can find strategies such that this bound further improves to O(√α).}}, author = {{Drees, Maximilian and Feldkord, Björn and Skopalik, Alexander}}, booktitle = {{Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}}, pages = {{593----607}}, title = {{{Strategic Online Facility Location}}}, doi = {{10.1007/978-3-319-48749-6_43}}, year = {{2016}}, } @phdthesis{150, author = {{Arifulina, Svetlana}}, publisher = {{Universität Paderborn}}, title = {{{Solving Heterogeneity for a Successful Service Market}}}, doi = {{10.17619/UNIPB/1-13}}, year = {{2016}}, } @inproceedings{15085, author = {{Dunst, Alexander and Hartel, Rita and Hohenstein, Sven and Laubrock, Jochen}}, booktitle = {{Digital Humanities 2016, DH 2016, Conference Abstracts}}, pages = {{178--180}}, title = {{{Corpus Analyses of Multimodal Narrative: The Example of Graphic Novels}}}, year = {{2016}}, } @inproceedings{15086, author = {{Böttcher, Stefan and Hartel, Rita and Jacobs, Thomas and Maneth, Sebastian}}, booktitle = {{2016 IEEE 32nd International Conference on Data Engineering (ICDE)}}, isbn = {{9781509020201}}, pages = {{1026--1037}}, publisher = {{IEEE}}, title = {{{Incremental updates on compressed XML}}}, doi = {{10.1109/icde.2016.7498310}}, year = {{2016}}, } @inproceedings{15111, author = {{Pfannschmidt, Karlson and Hüllermeier, Eyke and Held, S. and Neiger, R.}}, booktitle = {{In Proceedings IPMU 16th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands}}, pages = {{450--461}}, publisher = {{Springer}}, title = {{{Evaluating tests in medical diagnosis-Combining machine learning with game-theoretical concepts}}}, year = {{2016}}, } @inproceedings{15184, author = {{Dunst, Alexander and Hartel, Rita}}, booktitle = {{DHd-Tagung 2015, Modellierung - Vernetzung - Visualisierung, Die Digital Humanities als fächerübergreifendes Forschungsparadigma}}, title = {{{Die Corpusanalyse multimodaler Erzählungen am Beispiel graphischer Romane}}}, year = {{2016}}, } @misc{152, author = {{Dallmeier, Fynn}}, publisher = {{Universität Paderborn}}, title = {{{Short Randomizable Aggregatable Signatures: Constructions and Security Analysis}}}, year = {{2016}}, } @inproceedings{160, abstract = {{A task at the beginning of the software development process is the creation of a requirements specification. The requirements specification is usually created by a software engineering expert. We try to substitute this expert by a domain expert (the user) and formulate the problem of creating requirements specifications as a search-based software engineering problem. The domain expert provides only examples of event sequences that describe the behavior of the required software program. These examples are represented by simple sequence diagrams and are divided into two subsets: positive examples of required program behavior and negative examples of prohibited program behavior. The task is then to synthesize a generalized requirements specification that usefully describes the required software. We approach this problem by applying a genetic algorithm and evolve deterministic finite automata (DFAs). These DFAs take the sequence diagrams as input that should be either accepted (positive example) or rejected (negative example). The problem is neither to find the minimal nor the most general automaton. Instead, the user should be provided with several appropriate automata from which the user can select, or which help the user to refine the examples given initially. We present the context of our research ("On-The-Fly Computing"), present our approach, report results indicating its feasibility, and conclude with a discussion.}}, author = {{van Rooijen, Lorijn and Hamann, Heiko}}, booktitle = {{Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016)}}, pages = {{3----9}}, title = {{{Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm}}}, doi = {{10.1109/REW.2016.015}}, year = {{2016}}, } @article{16041, author = {{Leinweber, M. and Fober, T. and Strickert, M. and Baumgärtner, L. and Klebe, G. and Freisleben, B. and Hüllermeier, Eyke}}, journal = {{IEEE Transactions on Knowledge and Data Engineering}}, number = {{6}}, pages = {{1423--1434}}, title = {{{CavSimBase: A database for large scale comparison of protein binding sites}}}, volume = {{28}}, year = {{2016}}, } @phdthesis{161, author = {{Kenter, Tobias}}, publisher = {{Universität Paderborn}}, title = {{{Reconfigurable Accelerators in the World of General-Purpose Computing}}}, year = {{2016}}, } @misc{162, author = {{Zhang, Guangli}}, publisher = {{Universität Paderborn}}, title = {{{Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions}}}, year = {{2016}}, } @inproceedings{1627, author = {{Gutierrez, P. A. Aranda and Rojas, E. and Schwabe, A. and Stritzke, C. and Doriguzzi-Corin, R. and Leckey, A. and Petralia, G. and Marsico, A. and Phemius, K. and Tamurejo, S.}}, booktitle = {{2016 IEEE NetSoft Conference and Workshops (NetSoft)}}, isbn = {{9781467394864}}, publisher = {{IEEE}}, title = {{{NetIDE: All-in-one framework for next generation, composed SDN applications}}}, doi = {{10.1109/netsoft.2016.7502408}}, year = {{2016}}, } @proceedings{163, editor = {{Dressler, Falko and Meyer auf der Heide, Friedhelm}}, location = {{Paderborn, Germany}}, publisher = {{ACM}}, title = {{{Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)}}}, doi = {{10.1145/2942358}}, year = {{2016}}, } @inproceedings{1630, author = {{Marsico, Antonio and Doriguzzi-Corin, Roberto and Gerola, Matteo and Siracusa, Domenico and Schwabe, Arne}}, booktitle = {{NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium}}, isbn = {{9781509002238}}, publisher = {{IEEE}}, title = {{{A non-disruptive automated approach to update SDN applications at runtime}}}, doi = {{10.1109/noms.2016.7502946}}, year = {{2016}}, } @inproceedings{1632, author = {{Doriguzzi-Corin, Roberto and Siracusa, Domenico and Salvador, Elio and Schwabe, Arne}}, booktitle = {{NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium}}, isbn = {{9781509002238}}, publisher = {{IEEE}}, title = {{{Empowering network operating systems with memory management techniques}}}, doi = {{10.1109/noms.2016.7502889}}, year = {{2016}}, } @inproceedings{16351, abstract = {{Defining, measuring, and comparing the quality and efficiency of rendering algorithms in computer graphics is a demanding challenge: quality measures are often application specific and efficiency is strongly influenced by properties of the rendered scene and the used hardware. We survey the currently employed evaluation methods for AQ1 the development process of rendering algorithms. Then, we present our PADrend framework, which supports systematic and flexible development, evaluation, adaptation, and comparison of rendering algorithms, and provides a comfortable and easy-to-use platform for developers of rendering algorithms. The system includes a new evaluation method to improve the objectivity of experimental evaluations of rendering algorithms. }}, author = {{Fischer, Matthias and Jähn, Claudius and Meyer auf der Heide, Friedhelm and Petring, Ralf}}, booktitle = {{Algorithm Engineering}}, editor = {{Kliemann, Lasse and Sanders, Peter}}, pages = {{226--244}}, publisher = {{Springer}}, title = {{{Algorithm Engineering Aspects of Real-Time Rendering Algorithms}}}, doi = {{10.1007/978-3-319-49487-6_7 }}, volume = {{9220}}, year = {{2016}}, } @inproceedings{16358, author = {{Li, Shouwei and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}}, booktitle = {{Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)}}, publisher = {{Springer}}, title = {{{The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots}}}, doi = {{10.1007/978-3-319-53058-1_5 }}, year = {{2016}}, } @inproceedings{16359, 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 O(n) in the fully synchronous 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 2x2- 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 L1-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 merged to be only one robot. The locality constraint is the significant challenging issue here, since robot move- ments 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 con- nectivity. In our model, robots can obtain a special state, which marks such a robot to be performing specific connec- tivity preserving movements in order to allow later merge operations of the swarm. Compared to the grid, for gath- ering in the Euclidean plane for the same robot and time model the best known upper bound is O(n^2).}}, author = {{Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}}, pages = {{301--312}}, publisher = {{ACM}}, title = {{{Asymptotically Optimal Gathering on a Grid}}}, doi = {{10.1145/2935764.2935789}}, year = {{2016}}, } @inproceedings{16360, abstract = {{We consider the following variant of the two dimensional gathering problem for swarms of robots: Given a swarm of n indistinguishable, point shaped robots on a two dimensional grid. Initially, the robots form a closed chain on the grid and must keep this connectivity during the whole process of their gathering. Connectivity means, that neighboring robots of the chain need to be positioned at the same or neighboring points of the grid. In our model, gathering means to keep shortening the chain until the robots are located inside a 2*2 subgrid. Our model is completely local (no global control, no global coordinates, no compass, no global communication or vision, ...). Each robot can only see its next constant number of left and right neighbors on the chain. This fixed constant is called the viewing path length. All its operations and detections are restricted to this constant number of robots. Other robots, even if located at neighboring or the same grid point cannot be detected. Only based on the relative positions of its detectable chain neighbors, a robot can decide to obtain a certain state. Based on this state and their local knowledge, the robots do local modifications to the chain by moving to neighboring grid points without breaking the chain. These modifications are performed without the knowledge whether they lead to a global progress or not. We assume the fully synchronous FSYNC model. For this problem, we present a gathering algorithm which needs linear time. This result generalizes a result, where an open chain with specified distinguishable (and fixed) endpoints is considered. }}, author = {{Abshoff, Sebastian and Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)}}, pages = {{689--699}}, publisher = {{IEEE}}, title = {{{Gathering a Closed Chain of Robots on a Grid}}}, doi = {{10.1109/IPDPS.2016.51}}, year = {{2016}}, }