@article{21035, author = {{Krapick, Stephan and Brecht, Benjamin and Herrmann, Harald and Quiring, Viktor and Silberhorn, Christine}}, issn = {{1094-4087}}, journal = {{Optics Express}}, number = {{3}}, title = {{{On-chip generation of photon-triplet states}}}, doi = {{10.1364/oe.24.002836}}, volume = {{24}}, year = {{2016}}, } @book{21079, author = {{Menke, Peter}}, isbn = {{978373035445}}, publisher = {{bod}}, title = {{{The FiESTA data model: a novel approach to the representation of heterogeneous multimodal interaction data}}}, year = {{2016}}, } @article{211, abstract = {{On an intermediate goods market with asymmetric production technologies as well as vertical and horizontal product differentiation we analyze the influence of simultaneous competition for resources and customers. The intermediaries face either price or quantity competition on the output market and a monopolistic, strategically acting supplier on the input market. We find that there exist quality and productivity differences such that for quantity competition only one intermediary is willing to procure inputs from the input supplier, while for price competition both intermediaries are willing to purchase inputs. Moreover, the well-known welfare advantage of price competition can in general be no longer confirmed in our model with an endogenous input market and asymmetric intermediaries.}}, author = {{Brangewitz, Sonja and Manegold, Jochen}}, journal = {{Theoretical Economics Letters}}, number = {{6}}, pages = {{1341--1362}}, publisher = {{Scientific Research Publishing (SCIRP)}}, title = {{{Competition of Intermediaries in a Differentiated Duopoly}}}, doi = {{10.4236/tel.2016.66124}}, volume = {{6}}, year = {{2016}}, } @phdthesis{212, author = {{Manegold, Jochen}}, publisher = {{Universität Paderborn}}, title = {{{Competition in Markets with Intermediaries}}}, year = {{2016}}, } @misc{213, author = {{Porzenheim, Laurens}}, publisher = {{Universität Paderborn}}, title = {{{Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes}}}, year = {{2016}}, } @inproceedings{21354, author = {{Mirbabaie, Milad and Tschampel, N. and Stieglitz, Stefan}}, booktitle = {{Proceedings of the 9th Multikonferenz Wirtschaftsinformatik}}, title = {{{Geodaten in Social Media als Informationsquelle in Krisensituationen}}}, year = {{2016}}, } @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}}, }