@article{14023,
  author       = {{Beverungen, Daniel and Breidbach, Christoph F. and Poeppelbuss, Jens and Tuunainen, Virpi Kristiina}},
  issn         = {{1350-1917}},
  journal      = {{Information Systems Journal}},
  title        = {{{Smart service systems: An interdisciplinary perspective}}},
  doi          = {{10.1111/isj.12275}},
  year         = {{2019}},
}

@inproceedings{14025,
  author       = {{Weidmann, Nils and Oppermann, Robin and Robrecht, Patrick}},
  booktitle    = {{Proceedings of the 12th ACM SIGPLAN International Conference on Software Language Engineering  - SLE 2019}},
  editor       = {{Nierstrasz, Oscar and Gray, Jeff and Oliveira, Bruno}},
  isbn         = {{9781450369817}},
  location     = {{Athens, Greece}},
  publisher    = {{ACM}},
  title        = {{{A feature-based classification of triple graph grammar variants}}},
  doi          = {{10.1145/3357766.3359529}},
  year         = {{2019}},
}

@inproceedings{14026,
  author       = {{Weidmann, Nils and Anjorin, Anthony and Leblebici, Erhan and Schürr, Andy}},
  booktitle    = {{Proceedings of the 12th ACM SIGPLAN International Conference on Software Language Engineering  - SLE 2019}},
  editor       = {{Nierstrasz, Oscar and Gray, Jeff and Oliveira, Bruno }},
  isbn         = {{9781450369817}},
  location     = {{Athens, Greece}},
  publisher    = {{ACM}},
  title        = {{{Consistency management via a combination of triple graph grammars and linear programming}}},
  doi          = {{10.1145/3357766.3359544}},
  year         = {{2019}},
}

@article{14027,
  author       = {{Bengs, Viktor and Eulert, Matthias and Holzmann, Hajo}},
  issn         = {{0047-259X}},
  journal      = {{Journal of Multivariate Analysis}},
  pages        = {{291--312}},
  title        = {{{Asymptotic confidence sets for the jump curve in bivariate regression problems}}},
  doi          = {{10.1016/j.jmva.2019.02.017}},
  year         = {{2019}},
}

@article{14028,
  author       = {{Bengs, Viktor and Holzmann, Hajo}},
  issn         = {{1935-7524}},
  journal      = {{Electronic Journal of Statistics}},
  pages        = {{1523--1579}},
  title        = {{{Adaptive confidence sets for kink estimation}}},
  doi          = {{10.1214/19-ejs1555}},
  year         = {{2019}},
}

@misc{14032,
  abstract     = {{ Beschrieben ist ein verteiltes Warenwirtschaftssystem, bei dem der Kunde, Händler, und der Hersteller vernetzt sind. Dies wird bewerkstelligt durch einen Cloud-Speicher (105), der Cloud-Speicher (105) aufweisend ein Mittel zum Speichern (105a) von Daten, ein Mittel zum Empfangen von ersten Daten von einem ersten Netzwerkteilnehmer (110), wobei die ersten Daten zugehörig sind zu einem physischen Objekt, ein Mittel zum Empfangen von Anfragedaten von einem zweiten Netzwerkteilnehmer (120), ein Mittel zum Empfangen von zweiten Daten von einem dritten Netzwerkteilnehmer (130), wobei die zweiten Daten zugehörig sind zu den ersten Daten und zumindest ein Datum aufweisen, welches angepasst ist, die ersten Daten zu ändern in Abhängigkeit der empfangenen Anfragedaten, ein Mittel zum Ändern der ersten Daten basierend zumindest im Teil auf den zweiten Daten und den Anfragedaten und ein Mittel zum Senden eines geänderten Teils der ersten Daten von dem Cloud-Speicher (105) an den ersten Netzwerkteilnehmer (110).}},
  author       = {{Göllner, Thomas and Schwarz, Jan-Hendrik and Gottschalk, Sebastian and Sauer, Stefan}},
  pages        = {{25}},
  title        = {{{Verteiltes Warenwirtschaftssystem [Distributed Warehouse System]}}},
  year         = {{2019}},
}

@article{14033,
  author       = {{Klümper, A. and Nuding, W. and Sedrakyan, A.}},
  issn         = {{2469-9950}},
  journal      = {{Physical Review B}},
  pages        = {{140201}},
  title        = {{{Random network models with variable disorder of geometry}}},
  doi          = {{10.1103/physrevb.100.140201}},
  volume       = {{100}},
  year         = {{2019}},
}

@inproceedings{14539,
  author       = {{Castenow, Jannik and Kolb, Christina and Scheideler, Christian}},
  booktitle    = {{Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)}},
  location     = {{L'Aquila, Italy}},
  pages        = {{345--348}},
  title        = {{{A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}}},
  doi          = {{10.1007/978-3-030-24922-9\_26}},
  year         = {{2019}},
}

@article{14540,
  author       = {{Schryen, Guido and Kliewer, Natalia and Borndörfer, Ralf and Koch, Thorsten}},
  journal      = {{OR News}},
  pages        = {{34--35}},
  title        = {{{High-Performance Business Computing – Parallel Algorithms and Implementations for Solving Problems in Operations Research and Data Analysis}}},
  volume       = {{65}},
  year         = {{2019}},
}

@inproceedings{14543,
  author       = {{Szopinski, Daniel and John, Thomas and Kundisch, Dennis}},
  location     = {{Munich, Germany}},
  title        = {{{Digital Tools for Teaching Business Model Innovation in Information Systems: A newly developed didactic approach comprising video-based peer feedback}}},
  year         = {{2019}},
}

@misc{14546,
  author       = {{Hansmeier, Tim}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Autonomous Operation of High-Performance Compute Nodes through Self-Awareness and Learning Classifiers}}},
  year         = {{2019}},
}

