@inproceedings{13584, author = {Szopinski, Daniel and Schoormann, Thorsten and Kundisch, Dennis}, booktitle = {Proceedings of the Fifty-Third Hawaii International Conference on System Sciences (HICSS)}, location = {Maui, Hawaii}, title = {{Criteria as a prelude for guiding taxonomy evaluation}}, year = {2020}, } @article{15489, author = {Claes, Leander and Steidl, Carolin and Hetkämper, Tim and Henning, Bernd}, journal = {arXiv.org}, publisher = {Cornell University}, title = {{Estimation of acoustic wave non-linearity in ultrasonic measurement systems}}, year = {2020}, } @article{15605, author = {Jovanovikj, Ivan and Yigitbas, Enes and Sauer, Stefan and Engels, Gregor}, journal = {Software Engineering 2020 Workshopband}, location = {Innscbruck}, title = {{Test Case Co-Migration Method Patterns (to appear)}}, year = {2020}, } @inproceedings{15256, abstract = {This paper deals with online customer reviews of local multi-service providers. While many studies investigate product reviews and online labour markets with service providers delivering intangible products “over the wire”, we focus on websites where providers offer multiple distinct services that can be booked, paid and reviewed online but are performed locally offline. This type of service providers has so far been neglected in the literature. This paper analyses reviews and applies sentiment analysis. It aims to gain new insights into local multi-service providers’ performance. There is a broad literature range presented with regard to the topics addressed. The results show, among other things, that providers with good ratings continue to perform well over time. We find that many positive reviews seem to encourage sales. On average, quantitative star ratings and qualitative ratings in the form of review texts match. Further results are also achieved in this study.}, author = {Kersting, Joschka and Geierhos, Michaela}, booktitle = {Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods}, keyword = {Customer Reviews, Sentiment Analysis, Online Labour Markets}, location = {Valetta, Malta}, publisher = {SCITEPRESS}, title = {{What Reviews in Local Online Labour Markets Reveal about the Performance of Multi-Service Providers}}, year = {2020}, } @inproceedings{15580, abstract = {This paper deals with aspect phrase extraction and classification in sentiment analysis. We summarize current approaches and datasets from the domain of aspect-based sentiment analysis. This domain detects sentiments expressed for individual aspects in unstructured text data. So far, mainly commercial user reviews for products or services such as restaurants were investigated. We here present our dataset consisting of German physician reviews, a sensitive and linguistically complex field. Furthermore, we describe the annotation process of a dataset for supervised learning with neural networks. Moreover, we introduce our model for extracting and classifying aspect phrases in one step, which obtains an F1-score of 80%. By applying it to a more complex domain, our approach and results outperform previous approaches.}, author = {Kersting, Joschka and Geierhos, Michaela}, booktitle = {Proceedings of the 12th International Conference on Agents and Artificial Intelligence (ICAART 2020) -- Special Session on Natural Language Processing in Artificial Intelligence (NLPinAI 2020)}, keyword = {Deep Learning, Natural Language Processing, Aspect-based Sentiment Analysis}, location = {Valetta, Malta}, publisher = {SCITEPRESS}, title = {{Aspect Phrase Extraction in Sentiment Analysis with Deep Learning}}, year = {2020}, } @article{15744, author = {Liêu, Minh Ly and Pelster, Matthias}, issn = {1062-9769}, journal = {The Quarterly Review of Economics and Finance}, title = {{Framing and the disposition effect in a scopic regime}}, doi = {10.1016/j.qref.2020.01.008}, year = {2020}, } @phdthesis{15631, author = {Feldkord, Björn}, title = {{Mobile Resource Allocation}}, doi = {10.17619/UNIPB/1-869}, year = {2020}, } @inproceedings{15629, abstract = {In multi-label classification (MLC), each instance is associated with a set of class labels, in contrast to standard classification where an instance is assigned a single label. Binary relevance (BR) learning, which reduces a multi-label to a set of binary classification problems, one per label, is arguably the most straight-forward approach to MLC. In spite of its simplicity, BR proved to be competitive to more sophisticated MLC methods, and still achieves state-of-the-art performance for many loss functions. Somewhat surprisingly, the optimal choice of the base learner for tackling the binary classification problems has received very little attention so far. Taking advantage of the label independence assumption inherent to BR, we propose a label-wise base learner selection method optimizing label-wise macro averaged performance measures. In an extensive experimental evaluation, we find that or approach, called LiBRe, can significantly improve generalization performance.}, author = {Wever, Marcel Dominik and Tornede, Alexander and Mohr, Felix and Hüllermeier, Eyke}, location = {Konstanz, Germany}, publisher = {Springer}, title = {{LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification}}, year = {2020}, } @misc{15770, author = {Warner, Daniel}, title = {{On the complexity of local transformations in SDN overlays}}, year = {2020}, } @inproceedings{15821, author = {Bondarenko, Alexander and Hagen, Matthias and Potthast, Martin and Wachsmuth, Henning and Beloucif, Meriem and Biemann, Chris and Panchenko, Alexander and Stein, Benno}, booktitle = {Proceedings of the 42nd European Conference on Information Retrieval (ECIR 2020)}, title = {{Touché: First Shared Task on Argument Retrieval}}, year = {2020}, } @inproceedings{15826, author = {Chen, Wei-Fan and Syed, Shahbaz and Stein, Benno and Hagen, Matthias and Potthast, Martin }, booktitle = {Proceedings of the the Web Conference 2020}, title = {{Abstractive Snippet Generation}}, year = {2020}, } @article{15480, abstract = {The nonlinear processes of frequency conversion such as second harmonic generation (SHG) usually obey certain selection rules, resulting from the preservation of different kinds of physical quantities, e.g. the angular momentum. For the SHG created by a monolayer of transition-metal dichalcogenides (TMDCs) such as WS2, the valley-exciton locked selection rule predicts an SHG signal in the cross-polarization state. By combining plasmonic nanostructures with a monolayer of TMDC, a hybrid metasurface is realized, which affects this nonlinear process because of an additional polarization conversion process. Here, we observe that the plasmonic metasurface modifies the light-matter interaction with the TMDC, resulting in an SHG signal that is co-polarized with respect to the incident field, which is usually forbidden for the monolayers of TMDC. We fabricate such hybrid metasurfaces by placing plasmonic nanorods on top of a monolayer WS2 and study the valley-exciton locked SHG emission from such system for different parameters, such as wavelength and polarization. Furthermore, we show the potential of the hybrid metasurface for tailoring nonlinear processes by adding additional phase information to the SHG signal using the Pancharatnam-Berry phase effect. This allows direct tailoring of the SHG emission to the far-field.}, author = {Spreyer, Florian and Zhao, Ruizhe and Huang, Lingling and Zentgraf, Thomas}, issn = {2192-8614}, journal = {Nanophotonics}, title = {{Second harmonic imaging of plasmonic Pancharatnam-Berry phase metasurfaces coupled to monolayers of WS2}}, doi = {10.1515/nanoph-2019-0378}, year = {2020}, } @article{15714, author = {Riedl, T. and Kunnathully, V. S. and Trapp, A. and Langer, T. and Reuter, D. and Lindner, J. K. N.}, issn = {2475-9953}, journal = {Physical Review Materials}, title = {{Strain-driven InAs island growth on top of GaAs(111) nanopillars}}, doi = {10.1103/physrevmaterials.4.014602}, year = {2020}, } @misc{15719, author = {Philipp, Schumann}, title = {{Is Delivery Killing Dine-In Restaurants?" - Eine ökonometrische Analyse von Spillover-Effekten für digitale Plattformen in der Restaurantindustrie}}, year = {2020}, } @misc{15769, author = {Wolfförster, Lukas}, title = {{Taxonomie zu Taxonomie-Nutzungsgründen}}, year = {2020}, } @article{15841, author = {Bothe, Mike and Fedorov, Alexander and Frei, Herrmann and Lutters, Nicole and Kenig, Eugeny Y.}, issn = {0009-286X}, journal = {Chemie Ingenieur Technik}, location = {Potsdam}, title = {{Untersuchung des dynamischen Prozessverhaltens bei Betriebsstörungen im Bereich der chemischen Absorption}}, doi = {10.1002/cite.201900096}, year = {2020}, } @inproceedings{3583, author = { Guetttatfi, Zakarya and Kaufmann, Paul and Platzner, Marco}, booktitle = {Proceedings of the International Workshop on Applied Reconfigurable Computing (ARC)}, title = {{Optimal and Greedy Heuristic Approaches for Scheduling and Mapping of Hardware Tasks to Reconfigurable Computing Devices}}, year = {2020}, } @article{13175, abstract = {Today, organizations must deal with a plethora of IT security threats and to ensure smooth and uninterrupted business operations, firms are challenged to predict the volume of IT security vulnerabilities and allocate resources for fixing them. This challenge requires decision makers to assess which system or software packages are prone to vulnerabilities, how many post-release vulnerabilities can be expected to occur during a certain period of time, and what impact exploits might have. Substantial research has been dedicated to techniques that analyze source code and detect security vulnerabilities. However, only limited research has focused on forecasting security vulnerabilities that are detected and reported after the release of software. To address this shortcoming, we apply established methodologies which are capable of forecasting events exhibiting specific time series characteristics of security vulnerabilities, i.e., rareness of occurrence, volatility, non-stationarity, and seasonality. Based on a dataset taken from the National Vulnerability Database (NVD), we use the Mean Absolute Error (MAE) and Root Mean Square Error (RMSE) to measure the forecasting accuracy of single, double, and triple exponential smoothing methodologies, Croston's methodology, ARIMA, and a neural network-based approach. We analyze the impact of the applied forecasting methodology on the prediction accuracy with regard to its robustness along the dimensions of the examined system and software package "operating systems", "browsers" and "office solutions" and the applied metrics. To the best of our knowledge, this study is the first to analyze the effect of forecasting methodologies and to apply metrics that are suitable in this context. Our results show that the optimal forecasting methodology depends on the software or system package, as some methodologies perform poorly in the context of IT security vulnerabilities, that absolute metrics can cover the actual prediction error precisely, and that the prediction accuracy is robust within the two applied forecasting-error metrics.}, author = {Yasasin, Emrah and Prester, Julian and Wagner, Gerit and Schryen, Guido}, issn = {0167-4048}, journal = {Computers & Security}, number = {January}, title = {{Forecasting IT Security Vulnerabilities - An Empirical Analysis}}, volume = {88}, year = {2020}, } @inproceedings{15169, author = {Castenow, Jannik and Kolb, Christina and Scheideler, Christian}, booktitle = {Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)}, location = {Kolkata, Indien}, publisher = {ACM}, title = {{A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}}, year = {2020}, } @inproceedings{15210, author = {Seutter, Janina and Neumann, Jürgen and Kundisch, Dennis}, booktitle = {Tagungsband der 15. Internationalen Tagung Wirtschaftsinformatik 2020 (WI)}, location = {Potsdam, Germany}, title = {{Nudging in Judging- Differences in Online Rating Behavior for Utilitarian and Hedonic Service Aspects}}, year = {2020}, } @article{2834, author = {Gutt, Dominik and von Rechenberg, Tobias and Kundisch, Dennis}, journal = {Journal of Business Research}, pages = {277--287}, publisher = {Elsevier}, title = {{Goal Achievement, Subsequent User Effort and the Moderating Role of Goal Difficulty}}, doi = {10.1016/j.jbusres.2018.06.019}, volume = {106}, year = {2020}, } @inproceedings{13226, abstract = {The canonical problem for the class Quantum Merlin-Arthur (QMA) is that of estimating ground state energies of local Hamiltonians. Perhaps surprisingly, [Ambainis, CCC 2014] showed that the related, but arguably more natural, problem of simulating local measurements on ground states of local Hamiltonians (APX-SIM) is likely harder than QMA. Indeed, [Ambainis, CCC 2014] showed that APX-SIM is P^QMA[log]-complete, for P^QMA[log] the class of languages decidable by a P machine making a logarithmic number of adaptive queries to a QMA oracle. In this work, we show that APX-SIM is P^QMA[log]-complete even when restricted to more physical Hamiltonians, obtaining as intermediate steps a variety of related complexity-theoretic results. We first give a sequence of results which together yield P^QMA[log]-hardness for APX-SIM on well-motivated Hamiltonians: (1) We show that for NP, StoqMA, and QMA oracles, a logarithmic number of adaptive queries is equivalent to polynomially many parallel queries. These equalities simplify the proofs of our subsequent results. (2) Next, we show that the hardness of APX-SIM is preserved under Hamiltonian simulations (a la [Cubitt, Montanaro, Piddock, 2017]). As a byproduct, we obtain a full complexity classification of APX-SIM, showing it is complete for P, P^||NP, P^||StoqMA, or P^||QMA depending on the Hamiltonians employed. (3) Leveraging the above, we show that APX-SIM is P^QMA[log]-complete for any family of Hamiltonians which can efficiently simulate spatially sparse Hamiltonians, including physically motivated models such as the 2D Heisenberg model. Our second focus considers 1D systems: We show that APX-SIM remains P^QMA[log]-complete even for local Hamiltonians on a 1D line of 8-dimensional qudits. This uses a number of ideas from above, along with replacing the "query Hamiltonian" of [Ambainis, CCC 2014] with a new "sifter" construction.}, author = {Gharibian, Sevag and Piddock, Stephen and Yirka, Justin}, booktitle = {Proceedings of the 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {38}, title = {{Oracle complexity classes and local measurements on physical Hamiltonians}}, year = {2020}, } @inproceedings{15501, author = {Wolf, Verena and Franke, Alena and Bartelheimer, Christian and Beverungen, Daniel}, booktitle = {Proceedings of the 15th International Conference on Wirtschaftsinformatik}, title = {{Establishing Smart Service Systems is a Challenge: A Case Study on Pitfalls and Implications (accepted)}}, year = {2020}, } @article{15513, abstract = {This interview is part of the special issue (01/2020) on “High Performance Business Computing” to be published in the journal Business & Information Systems Engineering. The interviewee Utz-Uwe Haus is Senior Research Engineer @ CRAY European Research Lab (CERL)). A bio of him is included at the end of the interview.}, author = {Schryen, Guido and Kliewer, Natalia and Fink, Andreas}, journal = {Business & Information Systems Engineering}, number = {01/2020}, title = {{Interview with Utz-Uwe Haus on “High Performance Computing in Economic Environments”}}, year = {2020}, } @article{11946, abstract = {Literature reviews (LRs) play an important role in the development of domain knowledge in all fields. Yet, we observe a lack of insights into the activities with which LRs actually develop knowledge. To address this important gap, we (1) derive knowledge building activities from the extant literature on LRs, (2) suggest a knowledge-based typology of LRs that complements existing typologies, and (3) apply the suggested typology in an empirical study that explores how LRs with different goals and methodologies have contributed to knowledge development. The analysis of 240 LRs published in 40 renowned IS journals between 2000 and 2014 allows us to draw a detailed picture of knowledge development achieved by one of the most important genres in the IS field. An overarching contribution of our work is to unify extant conceptualizations of LRs by clarifying and illustrating how LRs apply different methodologies in a range of knowledge building activities to achieve their goals with respect to theory.}, author = {Schryen, Guido and Wagner, Gerit and Benlian, Alexander and Paré, Guy}, journal = {Communications of the AIS}, keyword = {Literature review, knowledge development, knowledge building activities, knowledge-based typology, information systems research}, title = {{A Knowledge Development Perspective on Literature Reviews: Validation of a New Typology in the IS Field}}, year = {2020}, } @inproceedings{15582, abstract = {When it comes to increased digitization in the health care domain, privacy is a relevant topic nowadays. This relates to patient data, electronic health records or physician reviews published online, for instance. There exist different approaches to the protection of individuals’ privacy, which focus on the anonymization and masking of personal information subsequent to their mining. In the medical domain in particular, measures to protect the privacy of patients are of high importance due to the amount of sensitive data that is involved (e.g. age, gender, illnesses, medication). While privacy breaches in structured data can be detected more easily, disclosure in written texts is more difficult to find automatically due to the unstructured nature of natural language. Therefore, we take a detailed look at existing research on areas related to privacy protection. Likewise, we review approaches to the automatic detection of privacy disclosure in different types of medical data. We provide a survey of several studies concerned with privacy breaches in the medical domain with a focus on Physician Review Websites (PRWs). Finally, we briefly develop implications and directions for further research.}, author = {Buff, Bianca and Kersting, Joschka and Geierhos, Michaela}, booktitle = {Proceedings of the 9th International Conference on Pattern Recognition Applications and Methods (ICPRAM 2020)}, keyword = {Identity Disclosure, Privacy Protection, Physician Review Website, De-Anonymization, Medical Domain}, location = {Valetta, Malta}, publisher = {SCITEPRESS}, title = {{Detection of Privacy Disclosure in the Medical Domain: A Survey}}, year = {2020}, } @article{15633, author = {Krimphove, Dieter}, journal = {ArbR – Arbeitsrecht Aktuell}, pages = {1--4}, publisher = {C. H. Beck}, title = {{Arbeitsrechtliche Rechtsprechung des EuGH im Jahre 2019}}, volume = {1}, year = {2020}, } @misc{15878, author = {Wegener, Maik}, title = {{Q&A for Products - Eine deskriptive Analyse von Fragen und Antworten auf digitalen Marktplätzen}}, year = {2020}, } @inproceedings{6856, author = {Müller, Michelle and Gutt, Dominik}, booktitle = {Wirtschaftsinformatik Proceedings 2019}, location = {Siegen, Germany}, title = {{Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods}}, year = {2019}, } @inproceedings{6976, abstract = {We investigate the maintenance of overlay networks under massive churn, i.e. nodes joining and leaving the network. We assume an adversary that may churn a constant fraction $\alpha n$ of nodes over the course of $\mathcal{O}(\log n)$ rounds. In particular, the adversary has an almost up-to-date information of the network topology as it can observe an only slightly outdated topology that is at least $2$ rounds old. Other than that, we only have the provably minimal restriction that new nodes can only join the network via nodes that have taken part in the network for at least one round. Our contributions are as follows: First, we show that it is impossible to maintain a connected topology if adversary has up-to-date information about the nodes' connections. Further, we show that our restriction concerning the join is also necessary. As our main result present an algorithm that constructs a new overlay- completely independent of all previous overlays - every $2$ rounds. Furthermore, each node sends and receives only $\mathcal{O}(\log^3 n)$ messages each round. As part of our solution we propose the Linearized DeBruijn Swarm (LDS), a highly churn resistant overlay, which will be maintained by the algorithm. However, our approaches can be transferred to a variety of classical P2P Topologies where nodes are mapped into the $[0,1)$-interval.}, author = {Götte, Thorsten and Vijayalakshmi, Vipin Ravindran and Scheideler, Christian}, booktitle = {Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19)}, location = {Rio de Janeiro, Brazil}, publisher = {IEEE}, title = {{Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary}}, year = {2019}, } @phdthesis{8080, abstract = {This thesis investigates approximate pure Nash equilibria in different game-theoretic models. In such an outcome, no player can improve her objective by more than a given factor through a deviation to another strategy. In the first part, we investigate two variants of Congestion Games in which the existence of pure Nash equilibria is guaranteed through a potential function argument. However, the computation of such equilibria might be hard. We construct and analyze approximation algorithms that enable the computation of states with low approximation factors in polynomial time. To show their guarantees we use sub games among players, bound the potential function values of arbitrary states and exploit a connection between Shapley and proportional cost shares. Furthermore, we apply and analyze sampling techniques for the computation of approximate Shapley values in different settings. In the second part, we concentrate on the existence of approximate pure Nash equilibria in games in which no pure Nash equilibria exist in general. In the model of Coevolving Opinion Formation Games, we bound the approximation guarantees for natural states nearly independent of the specific definition of the players' neighborhoods by applying a concept of virtual costs. For the special case of only one influential neighbor, we even show lower approximation factors for a natural strategy. Then, we investigate a two-sided Facility Location Game among facilities and clients on a line with an objective function consisting of distance and load. We show tight bounds on the approximation factor for settings with three facilities and infinitely many clients. For the general scenario with an arbitrary number of facilities, we bound the approximation factor for two promising candidates, namely facilities that are uniformly distributed and which are paired.}, author = {Feldotto, Matthias}, title = {{Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games}}, doi = {10.17619/UNIPB/1-588}, year = {2019}, } @inbook{8749, author = {Laubenstein, Désirée and Guthöhrlein, Kirsten and Lindmeier, Christian and Scheer, David and Sponholz, Dirk}, booktitle = {Inclusive Mathematics Education}, isbn = {9783030115173}, pages = {107--121}, title = {{The ‘Learning Office’ as an Approach for Inclusive Education in Mathematics: Opportunities and Challenges}}, doi = {10.1007/978-3-030-11518-0_9}, year = {2019}, } @article{80, abstract = {Models on network formation have often been extended to include the potential of network disruption in recent years. Whereas the theoretical research on network formation under the threat of disruption has thus gained prominence, hardly any experimental research exists so far. In this paper, we therefore experimentally study the emergence of networks including the aspect of a known external threat by relating theoretical predictions by Dzuibiński and Goyal (2013) to actual observed behaviour. We deal with the question if subjects in the role of a strategic Designer are able to form safe networks for least costs while facing a strategic Adversary who is going to attack their networks. Varying the costs for protecting nodes, we designed and tested two treatments with different predictions for the equilibrium network and investigated whether one of the least cost equilibrium networks was more likely to be reached. Furthermore, the influence of the subjects’ farsightedness on their decision-making process was elicited and analysed. We find that while subjects are able to build safe networks in both treatments, equilibrium networks are only built in one of the two treatments. In the other treatment, predominantly safe networks are built but they are not for least costs. Additionally, we find that farsightedness –as measured in our experiment– has no influence on whether subjects are able to build safe or least cost equilibrium networks. Two robustness settings with a reduced external threat or more liberties to modify the initial networks qualitatively confirm our results. Overall, in this experiment observed behaviour is only partially in line with the theoretical predictions by Dzuibiński and Goyal (2013).}, author = {Endres, Angelika Elfriede and Recker, Sonja and Mir Djawadi, Behnud and Hoyer, Britta}, journal = {Journal of Economic Behavior and Organization }, pages = {708--734}, title = {{Network Formation and Disruption - An Experiment: Are equilibrium networks too complex?}}, doi = {10.1016/j.jebo.2018.11.004}, volume = {157}, year = {2019}, } @misc{8530, author = {Beckhoff, Yvonne Maria}, title = {{There's an App for that - Ein Literaturüberblick über Erfolgsfaktoren für App-Downloads}}, year = {2019}, } @misc{8840, author = {Fath, Jerome Louis}, title = {{# Fail - Ein Literaturüberblick über Online-Bewertungen zu Produkt- und Dienstleistungsfehlern}}, year = {2019}, } @misc{6628, author = {Seutter, Janina}, title = {{Bewertung von Maschinen-generierten Geschäftsmodell-Ideen: Eine experimentelle Untersuchung}}, year = {2019}, } @misc{8799, author = {Groh, Andreas}, title = {{Ideenbewertung durch die Crowd - Ein klassifizierender Literaturüberblick}}, year = {2019}, } @article{8958, author = {Goller, Michael and Steffen, Bianca and Harteis, Christian}, issn = {1874-785X}, journal = {Vocations and Learning}, number = {1}, pages = {67--85}, title = {{Becoming a Nurse Aide: An Investigation of an Existing Workplace Curriculum in a Nursing Home}}, doi = {10.1007/s12186-018-9209-z}, volume = {12}, year = {2019}, } @article{9634, abstract = {Future quantum computation and networks require scalable monolithic circuits, which incorporate various advanced functionalities on a single physical substrate. Although substantial progress for various applications has already been demonstrated on different platforms, the range of diversified manipulation of photonic states on demand on a single chip has remained limited, especially dynamic time management. Here, we demonstrate an electro-optic device, including photon pair generation, propagation, electro-optical path routing, as well as a voltage-controllable time delay of up to ~12 ps on a single Ti:LiNbO3 waveguide chip. As an example, we demonstrate Hong-Ou-Mandel interference with a visibility of more than 93 ± 1.8%. Our chip not only enables the deliberate manipulation of photonic states by rotating the polarization but also provides precise time control. Our experiment reveals that we have full flexible control over single-qubit operations by harnessing the complete potential of fast on-chip electro-optic modulation.}, author = {Luo, Kai-Hong and Brauner, Sebastian and Eigner, Christof and Sharapova, Polina R. and Ricken, Raimund and Meier, Torsten and Herrmann, Harald and Silberhorn, Christine}, issn = {2375-2548}, journal = {Science Advances}, title = {{Nonlinear integrated quantum electro-optic circuits}}, doi = {10.1126/sciadv.aat1451}, year = {2019}, } @book{9711, editor = {Strauß, Sara and Schäfer-Althaus, Sarah}, publisher = {Winter}, title = {{Transient Bodies in Anglophone Literature and Culture}}, year = {2019}, } @inproceedings{9780, author = {Bohn, Nicolai}, booktitle = {Proceedings of the Twenty-fifth Americas Conference on Information Systems (AMCIS)}, location = {Cancun, Mexico}, title = {{Do Digital Startups Prepare for Technology Pivots? - An Initial Analysis of Job Adverts}}, year = {2019}, } @article{9824, author = {Peuster, Manuel and Schneider, Stefan Balthasar and Zhao, Mengxuan and Xilouris, George and Trakadas, Panagiotis and Vicens, Felipe and Tavernier, Wouter and Soenen, Thomas and Vilalta, Ricard and Andreou, George and Kyriazis, Dimosthenis and Karl, Holger}, issn = {0163-6804}, journal = {IEEE Communications Magazine}, pages = {96--102}, title = {{Introducing Automated Verification and Validation for Virtualized Network Functions and Services}}, doi = {10.1109/mcom.2019.1800873}, year = {2019}, } @article{9920, author = {Fritz, Marlon and Gries, Thomas and Feng, Yuanhua}, issn = {0165-1765}, journal = {Economics Letters}, pages = {47--50}, title = {{Secular stagnation? Is there statistical evidence of an unprecedented, systematic decline in growth?}}, doi = {10.1016/j.econlet.2019.04.021}, volume = {181}, year = {2019}, } @inproceedings{9913, abstract = {Reconfigurable hardware has received considerable attention as a platform that enables dynamic hardware updates and thus is able to adapt new configurations at runtime. However, due to their dynamic nature, e.g., field-programmable gate arrays (FPGA) are subject to a constant possibility of attacks, since each new configuration might be compromised. Trojans for reconfigurable hardware that evade state-of-the-art detection techniques and even formal verification, are thus a large threat to these devices. One such stealthy hardware Trojan, that is inserted and activated in two stages by compromised electronic design automation (EDA) tools, has recently been presented and shown to evade all forms of classical pre-configuration detection techniques. This paper presents a successful pre-configuration countermeasure against this ``Malicious Look-up-table (LUT)''-hardware Trojan, by employing bitstream-level Proof-Carrying Hardware (PCH). We show that the method is able to alert innocent module creators to infected EDA tools, and to prohibit malicious ones to sell infected modules to unsuspecting customers.}, author = {Ahmed, Qazi Arbab and Wiersema, Tobias and Platzner, Marco}, booktitle = {Applied Reconfigurable Computing}, editor = {Hochberger, Christian and Nelson, Brent and Koch, Andreas and Woods, Roger and Diniz, Pedro}, isbn = {978-3-030-17227-5}, location = {Darmstadt, Germany}, pages = {127--136}, publisher = {Springer International Publishing}, title = {{Proof-Carrying Hardware Versus the Stealthy Malicious LUT Hardware Trojan}}, doi = {10.1007/978-3-030-17227-5_10}, volume = {11444}, year = {2019}, } @inproceedings{10285, abstract = {We study text reuse related to Wikipedia at scale by compiling the first corpus of text reuse cases within Wikipedia as well as without (i.e., reuse of Wikipedia text in a sample of the Common Crawl). To discover reuse beyond verbatim copy and paste, we employ state-of-the-art text reuse detection technology, scaling it for the first time to process the entire Wikipedia as part of a distributed retrieval pipeline. We further report on a pilot analysis of the 100 million reuse cases inside, and the 1.6 million reuse cases outside Wikipedia that we discovered. Text reuse inside Wikipedia gives rise to new tasks such as article template induction, fixing quality flaws, or complementing Wikipedia's ontology. Text reuse outside Wikipedia yields a tangible metric for the emerging field of quantifying Wikipedia's influence on the web. To foster future research into these tasks, and for reproducibility's sake, the Wikipedia text reuse corpus and the retrieval pipeline are made freely available.}, author = {Alshomary, Milad and Völske, Michael and Licht, Tristan and Wachsmuth, Henning and Stein, Benno and Hagen, Matthias and Potthast, Martin}, booktitle = {Advances in Information Retrieval}, editor = {Azzopardi, Leif and Stein, Benno and Fuhr, Norbert and Mayr, Philipp and Hauff, Claudia and Hiemstra, Djoerd}, isbn = {978-3-030-15712-8}, pages = {747--754}, publisher = {Springer International Publishing}, title = {{Wikipedia Text Reuse: Within and Without}}, year = {2019}, } @article{10090, author = {Gries, Thomas}, issn = {0569-4345}, journal = {The American Economist}, title = {{A New Theory of Demand-Restricted Growth: The Basic Idea}}, doi = {10.1177/0569434519846477}, year = {2019}, } @article{2727, author = {Gries, T. and Redlin, M.}, issn = {1024-2694}, journal = {Defence and Peace Economics}, number = {3}, pages = {309--323}, publisher = {Informa UK Limited}, title = {{Pirates – The Young and the Jobless: The Effect of Youth Bulges and Youth Labor Market Integration on Maritime Piracy}}, doi = {10.1080/10242694.2017.1333797}, volume = {30}, year = {2019}, } @article{10595, abstract = {In this article we show that the boundary of the Pareto critical set of an unconstrained multiobjective optimization problem (MOP) consists of Pareto critical points of subproblems where only a subset of the set of objective functions is taken into account. If the Pareto critical set is completely described by its boundary (e.g., if we have more objective functions than dimensions in decision space), then this can be used to efficiently solve the MOP by solving a number of MOPs with fewer objective functions. If this is not the case, the results can still give insight into the structure of the Pareto critical set.}, author = {Gebken, Bennet and Peitz, Sebastian and Dellnitz, Michael}, issn = {0925-5001}, journal = {Journal of Global Optimization}, number = {4}, pages = {891--913}, title = {{On the hierarchical structure of Pareto critical sets}}, doi = {10.1007/s10898-019-00737-6}, volume = {73}, year = {2019}, } @inproceedings{9778, author = {Gutt, Dominik and Neumann, Jürgen}, booktitle = {Proceedings of the Twenty-Seventh European Conference on Information Systems (ECIS)}, location = {Stockholm, Sweden}, title = {{The Virtues of Anonymity - An Empirical Investigation of the Relationship between B2B Online Ratings and Reviewer Self-Disclosure}}, year = {2019}, } @misc{10038, author = {Agethen, Christopher Heinrich}, title = {{Stoppt das Sharing? Ökonometrische Untersuchungen zur gesetzlichen Einschränkung von Airbnb}}, year = {2019}, }
https://ris.uni-paderborn.de/export?cql=status%3Dpublic&fmt=bibtex&limit=50&sort=year.desc&sort=author.asc&start=20&style=ieee
ris.uni-paderborn.de
crawl=CC-MAIN-2020-10
38226
application/http; msgtype=response
sha1:KKLNMSKZK3C2GTLPQSFQI7UDVSVWW4TP
<urn:uuid:021d2736-1bb9-4501-8d49-6f03a83b2759>
2020-02-20T15:02:02Z
131.234.137.50
application/x-bibtex-text-file
sha1:L2BT4R47LRZLOVRV7RQTP3G3JCZKRSZP
<urn:uuid:d882e253-112b-4f1d-b973-c6a4b44fe37d>
https://ris.uni-paderborn.de/export?cql=status%3Dpublic&fmt=bibtex&limit=50&sort=year.desc&sort=author.asc&start=20&style=ieee
response
<urn:uuid:13f04498-3df5-4691-865f-cc87e5211459>
isPartOf: CC-MAIN-2020-10
publisher: Common Crawl
description: Wide crawl of the web for February 2020
operator: Common Crawl Admin (info@commoncrawl.org)
hostname: ip-10-67-67-228.ec2.internal
software: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)
robots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)
format: WARC File Format 1.1
conformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/