@inbook{4338, abstract = {{Physician review websites are known around the world. Patients review the subjectively experienced quality of medical services supplied to them and publish an overall rating on the Internet, where quantitative grades and qualitative texts come together. On the one hand, these new possibilities reduce the imbalance of power between health care providers and patients, but on the other hand, they can also damage the usually very intimate relationship between health care providers and patients. Review websites must meet these requirements with a high level of responsibility and service quality. In this paper, we look at the situation in Lithuania: Especially, we are interested in the available possibilities of evaluation and interaction, and the quality of a particular review website measured against the available data. We thereby identify quality weaknesses and lay the foundation for future research.}}, author = {{Bäumer, Frederik Simon and Kersting, Joschka and Kuršelis, Vytautas and Geierhos, Michaela}}, booktitle = {{Communications in Computer and Information Science}}, editor = {{Damaševičius, Robertas and Vasiljevienė, Giedrė}}, isbn = {{9783319999715}}, issn = {{1865-0929}}, keywords = {{Lithuanian physician review websites, Medical service ratings}}, location = {{Vilnius, Lithuania}}, pages = {{43--58}}, publisher = {{Springer}}, title = {{{Rate Your Physician: Findings from a Lithuanian Physician Rating Website}}}, doi = {{10.1007/978-3-319-99972-2_4}}, volume = {{920}}, year = {{2018}}, } @inproceedings{4339, abstract = {{On-The-Fly Computing is the vision of covering software needs of end users by fully-automatic compositions of existing software services. End users will receive so-called service compositions tailored to their very individual needs, based on natural language software descriptions. This everyday language may contain inaccuracies and incompleteness, which are well-known challenges in requirements engineering. In addition to existing approaches that try to automatically identify and correct these deficits, there are also new trends to involve users more in the elaboration and refinement process. In this paper, we present the relevant state of the art in the field of automated detection and compensation of multiple inaccuracies in natural language service descriptions and name open challenges needed to be tackled in NL-based software service composition. }}, author = {{Bäumer, Frederik Simon and Geierhos, Michaela}}, booktitle = {{Proceedings of the 24th International Conference on Information and Software Technologies (ICIST 2018)}}, editor = {{Damaševičius, Robertas and Vasiljevienė, Giedrė}}, isbn = {{9783319999715}}, issn = {{1865-0929}}, keywords = {{Inaccuracy detection, Natural language software requirements}}, location = {{Vilnius, Lithuania}}, pages = {{559--570}}, publisher = {{Springer}}, title = {{{NLP in OTF Computing: Current Approaches and Open Challenges}}}, doi = {{10.1007/978-3-319-99972-2_46}}, volume = {{920}}, year = {{2018}}, } @inproceedings{4341, author = {{Bäumer, Frederik Simon and Geierhos, Michaela}}, booktitle = {{European Conference on Data Analysis 2018: Multidisciplinary Facets of Data Science - Book of Abstracts}}, location = {{Paderborn, Germany}}, title = {{{Text Broom: A ML-based Tool to Detect and Highlight Privacy Breaches in Physician Reviews: An Insight into Our Current Work}}}, year = {{2018}}, } @article{4342, author = {{Chen, Shumei and Rahmani, Mohsen and Li, King Fai and Miroshnichenko, Andrey and Zentgraf, Thomas and Li, Guixin and Neshev, Dragomir and Zhang, Shuang}}, issn = {{2330-4022}}, journal = {{ACS Photonics}}, number = {{5}}, pages = {{1671--1675}}, publisher = {{American Chemical Society (ACS)}}, title = {{{Third Harmonic Generation Enhanced by Multipolar Interference in Complementary Silicon Metasurfaces}}}, doi = {{10.1021/acsphotonics.7b01423}}, volume = {{5}}, year = {{2018}}, } @inproceedings{4344, author = {{Blömer, Johannes and Brauer, Sascha and Bujna, Kathrin}}, booktitle = {{29th International Symposium on Algorithms and Computation (ISAAC 2018)}}, isbn = {{978-3-95977-094-1}}, location = {{Jiaoxi, Yilan County, Taiwan}}, pages = {{46:1----46:12}}, publisher = {{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}}, title = {{{Coresets for Fuzzy K-Means with Applications}}}, doi = {{10.4230/LIPIcs.ISAAC.2018.46}}, year = {{2018}}, } @inproceedings{4345, abstract = {{This paper presents the various sources of uncertainty we encounter in our project. Our research focus lies on the investigation of language elaboration processes in Middle Low German. We are particularly interested in diachronic constructional changes and constructionalizations involving and affecting all linguistic dimensions. For this, it is necessary to annotate our corpus with Part-of-Speech and constructional tags. Here, we are confronted with gradualness, gradience, and ambiguity as potential sources of uncertainty that complicate the annotation process. Furthermore, due to the historicity of the investigated language, we expect cases of incomplete knowledge and comparative fallacy from the annotators. For this reason, we develop an interface that captures all annotators’ doubts.}}, author = {{Merten, Marie-Luis and Seemann, Nina}}, booktitle = {{Proceedings of the 6th International Conference on Technological Ecosystems for Enhancing Multiculturality (TEEM'18)}}, editor = {{García-Peñalvo, Francisco José}}, isbn = {{978-1-4503-6518-5}}, keywords = {{historical languages, linguistic annotations, gradience and gradualness, ambiguity, incomplete knowledge}}, location = {{Salamanca, Spain}}, pages = {{819--825}}, publisher = {{ACM}}, title = {{{Analysing Constructional Change: Linguistic Annotation and Sources of Uncertainty}}}, doi = {{10.1145/3284179.3284320}}, year = {{2018}}, } @inproceedings{4349, abstract = {{Physician Review Websites allow users to evaluate their experiences with health services. As these evaluations are regularly contextualized with facts from users’ private lives, they often accidentally disclose personal information on the Web. This poses a serious threat to users’ privacy. In this paper, we report on early work in progress on “Text Broom”, a tool to detect privacy breaches in user-generated texts. For this purpose, we conceptualize a pipeline which combines methods of Natural Language Processing such as Named Entity Recognition, linguistic patterns and domain-specific Machine Learning approaches which have the potential to recognize privacy violations with wide coverage. A prototypical web application is openly accesible.}}, author = {{Bäumer, Frederik Simon and Kersting, Joschka and Orlikowski, Matthias and Geierhos, Michaela}}, booktitle = {{Proceedings of the Posters and Demos Track of the 14th International Conference on Semantic Systems co-located with the 14th International Conference on Semantic Systems (SEMANTiCS 2018)}}, editor = {{Khalili, Ali and Koutraki, Maria}}, issn = {{1613-0073}}, keywords = {{Detection of Privacy Violations, Physician Reviews}}, location = {{Vienna, Austria}}, publisher = {{CEUR-WS.org}}, title = {{{Towards a Multi-Stage Approach to Detect Privacy Breaches in Physician Reviews}}}, volume = {{2198}}, year = {{2018}}, } @inbook{4350, author = {{As, Donat Josef and Lischka, Klaus}}, booktitle = {{Molecular Beam Epitaxy}}, isbn = {{9780128121368}}, pages = {{95--114}}, publisher = {{Elsevier}}, title = {{{Nonpolar Cubic III-nitrides: From the Basics of Growth to Device Applications}}}, doi = {{10.1016/b978-0-12-812136-8.00006-2}}, year = {{2018}}, } @inproceedings{4351, abstract = {{ We extend the concept of monotonic searchability~\cite{DBLP:conf/opodis/ScheidelerSS15}~\cite{DBLP:conf/wdag/ScheidelerSS16} for self-stabilizing systems from one to multiple dimensions. A system is self-stabilizing if it can recover to a legitimate state from any initial illegal state. These kind of systems are most often used in distributed applications. Monotonic searchability provides guarantees when searching for nodes while the recovery process is going on. More precisely, if a search request started at some node $u$ succeeds in reaching its destination $v$, then all future search requests from $u$ to $v$ succeed as well. Although there already exists a self-stabilizing protocol for a two-dimensional topology~\cite{DBLP:journals/tcs/JacobRSS12} and an universal approach for monotonic searchability~\cite{DBLP:conf/wdag/ScheidelerSS16}, it is not clear how both of these concepts fit together effectively. The latter concept even comes with some restrictive assumptions on messages, which is not the case for our protocol. We propose a simple novel protocol for a self-stabilizing two-dimensional quadtree that satisfies monotonic searchability. Our protocol can easily be extended to higher dimensions and offers routing in $\mathcal O(\log n)$ hops for any search request. }}, author = {{Feldmann, Michael and Kolb, Christina and Scheideler, Christian}}, booktitle = {{Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}}, pages = {{16--31 }}, publisher = {{Springer, Cham}}, title = {{{Self-stabilizing Overlays for high-dimensional Monotonic Searchability}}}, doi = {{10.1007/978-3-030-03232-6_2}}, volume = {{11201}}, year = {{2018}}, } @article{4356, author = {{Guo, Zhongyi and Chen, Xianzhong and Zentgraf, Thomas}}, issn = {{0022-3727}}, journal = {{Journal of Physics D: Applied Physics}}, number = {{15}}, publisher = {{IOP Publishing}}, title = {{{Editorial for the theories and applications of metasurfaces}}}, doi = {{10.1088/1361-6463/aab3b6}}, volume = {{51}}, year = {{2018}}, } @article{4358, author = {{Zhao, Ruizhe and Huang, Lingling and Tang, Chengchun and Li, Junjie and Li, Xiaowei and Wang, Yongtian and Zentgraf, Thomas}}, issn = {{2195-1071}}, journal = {{Advanced Optical Materials}}, publisher = {{Wiley}}, title = {{{Nanoscale Polarization Manipulation and Encryption Based on Dielectric Metasurfaces}}}, doi = {{10.1002/adom.201800490}}, year = {{2018}}, } @inproceedings{4362, author = {{Schlangenotto, Darius and Kundisch, Dennis and Poniatowski, Martin}}, booktitle = {{Proceedings of the 24th Americas Conference on Information Systems (AMCIS)}}, location = {{New Orleans, USA}}, title = {{{What Drives Paid Search Success: A Systematic Literature Review}}}, year = {{2018}}, } @inproceedings{4363, author = {{Bohn, Nicolai and Kundisch, Dennis}}, booktitle = {{Proceedings of the 39th International Conference on Information Systems (ICIS)}}, location = {{Phoenix, Arizona, USA}}, title = {{{An Extended Perspective of Technology Pivots in Software Startups: Towards a Theoretical Model}}}, year = {{2018}}, } @inproceedings{4364, author = {{Neumann, Jürgen}}, booktitle = {{INFORMS Conference on Information Systems and Technology (CIST)}}, location = {{Phoenix, Arizona, USA}}, title = {{{The Economics of Online Reviews in Markets with Variety-Seeking Consumers}}}, year = {{2018}}, } @inproceedings{4373, author = {{Szopinski, Daniel}}, booktitle = {{Bosch Business Model Innovation Summit 2018}}, location = {{Renningen, Germany}}, title = {{{Towards software-based tools for business model development: Using external stimuli for business model idea generation}}}, year = {{2018}}, } @inproceedings{4375, abstract = {{We present a peer-to-peer network that supports the efficient processing of orthogonal range queries $R=\bigtimes_{i=1}^{d}[a_i,\,b_i]$ in a $d$-dimensional point space.\\ The network is the same for each dimension, namely a distance halving network like the one introduced by Naor and Wieder (ACM TALG'07). We show how to execute such range queries using $\mathcal{O}\left(2^{d'}d\,\log m + d\,|R|\right)$ hops (and the same number of messages) in total. Here $[m]^d$ is the ground set, $|R|$ is the size and $d'$ the dimension of the queried range. Furthermore, if the peers form a distributed network, the query can be answered in $\mathcal{O}\left(d\,\log m + d\,\sum_{i=1}^{d}(b_i-a_i+1)\right)$ communication rounds. Our algorithms are based on a mapping of the Hilbert Curve through $[m]^d$ to the peers.}}, author = {{Benter, Markus and Knollmann, Till and Meyer auf der Heide, Friedhelm and Setzer, Alexander and Sundermeier, Jannik}}, booktitle = {{Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)}}, keywords = {{Distributed Storage, Multi-Dimensional Range Queries, Peer-to-Peer, Hilbert Curve}}, location = {{Helsinki}}, title = {{{A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension}}}, doi = {{10.1007/978-3-030-19759-9_4}}, year = {{2018}}, } @article{4394, abstract = {{ 1. Effektive Besteuerung von Outbound-Investitionen in den USA 2. Qualifikation von Einkünften als passiv 3. Anwendung des Motivtests auf die USA? 4. Fazit und Ausblick}}, author = {{Schümmer, Markus and Leusder, Johannes and Weinrich, Arndt}}, journal = {{IStR Internationales Steuerrecht}}, keywords = {{Effektive Besteuerung von Outbound-Investitionen in den USA Qualifikation von Einkünften als passiv Anwendung des Motivtests auf die USA}}, title = {{{Implikationen der US-Steuerreform auf die Hinzurechnungsbesteuerung nach dem AStG}}}, year = {{2018}}, } @inproceedings{44, abstract = {{Natural language software requirements descriptions enable end users to formulate their wishes and expectations for a future software product without much prior knowledge in requirements engineering. However, these descriptions are susceptible to linguistic inaccuracies such as ambiguities and incompleteness that can harm the development process. There is a number of software solutions that can detect deficits in requirements descriptions and partially solve them, but they are often hard to use and not suitable for end users. For this reason, we develop a software system that helps end-users to create unambiguous and complete requirements descriptions by combining existing expert tools and controlling them using automatic compensation strategies. In order to recognize the necessity of individual compensation methods in the descriptions, we have developed linguistic indicators, which we present in this paper. Based on these indicators, the whole text analysis pipeline is ad-hoc configured and thus adapted to the individual circumstances of a requirements description.}}, author = {{Bäumer, Frederik Simon and Geierhos, Michaela}}, booktitle = {{Proceedings of the 51st Hawaii International Conference on System Sciences}}, isbn = {{978-0-9981331-1-9}}, keywords = {{Software Product Lines: Engineering, Services, and Management, Ambiguities, Incompleteness, Natural Language Processing, Software Requirements}}, location = {{Big Island, Waikoloa Village}}, pages = {{5746--5755}}, title = {{{Flexible Ambiguity Resolution and Incompleteness Detection in Requirements Descriptions via an Indicator-based Configuration of Text Analysis Pipelines}}}, doi = {{10125/50609}}, year = {{2018}}, } @inproceedings{4999, author = {{Pauck, Felix and Bodden, Eric and Wehrheim, Heike}}, booktitle = {{Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering - ESEC/FSE 2018}}, isbn = {{9781450355735}}, publisher = {{ACM Press}}, title = {{{Do Android taint analysis tools keep their promises?}}}, doi = {{10.1145/3236024.3236029}}, year = {{2018}}, } @article{5001, author = {{Garnefeld, Ina and Boehm, Eva and Klimke, Lena and Oestreich, Andrea}}, journal = {{Journal of the Academy of Marketing Science}}, number = {{6}}, pages = {{1133----1147}}, title = {{{I thought it was over, but now it is back: customer reactions to ex post time extensions of sales promotions}}}, volume = {{46}}, year = {{2018}}, }