@misc{131,
  author       = {{Holzmann, Annabel}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren}}},
  year         = {{2016}},
}

@inproceedings{132,
  abstract     = {{Runtime reconfiguration can be used to replace hardware modules in the field and even to continuously improve them during operation. Runtime reconfiguration poses new challenges for validation, since the required properties of newly arriving modules may be difficult to check fast enough to sustain the intended system dynamics. In this paper we present a method for just-in-time verification of the worst-case completion time of a reconfigurable hardware module. We assume so-called run-to-completion modules that exhibit start and done signals indicating the start and end of execution, respectively. We present a formal verification approach that exploits the concept of proof-carrying hardware. The approach tasks the creator of a hardware module with constructing a proof of the worst-case completion time, which can then easily be checked by the user of the module, just prior to reconfiguration. After explaining the verification approach and a corresponding tool flow, we present results from two case studies, a short term synthesis filter and a multihead weigher. The resultsclearly show that cost of verifying the completion time of the module is paid by the creator instead of the user of the module.}},
  author       = {{Wiersema, Tobias and Platzner, Marco}},
  booktitle    = {{Proceedings of the 11th International Symposium on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC 2016)}},
  pages        = {{1----8}},
  title        = {{{Verifying Worst-Case Completion Times for Reconfigurable Hardware Modules using Proof-Carrying Hardware}}},
  doi          = {{10.1109/ReCoSoC.2016.7533910}},
  year         = {{2016}},
}

@misc{133,
  abstract     = {{.}},
  author       = {{Dewender, Markus}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Verifikation von Service Kompositionen mit Spin}}},
  year         = {{2016}},
}

@misc{134,
  abstract     = {{.}},
  author       = {{Heinisch, Philipp}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Verifikation von Service Kompositionen mit Prolog}}},
  year         = {{2016}},
}

@phdthesis{10136,
  author       = {{Eikel, Martina}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Insider-resistent Distributed Storage Systems}}},
  year         = {{2016}},
}

@phdthesis{10292,
  author       = {{John, Thomas}},
  title        = {{{Business Model Modeling Languages as Tools for Innovation:  Theory and Empirical Evidence}}},
  doi          = {{10.17619/UNIPB/1-259 }},
  year         = {{2016}},
}

@inproceedings{135,
  author       = {{Strotmeyer, Sebastian and John, Thomas and Kundisch, Dennis}},
  booktitle    = {{Multikonferenz Wirtschaftsinformatik (MKWI)}},
  location     = {{Ilmenau, Germany}},
  title        = {{{Vergleichende Betrachtung von Software-Werkzeugen zur Geschäftsmodellentwicklung}}},
  year         = {{2016}},
}

@misc{136,
  author       = {{Vollmers, Daniel}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Vergleich von Disambiguierungsansätzen bei Anforderungsbeschreibungen}}},
  year         = {{2016}},
}

@misc{5934,
  author       = {{N, N}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Renegotiable vs. Non-Renegotiable Agreements - Theory and Applications}}},
  year         = {{2016}},
}

@misc{5932,
  author       = {{N, N}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Wie wertvoll ist der Einzelne für das Team? - Performancemessung der Bundesligaspieler anhand der kooperativen Spieltheorie der Saison 2014/2015}}},
  year         = {{2016}},
}

@misc{5940,
  author       = {{N, N}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Automatisiertes Matching von Angebot und Nachfrage in der Kunststoffindustrie Ein Fallbeispiel in Kooperation mit der PINPOOLS GmbH}}},
  year         = {{2016}},
}

@misc{5935,
  author       = {{N, N}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Der Einfluss von Netzwerken auf Gleichgewichtspreise - eine spieltheoretische Analyse}}},
  year         = {{2016}},
}

@misc{5931,
  author       = {{N, N}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Hat vertikale Integration einen Einfluss auf die allgemeine Wohlfahrt?}}},
  year         = {{2016}},
}

@misc{5941,
  author       = {{N, N}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Stabile Supply-Chains - Basierend auf der Theorie der Matching-Märkte}}},
  year         = {{2016}},
}

@misc{5933,
  author       = {{N, N}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Die Berechnung von Machtindizes - ein Vergleich verschiedener Verfahren}}},
  year         = {{2016}},
}

@misc{5939,
  author       = {{N, N}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Intermediaries in Buyer Seller Networks}}},
  year         = {{2016}},
}

@misc{5937,
  author       = {{N, N}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Staatliche Regulierung in vertikal verbundenen Industrien - eine spieltheoretische Analyse}}},
  year         = {{2016}},
}

@misc{5938,
  author       = {{N, N}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Pricing and Revenue Sharing of Bundles Using Game Theoretical Concepts}}},
  year         = {{2016}},
}

@inproceedings{137,
  abstract     = {{Wikidata is the new, large-scale knowledge base of the Wikimedia Foundation. Its knowledge is increasingly used within Wikipedia itself and various other kinds of information systems, imposing high demands on its integrity.Wikidata can be edited by anyone and, unfortunately, it frequently gets vandalized, exposing all information systems using it to the risk of spreading vandalized and falsified information. In this paper, we present a new machine learning-based approach to detect vandalism in Wikidata.We propose a set of 47 features that exploit both content and context information, and we report on 4 classifiers of increasing effectiveness tailored to this learning task. Our approach is evaluated on the recently published Wikidata Vandalism Corpus WDVC-2015 and it achieves an area under curve value of the receiver operating characteristic, ROC-AUC, of 0.991. It significantly outperforms the state of the art represented by the rule-based Wikidata Abuse Filter (0.865 ROC-AUC) and a prototypical vandalism detector recently introduced by Wikimedia within the Objective Revision Evaluation Service (0.859 ROC-AUC).}},
  author       = {{Heindorf, Stefan and Potthast, Matthias and Stein, Benno and Engels, Gregor}},
  booktitle    = {{Proceedings of the 25th International Conference on Information and Knowledge Management (CIKM 2016)}},
  pages        = {{327----336}},
  title        = {{{Vandalism Detection in Wikidata}}},
  doi          = {{10.1145/2983323.2983740}},
  year         = {{2016}},
}

@inproceedings{31,
  author       = {{Riebler, Heinrich and Vaz, Gavin Francis and Plessl, Christian and Trainiti, Ettore M. G. and Durelli, Gianluca C. and Bolchini, Cristiana}},
  booktitle    = {{Proc. HiPEAC Workshop on Reonfigurable Computing (WRC)}},
  title        = {{{Using Just-in-Time Code Generation for Transparent Resource Management in Heterogeneous Systems}}},
  year         = {{2016}},
}

