@inproceedings{21355, author = {{Mirbabaie, Milad and Stieglitz, Stefan and Volkeri, S.}}, booktitle = {{Proceedings of the 49th Hawaii International Conference on System Sciences}}, title = {{{Volunteered Geographic Information and its Implications for Disaster Management}}}, year = {{2016}}, } @misc{214, author = {{Bemmann, Kai Sören}}, publisher = {{Universität Paderborn}}, title = {{{Commitment Schemes - Definitions, Variants, and Security}}}, year = {{2016}}, } @inproceedings{21494, author = {{Hein, David and Meschut, Gerson and Matzenmiller, Anton and Nelson, Alexander}}, booktitle = {{16. Kolloquium Gemeinsame Forschung in der Klebtechnik }}, location = {{Köln}}, title = {{{Experimentelle und numerische Untersuchungen des Crashverhaltens hybridgefügter Verbindungen}}}, year = {{2016}}, } @inproceedings{21495, author = {{Hein, David and Meschut, Gerson}}, booktitle = {{Anwendertreff Leichtbau}}, location = {{Würzburg}}, title = {{{Werkstoffgerechte Fügetechnologien als Schlüssel für innovative Mischbauweisen}}}, year = {{2016}}, } @inproceedings{215, abstract = {{We present three robust overlay networks: First, we present a network that organizes the nodes into an expander and is resistant to even massive adversarial churn. Second, we develop a network based on the hypercube that maintains connectivity under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log log n)-late adversary which only has access to topological information that is at least Omega(log log n) rounds old. Finally, we develop a network that combines both churn- and DoS-resistance. The networks gain their robustness through constant network reconfiguration, i.e., the topology of the networks changes constantly. Our reconguration algorithms are based on node sampling primitives for expanders and hypercubes that allow each node to sample a logarithmic number of nodes uniformly at random in O(log log n) communication rounds. These primitives are specific to overlay networks and their optimal runtime represents an exponential improvement over known techniques. Our results have a wide range of applications, for example in the area of scalable and robust peer-to-peer systems.}}, author = {{Drees, Maximilian and Gmyr, Robert and Scheideler, Christian}}, booktitle = {{Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}}, pages = {{417----427}}, title = {{{Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration}}}, doi = {{10.1145/2935764.2935783}}, year = {{2016}}, } @proceedings{21507, editor = {{Hein, David and Meschut, Gerson and Tümkaya, Gökhan}}, isbn = {{978-3-945023-74-7}}, location = {{Leipzig}}, publisher = {{DVS Media GmbH}}, title = {{{Erweichungszonen beim Widerstandspunktschweißen von DP- und CP-Stählen – Analyse und Bewertung der Verbindungen im Hinblick auf die Tragfähigkeit}}}, volume = {{327}}, year = {{2016}}, } @inproceedings{216, abstract = {{We empirically investigate the impact of successful goal achievement on future effort to attain the next goal in a recurring goal framework. We use data from a popular German Question & Answer community where goals are represented in the form of badges. In particular, our analysis of this data hinges on the fact, that in this Question & Answer community, badges in a hierarchical badge system are in-creasingly challenging to attain up to a certain badge. After this certain badge, the difficulty level sud-denly drops and remains constant throughout up to the last badge in the hierarchy. Our findings indi-cate that after successful badge achievement users increase their subsequent effort to attain the next badge, but only as long as badges represent a challenge to the user. According to our analysis, we identify self-learning to be the key driver of this behavior.}}, author = {{von Rechenberg, Tobias and Gutt, Dominik}}, booktitle = {{Proceedings of the 24th Conference on Information Systems (ECIS), Istanbul}}, location = {{Istanbul, Turkey}}, title = {{{Challenge Accepted! - The Impcat of Goal Achievement on Subsequent User Effort and Implications of a Goal's Difficulty}}}, year = {{2016}}, } @article{21638, author = {{Platenius, Marie C. and Shaker, Ammar and Becker, Matthias and Hullermeier, Eyke and Schäfer, Wilhelm}}, issn = {{0098-5589}}, journal = {{IEEE Transactions on Software Engineering}}, pages = {{739--759}}, title = {{{Imprecise Matching of Requirements Specifications for Software Services Using Fuzzy Logic}}}, doi = {{10.1109/tse.2016.2632115}}, year = {{2016}}, } @misc{173, author = {{Heck, Eduard}}, publisher = {{Universität Paderborn}}, title = {{{Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen am Beispiel des Google Marketplace}}}, year = {{2016}}, } @inproceedings{17320, author = {{Budde, Jannica and Oevel, Gudrun}}, booktitle = {{INFORMATIK 2016}}, editor = {{Mayr, Heinrich C. and Pinzger, Martin}}, pages = {{947--959}}, publisher = {{Gesellschaft für Informatik}}, title = {{{Innovationsmanagement an Hochschulen: Maßnahmen zur Unterstützung der Digitalisierung von Studium und Lehre}}}, year = {{2016}}, } @inbook{17323, author = {{Oevel, Gudrun}}, booktitle = {{"Ei, dem alten Herrn zoll' ich Achtung gern'". Festschrift für Joachim Veit zum 60. Geburtstag}}, editor = {{Richts, Kristina and Stadler, Peter}}, pages = {{509--522}}, publisher = {{Allitera}}, title = {{{Der Ton macht die Musik. Digitalisierung von Forschungsprozessen nicht nur in der Musikwissenschaft}}}, year = {{2016}}, } @inbook{17327, author = {{Oevel, Gudrun}}, booktitle = {{Kooperation von Rechenzentren. Festkolloquium für Gerhard Schneider zum 60. Geburtstag}}, editor = {{von Suchodoletz, Dirk and Schulz, Janne Chr. and Leendertse, Jan and Hotzel, Hartmut and Wimmer, Martin}}, pages = {{365--376}}, publisher = {{De Gruyter}}, title = {{{G´schichten aus dem Rechnerwald: Sieben auf einen Streich}}}, doi = {{10.1515/9783110459753-031}}, year = {{2016}}, } @misc{174, author = {{Schwentker, Christoph}}, publisher = {{Universität Paderborn}}, title = {{{Ontologie-basierte Extraktion funktionaler Softwareanforderungen am Fallbeispiel mobiler Kommunikationsapplikationen}}}, year = {{2016}}, } @article{175, abstract = {{Today, service compositions often need to be assembled or changed on-the-fly, which leaves only little time for quality assurance. Moreover, quality assurance is complicated by service providers only giving information on their services in terms of domain specific concepts with only limited semantic meaning.In this paper, we propose a method for constructing service compositions based on pre-verified templates. Templates, given as workflow descriptions, are typed over a (domain-independent) template ontology defining concepts and predicates. Their meaning is defined by an abstract semantics, leaving the specific meaning of ontology concepts open, however, only up to given ontology rules. Templates are proven correct using a Hoare-style proof calculus, extended by a specific rule for service calls. Construction of service compositions amounts to instantiation of templates with domain-specific services. Correctness of an instantiation can then simply be checked by verifying that the domain ontology (a) adheres to the rules of the template ontology, and (b) fulfills the constraints of the employed template.}}, author = {{Walther, Sven and Wehrheim, Heike}}, journal = {{Science of Computer Programming}}, pages = {{2----23}}, publisher = {{Elsevier}}, title = {{{On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs}}}, doi = {{10.1016/j.scico.2016.04.002}}, year = {{2016}}, } @inproceedings{176, abstract = {{Users prefer natural language software requirements because of their usability and accessibility. When they describe their wishes for software development, they often provide off-topic information. We therefore present an automated approach for identifying and semantically annotating the on-topic parts of the given descriptions. It is designed to support requirement engineers in the requirement elicitation process on detecting and analyzing requirements in user-generated content. Since no lexical resources with domain-specific information about requirements are available, we created a corpus of requirements written in controlled language by instructed users and uncontrolled language by uninstructed users. We annotated these requirements regarding predicate-argument structures, conditions, priorities, motivations and semantic roles and used this information to train classifiers for information extraction purposes. The approach achieves an accuracy of 92% for the on- and off-topic classification task and an F1-measure of 72% for the semantic annotation.}}, author = {{Dollmann, Markus and Geierhos, Michaela}}, booktitle = {{Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing (EMNLP)}}, location = {{Austin, TX, USA}}, pages = {{1807--1816}}, publisher = {{Association for Computational Linguistics (ACL)}}, title = {{{On- and Off-Topic Classification and Semantic Annotation of User-Generated Software Requirements}}}, year = {{2016}}, } @inproceedings{17655, author = {{Polevoy, Gleb and de Weerdt, M.M. and Jonker, C.M.}}, booktitle = {{Proceedings of the 2016 European Conference on Artificial Intelligence}}, keywords = {{agents, action, repeated reciprocation, fixed, floating, network, Nash equilibrium, social welfare, price of anarchy, price of stability, convex combination}}, pages = {{417--425}}, title = {{{The Game of Reciprocation Habits}}}, doi = {{10.3233/978-1-61499-672-9-417}}, volume = {{Volume 285: ECAI 2016}}, year = {{2016}}, } @inproceedings{17656, author = {{Polevoy, Gleb and de Weerdt, Mathijs and Jonker, Catholijn}}, booktitle = {{Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems}}, isbn = {{978-1-4503-4239-1}}, keywords = {{agent's influence, behavior, convergence, perron-frobenius, reciprocal interaction, repeated reciprocation}}, pages = {{1431--1432}}, publisher = {{International Foundation for Autonomous Agents and Multiagent Systems}}, title = {{{The Convergence of Reciprocation}}}, year = {{2016}}, } @inproceedings{177, abstract = {{Efficiently parallelizable parameterized problems have been classified as being either in the class FPP (fixed-parameter parallelizable) or the class PNC (parameterized analog of NC), which contains FPP as a subclass. In this paper, we propose a more restrictive class of parallelizable parameterized problems called fixed-parameter parallel-tractable (FPPT). For a problem to be in FPPT, it should possess an efficient parallel algorithm not only from a theoretical standpoint but in practice as well. The primary distinction between FPPT and FPP is the parallel processor utilization, which is bounded by a polynomial function in the case of FPPT. We initiate the study of FPPT with the well-known k-vertex cover problem. In particular, we present a parallel algorithm that outperforms the best known parallel algorithm for this problem: using O(m) instead of O(n2) parallel processors, the running time improves from 4logn+O(kk) to O(k⋅log3n), where m is the number of edges, n is the number of vertices of the input graph, and k is an upper bound of the size of the sought vertex cover. We also note that a few P-complete problems fall into FPPT including the monotone circuit value problem (MCV) when the underlying graphs are bounded by a constant Euler genus.}}, author = {{Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}}, booktitle = {{Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)}}, pages = {{477--488}}, title = {{{On the Parameterized Parallel Complexity and the Vertex Cover Problem}}}, doi = {{10.1007/978-3-319-48749-6_35}}, year = {{2016}}, } @article{1771, abstract = {{Die (Wieder-)Einführung einer Vermögensteuer ist in den vergangenen Jahren erneut in den Fokus der politischen Diskussion gerückt. Der vorliegende Beitrag vermittelt einen Eindruck von den Belastungswirkungen, die aus der Umsetzung von aktuell vorliegenden Besteuerungskonzepten resultieren würden. Auf der Basis von realen Jahresabschlussdaten wird eine mehrperiodige Veranlagungssimulation durchgeführt, die insbesondere ermöglicht, den zu erwartenden Eigenkapitalverzehr sowie den Anstieg der Steuerbelastung für die betrachtete Stichprobe zu quantifizieren. Von besonderem Interesse sind hierbei Unternehmen, deren laufende Erträge nicht ausreichen, um die Belastungen durch die Vermögensteuer zu tragen und damit einem Substanzverzehr ausgesetzt sind. Es zeigt sich, dass etwa die Hälfte der Unternehmen im Untersuchungszeitraum von sechs Jahren in mindestens einem Jahr einen Substanzverzehr erfährt. Der Vermögensteuer kommt somit keinesfalls der vielfach postulierte Charakter einer eher mäßig belastenden und im Wesentlichen substanzverschonenden Steuer zu. Zusatzbelastungen von knapp 100 bis zu 300 % der Ertragsteuerlast sind keine Seltenheit und veranschaulichen das Gefährdungspotenzial dieser Steuer für den Wirtschaftsstandort Deutschland.}}, author = {{Hoppe, Thomas and Maiterth, Ralf and Sureth-Sloane, Caren}}, issn = {{0341-2687}}, journal = {{Schmalenbachs Zeitschrift für betriebswirtschaftliche Forschung}}, keywords = {{Steuerbelastung, Substanzbesteuerung, Ungleiche Vermögensverteilung, Veranlagungssimulation, Vermögensteuer}}, number = {{1}}, pages = {{3--45}}, publisher = {{Springer Nature}}, title = {{{Eigenkapitalverzehr und Substanzbesteuerung deutscher Unternehmen durch eine Vermögensteuer – eine empirische Analyse}}}, doi = {{10.1007/s41471-016-0005-x}}, volume = {{68}}, year = {{2016}}, } @article{17726, author = {{Mindt, Ilka}}, journal = {{ICAME Journal 40}}, pages = {{9 -- 15}}, title = {{{40 issues of ICAME News/ICAME Journal}}}, year = {{2016}}, }