@misc{18030, author = {{N., N.}}, publisher = {{Universität Paderborn}}, title = {{{Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}}}, year = {{2018}}, } @misc{18033, author = {{Wulfes, Robin}}, publisher = {{Universität Paderborn}}, title = {{{Load-Balanced Routing in Hybriden Kommunikationsnetzwerken}}}, year = {{2018}}, } @misc{2320, author = {{Funke, Lars Christian}}, title = {{{Eignungsbewertung eines Enterprise Architecture Frameworks für das IT-Alignment zwischen Unternehmensstrategie und IT-Landschaft am Beispiel der Arvato SCM}}}, year = {{2018}}, } @inbook{2322, abstract = {{The vision of On-The-Fly Computing is an automatic composition of existing software services. Based on natural language software descriptions, end users will receive compositions tailored to their needs. For this reason, the quality of the initial software service description strongly determines whether a software composition really meets the expectations of end users. In this paper, we expose open NLP challenges needed to be faced for service composition in On-The-Fly Computing.}}, author = {{Bäumer, Frederik Simon and Geierhos, Michaela}}, booktitle = {{Proceedings of the 23rd International Conference on Natural Language and Information Systems}}, editor = {{Silberztein, Max and Atigui, Faten and Kornyshova, Elena and Métais, Elisabeth and Meziane, Farid }}, isbn = {{978-3-319-91946-1}}, keywords = {{Requirements Extraction, Temporal Reordering of Software Functions, Inaccuracy Compensation}}, location = {{Paris, France}}, pages = {{509--513}}, publisher = {{Springer}}, title = {{{How to Deal with Inaccurate Service Descriptions in On-The-Fly Computing: Open Challenges}}}, doi = {{10.1007/978-3-319-91947-8_53}}, volume = {{10859}}, year = {{2018}}, } @article{2331, abstract = {{A user generally writes software requirements in ambiguous and incomplete form by using natural language; therefore, a software developer may have difficulty in clearly understanding what the meanings are. To solve this problem with automation, we propose a classifier for semantic annotation with manually pre-defined semantic categories. To improve our classifier, we carefully designed syntactic features extracted by constituency and dependency parsers. Even with a small dataset and a large number of classes, our proposed classifier records an accuracy of 0.75, which outperforms the previous model, REaCT.}}, author = {{Kim, Yeongsu and Lee, Seungwoo and Dollmann, Markus and Geierhos, Michaela}}, issn = {{2207-6360}}, journal = {{International Journal of Advanced Science and Technology}}, keywords = {{Software Engineering, Natural Language Processing, Semantic Annotation, Machine Learning, Feature Engineering, Syntactic Structure}}, pages = {{123--136}}, publisher = {{SERSC Australia}}, title = {{{Improving Classifiers for Semantic Annotation of Software Requirements with Elaborate Syntactic Structure}}}, doi = {{10.14257/ijast.2018.112.12}}, volume = {{112}}, year = {{2018}}, } @misc{8074, author = {{Aykanat, Cengiz}}, publisher = {{Universität Paderborn}}, title = {{{Sharing Economy - Chancen und Risiken aus ökonomischer Sicht}}}, year = {{2018}}, } @misc{8075, author = {{Suvorina, Tatiana}}, publisher = {{Universität Paderborn}}, title = {{{Heterogeneity in Contests, Sources and Implicants}}}, year = {{2018}}, } @misc{5693, author = {{Graf, Helena}}, publisher = {{Universität Paderborn}}, title = {{{Ranking of Classification Algorithms in AutoML}}}, year = {{2018}}, } @article{5772, author = {{Fanasch, Patrizia and Frick, Bernd}}, issn = {{1931-4361}}, journal = {{Journal of Wine Economics}}, pages = {{1--27}}, publisher = {{Cambridge University Press (CUP)}}, title = {{{What Makes Cooperatives Successful? Identifying the Determinants of Their Organizational Performance}}}, doi = {{10.1017/jwe.2018.28}}, year = {{2018}}, } @inproceedings{5774, abstract = {{Information flow analysis investigates the flow of data in applications, checking in particular for flows from private sources to public sinks. Flow- and path-sensitive analyses are, however, often too costly to be performed every time a security-critical application is run. In this paper, we propose a variant of proof carrying code for information flow security. To this end, we develop information flow (IF) certificates which get attached to programs as well as a method for IF certificate validation. We prove soundness of our technique, i.e., show it to be tamper-free. The technique is implemented within the program analysis tool CPAchecker. Our experiments confirm that the use of certificates pays off for costly analysis runs.}}, author = {{Töws, Manuel and Wehrheim, Heike}}, booktitle = {{Theoretical Aspects of Computing – ICTAC 2018}}, isbn = {{9783030025076}}, issn = {{0302-9743}}, pages = {{435--454}}, publisher = {{Springer International Publishing}}, title = {{{Information Flow Certificates}}}, doi = {{10.1007/978-3-030-02508-3_23}}, year = {{2018}}, } @techreport{5820, abstract = {{In this paper, we investigate the use of trusted execution environments (TEEs, such as Intel's SGX) for an anonymous communication infrastructure over untrusted networks. For this, we present the general idea of exploiting trusted execution environments for the purpose of anonymous communication, including a continuous-time security framework that models strong anonymity guarantees in the presence of an adversary that observes all network traffic and can adaptively corrupt a constant fraction of participating nodes. In our framework, a participating node can generate a number of unlinkable pseudonyms. Messages are sent from and to pseudonyms, allowing both senders and receivers of messages to remain anonymous. We introduce a concrete construction, which shows viability of our TEE-based approach to anonymous communication. The construction draws from techniques from cryptography and overlay networks. Our techniques are very general and can be used as a basis for future constructions with similar goals.}}, author = {{Blömer, Johannes and Bobolz, Jan and Scheideler, Christian and Setzer, Alexander}}, title = {{{Provably Anonymous Communication Based on Trusted Execution Environments}}}, year = {{2018}}, } @misc{5936, author = {{Scheibl, Manuel}}, publisher = {{Universität Paderborn}}, title = {{{Learning about learning curves from dataset properties}}}, year = {{2018}}, } @misc{5967, author = {{Koch, Alexander}}, publisher = {{Universität Paderborn}}, title = {{{Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung}}}, year = {{2018}}, } @article{5984, author = {{Scheideler, Christian}}, journal = {{Theor. Comput. Sci.}}, pages = {{1}}, title = {{{Preface}}}, doi = {{10.1016/j.tcs.2018.11.004}}, volume = {{751}}, year = {{2018}}, } @inproceedings{5985, author = {{Scheideler, Christian}}, booktitle = {{Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018}}, pages = {{1--2}}, title = {{{Relays: Towards a Link Layer for Robust and Secure Fog Computing}}}, doi = {{10.1145/3229774.3229781}}, year = {{2018}}, } @inproceedings{6016, author = {{Peuster, Manuel and Karl, Holger}}, booktitle = {{IEEE/IFIP 14th International Conference on Network and Service Management (CNSM)}}, location = {{Rome}}, publisher = {{IEEE/IFIP}}, title = {{{Understand your chains and keep your deadlines: Introducing time-constrained profiling for NFV}}}, year = {{2018}}, } @article{63, author = {{Althaus, Ernst and Brinkmann, Andre and Kling, Peter and Meyer auf der Heide, Friedhelm and Nagel, Lars and Riechers, Sören and Sgall, Jiri and Suess, Tim}}, journal = {{Journal of Scheduling}}, number = {{1}}, pages = {{77--92}}, publisher = {{Springer}}, title = {{{Scheduling Shared Continuous Resources on Many-Cores}}}, doi = {{10.1007/s10951-017-0518-0}}, volume = {{21}}, year = {{2018}}, } @inbook{6423, author = {{Schäfer, Dirk and Hüllermeier, Eyke}}, booktitle = {{Discovery Science}}, isbn = {{9783030017705}}, issn = {{0302-9743}}, pages = {{161--175}}, publisher = {{Springer International Publishing}}, title = {{{Preference-Based Reinforcement Learning Using Dyad Ranking}}}, doi = {{10.1007/978-3-030-01771-2_11}}, year = {{2018}}, } @inproceedings{4411, abstract = {{While a lot of research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures. Considering crashing peers in peer-to-peer networks, it should not be taken for granted that a distributed data structure remains intact. In this work, we present a self-stabilizing protocol for a distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys. The data structure has a wide area of applications including string matching problems while offering low overhead and efficient operations when embedded on top of a distributed hash table. Especially, longest prefix matching for $x$ can be done in $\mathcal{O}(\log |x|)$ hash table read accesses. We show how to maintain the structure in a self-stabilizing way. Our protocol assures low overhead in a legal state and a total (asymptotically optimal) memory demand of $\Theta(d)$ bits, where $d$ is the number of bits needed for storing all keys.}}, author = {{Knollmann, Till and Scheideler, Christian}}, booktitle = {{Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}}, editor = {{Izumi, Taisuke and Kuznetsov, Petr}}, keywords = {{Self-Stabilizing, Prefix Search, Distributed Data Structure}}, location = {{Tokyo}}, publisher = {{Springer, Cham}}, title = {{{A Self-Stabilizing Hashed Patricia Trie}}}, doi = {{10.1007/978-3-030-03232-6_1}}, volume = {{11201}}, year = {{2018}}, } @inproceedings{4520, author = {{Neumann, Jürgen and Gutt, Dominik and Kundisch, Dennis}}, booktitle = {{Workshop on IS Design and Economic Behavior (ISDEB)}}, location = {{Lüneburg, Germany}}, title = {{{The Traveling Reviewer Problem - Exploring the Relationship Between Offline Locations and Online Rating Behavior}}}, year = {{2018}}, }