@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}}, } @article{17727, author = {{Kytö, Merja and Stenström, Anna-Brita and Mindt, Ilka}}, journal = {{ICAME Journal 40}}, pages = {{5 -- 8}}, title = {{{An interview with Joybrato Mukherjee, the Chair oft he ICAME Board}}}, year = {{2016}}, } @article{17764, author = {{Mindt, Ilka}}, journal = {{Silesian Studies in English 2015}}, location = {{Opava}}, pages = {{38 -- 59}}, publisher = {{Silesian University in Opava}}, title = {{{The diachronic development of 'COME TO V'}}}, year = {{2016}}, } @misc{178, author = {{Endres, Angelika Elfriede}}, publisher = {{Universität Paderborn}}, title = {{{On the Design and Defense of Networks - An Experimental Investigation}}}, year = {{2016}}, } @misc{179, author = {{Pehlivan, Muhammet}}, publisher = {{Universität Paderborn}}, title = {{{On the abuse of market power - an economic perspective of Microsoft antitrust cases}}}, year = {{2016}}, } @misc{187, booktitle = {{Transactions on Parallel Computing (TOPC)}}, editor = {{Meyer auf der Heide, Friedhelm}}, number = {{1}}, pages = {{1}}, title = {{{Introduction to the Special Issue on SPAA 2014}}}, doi = {{10.1145/2936716}}, year = {{2016}}, } @inbook{18845, author = {{Seng, Eva- Maria}}, booktitle = {{Das Wiesbadener Programm und seine Bedeutung für den Kirchenbau. Zum Gedächtnis an Prof. Dr. Gottfried Kiesow}}, editor = {{Weichel, Thomas}}, pages = {{71--81}}, title = {{{Das Eisenacher Regulativ und das Wiesbadener Programm. Die Diskussion um den evangelischen Kirchenbau und die Wiesbadener Kirchenbauten des 19. Jahrhunderts}}}, year = {{2016}}, } @inbook{18847, author = {{Seng, Eva- Maria}}, booktitle = {{ZIBALDONE. Zeitschrift für italienische Kultur der Gegenwart, No. 60, Herbst 2015}}, editor = {{Bremer, Thomas}}, pages = {{69--79}}, title = {{{Palmanova, eine Idealstadt im Friaul}}}, volume = {{No.60, Herbst 2015}}, year = {{2016}}, } @inbook{18866, author = {{Seng, Eva- Maria}}, booktitle = {{Mutations de la culture patrimoniale}}, editor = {{Morice, Jean-René and Sapin, Guy and Vivier, Nadine}}, pages = {{61--72}}, title = {{{Patrimoine culturel immatériel: plaidoyer pour une vision globale du patrimione culturel}}}, year = {{2016}}, } @inbook{18948, author = {{Seng, Eva- Maria}}, booktitle = {{Altes Zeug: Beiträge zur Diskussion zum nachhaltigen Kulturgutschutz}}, editor = {{Zimmermann, Olaf and Geißler, Theo}}, pages = {{246--250}}, title = {{{Aus Fehlern lernen? Was kann man bei der Vergabe des Titels immaterielles Kulturerbe aus den Erfahrungen mit dem materiellen Kulturerbe ableiten und verbessern?}}}, year = {{2016}}, } @inproceedings{19, abstract = {{Version Control Systems (VCS) are a valuable tool for software development and document management. Both client/server and distributed (Peer-to-Peer) models exist, with the latter (e.g., Git and Mercurial) becoming increasingly popular. Their distributed nature introduces complications, especially concerning security: it is hard to control the dissemination of contents stored in distributed VCS as they rely on replication of complete repositories to any involved user. We overcome this issue by designing and implementing a concept for cryptography-enforced access control which is transparent to the user. Use of field-tested schemes (end-to-end encryption, digital signatures) allows for strong security, while adoption of convergent encryption and content-defined chunking retains storage efficiency. The concept is seamlessly integrated into Mercurial---respecting its distributed storage concept---to ensure practical usability and compatibility to existing deployments.}}, author = {{Lass, Michael and Leibenger, Dominik and Sorge, Christoph}}, booktitle = {{Proc. 41st Conference on Local Computer Networks (LCN)}}, isbn = {{978-1-5090-2054-6}}, keywords = {{access control, distributed version control systems, mercurial, peer-to-peer, convergent encryption, confidentiality, authenticity}}, publisher = {{IEEE}}, title = {{{Confidentiality and Authenticity for Distributed Version Control Systems - A Mercurial Extension}}}, doi = {{10.1109/lcn.2016.11}}, year = {{2016}}, }