@article{13048,
  abstract     = {{Marginal hardware introduces severe reliability threats throughout the life cycle of a system. Although marginalities may not affect the functionality of a circuit immediately after manufacturing, they can degrade into hard failures and must be screened out during manufacturing test to prevent early life failures. Furthermore, their evolution in the field must be proactively monitored by periodic tests before actual failures occur. In recent years small delay faults have gained increasing attention as possible indicators of marginal hardware. However, small delay faults on short paths may be undetectable even with advanced timing aware ATPG. Faster-than-at-speed test (FAST) can detect such hidden delay faults, but so far FAST has mainly been restricted to manufacturing test.}},
  author       = {{Kampmann, Matthias and A. Kochte, Michael and Liu, Chang and Schneider, Eric and Hellebrand, Sybille and Wunderlich, Hans-Joachim}},
  issn         = {{1937-4151}},
  journal      = {{IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD)}},
  number       = {{10}},
  pages        = {{1956 -- 1968}},
  publisher    = {{IEEE}},
  title        = {{{Built-in Test for Hidden Delay Faults}}},
  volume       = {{38}},
  year         = {{2019}},
}

@inproceedings{13106,
  author       = {{Schumacher, Jan}},
  booktitle    = {{Beiträge zum Mathematikunterricht 2019}},
  location     = {{Regensburg}},
  title        = {{{Rekonstruktion diagrammatischen Schließens am Beispiel der Subtraktion negativer Zahlen}}},
  year         = {{2019}},
}

@inproceedings{13107,
  abstract     = {{In this paper, we first outline a Hypothetical Learning Trajectory (HLT), which aims at a formal understanding of the rules for manipulating integers. The HLT is based on task formats, which promote algebraic thinking in terms of generalizing rules from the analysis of patterns and should be familiar to students from their mathematics education experiences in elementary school. Second, we analyze two students' actual learning process based on Peircean semiotics. The analysis shows that the actual learning process diverges from the hypothesized learning process in that the students do not relate the different levels of the diagrams in a way that allows them to extrapolate the rule for the subtraction of negative numbers. Based on this finding, we point out consequences for the design of the tasks.}},
  author       = {{Schumacher, Jan and Rezat, Sebastian}},
  booktitle    = {{Proceedings of the Eleventh Congress of the European Society for Research in Mathematics Education (CERME11, February 6 – 10, 2019)}},
  editor       = {{Jankvist, Uffe Thomas and Van den Heuvel-Panhuizen, Marja and Veldhuis, Michiel}},
  keywords     = {{diagrammatic reasoning, hypothetical learning trajectory, induction extrapolatory method, integers, negative numbers, permanence principle, semiotics}},
  location     = {{Utrecht}},
  publisher    = {{Freudenthal Group & Freudenthal Institute, Utrecht University and ERME}},
  title        = {{{A Hypothetical Learning Trajectory for the Learning of the Rules for Manipulating Integers}}},
  year         = {{2019}},
}

@article{13121,
  author       = {{Breitmayer, Bastian and Hasso, Tim and Pelster, Matthias}},
  issn         = {{0165-1765}},
  journal      = {{Economics Letters}},
  title        = {{{Culture and the disposition effect}}},
  doi          = {{10.1016/j.econlet.2019.108653}},
  volume       = {{184}},
  year         = {{2019}},
}

@article{13122,
  author       = {{Breitmayer, Bastian and Massari, Filippo and Pelster, Matthias}},
  issn         = {{1059-0560}},
  journal      = {{International Review of Economics & Finance}},
  pages        = {{443--464}},
  title        = {{{Swarm intelligence? Stock opinions of the crowd and stock returns}}},
  doi          = {{10.1016/j.iref.2019.08.006}},
  volume       = {{64}},
  year         = {{2019}},
}

@inproceedings{13123,
  abstract     = {{Given the recent development in embedded devices, wireless senor nodes are no longer limited to data collection but they can also do processing (e.g., smartphones). Accordingly, new types of applications take an advantage of the processing and flexibility provided by the wireless network. A common property between these applications is that the processing is not running on only one single node, but it is broken-down into smaller tasks that can run over multiple nodes, i.e., exploiting the in-network processing. We study a special variant of in-network processing, where the application is given by a graph; the processing tasks have predefined connections to be executed in a predefined sequence. The problem of embedding an application graph into a network is commonly known as Virtual Network Embedding (VNE). In this paper, we present a Genetic Algorithm (GA) solution to solve this wireless VNE problem, where we take into account the interference and multi-cast properties. We show that the GA has a good performance and fast execution compared to the optimization problem.}},
  author       = {{Afifi, Haitham and Horbach, Konrad and Karl, Holger}},
  booktitle    = {{2019 International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob) (WiMob 2019)}},
  title        = {{{A Genetic Algorithm Framework for Solving Wireless Virtual Network Embedding}}},
  year         = {{2019}},
}

@phdthesis{13124,
  author       = {{Dräxler, Sevil}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Scaling, placement, and routing for pliable virtualized composed services}}},
  year         = {{2019}},
}

@phdthesis{13125,
  author       = {{Görzen, Thomas}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Essays on Crowd Based Idea Evaluation - Empirical Evidence from an Anonymous Online Crowd}}},
  year         = {{2019}},
}

@phdthesis{13126,
  author       = {{Khaluf, Lial}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Organic Programming of Dynamic Real-Time Applications}}},
  year         = {{2019}},
}