@article{AlnoorTiberiusAtiyahetal.2022,
  author    = {Alnoor, Alhamzah and Tiberius, Victor and Atiyah, Abbas Gatea and Khaw, Khai Wah and Yin, Teh Sin and Chew, XinYing and Abbas, Sammar},
  title     = {How positive and negative electronic word of mouth (eWOM) affects customers' intention to use social commerce?},
  series = {International journal of human computer interaction},
  journal   = {International journal of human computer interaction},
  publisher = {Taylor \& Francis},
  address   = {New York},
  issn      = {1044-7318},
  doi       = {10.1080/10447318.2022.2125610},
  pages     = {1 -- 30},
  year      = {2022},
  abstract  = {Advances in Web 2.0 technologies have led to the widespread assimilation of electronic commerce platforms as an innovative shopping method and an alternative to traditional shopping. However, due to pro-technology bias, scholars focus more on adopting technology, and slightly less attention has been given to the impact of electronic word of mouth (eWOM) on customers' intention to use social commerce. This study addresses the gap by examining the intention through exploring the effect of eWOM on males' and females' intentions and identifying the mediation of perceived crowding. To this end, we adopted a dual-stage multi-group structural equation modeling and artificial neural network (SEM-ANN) approach. We successfully extended the eWOM concept by integrating negative and positive factors and perceived crowding. The results reveal the causal and non-compensatory relationships between the constructs. The variables supported by the SEM analysis are adopted as the ANN model's input neurons. According to the natural significance obtained from the ANN approach, males' intentions to accept social commerce are related mainly to helping the company, followed by core functionalities. In contrast, females are highly influenced by technical aspects and mishandling. The ANN model predicts customers' intentions to use social commerce with an accuracy of 97\%. We discuss the theoretical and practical implications of increasing customers' intention toward social commerce channels among consumers based on our findings.},
  language  = {en}
}
@article{HuangRichterKleickmannetal.2021,
  author    = {Huang, Yizhen and Richter, Eric and Kleickmann, Thilo and Wiepke, Axel and Richter, Dirk},
  title     = {Classroom complexity affects student teachers' behavior in a VR classroom},
  series = {Computers \& education : an international journal},
  volume    = {163},
  journal   = {Computers \& education : an international journal},
  publisher = {Elsevier},
  address   = {Oxford},
  issn      = {0360-1315},
  doi       = {10.1016/j.compedu.2020.104100},
  pages     = {15},
  year      = {2021},
  abstract  = {Student teachers often struggle to keep track of everything that is happening in the classroom, and particularly to notice and respond when students cause disruptions. The complexity of the classroom environment is a potential contributing factor that has not been empirically tested. In this experimental study, we utilized a virtual reality (VR) classroom to examine whether classroom complexity affects the likelihood of student teachers noticing disruptions and how they react after noticing. Classroom complexity was operationalized as the number of disruptions and the existence of overlapping disruptions (multidimensionality) as well as the existence of parallel teaching tasks (simultaneity). Results showed that student teachers (n = 50) were less likely to notice the scripted disruptions, and also less likely to respond to the disruptions in a comprehensive and effortful manner when facing greater complexity. These results may have implications for both teacher training and the design of VR for training or research purpose. This study contributes to the field from two aspects: 1) it revealed how features of the classroom environment can affect student teachers' noticing of and reaction to disruptions; and 2) it extends the functionality of the VR environment-from a teacher training tool to a testbed of fundamental classroom processes that are difficult to manipulate in real-life.},
  language  = {en}
}
@article{ShekharReimannMayeretal.2021,
  author    = {Shekhar, Sumit and Reimann, Max and Mayer, Maximilian and Semmo, Amir and Pasewaldt, Sebastian and D{\"o}llner, J{\"u}rgen and Trapp, Matthias},
  title     = {Interactive photo editing on smartphones via intrinsic decomposition},
  series = {Computer graphics forum : journal of the European Association for Computer Graphics},
  volume    = {40},
  journal   = {Computer graphics forum : journal of the European Association for Computer Graphics},
  publisher = {Blackwell},
  address   = {Oxford},
  issn      = {0167-7055},
  doi       = {10.1111/cgf.142650},
  pages     = {497 -- 510},
  year      = {2021},
  abstract  = {Intrinsic decomposition refers to the problem of estimating scene characteristics, such as albedo and shading, when one view or multiple views of a scene are provided. The inverse problem setting, where multiple unknowns are solved given a single known pixel-value, is highly under-constrained. When provided with correlating image and depth data, intrinsic scene decomposition can be facilitated using depth-based priors, which nowadays is easy to acquire with high-end smartphones by utilizing their depth sensors. In this work, we present a system for intrinsic decomposition of RGB-D images on smartphones and the algorithmic as well as design choices therein. Unlike state-of-the-art methods that assume only diffuse reflectance, we consider both diffuse and specular pixels. For this purpose, we present a novel specularity extraction algorithm based on a multi-scale intensity decomposition and chroma inpainting. At this, the diffuse component is further decomposed into albedo and shading components. We use an inertial proximal algorithm for non-convex optimization (iPiano) to ensure albedo sparsity. Our GPU-based visual processing is implemented on iOS via the Metal API and enables interactive performance on an iPhone 11 Pro. Further, a qualitative evaluation shows that we are able to obtain high-quality outputs. Furthermore, our proposed approach for specularity removal outperforms state-of-the-art approaches for real-world images, while our albedo and shading layer decomposition is faster than the prior work at a comparable output quality. Manifold applications such as recoloring, retexturing, relighting, appearance editing, and stylization are shown, each using the intrinsic layers obtained with our method and/or the corresponding depth data.},
  language  = {en}
}
@article{BrewkaEllmauthalerKernIsberneretal.2018,
  author    = {Brewka, Gerhard and Ellmauthaler, Stefan and Kern-Isberner, Gabriele and Obermeier, Philipp and Ostrowski, Max and Romero, Javier and Schaub, Torsten H. and Schieweck, Steffen},
  title     = {Advanced solving technology for dynamic and reactive applications},
  series = {K{\"u}nstliche Intelligenz},
  volume    = {32},
  journal   = {K{\"u}nstliche Intelligenz},
  number    = {2-3},
  publisher = {Springer},
  address   = {Heidelberg},
  issn      = {0933-1875},
  doi       = {10.1007/s13218-018-0538-8},
  pages     = {199 -- 200},
  year      = {2018},
  language  = {en}
}
@inproceedings{AbramovaGladkayaKrasnova2021,
  author    = {Abramova, Olga and Gladkaya, Margarita and Krasnova, Hanna},
  title     = {An unusual encounter with oneself},
  series = {ICIS 2021: IS and the future of work},
  booktitle = {ICIS 2021: IS and the future of work},
  publisher = {AIS Electronic Library (AISeL)},
  address   = {[Erscheinungsort nicht ermittelbar]},
  year      = {2021},
  abstract  = {Helping overcome distance, the use of videoconferencing tools has surged during the pandemic. To shed light on the consequences of videoconferencing at work, this study takes a granular look at the implications of the self-view feature for meeting outcomes. Building on self-awareness research and self-regulation theory, we argue that by heightening the state of self-awareness, self-view engagement depletes participants' mental resources and thereby can undermine online meeting outcomes. Evaluation of our theoretical model on a sample of 179 employees reveals a nuanced picture. Self-view engagement while speaking and while listening is positively associated with self-awareness, which, in turn, is negatively associated with satisfaction with meeting process, perceived productivity, and meeting enjoyment. The criticality of the communication role is put forward: looking at self while listening to other attendees has a negative direct and indirect effect on meeting outcomes; however, looking at self while speaking produces equivocal effects.},
  language  = {en}
}
@article{LutherTiberiusBrem2020,
  author    = {Luther, Laura and Tiberius, Victor and Brem, Alexander},
  title     = {User experience (UX) in business, management, and psychology},
  series = {Multimodal technologies and interaction : open access journal},
  volume    = {4},
  journal   = {Multimodal technologies and interaction : open access journal},
  number    = {2},
  publisher = {MDPI},
  address   = {Basel},
  issn      = {2414-4088},
  doi       = {10.3390/mti4020018},
  pages     = {19},
  year      = {2020},
  abstract  = {User Experience (UX) describes the holistic experience of a user before, during, and after interaction with a platform, product, or service. UX adds value and attraction to their sole functionality and is therefore highly relevant for firms. The increased interest in UX has produced a vast amount of scholarly research since 1983. The research field is, therefore, complex and scattered. Conducting a bibliometric analysis, we aim at structuring the field quantitatively and rather abstractly. We employed citation analyses, co-citation analyses, and content analyses to evaluate productivity and impact of extant research. We suggest that future research should focus more on business and management related topics.},
  language  = {en}
}
@article{DoerrNeumannSutton2016,
  author    = {Doerr, Benjamin and Neumann, Frank and Sutton, Andrew M.},
  title     = {Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas},
  series = {Algorithmica : an international journal in computer science},
  volume    = {78},
  journal   = {Algorithmica : an international journal in computer science},
  publisher = {Springer},
  address   = {New York},
  issn      = {0178-4617},
  doi       = {10.1007/s00453-016-0190-3},
  pages     = {561 -- 586},
  year      = {2016},
  abstract  = {We contribute to the theoretical understanding of randomized search heuristics by investigating their optimization behavior on satisfiable random k-satisfiability instances both in the planted solution model and the uniform model conditional on satisfiability. Denoting the number of variables by n, our main technical result is that the simple () evolutionary algorithm with high probability finds a satisfying assignment in time when the clause-variable density is at least logarithmic. For low density instances, evolutionary algorithms seem to be less effective, and all we can show is a subexponential upper bound on the runtime for densities below . We complement these mathematical results with numerical experiments on a broader density spectrum. They indicate that, indeed, the () EA is less efficient on lower densities. Our experiments also suggest that the implicit constants hidden in our main runtime guarantee are low. Our main result extends and considerably improves the result obtained by Sutton and Neumann (Lect Notes Comput Sci 8672:942-951, 2014) in terms of runtime, minimum density, and clause length. These improvements are made possible by establishing a close fitness-distance correlation in certain parts of the search space. This approach might be of independent interest and could be useful for other average-case analyses of randomized search heuristics. While the notion of a fitness-distance correlation has been around for a long time, to the best of our knowledge, this is the first time that fitness-distance correlation is explicitly used to rigorously prove a performance statement for an evolutionary algorithm.},
  language  = {en}
}
@article{DoerrKoetzing2020,
  author    = {Doerr, Benjamin and K{\"o}tzing, Timo},
  title     = {Multiplicative Up-Drift},
  series = {Algorithmica},
  volume    = {83},
  journal   = {Algorithmica},
  number    = {10},
  publisher = {Springer},
  address   = {New York},
  issn      = {0178-4617},
  doi       = {10.1007/s00453-020-00775-7},
  pages     = {3017 -- 3058},
  year      = {2020},
  abstract  = {Drift analysis aims at translating the expected progress of an evolutionary algorithm (or more generally, a random process) into a probabilistic guarantee on its run time (hitting time). So far, drift arguments have been successfully employed in the rigorous analysis of evolutionary algorithms, however, only for the situation that the progress is constant or becomes weaker when approaching the target. Motivated by questions like how fast fit individuals take over a population, we analyze random processes exhibiting a (1+delta)-multiplicative growth in expectation. We prove a drift theorem translating this expected progress into a hitting time. This drift theorem gives a simple and insightful proof of the level-based theorem first proposed by Lehre (2011). Our version of this theorem has, for the first time, the best-possible near-linear dependence on 1/delta} (the previous results had an at least near-quadratic dependence), and it only requires a population size near-linear in delta (this was super-quadratic in previous results). These improvements immediately lead to stronger run time guarantees for a number of applications. We also discuss the case of large delta and show stronger results for this setting.},
  language  = {en}
}
@article{RichlySchlosserBoissier2022,
  author    = {Richly, Keven and Schlosser, Rainer and Boissier, Martin},
  title     = {Budget-conscious fine-grained configuration optimization for spatio-temporal applications},
  series = {Proceedings of the VLDB Endowment},
  volume    = {15},
  journal   = {Proceedings of the VLDB Endowment},
  number    = {13},
  publisher = {Association for Computing Machinery (ACM)},
  address   = {[New York]},
  issn      = {2150-8097},
  doi       = {10.14778/3565838.3565858},
  pages     = {4079 -- 4092},
  year      = {2022},
  abstract  = {Based on the performance requirements of modern spatio-temporal data mining applications, in-memory database systems are often used to store and process the data. To efficiently utilize the scarce DRAM capacities, modern database systems support various tuning possibilities to reduce the memory footprint (e.g., data compression) or increase performance (e.g., additional indexes). However, the selection of cost and performance balancing configurations is challenging due to the vast number of possible setups consisting of mutually dependent individual decisions. In this paper, we introduce a novel approach to jointly optimize the compression, sorting, indexing, and tiering configuration for spatio-temporal workloads. Further, we consider horizontal data partitioning, which enables the independent application of different tuning options on a fine-grained level. We propose different linear programming (LP) models addressing cost dependencies at different levels of accuracy to compute optimized tuning configurations for a given workload and memory budgets. To yield maintainable and robust configurations, we extend our LP-based approach to incorporate reconfiguration costs as well as a worst-case optimization for potential workload scenarios. Further, we demonstrate on a real-world dataset that our models allow to significantly reduce the memory footprint with equal performance or increase the performance with equal memory size compared to existing tuning heuristics.},
  language  = {en}
}
@article{Boissier2021,
  author    = {Boissier, Martin},
  title     = {Robust and budget-constrained encoding configurations for in-memory database systems},
  series = {Proceedings of the VLDB Endowment},
  volume    = {15},
  journal   = {Proceedings of the VLDB Endowment},
  number    = {4},
  publisher = {Association for Computing Machinery (ACM)},
  address   = {[New York]},
  issn      = {2150-8097},
  doi       = {10.14778/3503585.3503588},
  pages     = {780 -- 793},
  year      = {2021},
  abstract  = {Data encoding has been applied to database systems for decades as it mitigates bandwidth bottlenecks and reduces storage requirements. But even in the presence of these advantages, most in-memory database systems use data encoding only conservatively as the negative impact on runtime performance can be severe. Real-world systems with large parts being infrequently accessed and cost efficiency constraints in cloud environments require solutions that automatically and efficiently select encoding techniques, including heavy-weight compression. In this paper, we introduce workload-driven approaches to automaticaly determine memory budget-constrained encoding configurations using greedy heuristics and linear programming. We show for TPC-H, TPC-DS, and the Join Order Benchmark that optimized encoding configurations can reduce the main memory footprint significantly without a loss in runtime performance over state-of-the-art dictionary encoding. To yield robust selections, we extend the linear programming-based approach to incorporate query runtime constraints and mitigate unexpected performance regressions.},
  language  = {en}
}
@article{VitaglianoJiangNaumann2021,
  author    = {Vitagliano, Gerardo and Jiang, Lan and Naumann, Felix},
  title     = {Detecting layout templates in complex multiregion files},
  series = {Proceedings of the VLDB Endowment},
  volume    = {15},
  journal   = {Proceedings of the VLDB Endowment},
  number    = {3},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  issn      = {2150-8097},
  doi       = {10.14778/3494124.3494145},
  pages     = {646 -- 658},
  year      = {2021},
  abstract  = {Spreadsheets are among the most commonly used file formats for data management, distribution, and analysis. Their widespread employment makes it easy to gather large collections of data, but their flexible canvas-based structure makes automated analysis difficult without heavy preparation. One of the common problems that practitioners face is the presence of multiple, independent regions in a single spreadsheet, possibly separated by repeated empty cells. We define such files as "multiregion" files. In collections of various spreadsheets, we can observe that some share the same layout. We present the Mondrian approach to automatically identify layout templates across multiple files and systematically extract the corresponding regions. Our approach is composed of three phases: first, each file is rendered as an image and inspected for elements that could form regions; then, using a clustering algorithm, the identified elements are grouped to form regions; finally, every file layout is represented as a graph and compared with others to find layout templates. We compare our method to state-of-the-art table recognition algorithms on two corpora of real-world enterprise spreadsheets. Our approach shows the best performances in detecting reliable region boundaries within each file and can correctly identify recurring layouts across files.},
  language  = {en}
}
@article{GhahremaniGiese2020,
  author    = {Ghahremani, Sona and Giese, Holger},
  title     = {Evaluation of self-healing systems},
  series = {Computers},
  volume    = {9},
  journal   = {Computers},
  number    = {1},
  publisher = {MDPI},
  address   = {Basel},
  issn      = {2073-431X},
  doi       = {10.3390/computers9010016},
  pages     = {32},
  year      = {2020},
  abstract  = {Evaluating the performance of self-adaptive systems is challenging due to their interactions with often highly dynamic environments. In the specific case of self-healing systems, the performance evaluations of self-healing approaches and their parameter tuning rely on the considered characteristics of failure occurrences and the resulting interactions with the self-healing actions. In this paper, we first study the state-of-the-art for evaluating the performances of self-healing systems by means of a systematic literature review. We provide a classification of different input types for such systems and analyse the limitations of each input type. A main finding is that the employed inputs are often not sophisticated regarding the considered characteristics for failure occurrences. To further study the impact of the identified limitations, we present experiments demonstrating that wrong assumptions regarding the characteristics of the failure occurrences can result in large performance prediction errors, disadvantageous design-time decisions concerning the selection of alternative self-healing approaches, and disadvantageous deployment-time decisions concerning parameter tuning. Furthermore, the experiments indicate that employing multiple alternative input characteristics can help with reducing the risk of premature disadvantageous design-time decisions.},
  language  = {en}
}
@article{LamprechtMargariaSteffen2014,
  author    = {Lamprecht, Anna-Lena and Margaria, Tiziana and Steffen, Bernhard},
  title     = {Modeling and Execution of Scientific Workflows with the jABC Framework},
  series = {Process Design for Natural Scientists: an agile model-driven approach},
  journal   = {Process Design for Natural Scientists: an agile model-driven approach},
  number    = {500},
  editor    = {Lambrecht, Anna-Lena and Margaria, Tiziana},
  publisher = {Springer Verlag},
  address   = {Berlin},
  isbn      = {978-3-662-45005-5},
  issn      = {1865-0929},
  pages     = {14 -- 29},
  year      = {2014},
  abstract  = {We summarize here the main characteristics and features of the jABC framework, used in the case studies as a graphical tool for modeling scientific processes and workflows. As a comprehensive environment for service-oriented modeling and design according to the XMDD (eXtreme Model-Driven Design) paradigm, the jABC offers much more than the pure modeling capability. Associated technologies and plugins provide in fact means for a rich variety of supporting functionality, such as remote service integration, taxonomical service classification, model execution, model verification, model synthesis, and model compilation. We describe here in short both the essential jABC features and the service integration philosophy followed in the environment. In our work over the last years we have seen that this kind of service definition and provisioning platform has the potential to become a core technology in interdisciplinary service orchestration and technology transfer: Domain experts, like scientists not specially trained in computer science, directly define complex service orchestrations as process models and use efficient and complex domain-specific tools in a simple and intuitive way.},
  language  = {en}
}
@article{LamprechtMargaria2014,
  author    = {Lamprecht, Anna-Lena and Margaria, Tiziana},
  title     = {Scientific Workflows and XMDD},
  series = {Process Design for Natural Scientists: an agile model-driven approach},
  journal   = {Process Design for Natural Scientists: an agile model-driven approach},
  number    = {500},
  editor    = {Lambrecht, Anna-Lena and Margaria, Tiziana},
  publisher = {Springer Verlag},
  address   = {Berlin},
  isbn      = {978-3-662-45005-5},
  issn      = {1865-0929},
  pages     = {1 -- 13},
  year      = {2014},
  abstract  = {A major part of the scientific experiments that are carried out today requires thorough computational support. While database and algorithm providers face the problem of bundling resources to create and sustain powerful computation nodes, the users have to deal with combining sets of (remote) services into specific data analysis and transformation processes. Today's attention to "big data" amplifies the issues of size, heterogeneity, and process-level diversity/integration. In the last decade, especially workflow-based approaches to deal with these processes have enjoyed great popularity. This book concerns a particularly agile and model-driven approach to manage scientific workflows that is based on the XMDD paradigm. In this chapter we explain the scope and purpose of the book, briefly describe the concepts and technologies of the XMDD paradigm, explain the principal differences to related approaches, and outline the structure of the book.},
  language  = {en}
}
@article{LamprechtWickertMargaria2014,
  author    = {Lamprecht, Anna-Lena and Wickert, Alexander and Margaria, Tiziana},
  title     = {Lessons Learned},
  series = {Process Design for Natural Scientists: an agile model-driven approach},
  journal   = {Process Design for Natural Scientists: an agile model-driven approach},
  number    = {500},
  editor    = {Lambrecht, Anna-Lena and Margaria, Tiziana},
  publisher = {Springer Verlag},
  address   = {Berlin},
  isbn      = {978-3-662-45005-5},
  issn      = {1865-0929},
  pages     = {45 -- 64},
  year      = {2014},
  abstract  = {This chapter summarizes the experience and the lessons we learned concerning the application of the jABC as a framework for design and execution of scientific workflows. It reports experiences from the domain modeling (especially service integration) and workflow design phases and evaluates the resulting models statistically with respect to the SIB library and hierarchy levels.},
  language  = {en}
}
@article{LamprechtWickert2014,
  author    = {Lamprecht, Anna-Lena and Wickert, Alexander},
  title     = {The Course's SIB Libraries},
  series = {Process Design for Natural Scientists: an agile model-driven approach},
  journal   = {Process Design for Natural Scientists: an agile model-driven approach},
  number    = {500},
  editor    = {Lambrecht, Anna-Lena and Margaria, Tiziana},
  publisher = {Springer Verlag},
  address   = {Berlin},
  isbn      = {978-3-662-45005-5},
  issn      = {1865-0929},
  pages     = {30 -- 44},
  year      = {2014},
  abstract  = {This chapter gives a detailed description of the service framework underlying all the example projects that form the foundation of this book. It describes the different SIB libraries that we made available for the course "Process modeling in the natural sciences" to provide the functionality that was required for the envisaged applications. The students used these SIB libraries to realize their projects.},
  language  = {en}
}
@article{LamprechtMargaria2015,
  author    = {Lamprecht, Anna-Lena and Margaria, Tiziana},
  title     = {Scientific workflows and XMDD},
  series = {Process design for natural scientists},
  journal   = {Process design for natural scientists},
  editor    = {Lamprecht, Anna-Lena and Margaria, Tiziana},
  publisher = {Springer},
  address   = {Berlin},
  isbn      = {978-3-662-45006-2},
  pages     = {1 -- 13},
  year      = {2015},
  language  = {en}
}
@inproceedings{RojahnGronau2023,
  author    = {Rojahn, Marcel and Gronau, Norbert},
  title     = {Digital platform concepts for manufacturing companies},
  series = {10th International Conference on Future Internet of Things and Cloud (FiCloud)},
  booktitle = {10th International Conference on Future Internet of Things and Cloud (FiCloud)},
  publisher = {IEEE},
  address   = {[Erscheinungsort nicht ermittelbar]},
  isbn      = {979-8-3503-1635-3},
  doi       = {10.1109/FiCloud58648.2023.00030},
  pages     = {149 -- 158},
  year      = {2023},
  abstract  = {Digital Platforms (DPs) has established themself in recent years as a central concept of the Information Technology Science. Due to the great diversity of digital platform concepts, clear definitions are still required. Furthermore, DPs are subject to dynamic changes from internal and external factors, which pose challenges for digital platform operators, developers and customers. Which current digital platform research directions should be taken to address these challenges remains open so far. The following paper aims to contribute to this by outlining a systematic literature review (SLR) on digital platform concepts in the context of the Industrial Internet of Things (IIoT) for manufacturing companies and provides a basis for (1) a selection of definitions of current digital platform and ecosystem concepts and (2) a selection of current digital platform research directions. These directions are diverted into (a) occurrence of digital platforms, (b) emergence of digital platforms, (c) evaluation of digital platforms, (d) development of digital platforms, and (e) selection of digital platforms.},
  language  = {en}
}
@article{deWiljesPathirajaReich2020,
  author    = {de Wiljes, Jana and Pathiraja, Sahani Darschika and Reich, Sebastian},
  title     = {Ensemble transform algorithms for nonlinear smoothing problems},
  series = {SIAM journal on scientific computing},
  volume    = {42},
  journal   = {SIAM journal on scientific computing},
  number    = {1},
  publisher = {Society for Industrial and Applied Mathematics},
  address   = {Philadelphia},
  issn      = {1064-8275},
  doi       = {10.1137/19M1239544},
  pages     = {A87 -- A114},
  year      = {2020},
  abstract  = {Several numerical tools designed to overcome the challenges of smoothing in a non-linear and non-Gaussian setting are investigated for a class of particle smoothers. The considered family of smoothers is induced by the class of linear ensemble transform filters which contains classical filters such as the stochastic ensemble Kalman filter, the ensemble square root filter, and the recently introduced nonlinear ensemble transform filter. Further the ensemble transform particle smoother is introduced and particularly highlighted as it is consistent in the particle limit and does not require assumptions with respect to the family of the posterior distribution. The linear update pattern of the considered class of linear ensemble transform smoothers allows one to implement important supplementary techniques such as adaptive spread corrections, hybrid formulations, and localization in order to facilitate their application to complex estimation problems. These additional features are derived and numerically investigated for a sequence of increasingly challenging test problems.},
  language  = {en}
}
@article{MarxStieglitzBruenkeretal.2023,
  author    = {Marx, Julian and Stieglitz, Stefan and Br{\"u}nker, Felix and Mirbabaie, Milad},
  title     = {Home (office) is where your heart is},
  series = {Business \& information systems engineering},
  volume    = {65},
  journal   = {Business \& information systems engineering},
  number    = {3},
  publisher = {Springer Gabler},
  address   = {Wiesbaden},
  issn      = {2363-7005},
  doi       = {10.1007/s12599-023-00807-w},
  pages     = {293 -- 308},
  year      = {2023},
  abstract  = {Working conditions of knowledge workers have been subject to rapid change recently. Digital nomadism is no longer a phenomenon that relates only to entrepreneurs, freelancers, and gig workers. Corporate employees, too, have begun to uncouple their work from stationary (home) offices and 9-to-5 schedules. However, pursuing a permanent job in a corporate environment is still subject to fundamentally different values than postulated by the original notion of digital nomadism. Therefore, this paper explores the work identity of what is referred to as 'corporate nomads'. By drawing on identity theory and the results of semi-structured interviews, the paper proposes a conceptualization of the corporate nomad archetype and presents nine salient identity issues of corporate nomads (e.g., holding multiple contradictory identities, the flexibility paradox, or collaboration constraints). By introducing the 'corporate nomad' archetype to the Information Systems literature, this article helps to rethink established conceptions of "home office" and socio-spatial configurations of knowledge work.},
  language  = {en}
}
@article{HofeditzMirbabaieOrtmann2023,
  author    = {Hofeditz, Lennart and Mirbabaie, Milad and Ortmann, Mara},
  title     = {Ethical challenges for human-agent interaction in virtual collaboration at work},
  series = {International journal of human computer interaction},
  journal   = {International journal of human computer interaction},
  publisher = {Taylor \& Francis},
  address   = {New York, NY},
  issn      = {1044-7318},
  doi       = {10.1080/10447318.2023.2279400},
  pages     = {17},
  year      = {2023},
  abstract  = {In virtual collaboration at the workplace, a growing number of teams apply supportive conversational agents (CAs). They take on different work-related tasks for teams and single users such as scheduling meetings or stimulating creativity. Previous research merely focused on these positive aspects of introducing CAs at the workplace, omitting ethical challenges faced by teams using these often artificial intelligence (AI)-enabled technologies. Thus, on the one hand, CAs can present themselves as benevolent teammates, but on the other hand, they can collect user data, reduce worker autonomy, or foster social isolation by their service. In this work, we conducted 15 expert interviews with senior researchers from the fields of ethics, collaboration, and computer science in order to derive ethical guidelines for introducing CAs in virtual team collaboration. We derived 14 guidelines and seven research questions to pave the way for future research on the dark sides of human-agent interaction in organizations.},
  language  = {en}
}
@article{BruenkerMarxMirbabaieetal.2023,
  author    = {Br{\"u}nker, Felix and Marx, Julian and Mirbabaie, Milad and Stieglitz, Stefan},
  title     = {Proactive digital workplace transformation},
  series = {Journal of information technology},
  journal   = {Journal of information technology},
  publisher = {Sage Publishing},
  address   = {London},
  issn      = {0268-3962},
  doi       = {10.1177/02683962231219516},
  pages     = {19},
  year      = {2023},
  abstract  = {Digital transformation fundamentally changes the way individuals conduct work in organisations. In accordance with this statement, prevalent literature understands digital workplace transformation as a second-order effect of implementing new information technology to increase organisational effectiveness or reach other strategic goals. This paper, in contrast, provides empirical evidence from two remote-first organisations that undergo a proactive rather than reactive digital workplace transformation. The analysis of these cases suggests that new ways of working can be the consequence of an identity change that is a precondition for introducing new information technology rather than its outcome. The resulting process model contributes a competing argument to the existing debate in digital transformation literature. Instead of issuing digital workplace transformation as a deliverable of technological progress and strategic goals, this paper supports a notion of digital workplace transformation that serves a desired identity based on work preferences.},
  language  = {en}
}
@article{RuedianVladova2021,
  author    = {R{\"u}dian, Sylvio Leo and Vladova, Gergana},
  title     = {Kostenfreie Onlinekurse nachhaltig mit personalisiertem Marketing finanzieren},
  series = {HMD Praxis der Wirtschaftsinformatik},
  volume    = {58},
  journal   = {HMD Praxis der Wirtschaftsinformatik},
  number    = {3},
  publisher = {Springer Vieweg},
  address   = {Wiesbaden},
  issn      = {1436-3011},
  doi       = {10.1365/s40702-021-00720-4},
  pages     = {507 -- 520},
  year      = {2021},
  abstract  = {Selbstbestimmtes Lernen mit Onlinekursen findet zunehmend mehr Akzeptanz in unserer Gesellschaft. Lernende k{\"o}nnen mithilfe von Onlinekursen selbst festlegen, was sie wann lernen und Kurse k{\"o}nnen durch vielf{\"a}ltige Adaptionen an den Lernfortschritt der Nutzer angepasst und individualisiert werden. Auf der einen Seite ist eine große Zielgruppe f{\"u}r diese Lernangebote vorhanden. Auf der anderen Seite sind die Erstellung von Onlinekursen, ihre Bereitstellung, Wartung und Betreuung kostenintensiv, wodurch hochwertige Angebote h{\"a}ufig kostenpflichtig angeboten werden m{\"u}ssen, um als Anbieter zumindest kostenneutral agieren zu k{\"o}nnen. In diesem Beitrag er{\"o}rtern und diskutieren wir ein offenes, nachhaltiges datengetriebenes zweiseitiges Gesch{\"a}ftsmodell zur Verwertung gepr{\"u}fter Onlinekurse und deren kostenfreie Bereitstellung f{\"u}r jeden Lernenden. Kern des Gesch{\"a}ftsmodells ist die Nutzung der dabei entstehenden Verhaltensdaten, die daraus m{\"o}gliche Ableitung von Pers{\"o}nlichkeitsmerkmalen und Interessen und deren Nutzung im kommerziellen Kontext. Dies ist eine bei der Websuche bereits weitl{\"a}ufig akzeptierte Methode, welche nun auf den Lernkontext {\"u}bertragen wird. Welche M{\"o}glichkeiten, Herausforderungen, aber auch Barrieren {\"u}berwunden werden m{\"u}ssen, damit das Gesch{\"a}ftsmodell nachhaltig und ethisch vertretbar funktioniert, werden zwei unabh{\"a}ngige, jedoch synergetisch verbundene Gesch{\"a}ftsmodelle vorgestellt und diskutiert. Zus{\"a}tzlich wurde die Akzeptanz und Erwartung der Zielgruppe f{\"u}r das vorgestellte Gesch{\"a}ftsmodell untersucht, um notwendige Kernressourcen f{\"u}r die Praxis abzuleiten. Die Ergebnisse der Untersuchung zeigen, dass das Gesch{\"a}ftsmodell von den Nutzer*innen grundlegend akzeptiert wird. 10 \% der Befragten w{\"u}rden es bevorzugen, mit virtuellen Assistenten - anstelle mit Tutor*innen zu lernen. Zudem ist der Großteil der Nutzer*innen sich nicht dar{\"u}ber bewusst, dass Pers{\"o}nlichkeitsmerkmale anhand des Nutzerverhaltens abgeleitet werden k{\"o}nnen.},
  language  = {de}
}
@article{StudenTiberius2020,
  author    = {Studen, Laura and Tiberius, Victor},
  title     = {Social Media, Quo Vadis?},
  series = {Future Internet},
  volume    = {12},
  journal   = {Future Internet},
  number    = {9},
  publisher = {MDPI},
  address   = {Basel},
  issn      = {1999-5903},
  doi       = {10.3390/fi12090146},
  pages     = {22},
  year      = {2020},
  abstract  = {Over the past two decades, social media have become a crucial and omnipresent cultural and economic phenomenon, which has seen platforms come and go and advance technologically. In this study, we explore the further development of social media regarding interactive technologies, platform development, relationships to news media, the activities of institutional and organizational users, and effects of social media on the individual and the society over the next five to ten years by conducting an international, two-stage Delphi study. Our results show that enhanced interaction on platforms, including virtual and augmented reality, somatosensory sense, and touch- and movement-based navigation are expected. AIs will interact with other social media users. Inactive user profiles will outnumber active ones. Platform providers will diversify into the WWW, e-commerce, edu-tech, fintechs, the automobile industry, and HR. They will change to a freemium business model and put more effort into combating cybercrime. Social media will become the predominant news distributor, but fake news will still be problematic. Firms will spend greater amounts of their budgets on social media advertising, and schools, politicians, and the medical sector will increase their social media engagement. Social media use will increasingly lead to individuals' psychic issues. Society will benefit from economic growth and new jobs, increased political interest, democratic progress, and education due to social media. However, censorship and the energy consumption of platform operators might rise.},
  language  = {en}
}
@article{vonSteinauSteinrueckBruhn2021,
  author    = {von Steinau-Steinr{\"u}ck, Robert and Bruhn, Emma},
  title     = {Der Impfmuffel im Arbeitsrecht},
  series = {NJW spezial},
  volume    = {18},
  journal   = {NJW spezial},
  number    = {16},
  publisher = {C.H. Beck},
  address   = {M{\"u}nchen},
  issn      = {1613-4621},
  pages     = {498 -- 499},
  year      = {2021},
  abstract  = {Trotz erfolgreicher Impfkampagne droht nach dem Sommer eine vierte Infektionswelle der Corona-Pandemie. Ob es dazu kommen wird, h{\"a}ngt maßgeblich davon ab, wie viele Menschen sich f{\"u}r eine Corona-Schutzimpfung entscheiden. Am Impfstoff mangelt es nicht mehr, daf{\"u}r an der Impfbereitschaft. Viele Arbeitgeber fragen sich daher, was sie unternehmen k{\"o}nnen, um die Impfquote in ihren Betrieben zu erh{\"o}hen.},
  language  = {de}
}
@article{BlaesiusFriedrichLischeidetal.2022,
  author    = {Bl{\"a}sius, Thomas and Friedrich, Tobias and Lischeid, Julius and Meeks, Kitty and Schirneck, Friedrich Martin},
  title     = {Efficiently enumerating hitting sets of hypergraphs arising in data profiling},
  series = {Journal of computer and system sciences : JCSS},
  volume    = {124},
  journal   = {Journal of computer and system sciences : JCSS},
  publisher = {Elsevier},
  address   = {San Diego},
  issn      = {0022-0000},
  doi       = {10.1016/j.jcss.2021.10.002},
  pages     = {192 -- 213},
  year      = {2022},
  abstract  = {The transversal hypergraph problem asks to enumerate the minimal hitting sets of a hypergraph. If the solutions have bounded size, Eiter and Gottlob [SICOMP'95] gave an algorithm running in output-polynomial time, but whose space requirement also scales with the output. We improve this to polynomial delay and space. Central to our approach is the extension problem, deciding for a set X of vertices whether it is contained in any minimal hitting set. We show that this is one of the first natural problems to be W[3]-complete. We give an algorithm for the extension problem running in time O(m(vertical bar X vertical bar+1) n) and prove a SETH-lower bound showing that this is close to optimal. We apply our enumeration method to the discovery problem of minimal unique column combinations from data profiling. Our empirical evaluation suggests that the algorithm outperforms its worst-case guarantees on hypergraphs stemming from real-world databases.},
  language  = {en}
}
@article{vonSteinauSteinrueckKurth2022,
  author    = {von Steinau-Steinr{\"u}ck, Robert and Kurth, Paula Sophie},
  title     = {Das reformierte Statusfeststellungsverfahren in der Praxis},
  series = {NJW spezial},
  volume    = {19},
  journal   = {NJW spezial},
  number    = {24},
  publisher = {C.H. Beck},
  address   = {M{\"u}nchen},
  issn      = {1613-4621},
  pages     = {754 -- 755},
  year      = {2022},
  abstract  = {Das Statusfeststellungsverfahren erm{\"o}glicht auf Antrag bei der alleinzust{\"a}ndigen Deutschen Rentenversicherung Bund den Erhalt einer verbindlichen Einsch{\"a}tzung der h{\"a}ufig komplizierten und folgenschweren Abgrenzung einer selbstst{\"a}ndigen T{\"a}tigkeit von einer abh{\"a}ngigen Besch{\"a}ftigung. Zum 1.4.2022 wurde das Statusfeststellungsverfahren umfassend reformiert. In der Praxis haben sich die eingef{\"u}hrten Novellierungen bislang unterschiedlich bew{\"a}hrt.},
  language  = {de}
}
@article{vonSteinauSteinrueckSura2023,
  author    = {von Steinau-Steinr{\"u}ck, Robert and Sura, Stephan},
  title     = {Die (Rest-)Zul{\"a}ssigkeit von Verboten religi{\"o}ser Zeichen am Arbeitsplatz},
  series = {NJW spezial},
  volume    = {20},
  journal   = {NJW spezial},
  number    = {8},
  publisher = {C.H. Beck},
  address   = {M{\"u}nchen},
  issn      = {1613-4621},
  pages     = {242 -- 243},
  year      = {2023},
  abstract  = {In einer Reihe von Urteilen hat der EuGH seit 2017 die Zul{\"a}ssigkeit von Verboten religi{\"o}ser Zeichen und Kleidung am Arbeitsplatz bewertet. Obwohl die Einordnungen des Gerichtshofs der deutschen Rechtslage zun{\"a}chst diametral entgegenstanden, hat sich diese letztlich nicht ver{\"a}ndert.},
  language  = {de}
}
@article{vonSteinauSteinrueckMiller2022,
  author    = {von Steinau-Steinr{\"u}ck, Robert and Miller, Denis},
  title     = {R{\"u}ckzahlungsklauseln f{\"u}r Fortbildungen},
  series = {Neue juristische Wochenschrift : NJW Spezial},
  volume    = {19},
  journal   = {Neue juristische Wochenschrift : NJW Spezial},
  number    = {12},
  publisher = {C.H. Beck},
  address   = {M{\"u}nchen},
  issn      = {1613-4621},
  pages     = {370 -- 371},
  year      = {2022},
  abstract  = {Mit Urteil vom 1.3.2022 (NZA2022, NZA Jahr 2022 Seite 780) hat das BAG erneut {\"u}ber die Wirksamkeit einer R{\"u}ckzahlungsklausel in einer Fortbildungsvereinbarung entschieden. Die Entscheidung reiht sich in eine nicht leicht zu durchschauende Anzahl von Urteilen hierzu ein. Sie dient uns zum Anlass, einen {\"U}berblick {\"u}ber die Rechtsprechung zu geben.},
  language  = {de}
}
@article{vonSteinauSteinrueckJoeris2021,
  author    = {von Steinau-Steinr{\"u}ck, Robert and J{\"o}ris, Nils},
  title     = {Brexit-Arbeitsrecht und die Folgen},
  series = {NJW spezial},
  volume    = {18},
  journal   = {NJW spezial},
  number    = {8},
  publisher = {C.H. Beck},
  address   = {M{\"u}nchen},
  issn      = {1613-4621},
  pages     = {242 -- 243},
  year      = {2021},
  abstract  = {Die Corona-Pandemie hat den Brexit ein wenig in den Hintergrund gedr{\"a}ngt. Dabei hat er gerade im Arbeitsrecht ganz erhebliche Auswirkungen. {\"U}ber sie geben wir einen {\"U}berblick.},
  language  = {de}
}
@article{vonSteinauSteinrueckHoeltge2022,
  author    = {von Steinau-Steinr{\"u}ck, Robert and H{\"o}ltge, Clara},
  title     = {Krieg in Europa},
  series = {NJW spezial},
  volume    = {19},
  journal   = {NJW spezial},
  number    = {8},
  publisher = {C.H. Beck},
  address   = {M{\"u}nchen},
  issn      = {1613-4621},
  pages     = {242 -- 243},
  year      = {2022},
  abstract  = {Am 24.2.2022 begann der russische Angriffskrieg in der Ukraine. Seitdem fliehen t{\"a}glich zahlreiche ukrainische Staatsb{\"u}rger in die Europ{\"a}ische Union, viele davon nach Deutschland. Vorrangig ist jetzt die Sicherung der Grundbed{\"u}rfnisse, wie Verpflegung, Unterkunft und medizinischer Versorgung. Daneben fragen sich Arbeitgeber, wie sie ukrainische Staatsb{\"u}rger m{\"o}glichst schnell besch{\"a}ftigen k{\"o}nnen. Wir geben einen {\"U}berblick {\"u}ber die M{\"o}glichkeiten, ukrainische Gefl{\"u}chtete m{\"o}glichst schnell in den deutschen Arbeitsmarkt zu integrieren.},
  language  = {de}
}
@article{vonSteinauSteinrueckBeismann2020,
  author    = {von Steinau-Steinr{\"u}ck, Robert and Beismann, Lukas},
  title     = {(Corona-)Homeoffice und betriebliche {\"U}bung},
  series = {NJW spezial},
  volume    = {17},
  journal   = {NJW spezial},
  number    = {20},
  publisher = {C.H. Beck},
  address   = {M{\"u}nchen},
  issn      = {1613-4621},
  pages     = {626 -- 627},
  year      = {2020},
  abstract  = {Homeoffice und mobiles Arbeiten haben sich infolge der Covid-19-Pandemie bei vielen Unternehmen bekanntlich etabliert. Die Anweisung bzw. „Duldung" des Homeoffice beruhte allerdings meist mehr auf tats{\"a}chlicher als auf rechtlicher Grundlage. Letztere k{\"o}nnte aber aus betrieblicher {\"U}bung erwachsen. Dieser Beitrag geht dem rechtlichen Rahmen daf{\"u}r nach.},
  language  = {de}
}
@article{vonSteinauSteinrueck2021,
  author    = {von Steinau-Steinr{\"u}ck, Robert},
  title     = {Was ist bei "Workation" und "Bleisure" rechtlich zu beachten?},
  series = {NJW spezial},
  volume    = {18},
  journal   = {NJW spezial},
  number    = {20},
  publisher = {C.H. Beck},
  address   = {M{\"u}nchen},
  issn      = {1613-4621},
  pages     = {626 -- 627},
  year      = {2021},
  abstract  = {Die Digitalisierung unseres Lebens l{\"o}st die Grenzen zwischen Privat- und Berufsleben immer weiter auf. Bekanntes Beispiel ist das Homeoffice. Arbeitgeber begegnen aber auch zahlreichen weiteren Trends in diesem Zusammenhang. Dazu geh{\"o}ren „workation", also die Verbindung zwischen Arbeit („work") und Urlaub („vacation") ebenso wie „bleisure", dh die Verbindung von Dienstreisen („business") und Urlaub („leisure"). Der Beitrag geht den rechtlichen Rahmenbedingungen hierf{\"u}r nach.},
  language  = {de}
}
@article{vonSteinauSteinrueckJoeris2020,
  author    = {von Steinau-Steinr{\"u}ck, Robert and J{\"o}ris, Nils},
  title     = {Arbeitsschutz bei Corona},
  series = {NJW spezial},
  volume    = {17},
  journal   = {NJW spezial},
  number    = {12},
  publisher = {C.H. Beck},
  address   = {M{\"u}nchen},
  issn      = {1613-4621},
  pages     = {370 -- 371},
  year      = {2020},
  abstract  = {Den {\"U}berblick im Arbeitsschutzrecht zu behalten, ist schwierig. Der Arbeitsschutz spielt sich in unterschiedlichen Bereichen und auf verschiedenen Ebenen ab. Außerdem sind die einschl{\"a}gigen Rechtsnormen {\"u}beraus ver{\"a}stelt. Der folgende Beitrag soll daher zur Entwirrung beitragen.},
  language  = {de}
}
@misc{vonSteinauSteinrueck2020,
  author    = {von Steinau-Steinr{\"u}ck, Robert},
  title     = {Gesetzesentwurf zu Corona-bedingten {\"A}nderungen des ArbGG/SGG},
  series = {NJW spezial},
  volume    = {17},
  journal   = {NJW spezial},
  number    = {11},
  publisher = {C.H. Beck},
  address   = {M{\"u}nchen},
  issn      = {1613-4621},
  pages     = {340 -- 340},
  year      = {2020},
  language  = {de}
}
@misc{vonSteinauSteinrueck2020,
  author    = {von Steinau-Steinr{\"u}ck, Robert},
  title     = {Koalitionsausschuss beschließt Verl{\"a}ngerung des Kurzarbeitergelds},
  series = {NJW spezial},
  volume    = {17},
  journal   = {NJW spezial},
  number    = {19},
  publisher = {C.H. Beck},
  address   = {M{\"u}nchen},
  issn      = {1613-4621},
  pages     = {596 -- 596},
  year      = {2020},
  language  = {de}
}
@misc{HesseMatthiesSinzigetal.2019,
  author    = {Hesse, G{\"u}nter and Matthies, Christoph and Sinzig, Werner and Uflacker, Matthias},
  title     = {Adding Value by Combining Business and Sensor Data},
  series = {Database Systems for Advanced Applications},
  volume    = {11448},
  journal   = {Database Systems for Advanced Applications},
  publisher = {Springer},
  address   = {Cham},
  isbn      = {978-3-030-18590-9},
  issn      = {0302-9743},
  doi       = {10.1007/978-3-030-18590-9_80},
  pages     = {528 -- 532},
  year      = {2019},
  abstract  = {Industry 4.0 and the Internet of Things are recent developments that have lead to the creation of new kinds of manufacturing data. Linking this new kind of sensor data to traditional business information is crucial for enterprises to take advantage of the data's full potential. In this paper, we present a demo which allows experiencing this data integration, both vertically between technical and business contexts and horizontally along the value chain. The tool simulates a manufacturing company, continuously producing both business and sensor data, and supports issuing ad-hoc queries that answer specific questions related to the business. In order to adapt to different environments, users can configure sensor characteristics to their needs.},
  language  = {en}
}
@article{WangYangMeinel2018,
  author    = {Wang, Cheng and Yang, Haojin and Meinel, Christoph},
  title     = {Image Captioning with Deep Bidirectional LSTMs and Multi-Task Learning},
  series = {ACM transactions on multimedia computing, communications, and applications},
  volume    = {14},
  journal   = {ACM transactions on multimedia computing, communications, and applications},
  number    = {2},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  issn      = {1551-6857},
  doi       = {10.1145/3115432},
  pages     = {20},
  year      = {2018},
  abstract  = {Generating a novel and descriptive caption of an image is drawing increasing interests in computer vision, natural language processing, and multimedia communities. In this work, we propose an end-to-end trainable deep bidirectional LSTM (Bi-LSTM (Long Short-Term Memory)) model to address the problem. By combining a deep convolutional neural network (CNN) and two separate LSTM networks, our model is capable of learning long-term visual-language interactions by making use of history and future context information at high-level semantic space. We also explore deep multimodal bidirectional models, in which we increase the depth of nonlinearity transition in different ways to learn hierarchical visual-language embeddings. Data augmentation techniques such as multi-crop, multi-scale, and vertical mirror are proposed to prevent over-fitting in training deep models. To understand how our models "translate" image to sentence, we visualize and qualitatively analyze the evolution of Bi-LSTM internal states over time. The effectiveness and generality of proposed models are evaluated on four benchmark datasets: Flickr8K, Flickr30K, MSCOCO, and Pascal1K datasets. We demonstrate that Bi-LSTM models achieve highly competitive performance on both caption generation and image-sentence retrieval even without integrating an additional mechanism (e.g., object detection, attention model). Our experiments also prove that multi-task learning is beneficial to increase model generality and gain performance. We also demonstrate the performance of transfer learning of the Bi-LSTM model significantly outperforms previous methods on the Pascal1K dataset.},
  language  = {en}
}
@inproceedings{GruenerMuehleGayvoronskayaetal.2019,
  author    = {Gr{\"u}ner, Andreas and M{\"u}hle, Alexander and Gayvoronskaya, Tatiana and Meinel, Christoph},
  title     = {A quantifiable trustmModel for Blockchain-based identity management},
  series = {IEEE 2018 International Congress on Cybermatics / 2018 IEEE Conferences on Internet of Things, Green Computing and Communications, cyber, physical and Social Computing, Smart Data, Blockchain, Computer and Information Technology},
  booktitle = {IEEE 2018 International Congress on Cybermatics / 2018 IEEE Conferences on Internet of Things, Green Computing and Communications, cyber, physical and Social Computing, Smart Data, Blockchain, Computer and Information Technology},
  publisher = {IEEE},
  address   = {New York},
  isbn      = {978-1-5386-7975-3},
  doi       = {10.1109/Cybermatics_2018.2018.00250},
  pages     = {1475 -- 1482},
  year      = {2019},
  language  = {en}
}
@article{ChujfiLaRocheMeinel2017,
  author    = {Chujfi-La-Roche, Salim and Meinel, Christoph},
  title     = {Matching cognitively sympathetic individual styles to develop collective intelligence in digital communities},
  series = {AI \& society : the journal of human-centred systems and machine intelligence},
  volume    = {35},
  journal   = {AI \& society : the journal of human-centred systems and machine intelligence},
  number    = {1},
  publisher = {Springer},
  address   = {New York},
  issn      = {0951-5666},
  doi       = {10.1007/s00146-017-0780-x},
  pages     = {5 -- 15},
  year      = {2017},
  abstract  = {Creation, collection and retention of knowledge in digital communities is an activity that currently requires being explicitly targeted as a secure method of keeping intellectual capital growing in the digital era. In particular, we consider it relevant to analyze and evaluate the empathetic cognitive personalities and behaviors that individuals now have with the change from face-to-face communication (F2F) to computer-mediated communication (CMC) online. This document proposes a cyber-humanistic approach to enhance the traditional SECI knowledge management model. A cognitive perception is added to its cyclical process following design thinking interaction, exemplary for improvement of the method in which knowledge is continuously created, converted and shared. In building a cognitive-centered model, we specifically focus on the effective identification and response to cognitive stimulation of individuals, as they are the intellectual generators and multiplicators of knowledge in the online environment. Our target is to identify how geographically distributed-digital-organizations should align the individual's cognitive abilities to promote iteration and improve interaction as a reliable stimulant of collective intelligence. The new model focuses on analyzing the four different stages of knowledge processing, where individuals with sympathetic cognitive personalities can significantly boost knowledge creation in a virtual social system. For organizations, this means that multidisciplinary individuals can maximize their extensive potential, by externalizing their knowledge in the correct stage of the knowledge creation process, and by collaborating with their appropriate sympathetically cognitive remote peers.},
  language  = {en}
}
@article{TorkuraSukmanaChengetal.2020,
  author    = {Torkura, Kennedy A. and Sukmana, Muhammad Ihsan Haikal and Cheng, Feng and Meinel, Christoph},
  title     = {CloudStrike},
  series = {IEEE access : practical research, open solutions},
  volume    = {8},
  journal   = {IEEE access : practical research, open solutions},
  publisher = {Institute of Electrical and Electronics Engineers },
  address   = {Piscataway},
  issn      = {2169-3536},
  doi       = {10.1109/ACCESS.2020.3007338},
  pages     = {123044 -- 123060},
  year      = {2020},
  abstract  = {Most cyber-attacks and data breaches in cloud infrastructure are due to human errors and misconfiguration vulnerabilities. Cloud customer-centric tools are imperative for mitigating these issues, however existing cloud security models are largely unable to tackle these security challenges. Therefore, novel security mechanisms are imperative, we propose Risk-driven Fault Injection (RDFI) techniques to address these challenges. RDFI applies the principles of chaos engineering to cloud security and leverages feedback loops to execute, monitor, analyze and plan security fault injection campaigns, based on a knowledge-base. The knowledge-base consists of fault models designed from secure baselines, cloud security best practices and observations derived during iterative fault injection campaigns. These observations are helpful for identifying vulnerabilities while verifying the correctness of security attributes (integrity, confidentiality and availability). Furthermore, RDFI proactively supports risk analysis and security hardening efforts by sharing security information with security mechanisms. We have designed and implemented the RDFI strategies including various chaos engineering algorithms as a software tool: CloudStrike. Several evaluations have been conducted with CloudStrike against infrastructure deployed on two major public cloud infrastructure: Amazon Web Services and Google Cloud Platform. The time performance linearly increases, proportional to increasing attack rates. Also, the analysis of vulnerabilities detected via security fault injection has been used to harden the security of cloud resources to demonstrate the effectiveness of the security information provided by CloudStrike. Therefore, we opine that our approaches are suitable for overcoming contemporary cloud security issues.},
  language  = {en}
}
@article{GruenerMuehleMeinel2021,
  author    = {Gr{\"u}ner, Andreas and M{\"u}hle, Alexander and Meinel, Christoph},
  title     = {ATIB},
  series = {IEEE access : practical research, open solutions / Institute of Electrical and Electronics Engineers},
  volume    = {9},
  journal   = {IEEE access : practical research, open solutions / Institute of Electrical and Electronics Engineers},
  publisher = {Institute of Electrical and Electronics Engineers},
  address   = {New York, NY},
  issn      = {2169-3536},
  doi       = {10.1109/ACCESS.2021.3116095},
  pages     = {138553 -- 138570},
  year      = {2021},
  abstract  = {Identity management is a principle component of securing online services. In the advancement of traditional identity management patterns, the identity provider remained a Trusted Third Party (TTP). The service provider and the user need to trust a particular identity provider for correct attributes amongst other demands. This paradigm changed with the invention of blockchain-based Self-Sovereign Identity (SSI) solutions that primarily focus on the users. SSI reduces the functional scope of the identity provider to an attribute provider while enabling attribute aggregation. Besides that, the development of new protocols, disregarding established protocols and a significantly fragmented landscape of SSI solutions pose considerable challenges for an adoption by service providers. We propose an Attribute Trust-enhancing Identity Broker (ATIB) to leverage the potential of SSI for trust-enhancing attribute aggregation. Furthermore, ATIB abstracts from a dedicated SSI solution and offers standard protocols. Therefore, it facilitates the adoption by service providers. Despite the brokered integration approach, we show that ATIB provides a high security posture. Additionally, ATIB does not compromise the ten foundational SSI principles for the users.},
  language  = {en}
}
@incollection{CorazzaThienen2023,
  author    = {Corazza, Giovanni Emanuele and Thienen, Julia von},
  title     = {Invention},
  series = {The Palgrave encyclopedia of the possible},
  booktitle = {The Palgrave encyclopedia of the possible},
  editor    = {Glăveanu, Vlad Petre},
  publisher = {Springer International Publishing},
  address   = {Cham},
  isbn      = {978-3-030-90912-3},
  doi       = {10.1007/978-3-030-90913-0_14},
  pages     = {806 -- 814},
  year      = {2023},
  abstract  = {This entry addresses invention from five different perspectives: (i) definition of the term, (ii) mechanisms underlying invention processes, (iii) (pre-)history of human inventions, (iv) intellectual property protection vs open innovation, and (v) case studies of great inventors. Regarding the definition, an invention is the outcome of a creative process taking place within a technological milieu, which is recognized as successful in terms of its effectiveness as an original technology. In the process of invention, a technological possibility becomes realized. Inventions are distinct from either discovery or innovation. In human creative processes, seven mechanisms of invention can be observed, yielding characteristic outcomes: (1) basic inventions, (2) invention branches, (3) invention combinations, (4) invention toolkits, (5) invention exaptations, (6) invention values, and (7) game-changing inventions. The development of humanity has been strongly shaped by inventions ever since early stone tools and the conception of agriculture. An "explosion of creativity" has been associated with Homo sapiens, and inventions in all fields of human endeavor have followed suit, engendering an exponential growth of cumulative culture. This culture development emerges essentially through a reuse of previous inventions, their revision, amendment and rededication. In sociocultural terms, humans have increasingly regulated processes of invention and invention-reuse through concepts such as intellectual property, patents, open innovation and licensing methods. Finally, three case studies of great inventors are considered: Edison, Marconi, and Montessori, next to a discussion of human invention processes as collaborative endeavors.},
  language  = {en}
}
@phdthesis{Schnjakin2014,
  author    = {Schnjakin, Maxim},
  title     = {Cloud-RAID},
  pages     = {137},
  year      = {2014},
  language  = {de}
}
@phdthesis{Wang2016,
  author    = {Wang, Cheng},
  title     = {Deep Learning of Multimodal Representations},
  school      = {Universit{\"a}t Potsdam},
  pages     = {142},
  year      = {2016},
  language  = {en}
}
@phdthesis{Saleh2016,
  author    = {Saleh, Eyad},
  title     = {Securing Multi-tenant SaaS Environments},
  school      = {Universit{\"a}t Potsdam},
  pages     = {108},
  year      = {2016},
  abstract  = {Software-as-a-Service (SaaS) offers several advantages to both service providers and users. Service providers can benefit from the reduction of Total Cost of Ownership (TCO), better scalability, and better resource utilization. On the other hand, users can use the service anywhere and anytime, and minimize upfront investment by following the pay-as-you-go model. Despite the benefits of SaaS, users still have concerns about the security and privacy of their data. Due to the nature of SaaS and the Cloud in general, the data and the computation are beyond the users' control, and hence data security becomes a vital factor in this new paradigm. Furthermore, in multi-tenant SaaS applications, the tenants become more concerned about the confidentiality of their data since several tenants are co-located onto a shared infrastructure. To address those concerns, we start protecting the data from the provisioning process by controlling how tenants are being placed in the infrastructure. We present a resource allocation algorithm designed to minimize the risk of co-resident tenants called SecPlace. It enables the SaaS provider to control the resource (i.e., database instance) allocation process while taking into account the security of tenants as a requirement. Due to the design principles of the multi-tenancy model, tenants follow some degree of sharing on both application and infrastructure levels. Thus, strong security-isolation should be present. Therefore, we develop SignedQuery, a technique that prevents one tenant from accessing others' data. We use the Signing Concept to create a signature that is used to sign the tenant's request, then the server can verifies the signature and recognizes the requesting tenant, and hence ensures that the data to be accessed is belonging to the legitimate tenant. Finally, Data confidentiality remains a critical concern due to the fact that data in the Cloud is out of users' premises, and hence beyond their control. Cryptography is increasingly proposed as a potential approach to address such a challenge. Therefore, we present SecureDB, a system designed to run SQL-based applications over an encrypted database. SecureDB captures the schema design and analyzes it to understand the internal structure of the data (i.e., relationships between the tables and their attributes). Moreover, we determine the appropriate partialhomomorphic encryption scheme for each attribute where computation is possible even when the data is encrypted. To evaluate our work, we conduct extensive experiments with di↵erent settings. The main use case in our work is a popular open source HRM application, called OrangeHRM. The results show that our multi-layered approach is practical, provides enhanced security and isolation among tenants, and have a moderate complexity in terms of processing encrypted data.},
  language  = {en}
}
@phdthesis{SadrAzodi2015,
  author    = {Sadr-Azodi, Amir Shahab},
  title     = {Towards Real-time SIEM-based Network monitoring and Intrusion Detection through Advanced Event Normalization},
  school      = {Universit{\"a}t Potsdam},
  pages     = {144},
  year      = {2015},
  language  = {en}
}
@phdthesis{Malchow2019,
  author    = {Malchow, Martin},
  title     = {Nutzerunterst{\"u}tzung und -Motivation in E-Learning Vorlesungsarchiven und MOOCs},
  school      = {Universit{\"a}t Potsdam},
  pages     = {142},
  year      = {2019},
  abstract  = {In den letzten Jahren ist die Aufnahme und Verbreitung von Videos immer einfacher geworden. Daher sind die Relevanz und Beliebtheit zur Aufnahme von Vorlesungsvideos in den letzten Jahren stark angestiegen. Dies f{\"u}hrt zu einem großen Datenbestand an Vorlesungsvideos in den Video-Vorlesungsarchiven der Universit{\"a}ten. Durch diesen wachsenden Datenbestand wird es allerdings f{\"u}r die Studenten immer schwieriger, die relevanten Videos eines Vorlesungsarchivs aufzufinden. Zus{\"a}tzlich haben viele Lerninteressierte durch ihre allt{\"a}gliche Arbeit und famili{\"a}ren Verpflichtungen immer weniger Zeit sich mit dem Lernen zu besch{\"a}ftigen. Ein weiterer Aspekt, der das Lernen im Internet erschwert, ist, dass es durch soziale Netzwerke und anderen Online-Plattformen vielf{\"a}ltige Ablenkungsm{\"o}glichkeiten gibt. Daher ist das Ziel dieser Arbeit, M{\"o}glichkeiten aufzuzeigen, welche das E-Learning bieten kann, um Nutzer beim Lernprozess zu unterst{\"u}tzen und zu motivieren. Das Hauptkonzept zur Unterst{\"u}tzung der Studenten ist das pr{\"a}zise Auffinden von Informationen in den immer weiter wachsenden Vorlesungsvideoarchiven. Dazu werden die Vorlesungen im Voraus analysiert und die Texte der Vorlesungsfolien mit verschiedenen Methoden indexiert. Daraufhin k{\"o}nnen die Studenten mit der Suche oder dem Lecture-Butler Lerninhalte entsprechend Ihres aktuellen Wissensstandes auffinden. Die m{\"o}glichen verwendeten Technologien f{\"u}r das Auffinden wurden, sowohl technisch, als auch durch Studentenumfragen erfolgreich evaluiert. Zur Motivation von Studenten in Vorlesungsarchiven werden diverse Konzepte betrachtet und die Umsetzung evaluiert, die den Studenten interaktiv in den Lernprozess einbeziehen. Neben Vorlesungsarchiven existieren sowohl im privaten als auch im dienstlichen Weiterbildungsbereich die in den letzten Jahren immer beliebter werdenden MOOCs. Generell sind die Abschlussquoten von MOOCs allerdings mit durchschnittlich 7\% eher gering. Daher werden Motivationsl{\"o}sungen f{\"u}r MOOCs im Bereich von eingebetteten Systemen betrachtet, die in praktischen Programmierkursen Anwendung finden. Zus{\"a}tzlich wurden Kurse evaluiert, welche die Programmierung von eingebetteten Systemen behandeln. Die Verf{\"u}gbarkeit war bei Kursen von bis zu 10.000 eingeschriebenen Teilnehmern hierbei kein schwerwiegendes Problem. Die Verwendung von eingebetteten Systemen in Programmierkursen sind bei den Studenten in der praktischen Umsetzung auf sehr großes Interesse gestoßen.},
  language  = {de}
}
@article{BinTareafBergerHennigetal.2020,
  author    = {Bin Tareaf, Raad and Berger, Philipp and Hennig, Patrick and Meinel, Christoph},
  title     = {Cross-platform personality exploration system for online social networks},
  series = {Web intelligence},
  volume    = {18},
  journal   = {Web intelligence},
  number    = {1},
  publisher = {IOS Press},
  address   = {Amsterdam},
  issn      = {2405-6456},
  doi       = {10.3233/WEB-200427},
  pages     = {35 -- 51},
  year      = {2020},
  abstract  = {Social networking sites (SNS) are a rich source of latent information about individual characteristics. Crawling and analyzing this content provides a new approach for enterprises to personalize services and put forward product recommendations. In the past few years, commercial brands made a gradual appearance on social media platforms for advertisement, customers support and public relation purposes and by now it became a necessity throughout all branches. This online identity can be represented as a brand personality that reflects how a brand is perceived by its customers. We exploited recent research in text analysis and personality detection to build an automatic brand personality prediction model on top of the (Five-Factor Model) and (Linguistic Inquiry and Word Count) features extracted from publicly available benchmarks. Predictive evaluation on brands' accounts reveals that Facebook platform provides a slight advantage over Twitter platform in offering more self-disclosure for users' to express their emotions especially their demographic and psychological traits. Results also confirm the wider perspective that the same social media account carry a quite similar and comparable personality scores over different social media platforms. For evaluating our prediction results on actual brands' accounts, we crawled the Facebook API and Twitter API respectively for 100k posts from the most valuable brands' pages in the USA and we visualize exemplars of comparison results and present suggestions for future directions.},
  language  = {en}
}
@article{Perscheid2021,
  author    = {Perscheid, Cindy},
  title     = {Integrative biomarker detection on high-dimensional gene expression data sets},
  series = {Briefings in bioinformatics},
  volume    = {22},
  journal   = {Briefings in bioinformatics},
  number    = {3},
  publisher = {Oxford Univ. Press},
  address   = {Oxford},
  issn      = {1467-5463},
  doi       = {10.1093/bib/bbaa151},
  pages     = {18},
  year      = {2021},
  abstract  = {Gene expression data provide the expression levels of tens of thousands of genes from several hundred samples. These data are analyzed to detect biomarkers that can be of prognostic or diagnostic use. Traditionally, biomarker detection for gene expression data is the task of gene selection. The vast number of genes is reduced to a few relevant ones that achieve the best performance for the respective use case. Traditional approaches select genes based on their statistical significance in the data set. This results in issues of robustness, redundancy and true biological relevance of the selected genes. Integrative analyses typically address these shortcomings by integrating multiple data artifacts from the same objects, e.g. gene expression and methylation data. When only gene expression data are available, integrative analyses instead use curated information on biological processes from public knowledge bases. With knowledge bases providing an ever-increasing amount of curated biological knowledge, such prior knowledge approaches become more powerful. This paper provides a thorough overview on the status quo of biomarker detection on gene expression data with prior biological knowledge. We discuss current shortcomings of traditional approaches, review recent external knowledge bases, provide a classification and qualitative comparison of existing prior knowledge approaches and discuss open challenges for this kind of gene selection.},
  language  = {en}
}
@article{Perscheid2021,
  author    = {Perscheid, Cindy},
  title     = {Comprior},
  series = {BMC Bioinformatics},
  volume    = {22},
  journal   = {BMC Bioinformatics},
  publisher = {Springer Nature},
  address   = {London},
  issn      = {1471-2105},
  doi       = {10.1186/s12859-021-04308-z},
  pages     = {1 -- 15},
  year      = {2021},
  abstract  = {Background Reproducible benchmarking is important for assessing the effectiveness of novel feature selection approaches applied on gene expression data, especially for prior knowledge approaches that incorporate biological information from online knowledge bases. However, no full-fledged benchmarking system exists that is extensible, provides built-in feature selection approaches, and a comprehensive result assessment encompassing classification performance, robustness, and biological relevance. Moreover, the particular needs of prior knowledge feature selection approaches, i.e. uniform access to knowledge bases, are not addressed. As a consequence, prior knowledge approaches are not evaluated amongst each other, leaving open questions regarding their effectiveness. Results We present the Comprior benchmark tool, which facilitates the rapid development and effortless benchmarking of feature selection approaches, with a special focus on prior knowledge approaches. Comprior is extensible by custom approaches, offers built-in standard feature selection approaches, enables uniform access to multiple knowledge bases, and provides a customizable evaluation infrastructure to compare multiple feature selection approaches regarding their classification performance, robustness, runtime, and biological relevance. Conclusion Comprior allows reproducible benchmarking especially of prior knowledge approaches, which facilitates their applicability and for the first time enables a comprehensive assessment of their effectiveness},
  language  = {en}
}
@article{LosterKoumarelasNaumann2021,
  author    = {Loster, Michael and Koumarelas, Ioannis and Naumann, Felix},
  title     = {Knowledge transfer for entity resolution with siamese neural networks},
  series = {ACM journal of data and information quality},
  volume    = {13},
  journal   = {ACM journal of data and information quality},
  number    = {1},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  issn      = {1936-1955},
  doi       = {10.1145/3410157},
  pages     = {25},
  year      = {2021},
  abstract  = {The integration of multiple data sources is a common problem in a large variety of applications. Traditionally, handcrafted similarity measures are used to discover, merge, and integrate multiple representations of the same entity-duplicates-into a large homogeneous collection of data. Often, these similarity measures do not cope well with the heterogeneity of the underlying dataset. In addition, domain experts are needed to manually design and configure such measures, which is both time-consuming and requires extensive domain expertise. <br /> We propose a deep Siamese neural network, capable of learning a similarity measure that is tailored to the characteristics of a particular dataset. With the properties of deep learning methods, we are able to eliminate the manual feature engineering process and thus considerably reduce the effort required for model construction. In addition, we show that it is possible to transfer knowledge acquired during the deduplication of one dataset to another, and thus significantly reduce the amount of data required to train a similarity measure. We evaluated our method on multiple datasets and compare our approach to state-of-the-art deduplication methods. Our approach outperforms competitors by up to +26 percent F-measure, depending on task and dataset. In addition, we show that knowledge transfer is not only feasible, but in our experiments led to an improvement in F-measure of up to +4.7 percent.},
  language  = {en}
}
@article{KaitouaRablMarkl2020,
  author    = {Kaitoua, Abdulrahman and Rabl, Tilmann and Markl, Volker},
  title     = {A distributed data exchange engine for polystores},
  series = {Information technology : methods and applications of informatics and information technology},
  volume    = {62},
  journal   = {Information technology : methods and applications of informatics and information technology},
  number    = {3-4},
  publisher = {De Gruyter},
  address   = {Berlin},
  issn      = {1611-2776},
  doi       = {10.1515/itit-2019-0037},
  pages     = {145 -- 156},
  year      = {2020},
  abstract  = {There is an increasing interest in fusing data from heterogeneous sources. Combining data sources increases the utility of existing datasets, generating new information and creating services of higher quality. A central issue in working with heterogeneous sources is data migration: In order to share and process data in different engines, resource intensive and complex movements and transformations between computing engines, services, and stores are necessary. Muses is a distributed, high-performance data migration engine that is able to interconnect distributed data stores by forwarding, transforming, repartitioning, or broadcasting data among distributed engines' instances in a resource-, cost-, and performance-adaptive manner. As such, it performs seamless information sharing across all participating resources in a standard, modular manner. We show an overall improvement of 30 \% for pipelining jobs across multiple engines, even when we count the overhead of Muses in the execution time. This performance gain implies that Muses can be used to optimise large pipelines that leverage multiple engines.},
  language  = {en}
}
@article{DreselerBoissierRabletal.2020,
  author    = {Dreseler, Markus and Boissier, Martin and Rabl, Tilmann and Uflacker, Matthias},
  title     = {Quantifying TPC-H choke points and their optimizations},
  series = {Proceedings of the VLDB Endowment},
  volume    = {13},
  journal   = {Proceedings of the VLDB Endowment},
  number    = {8},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  issn      = {2150-8097},
  doi       = {10.14778/3389133.3389138},
  pages     = {1206 -- 1220},
  year      = {2020},
  abstract  = {TPC-H continues to be the most widely used benchmark for relational OLAP systems. It poses a number of challenges, also known as "choke points", which database systems have to solve in order to achieve good benchmark results. Examples include joins across multiple tables, correlated subqueries, and correlations within the TPC-H data set. Knowing the impact of such optimizations helps in developing optimizers as well as in interpreting TPC-H results across database systems. This paper provides a systematic analysis of choke points and their optimizations. It complements previous work on TPC-H choke points by providing a quantitative discussion of their relevance. It focuses on eleven choke points where the optimizations are beneficial independently of the database system. Of these, the flattening of subqueries and the placement of predicates have the biggest impact. Three queries (Q2, Q17, and Q21) are strongly ifluenced by the choice of an efficient query plan; three others (Q1, Q13, and Q18) are less influenced by plan optimizations and more dependent on an efficient execution engine.},
  language  = {en}
}
@article{NavarroOrejasPinoetal.2021,
  author    = {Navarro, Marisa and Orejas, Fernando and Pino, Elvira and Lambers, Leen},
  title     = {A navigational logic for reasoning about graph properties},
  series = {Journal of logical and algebraic methods in programming},
  volume    = {118},
  journal   = {Journal of logical and algebraic methods in programming},
  publisher = {Elsevier Science},
  address   = {Amsterdam [u.a.]},
  issn      = {2352-2208},
  doi       = {10.1016/j.jlamp.2020.100616},
  pages     = {33},
  year      = {2021},
  abstract  = {Graphs play an important role in many areas of Computer Science. In particular, our work is motivated by model-driven software development and by graph databases. For this reason, it is very important to have the means to express and to reason about the properties that a given graph may satisfy. With this aim, in this paper we present a visual logic that allows us to describe graph properties, including navigational properties, i.e., properties about the paths in a graph. The logic is equipped with a deductive tableau method that we have proved to be sound and complete.},
  language  = {en}
}
@phdthesis{Makowski2021,
  author    = {Makowski, Silvia},
  title     = {Discriminative Models for Biometric Identification using Micro- and Macro-Movements of the Eyes},
  school      = {Universit{\"a}t Potsdam},
  pages     = {xi, 91},
  year      = {2021},
  abstract  = {Human visual perception is an active process. Eye movements either alternate between fixations and saccades or follow a smooth pursuit movement in case of moving targets. Besides these macroscopic gaze patterns, the eyes perform involuntary micro-movements during fixations which are commonly categorized into micro-saccades, drift and tremor. Eye movements are frequently studied in cognitive psychology, because they reflect a complex interplay of perception, attention and oculomotor control. A common insight of psychological research is that macro-movements are highly individual. Inspired by this finding, there has been a considerable amount of prior research on oculomotoric biometric identification. However, the accuracy of known approaches is too low and the time needed for identification is too long for any practical application. This thesis explores discriminative models for the task of biometric identification. Discriminative models optimize a quality measure of the predictions and are usually superior to generative approaches in discriminative tasks. However, using discriminative models requires to select a suitable form of data representation for sequential eye gaze data; i.e., by engineering features or constructing a sequence kernel and the performance of the classification model strongly depends on the data representation. We study two fundamentally different ways of representing eye gaze within a discriminative framework. In the first part of this thesis, we explore the integration of data and psychological background knowledge in the form of generative models to construct representations. To this end, we first develop generative statistical models of gaze behavior during reading and scene viewing that account for viewer-specific distributional properties of gaze patterns. In a second step, we develop a discriminative identification model by deriving Fisher kernel functions from these and several baseline models. We find that an SVM with Fisher kernel is able to reliably identify users based on their eye gaze during reading and scene viewing. However, since the generative models are constrained to use low-frequency macro-movements, they discard a significant amount of information contained in the raw eye tracking signal at a high cost: identification requires about one minute of input recording, which makes it inapplicable for real world biometric systems. In the second part of this thesis, we study a purely data-driven modeling approach. Here, we aim at automatically discovering the individual pattern hidden in the raw eye tracking signal. To this end, we develop a deep convolutional neural network DeepEyedentification that processes yaw and pitch gaze velocities and learns a representation end-to-end. Compared to prior work, this model increases the identification accuracy by one order of magnitude and the time to identification decreases to only seconds. The DeepEyedentificationLive model further improves upon the identification performance by processing binocular input and it also detects presentation-attacks. We find that by learning a representation, the performance of oculomotoric identification and presentation-attack detection can be driven close to practical relevance for biometric applications. Eye tracking devices with high sampling frequency and precision are expensive and the applicability of eye movement as a biometric feature heavily depends on cost of recording devices. In the last part of this thesis, we therefore study the requirements on data quality by evaluating the performance of the DeepEyedentificationLive network under reduced spatial and temporal resolution. We find that the method still attains a high identification accuracy at a temporal resolution of only 250 Hz and a precision of 0.03 degrees. Reducing both does not have an additive deteriorating effect.},
  language  = {en}
}
@article{GautamZhangLandwehretal.2021,
  author    = {Gautam, Khem Raj and Zhang, Guoqiang and Landwehr, Niels and Adolphs, Julian},
  title     = {Machine learning for improvement of thermal conditions inside a hybrid ventilated animal building},
  series = {Computers and electronics in agriculture : COMPAG online ; an international journal},
  volume    = {187},
  journal   = {Computers and electronics in agriculture : COMPAG online ; an international journal},
  publisher = {Elsevier Science},
  address   = {Amsterdam [u.a.]},
  issn      = {0168-1699},
  doi       = {10.1016/j.compag.2021.106259},
  pages     = {10},
  year      = {2021},
  abstract  = {In buildings with hybrid ventilation, natural ventilation opening positions (windows), mechanical ventilation rates, heating, and cooling are manipulated to maintain desired thermal conditions. The indoor temperature is regulated solely by ventilation (natural and mechanical) when the external conditions are favorable to save external heating and cooling energy. The ventilation parameters are determined by a rule-based control scheme, which is not optimal. This study proposes a methodology to enable real-time optimum control of ventilation parameters. We developed offline prediction models to estimate future thermal conditions from the data collected from building in operation. The developed offline model is then used to find the optimal controllable ventilation parameters in real-time to minimize the setpoint deviation in the building. With the proposed methodology, the experimental building's setpoint deviation improved for 87\% of time, on average, by 0.53 degrees C compared to the current deviations.},
  language  = {en}
}
@inproceedings{OPUS4-39635,
  title     = {11. Workshop Testmethoden und Zuverl{\"a}ssigkeit von Schaltungen und Systemen},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-9806494-1-4},
  pages     = {137 Seiten},
  year      = {1999},
  language  = {de}
}
@phdthesis{Gruetze2018,
  author    = {Gr{\"u}tze, Toni},
  title     = {Adding value to text with user-generated content},
  school      = {Universit{\"a}t Potsdam},
  pages     = {ii, 114},
  year      = {2018},
  abstract  = {In recent years, the ever-growing amount of documents on the Web as well as in closed systems for private or business contexts led to a considerable increase of valuable textual information about topics, events, and entities. It is a truism that the majority of information (i.e., business-relevant data) is only available in unstructured textual form. The text mining research field comprises various practice areas that have the common goal of harvesting high-quality information from textual data. These information help addressing users' information needs. In this thesis, we utilize the knowledge represented in user-generated content (UGC) originating from various social media services to improve text mining results. These social media platforms provide a plethora of information with varying focuses. In many cases, an essential feature of such platforms is to share relevant content with a peer group. Thus, the data exchanged in these communities tend to be focused on the interests of the user base. The popularity of social media services is growing continuously and the inherent knowledge is available to be utilized. We show that this knowledge can be used for three different tasks. Initially, we demonstrate that when searching persons with ambiguous names, the information from Wikipedia can be bootstrapped to group web search results according to the individuals occurring in the documents. We introduce two models and different means to handle persons missing in the UGC source. We show that the proposed approaches outperform traditional algorithms for search result clustering. Secondly, we discuss how the categorization of texts according to continuously changing community-generated folksonomies helps users to identify new information related to their interests. We specifically target temporal changes in the UGC and show how they influence the quality of different tag recommendation approaches. Finally, we introduce an algorithm to attempt the entity linking problem, a necessity for harvesting entity knowledge from large text collections. The goal is the linkage of mentions within the documents with their real-world entities. A major focus lies on the efficient derivation of coherent links. For each of the contributions, we provide a wide range of experiments on various text corpora as well as different sources of UGC. The evaluation shows the added value that the usage of these sources provides and confirms the appropriateness of leveraging user-generated content to serve different information needs.},
  language  = {en}
}
@article{BorchertMockTomczaketal.2021,
  author    = {Borchert, Florian and Mock, Andreas and Tomczak, Aurelie and H{\"u}gel, Jonas and Alkarkoukly, Samer and Knurr, Alexander and Volckmar, Anna-Lena and Stenzinger, Albrecht and Schirmacher, Peter and Debus, J{\"u}rgen and J{\"a}ger, Dirk and Longerich, Thomas and Fr{\"o}hling, Stefan and Eils, Roland and Bougatf, Nina and Sax, Ulrich and Schapranow, Matthieu-Patrick},
  title     = {Correction to: Knowledge bases and software support for variant interpretation in precision oncology},
  series = {Briefings in bioinformatics},
  volume    = {22},
  journal   = {Briefings in bioinformatics},
  number    = {6},
  publisher = {Oxford Univ. Press},
  address   = {Oxford},
  issn      = {1467-5463},
  doi       = {10.1093/bib/bbab246},
  pages     = {1},
  year      = {2021},
  language  = {en}
}
@article{IhdePufahlVoelkeretal.2022,
  author    = {Ihde, Sven and Pufahl, Luise and V{\"o}lker, Maximilian and Goel, Asvin and Weske, Mathias},
  title     = {A framework for modeling and executing task},
  series = {Computing : archives for informatics and numerical computation},
  volume    = {104},
  journal   = {Computing : archives for informatics and numerical computation},
  publisher = {Springer},
  address   = {Wien},
  issn      = {0010-485X},
  doi       = {10.1007/s00607-022-01093-2},
  pages     = {2405 -- 2429},
  year      = {2022},
  abstract  = {As resources are valuable assets, organizations have to decide which resources to allocate to business process tasks in a way that the process is executed not only effectively but also efficiently. Traditional role-based resource allocation leads to effective process executions, since each task is performed by a resource that has the required skills and competencies to do so. However, the resulting allocations are typically not as efficient as they could be, since optimization techniques have yet to find their way in traditional business process management scenarios. On the other hand, operations research provides a rich set of analytical methods for supporting problem-specific decisions on resource allocation. This paper provides a novel framework for creating transparency on existing tasks and resources, supporting individualized allocations for each activity in a process, and the possibility to integrate problem-specific analytical methods of the operations research domain. To validate the framework, the paper reports on the design and prototypical implementation of a software architecture, which extends a traditional process engine with a dedicated resource management component. This component allows us to define specific resource allocation problems at design time, and it also facilitates optimized resource allocation at run time. The framework is evaluated using a real-world parcel delivery process. The evaluation shows that the quality of the allocation results increase significantly with a technique from operations research in contrast to the traditional applied rule-based approach.},
  language  = {en}
}
@misc{CombiOliboniWeskeetal.2018,
  author    = {Combi, Carlo and Oliboni, Barbara and Weske, Mathias and Zerbato, Francesca},
  title     = {Conceptual modeling of processes and data},
  series = {Conceptual Modeling, ER 2018},
  volume    = {11157},
  journal   = {Conceptual Modeling, ER 2018},
  editor    = {Trujillo, JC Davis},
  publisher = {Springer},
  address   = {Cham},
  isbn      = {978-3-030-00847-5},
  issn      = {0302-9743},
  doi       = {10.1007/978-3-030-00847-5_18},
  pages     = {236 -- 250},
  year      = {2018},
  abstract  = {Business processes constantly generate, manipulate, and consume data that are managed by organizational databases. Despite being central to process modeling and execution, the link between processes and data is often handled by developers when the process is implemented, thus leaving the connection unexplored during the conceptual design. In this paper, we introduce, formalize, and evaluate a novel conceptual view that bridges the gap between process and data models, and show some kinds of interesting insights that can be derived from this novel proposal.},
  language  = {en}
}
@inproceedings{GonnermannTeichmann2023,
  author    = {Gonnermann, Jana and Teichmann, Malte},
  title     = {Influence of pre-experience on learning, usability and cognitive load in a virtual learning environment},
  series = {Americas conference on information systems},
  booktitle = {Americas conference on information systems},
  number    = {1871},
  publisher = {AIS},
  address   = {Atlanta},
  year      = {2023},
  abstract  = {Virtual reality can have advantages for education and learning. However, it must be adequately designed so that the learner benefits from the technological possibilities. Understanding the underlying effects of the virtual learning environment and the learner's prior experience with virtual reality or prior knowledge of the content is necessary to design a proper virtual learning environment. This article presents a pre-study testing the design of a virtual learning environment for engineering vocational training courses. In the pre-study, 12 employees of two companies joined the training course in one of the two degrees of immersion (desktop VR and VR HMD). Quantitative results on learning success, cognitive load, usability, and motivation and qualitative learning process data were presented. The qualitative data assessment shows that overall, the employees were satisfied with the learning environment regardless of the level of immersion and that the participants asked for more guidance and structure accompanying the learning process. Further research is needed to test for solid group differences.},
  language  = {en}
}
@article{CombiOliboniWeskeetal.2021,
  author    = {Combi, Carlo and Oliboni, Barbara and Weske, Mathias and Zerbato, Francesca},
  title     = {Seamless conceptual modeling of processes with transactional and analytical data},
  series = {Data \& knowledge engineering},
  volume    = {134},
  journal   = {Data \& knowledge engineering},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0169-023X},
  doi       = {10.1016/j.datak.2021.101895},
  pages     = {14},
  year      = {2021},
  abstract  = {In the field of Business Process Management (BPM), modeling business processes and related data is a critical issue since process activities need to manage data stored in databases. The connection between processes and data is usually handled at the implementation level, even if modeling both processes and data at the conceptual level should help designers in improving business process models and identifying requirements for implementation. Especially in data -and decision-intensive contexts, business process activities need to access data stored both in databases and data warehouses. In this paper, we complete our approach for defining a novel conceptual view that bridges process activities and data. The proposed approach allows the designer to model the connection between business processes and database models and define the operations to perform, providing interesting insights on the overall connected perspective and hints for identifying activities that are crucial for decision support.},
  language  = {en}
}
@article{Schladebach2022,
  author    = {Schladebach, Marcus},
  title     = {Satelliten-Megakonstellationen im Weltraumrecht},
  series = {Kommunikation \& Recht : K \& R / Beihefter},
  journal   = {Kommunikation \& Recht : K \& R / Beihefter},
  number    = {2},
  publisher = {dfv-Mediengruppe},
  address   = {Frankfurt am Main},
  issn      = {1434-6354},
  pages     = {26 -- 29},
  year      = {2022},
  language  = {de}
}
@article{KoerppenUllrichBertheau2021,
  author    = {K{\"o}rppen, Tim and Ullrich, Andr{\´e} and Bertheau, Clementine},
  title     = {Durchblick statt Bauchgef{\"u}hl - Transformation zur Data-Driven Organization},
  series = {Wirtschaftsinformatik \& Management},
  volume    = {13},
  journal   = {Wirtschaftsinformatik \& Management},
  number    = {6},
  publisher = {Springer Gabler},
  address   = {Wiesbaden},
  issn      = {1867-5905},
  doi       = {10.1365/s35764-021-00370-7},
  pages     = {452 -- 459},
  year      = {2021},
  abstract  = {Um in der digitalisierten Wirtschaft mitzuspielen, m{\"u}ssen Unternehmen, Markt und insbesondere Kunden detailliert verstanden werden. Neben den „Big Playern" aus dem Silicon Valley sieht der deutsche Mittelstand, der zu großen Teilen noch auf gewachsenen IT-Infrastrukturen und Prozessen agiert, oft alt aus. Um in den n{\"a}chsten Jahren nicht g{\"a}nzlich abgeh{\"a}ngt zu werden, ist ein Umbruch notwendig. Sowohl Leistungserstellungsprozesse als auch Leistungsangebot m{\"u}ssen transparent und datenbasiert ausgerichtet werden. Nur so k{\"o}nnen Gesch{\"a}ftsvorf{\"a}lle, das Marktgeschehen sowie Handeln der Akteure integrativ bewertet und fundierte Entscheidungen getroffen werden. In diesem Beitrag wird das Konzept der Data-Driven Organization vorgestellt und aufgezeigt, wie Unternehmen den eigenen Analyticsreifegrad ermitteln und in einem iterativen Transformationsprozess steigern k{\"o}nnen.},
  language  = {de}
}
@article{UllrichTeichmannGronau2021,
  author    = {Ullrich, Andr{\´e} and Teichmann, Malte and Gronau, Norbert},
  title     = {Fast trainable capabilities in software engineering-skill development in learning factories},
  series = {Ji suan ji jiao yu = Computer Education / Qing hua da xue},
  journal   = {Ji suan ji jiao yu = Computer Education / Qing hua da xue},
  number    = {12},
  publisher = {[Verlag nicht ermittelbar]},
  address   = {Bei jing shi},
  issn      = {1672-5913},
  doi       = {10.16512/j.cnki.jsjjy.2020.12.002},
  pages     = {2 -- 10},
  year      = {2021},
  abstract  = {The increasing demand for software engineers cannot completely be fulfilled by university education and conventional training approaches due to limited capacities. Accordingly, an alternative approach is necessary where potential software engineers are being educated in software engineering skills using new methods. We suggest micro tasks combined with theoretical lessons to overcome existing skill deficits and acquire fast trainable capabilities. This paper addresses the gap between demand and supply of software engineers by introducing an actionoriented and scenario-based didactical approach, which enables non-computer scientists to code. Therein, the learning content is provided in small tasks and embedded in learning factory scenarios. Therefore, different requirements for software engineers from the market side and from an academic viewpoint are analyzed and synthesized into an integrated, yet condensed skills catalogue. This enables the development of training and education units that focus on the most important skills demanded on the market. To achieve this objective, individual learning scenarios are developed. Of course, proper basic skills in coding cannot be learned over night but software programming is also no sorcery.},
  language  = {en}
}
@article{RoostapourNeumannNeumannetal.2022,
  author    = {Roostapour, Vahid and Neumann, Aneta and Neumann, Frank and Friedrich, Tobias},
  title     = {Pareto optimization for subset selection with dynamic cost constraints},
  series = {Artificial intelligence},
  volume    = {302},
  journal   = {Artificial intelligence},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0004-3702},
  doi       = {10.1016/j.artint.2021.103597},
  pages     = {17},
  year      = {2022},
  abstract  = {We consider the subset selection problem for function f with constraint bound B that changes over time. Within the area of submodular optimization, various greedy approaches are commonly used. For dynamic environments we observe that the adaptive variants of these greedy approaches are not able to maintain their approximation quality. Investigating the recently introduced POMC Pareto optimization approach, we show that this algorithm efficiently computes a phi=(alpha(f)/2)(1 - 1/e(alpha)f)-approximation, where alpha(f) is the submodularity ratio of f, for each possible constraint bound b <= B. Furthermore, we show that POMC is able to adapt its set of solutions quickly in the case that B increases. Our experimental investigations for the influence maximization in social networks show the advantage of POMC over generalized greedy algorithms. We also consider EAMC, a new evolutionary algorithm with polynomial expected time guarantee to maintain phi approximation ratio, and NSGA-II with two different population sizes as advanced multi-objective optimization algorithm, to demonstrate their challenges in optimizing the maximum coverage problem. Our empirical analysis shows that, within the same number of evaluations, POMC is able to perform as good as NSGA-II under linear constraint, while EAMC performs significantly worse than all considered algorithms in most cases.},
  language  = {en}
}
@inproceedings{KrasnovaGundlachBaumann2022,
  author    = {Krasnova, Hanna and Gundlach, Jana and Baumann, Annika},
  title     = {Coming back for more},
  series = {PACIS 2022 proceedings},
  booktitle = {PACIS 2022 proceedings},
  publisher = {AIS Electronic Library (AISeL)},
  address   = {[Erscheinungsort nicht ermittelbar]},
  isbn      = {9781958200018},
  year      = {2022},
  abstract  = {Recent spikes in social networking site (SNS) usage times have launched investigations into reasons for excessive SNS usage. Extending research on social factors (i.e., fear of missing out), this study considers the News Feed setup. More specifically, we suggest that the order of the News Feed (chronological vs. algorithmically assembled posts) affects usage behaviors. Against the background of the variable reward schedule, this study hypothesizes that the different orders exert serendipity differently. Serendipity, termed as unexpected lucky encounters with information, resembles variable rewards. Studies have evidenced a relation between variable rewards and excessive behaviors. Similarly, we hypothesize that order-induced serendipitous encounters affect SNS usage times and explore this link in a two-wave survey with an experimental setup (users using either chronological or algorithmic News Feeds). While theoretically extending explanations for increased SNS usage times by considering the News Feed order, practically the study will offer recommendations for relevant stakeholders.},
  language  = {en}
}
@inproceedings{AbramovaGundlachBilda2021,
  author    = {Abramova, Olga and Gundlach, Jana and Bilda, Juliane},
  title     = {Understanding the role of newsfeed clutter in stereotype activation},
  series = {PACIS 2021 proceedings},
  booktitle = {PACIS 2021 proceedings},
  number    = {473},
  publisher = {AIS Electronic Library (AISeL)},
  address   = {[Erscheinungsort nicht ermittelbar]},
  isbn      = {978-1-7336325-7-7},
  year      = {2021},
  abstract  = {Despite the phenomenal growth of Big Data Analytics in the last few years, little research is done to explicate the relationship between Big Data Analytics Capability (BDAC) and indirect strategic value derived from such digital capabilities. We attempt to address this gap by proposing a conceptual model of the BDAC - Innovation relationship using dynamic capability theory. The work expands on BDAC business value research and extends the nominal research done on BDAC - innovation. We focus on BDAC's relationship with different innovation objects, namely product, business process, and business model innovation, impacting all value chain activities. The insights gained will stimulate academic and practitioner interest in explicating strategic value generated from BDAC and serve as a framework for future research on the subject},
  language  = {en}
}
@article{NdashimyeHebieTjaden2022,
  author    = {Ndashimye, Felix and Hebie, Oumarou and Tjaden, Jasper},
  title     = {Effectiveness of WhatsApp for measuring migration in follow-up phone surveys},
  series = {Social science computer review},
  journal   = {Social science computer review},
  publisher = {Sage},
  address   = {Thousand Oaks},
  issn      = {0894-4393},
  doi       = {10.1177/08944393221111340},
  pages     = {20},
  year      = {2022},
  abstract  = {Phone surveys have increasingly become important data collection tools in developing countries, particularly in the context of sudden contact restrictions due to the COVID-19 pandemic. So far, there is limited evidence regarding the potential of the messenger service WhatsApp for remote data collection despite its large global coverage and expanding membership. WhatsApp may offer advantages in terms of reducing panel attrition and cutting survey costs. WhatsApp may offer additional benefits to migration scholars interested in cross-border migration behavior which is notoriously difficult to measure using conventional face-to-face surveys. In this field experiment, we compared the response rates between WhatsApp and interactive voice response (IVR) modes using a sample of 8446 contacts in Senegal and Guinea. At 12\%, WhatsApp survey response rates were nearly eight percentage points lower than IVR survey response rates. However, WhatsApp offers higher survey completion rates, substantially lower costs and does not introduce more sample selection bias compared to IVR. We discuss the potential of WhatsApp surveys in low-income contexts and provide practical recommendations for field implementation.},
  language  = {en}
}
@article{SpiekermannKrasnovaHinzetal.2022,
  author    = {Spiekermann, Sarah and Krasnova, Hanna and Hinz, Oliver and Baumann, Annika and Benlian, Alexander and Gimpel, Henner and Heimbach, Irina and Koester, Antonia and Maedche, Alexander and Niehaves, Bjoern and Risius, Marten and Trenz, Manuel},
  title     = {Values and ethics in information systems},
  series = {Business \& information systems engineering},
  volume    = {64},
  journal   = {Business \& information systems engineering},
  number    = {2},
  publisher = {Springer Gabler},
  address   = {Wiesbaden},
  issn      = {2363-7005},
  doi       = {10.1007/s12599-021-00734-8},
  pages     = {247 -- 264},
  year      = {2022},
  language  = {en}
}
@article{CsehJuhos2021,
  author    = {Cseh, {\´A}gnes and Juhos, Attila},
  title     = {Pairwise preferences in the stable marriage problem},
  series = {ACM Transactions on Economics and Computation / Association for Computing Machinery},
  volume    = {9},
  journal   = {ACM Transactions on Economics and Computation / Association for Computing Machinery},
  number    = {1},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  issn      = {2167-8375},
  doi       = {10.1145/3434427},
  pages     = {28},
  year      = {2021},
  abstract  = {We study the classical, two-sided stable marriage problem under pairwise preferences. In the most general setting, agents are allowed to express their preferences as comparisons of any two of their edges, and they also have the right to declare a draw or even withdraw from such a comparison. This freedom is then gradually restricted as we specify six stages of orderedness in the preferences, ending with the classical case of strictly ordered lists. We study all cases occurring when combining the three known notions of stability-weak, strong, and super-stability-under the assumption that each side of the bipartite market obtains one of the six degrees of orderedness. By designing three polynomial algorithms and two NP-completeness proofs, we determine the complexity of all cases not yet known and thus give an exact boundary in terms of preference structure between tractable and intractable cases.},
  language  = {en}
}
@article{CsehKavitha2021,
  author    = {Cseh, {\´A}gnes and Kavitha, Telikepalli},
  title     = {Popular matchings in complete graphs},
  series = {Algorithmica : an international journal in computer science},
  volume    = {83},
  journal   = {Algorithmica : an international journal in computer science},
  number    = {5},
  publisher = {Springer},
  address   = {New York},
  issn      = {0178-4617},
  doi       = {10.1007/s00453-020-00791-7},
  pages     = {1493 -- 1523},
  year      = {2021},
  abstract  = {Our input is a complete graph G on n vertices where each vertex has a strict ranking of all other vertices in G. The goal is to construct a matching in G that is popular. A matching M is popular if M does not lose a head-to-head election against any matching M ': here each vertex casts a vote for the matching in {M,M '} in which it gets a better assignment. Popular matchings need not exist in the given instance G and the popular matching problem is to decide whether one exists or not. The popular matching problem in G is easy to solve for odd n. Surprisingly, the problem becomes NP-complete for even n, as we show here. This is one of the few graph theoretic problems efficiently solvable when n has one parity and NP-complete when n has the other parity.},
  language  = {en}
}
@article{BredeBotta2021,
  author    = {Brede, Nuria and Botta, Nicola},
  title     = {On the correctness of monadic backward induction},
  series = {Journal of functional programming},
  volume    = {31},
  journal   = {Journal of functional programming},
  publisher = {Cambridge University Press},
  address   = {Cambridge},
  issn      = {1469-7653},
  doi       = {10.1017/S0956796821000228},
  pages     = {39},
  year      = {2021},
  abstract  = {In control theory, to solve a finite-horizon sequential decision problem (SDP) commonly means to find a list of decision rules that result in an optimal expected total reward (or cost) when taking a given number of decision steps. SDPs are routinely solved using Bellman's backward induction. Textbook authors (e.g. Bertsekas or Puterman) typically give more or less formal proofs to show that the backward induction algorithm is correct as solution method for deterministic and stochastic SDPs. Botta, Jansson and Ionescu propose a generic framework for finite horizon, monadic SDPs together with a monadic version of backward induction for solving such SDPs. In monadic SDPs, the monad captures a generic notion of uncertainty, while a generic measure function aggregates rewards. In the present paper, we define a notion of correctness for monadic SDPs and identify three conditions that allow us to prove a correctness result for monadic backward induction that is comparable to textbook correctness proofs for ordinary backward induction. The conditions that we impose are fairly general and can be cast in category-theoretical terms using the notion of Eilenberg-Moore algebra. They hold in familiar settings like those of deterministic or stochastic SDPs, but we also give examples in which they fail. Our results show that backward induction can safely be employed for a broader class of SDPs than usually treated in textbooks. However, they also rule out certain instances that were considered admissible in the context of Botta et al. 's generic framework. Our development is formalised in Idris as an extension of the Botta et al. framework and the sources are available as supplementary material.},
  language  = {en}
}
@article{StaufferMengeshaSeifertetal.2022,
  author    = {Stauffer, Maxime and Mengesha, Isaak and Seifert, Konrad and Krawczuk, Igor and Fischer, Jens and Serugendo, Giovanna Di Marzo},
  title     = {A computational turn in policy process studies},
  series = {Complexity},
  volume    = {2022},
  journal   = {Complexity},
  publisher = {Wiley-Hindawi},
  address   = {London},
  issn      = {1076-2787},
  doi       = {10.1155/2022/8210732},
  pages     = {17},
  year      = {2022},
  abstract  = {The past three decades of policy process studies have seen the emergence of a clear intellectual lineage with regard to complexity. Implicitly or explicitly, scholars have employed complexity theory to examine the intricate dynamics of collective action in political contexts. However, the methodological counterparts to complexity theory, such as computational methods, are rarely used and, even if they are, they are often detached from established policy process theory. Building on a critical review of the application of complexity theory to policy process studies, we present and implement a baseline model of policy processes using the logic of coevolving networks. Our model suggests that an actor's influence depends on their environment and on exogenous events facilitating dialogue and consensus-building. Our results validate previous opinion dynamics models and generate novel patterns. Our discussion provides ground for further research and outlines the path for the field to achieve a computational turn.},
  language  = {en}
}
@article{WenderingNikoloski2022,
  author    = {Wendering, Philipp and Nikoloski, Zoran},
  title     = {COMMIT},
  series = {PLoS Computational Biology : a new community journal / publ. by the Public Library of Science (PLoS) in association with the International Society for Computational Biology (ISCB)},
  volume    = {18},
  journal   = {PLoS Computational Biology : a new community journal / publ. by the Public Library of Science (PLoS) in association with the International Society for Computational Biology (ISCB)},
  number    = {3},
  publisher = {Public Library of Science},
  address   = {San Fransisco},
  issn      = {1553-734X},
  doi       = {10.1371/journal.pcbi.1009906},
  pages     = {24},
  year      = {2022},
  abstract  = {Composition and functions of microbial communities affect important traits in diverse hosts, from crops to humans. Yet, mechanistic understanding of how metabolism of individual microbes is affected by the community composition and metabolite leakage is lacking. Here, we first show that the consensus of automatically generated metabolic reconstructions improves the quality of the draft reconstructions, measured by comparison to reference models. We then devise an approach for gap filling, termed COMMIT, that considers metabolites for secretion based on their permeability and the composition of the community. By applying COMMIT with two soil communities from the Arabidopsis thaliana culture collection, we could significantly reduce the gap-filling solution in comparison to filling gaps in individual reconstructions without affecting the genomic support. Inspection of the metabolic interactions in the soil communities allows us to identify microbes with community roles of helpers and beneficiaries. Therefore, COMMIT offers a versatile fully automated solution for large-scale modelling of microbial communities for diverse biotechnological applications. <br /> Author summaryMicrobial communities are important in ecology, human health, and crop productivity. However, detailed information on the interactions within natural microbial communities is hampered by the community size, lack of detailed information on the biochemistry of single organisms, and the complexity of interactions between community members. Metabolic models are comprised of biochemical reaction networks based on the genome annotation, and can provide mechanistic insights into community functions. Previous analyses of microbial community models have been performed with high-quality reference models or models generated using a single reconstruction pipeline. However, these models do not contain information on the composition of the community that determines the metabolites exchanged between the community members. In addition, the quality of metabolic models is affected by the reconstruction approach used, with direct consequences on the inferred interactions between community members. Here, we use fully automated consensus reconstructions from four approaches to arrive at functional models with improved genomic support while considering the community composition. We applied our pipeline to two soil communities from the Arabidopsis thaliana culture collection, providing only genome sequences. Finally, we show that the obtained models have 90\% genomic support and demonstrate that the derived interactions are corroborated by independent computational predictions.},
  language  = {en}
}
@article{BenlianWienerCrametal.2022,
  author    = {Benlian, Alexander and Wiener, Martin and Cram, W. Alec and Krasnova, Hanna and Maedche, Alexander and Mohlmann, Mareike and Recker, Jan and Remus, Ulrich},
  title     = {Algorithmic management},
  series = {Business and information systems engineering},
  volume    = {64},
  journal   = {Business and information systems engineering},
  number    = {6},
  publisher = {Springer Gabler},
  address   = {Wiesbaden},
  issn      = {2363-7005},
  doi       = {10.1007/s12599-022-00764-w},
  pages     = {825 -- 839},
  year      = {2022},
  language  = {en}
}
@article{BensonMakaitRabl2021,
  author    = {Benson, Lawrence and Makait, Hendrik and Rabl, Tilmann},
  title     = {Viper},
  series = {Proceedings of the VLDB Endowment},
  volume    = {14},
  journal   = {Proceedings of the VLDB Endowment},
  number    = {9},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  issn      = {2150-8097},
  doi       = {10.14778/3461535.3461543},
  pages     = {1544 -- 1556},
  year      = {2021},
  abstract  = {Key-value stores (KVSs) have found wide application in modern software systems. For persistence, their data resides in slow secondary storage, which requires KVSs to employ various techniques to increase their read and write performance from and to the underlying medium. Emerging persistent memory (PMem) technologies offer data persistence at close-to-DRAM speed, making them a promising alternative to classical disk-based storage. However, simply drop-in replacing existing storage with PMem does not yield good results, as block-based access behaves differently in PMem than on disk and ignores PMem's byte addressability, layout, and unique performance characteristics. In this paper, we propose three PMem-specific access patterns and implement them in a hybrid PMem-DRAM KVS called Viper. We employ a DRAM-based hash index and a PMem-aware storage layout to utilize the random-write speed of DRAM and efficient sequential-write performance PMem. Our evaluation shows that Viper significantly outperforms existing KVSs for core KVS operations while providing full data persistence. Moreover, Viper outperforms existing PMem-only, hybrid, and disk-based KVSs by 4-18x for write workloads, while matching or surpassing their get performance.},
  language  = {en}
}
@inproceedings{SultanowChircuWuestemannetal.2022,
  author    = {Sultanow, Eldar and Chircu, Alina and W{\"u}stemann, Stefanie and Schwan, Andr{\´e} and Lehmann, Andreas and Sept, Andr{\´e} and Szymaski, Oliver and Venkatesan, Sripriya and Ritterbusch, Georg David and Teichmann, Malte Rolf},
  title     = {Metaverse opportunities for the public sector},
  series = {International Conference on Information Systems 2022 : Special Interest Group on Big Data : Proceedings},
  booktitle = {International Conference on Information Systems 2022 : Special Interest Group on Big Data : Proceedings},
  publisher = {AIS},
  address   = {Atlanta},
  year      = {2022},
  abstract  = {The metaverse is envisioned as a virtual shared space facilitated by emerging technologies such as virtual reality (VR), augmented reality (AR), the Internet of Things (IoT), 5G, artificial intelligence (AI), big data, spatial computing, and digital twins (Allam et al., 2022; Dwivedi et al., 2022; Ravenscraft, 2022; Wiles, 2022). While still a nascent concept, the metaverse has the potential to "transform the physical world, as well as transport or extend physical activities to a virtual world" (Wiles, 2022). Big data technologies will also be essential in managing the enormous amounts of data created in the metaverse (Sun et al., 2022). Metaverse technologies can offer the public sector a host of benefits, such as simplified information exchange, stronger communication with citizens, better access to public services, or benefiting from a new virtual economy. Implementations are underway in several cities around the world (Geraghty et al., 2022). In this paper, we analyze metaverse opportunities for the public sector and explore their application in the context of Germany's Federal Employment Agency. Based on an analysis of academic literature and practical examples, we create a capability map for potential metaverse business capabilities for different areas of the public sector (broadly defined). These include education (virtual training and simulation, digital campuses that offer not just online instruction but a holistic university campus experience, etc.), tourism (virtual travel to remote locations and museums, virtual festival participation, etc.), health (employee training - as for emergency situations, virtual simulations for patient treatment - for example, for depression or anxiety, etc.), military (virtual training to experience operational scenarios without being exposed to a real-world threats, practice strategic decision-making, or gain technical knowledge for operating and repairing equipment, etc.), administrative services (document processing, virtual consultations for citizens, etc.), judiciary (AI decision-making aids, virtual proceedings, etc.), public safety (virtual training for procedural issues, special operations, or unusual situations, etc.), emergency management (training for natural disasters, etc.), and city planning (visualization of future development projects and interactive feedback, traffic management, attraction gamification, etc.), among others. We further identify several metaverse application areas for Germany's Federal Employment Agency. These applications can help it realize the goals of the German government for digital transformation that enables faster, more effective, and innovative government services. They include training of employees, training of customers, and career coaching for customers. These applications can be implemented using interactive learning games with AI agents, virtual representations of the organizational spaces, and avatars interacting with each other in these spaces. Metaverse applications will both use big data (to design the virtual environments) and generate big data (from virtual interactions). Issues related to data availability, quality, storage, processing (and related computing power requirements), interoperability, sharing, privacy and security will need to be addressed in these emerging metaverse applications (Sun et al., 2022). Special attention is needed to understand the potential for power inequities (wealth inequity, algorithmic bias, digital exclusion) due to technologies such as VR (Egliston \& Carter, 2021), harmful surveillance practices (Bibri \& Allam, 2022), and undesirable user behavior or negative psychological impacts (Dwivedi et al., 2022). The results of this exploratory study can inform public sector organizations of emerging metaverse opportunities and enable them to develop plans for action as more of the metaverse technologies become a reality. While the metaverse body of research is still small and research agendas are only now starting to emerge (Dwivedi et al., 2022), this study offers a building block for future development and analysis of metaverse applications.},
  language  = {en}
}
@inproceedings{KrauseBaumann2021,
  author    = {Krause, Hannes-Vincent and Baumann, Annika},
  title     = {The devil in disguise},
  series = {ICIS 2021: user behaviors, engagement, and consequences},
  booktitle = {ICIS 2021: user behaviors, engagement, and consequences},
  publisher = {AIS Electronic Library (AISeL)},
  address   = {[Erscheinungsort nicht ermittelbar]},
  year      = {2021},
  abstract  = {Envy constitutes a serious issue on Social Networking Sites (SNSs), as this painful emotion can severely diminish individuals' well-being. With prior research mainly focusing on the affective consequences of envy in the SNS context, its behavioral consequences remain puzzling. While negative interactions among SNS users are an alarming issue, it remains unclear to which extent the harmful emotion of malicious envy contributes to these toxic dynamics. This study constitutes a first step in understanding malicious envy's causal impact on negative interactions within the SNS sphere. Within an online experiment, we experimentally induce malicious envy and measure its immediate impact on users' negative behavior towards other users. Our findings show that malicious envy seems to be an essential factor fueling negativity among SNS users and further illustrate that this effect is especially pronounced when users are provided an objective factor to mask their envy and justify their norm-violating negative behavior.},
  language  = {en}
}
@article{SeewannVerwiebeBuderetal.2022,
  author    = {Seewann, Lena and Verwiebe, Roland and Buder, Claudia and Fritsch, Nina-Sophie},
  title     = {"Broadcast your gender."},
  series = {Frontiers in Big Data},
  journal   = {Frontiers in Big Data},
  number    = {5},
  publisher = {Frontiers},
  address   = {Lausanne, Schweiz},
  issn      = {2624-909X},
  doi       = {10.3389/fdata.2022.908636},
  pages     = {16},
  year      = {2022},
  abstract  = {Social media platforms provide a large array of behavioral data relevant to social scientific research. However, key information such as sociodemographic characteristics of agents are often missing. This paper aims to compare four methods of classifying social attributes from text. Specifically, we are interested in estimating the gender of German social media creators. By using the example of a random sample of 200 YouTube channels, we compare several classification methods, namely (1) a survey among university staff, (2) a name dictionary method with the World Gender Name Dictionary as a reference list, (3) an algorithmic approach using the website gender-api.com, and (4) a Multinomial Na{\"i}ve Bayes (MNB) machine learning technique. These different methods identify gender attributes based on YouTube channel names and descriptions in German but are adaptable to other languages. Our contribution will evaluate the share of identifiable channels, accuracy and meaningfulness of classification, as well as limits and benefits of each approach. We aim to address methodological challenges connected to classifying gender attributes for YouTube channels as well as related to reinforcing stereotypes and ethical implications.},
  language  = {en}
}
@article{WrightWachsHarper2018,
  author    = {Wright, Michelle F. and Wachs, Sebastian and Harper, Bridgette D.},
  title     = {The moderation of empathy in the longitudinal association between witnessing cyberbullying, depression, and anxiety},
  series = {Journal of Psychosocial Research on Cyberspace},
  volume    = {12},
  journal   = {Journal of Psychosocial Research on Cyberspace},
  number    = {4},
  publisher = {Masrykova Univ.},
  address   = {Brno},
  issn      = {1802-7962},
  doi       = {10.5817/CP2018-4-6},
  pages     = {14},
  year      = {2018},
  abstract  = {While the role of and consequences of being a bystander to face-to-face bullying has received some attention in the literature, to date, little is known about the effects of being a bystander to cyberbullying. It is also unknown how empathy might impact the negative consequences associated with being a bystander of cyberbullying. The present study focused on examining the longitudinal association between bystander of cyberbullying depression, and anxiety, and the moderating role of empathy in the relationship between bystander of cyberbullying and subsequent depression and anxiety. There were 1,090 adolescents (M-age = 12.19; 50\% female) from the United States included at Time 1, and they completed questionnaires on empathy, cyberbullying roles (bystander, perpetrator, victim), depression, and anxiety. One year later, at Time 2, 1,067 adolescents (M-age = 13.76; 51\% female) completed questionnaires on depression and anxiety. Results revealed a positive association between bystander of cyberbullying and depression and anxiety. Further, empathy moderated the positive relationship between bystander of cyberbullying and depression, but not for anxiety. Implications for intervention and prevention programs are discussed.},
  language  = {en}
}
@article{XuRazaghiMoghadamNikoloski2021,
  author    = {Xu, Rudan and Razaghi-Moghadam, Zahra and Nikoloski, Zoran},
  title     = {Maximization of non-idle enzymes improves the coverage of the estimated maximal in vivo enzyme catalytic rates in Escherichia coli},
  series = {Bioinformatics},
  volume    = {37},
  journal   = {Bioinformatics},
  number    = {21},
  publisher = {Oxford Univ. Press},
  address   = {Oxford},
  issn      = {1367-4803},
  doi       = {10.1093/bioinformatics/btab575},
  pages     = {3848 -- 3855},
  year      = {2021},
  abstract  = {Motivation: Constraint-based modeling approaches allow the estimation of maximal in vivo enzyme catalytic rates that can serve as proxies for enzyme turnover numbers. Yet, genome-scale flux profiling remains a challenge in deploying these approaches to catalogue proxies for enzyme catalytic rates across organisms. Results: Here, we formulate a constraint-based approach, termed NIDLE-flux, to estimate fluxes at a genome-scale level by using the principle of efficient usage of expressed enzymes. Using proteomics data from Escherichia coli, we show that the fluxes estimated by NIDLE-flux and the existing approaches are in excellent qualitative agreement (Pearson correlation > 0.9). We also find that the maximal in vivo catalytic rates estimated by NIDLE-flux exhibits a Pearson correlation of 0.74 with in vitro enzyme turnover numbers. However, NIDLE-flux results in a 1.4-fold increase in the size of the estimated maximal in vivo catalytic rates in comparison to the contenders. Integration of the maximum in vivo catalytic rates with publically available proteomics and metabolomics data provide a better match to fluxes estimated by NIDLE-flux. Therefore, NIDLE-flux facilitates more effective usage of proteomics data to estimate proxies for kcatomes.},
  language  = {en}
}
@article{AngeleskaOmranianNikoloski2021,
  author    = {Angeleska, Angela and Omranian, Sara and Nikoloski, Zoran},
  title     = {Coherent network partitions},
  series = {Theoretical computer science : the journal of the EATCS},
  volume    = {894},
  journal   = {Theoretical computer science : the journal of the EATCS},
  publisher = {Elsevier},
  address   = {Amsterdam [u.a.]},
  issn      = {0304-3975},
  doi       = {10.1016/j.tcs.2021.10.002},
  pages     = {3 -- 11},
  year      = {2021},
  abstract  = {We continue to study coherent partitions of graphs whereby the vertex set is partitioned into subsets that induce biclique spanned subgraphs. The problem of identifying the minimum number of edges to obtain biclique spanned connected components (CNP), called the coherence number, is NP-hard even on bipartite graphs. Here, we propose a graph transformation geared towards obtaining an O (log n)-approximation algorithm for the CNP on a bipartite graph with n vertices. The transformation is inspired by a new characterization of biclique spanned subgraphs. In addition, we study coherent partitions on prime graphs, and show that finding coherent partitions reduces to the problem of finding coherent partitions in a prime graph. Therefore, these results provide future directions for approximation algorithms for the coherence number of a given graph.},
  language  = {en}
}
@article{ChenLangeAndjelkovicetal.2022,
  author    = {Chen, Junchao and Lange, Thomas and Andjelkovic, Marko and Simevski, Aleksandar and Lu, Li and Krstić, Miloš},
  title     = {Solar particle event and single event upset prediction from SRAM-based monitor and supervised machine learning},
  series = {IEEE transactions on emerging topics in computing / IEEE Computer Society, Institute of Electrical and Electronics Engineers},
  volume    = {10},
  journal   = {IEEE transactions on emerging topics in computing / IEEE Computer Society, Institute of Electrical and Electronics Engineers},
  number    = {2},
  publisher = {Institute of Electrical and Electronics Engineers},
  address   = {[New York, NY]},
  issn      = {2168-6750},
  doi       = {10.1109/TETC.2022.3147376},
  pages     = {564 -- 580},
  year      = {2022},
  abstract  = {The intensity of cosmic radiation may differ over five orders of magnitude within a few hours or days during the Solar Particle Events (SPEs), thus increasing for several orders of magnitude the probability of Single Event Upsets (SEUs) in space-borne electronic systems. Therefore, it is vital to enable the early detection of the SEU rate changes in order to ensure timely activation of dynamic radiation hardening measures. In this paper, an embedded approach for the prediction of SPEs and SRAM SEU rate is presented. The proposed solution combines the real-time SRAM-based SEU monitor, the offline-trained machine learning model and online learning algorithm for the prediction. With respect to the state-of-the-art, our solution brings the following benefits: (1) Use of existing on-chip data storage SRAM as a particle detector, thus minimizing the hardware and power overhead, (2) Prediction of SRAM SEU rate one hour in advance, with the fine-grained hourly tracking of SEU variations during SPEs as well as under normal conditions, (3) Online optimization of the prediction model for enhancing the prediction accuracy during run-time, (4) Negligible cost of hardware accelerator design for the implementation of selected machine learning model and online learning algorithm. The proposed design is intended for a highly dependable and self-adaptive multiprocessing system employed in space applications, allowing to trigger the radiation mitigation mechanisms before the onset of high radiation levels.},
  language  = {en}
}
@phdthesis{Hosp2015,
  author    = {Hosp, Sven},
  title     = {Modifizierte Cross-Party Codes zur schnellen Mehrbit-Fehlerkorrektur},
  pages     = {105},
  year      = {2015},
  language  = {de}
}
@article{TalebRohrerBergneretal.2022,
  author    = {Taleb, Aiham and Rohrer, Csaba and Bergner, Benjamin and De Leon, Guilherme and Rodrigues, Jonas Almeida and Schwendicke, Falk and Lippert, Christoph and Krois, Joachim},
  title     = {Self-supervised learning methods for label-efficient dental caries classification},
  series = {Diagnostics : open access journal},
  volume    = {12},
  journal   = {Diagnostics : open access journal},
  number    = {5},
  publisher = {MDPI},
  address   = {Basel},
  issn      = {2075-4418},
  doi       = {10.3390/diagnostics12051237},
  pages     = {15},
  year      = {2022},
  abstract  = {High annotation costs are a substantial bottleneck in applying deep learning architectures to clinically relevant use cases, substantiating the need for algorithms to learn from unlabeled data. In this work, we propose employing self-supervised methods. To that end, we trained with three self-supervised algorithms on a large corpus of unlabeled dental images, which contained 38K bitewing radiographs (BWRs). We then applied the learned neural network representations on tooth-level dental caries classification, for which we utilized labels extracted from electronic health records (EHRs). Finally, a holdout test-set was established, which consisted of 343 BWRs and was annotated by three dental professionals and approved by a senior dentist. This test-set was used to evaluate the fine-tuned caries classification models. Our experimental results demonstrate the obtained gains by pretraining models using self-supervised algorithms. These include improved caries classification performance (6 p.p. increase in sensitivity) and, most importantly, improved label-efficiency. In other words, the resulting models can be fine-tuned using few labels (annotations). Our results show that using as few as 18 annotations can produce >= 45\% sensitivity, which is comparable to human-level diagnostic performance. This study shows that self-supervision can provide gains in medical image analysis, particularly when obtaining labels is costly and expensive.},
  language  = {en}
}
@inproceedings{VladovaUllrichSultanowetal.2023,
  author    = {Vladova, Gergana and Ullrich, Andr{\´e} and Sultanow, Eldar and Tobolla, Marinho and Sebrak, Sebastian and Czarnecki, Christian and Brockmann, Carsten},
  title     = {Visual analytics for knowledge management},
  series = {Informatik 2023},
  booktitle = {Informatik 2023},
  editor    = {Klein, Maike and Krupka, Daniel and Winter, Cornelia and Wohlgemuth, Volker},
  publisher = {Gesellschaft f{\"u}r Informatik e.V. (GI)},
  address   = {Bonn},
  isbn      = {978-3-88579-731-9},
  issn      = {1617-5468},
  doi       = {10.18420/inf2023_187},
  pages     = {1851 -- 1870},
  year      = {2023},
  abstract  = {The management of knowledge in organizations considers both established long-term processes and cooperation in agile project teams. Since knowledge can be both tacit and explicit, its transfer from the individual to the organizational knowledge base poses a challenge in organizations. This challenge increases when the fluctuation of knowledge carriers is exceptionally high. Especially in large projects in which external consultants are involved, there is a risk that critical, company-relevant knowledge generated in the project will leave the company with the external knowledge carrier and thus be lost. In this paper, we show the advantages of an early warning system for knowledge management to avoid this loss. In particular, the potential of visual analytics in the context of knowledge management systems is presented and discussed. We present a project for the development of a business-critical software system and discuss the first implementations and results.},
  language  = {en}
}
@article{HagemannAbramova2023,
  author    = {Hagemann, Linus and Abramova, Olga},
  title     = {Emotions and information diffusion on social media},
  series = {AIS transactions on replication research},
  volume    = {9},
  journal   = {AIS transactions on replication research},
  number    = {1},
  publisher = {AIS},
  address   = {Atlanta},
  issn      = {2473-3458},
  doi       = {10.17705/1atrr.00079},
  pages     = {1 -- 19},
  year      = {2023},
  abstract  = {This paper presents a methodological and conceptual replication of Stieglitz and Dang-Xuan's (2013) investigation of the role of sentiment in information-sharing behavior on social media. Whereas Stieglitz and Dang-Xuan (2013) focused on Twitter communication prior to the state parliament elections in the German states Baden-Wurttemberg, Rheinland-Pfalz, and Berlin in 2011, we test their theoretical propositions in the context of the state parliament elections in Saxony-Anhalt (Germany) 2021. We confirm the positive link between sentiment in a political Twitter message and its number of retweets in a methodological replication. In a conceptual replication, where sentiment was assessed with the alternative dictionary-based tool LIWC, the sentiment was negatively associated with the retweet volume. In line with the original study, the strength of association between sentiment and retweet time lag insignificantly differs between tweets with negative sentiment and tweets with positive sentiment. We also found that the number of an author's followers was an essential determinant of sharing behavior. However, two hypotheses supported in the original study did not hold for our sample. Precisely, the total amount of sentiments was insignificantly linked to the time lag to the first retweet. Finally, in our data, we do not observe that the association between the overall sentiment and retweet quantity is stronger for tweets with negative sentiment than for those with positive sentiment.},
  language  = {en}
}
@article{Steinroetter2021,
  author    = {Steinr{\"o}tter, Bj{\"o}rn},
  title     = {Das Konzept einer datenaltruistischen Organisation},
  series = {Datenschutz und Datensicherheit},
  volume    = {45},
  journal   = {Datenschutz und Datensicherheit},
  number    = {12},
  publisher = {Springer},
  address   = {Berlin},
  issn      = {1862-2607},
  doi       = {10.1007/s11623-021-1539-6},
  pages     = {794 -- 798},
  year      = {2021},
  abstract  = {Dass Technologien wie Machine Learning-Anwendungen oder Big bzw. Smart Data- Verfahren unbedingt Daten in ausreichender Menge und G{\"u}te ben{\"o}tigen, erscheint inzwischen als Binsenweisheit. Vor diesem Hintergrund hat insbesondere der EU-Gesetzgeber f{\"u}r sich zuletzt ein neues Bet{\"a}tigungsfeld entdeckt, indem er versucht, auf unterschiedlichen Wegen Anreize zum Datenteilen zu schaffen, um Innovation zu kreieren. Hierzu z{\"a}hlt auch eine geradezu wohlt{\"o}nend mit ,,Datenaltruismus'' verschlagwortete Konstellation. Der Beitrag stellt die diesbez{\"u}glichen Regulierungserw{\"a}gungen auf supranationaler Ebene dar und nimmt eine erste Analyse vor.},
  language  = {de}
}
@article{PuriVardeMelo2023,
  author    = {Puri, Manish and Varde, Aparna S. and Melo, Gerard de},
  title     = {Commonsense based text mining on urban policy},
  series = {Language resources and evaluation},
  volume    = {57},
  journal   = {Language resources and evaluation},
  publisher = {Springer},
  address   = {Dordrecht [u.a.]},
  issn      = {1574-020X},
  doi       = {10.1007/s10579-022-09584-6},
  pages     = {733 -- 763},
  year      = {2023},
  abstract  = {Local laws on urban policy, i.e., ordinances directly affect our daily life in various ways (health, business etc.), yet in practice, for many citizens they remain impervious and complex. This article focuses on an approach to make urban policy more accessible and comprehensible to the general public and to government officials, while also addressing pertinent social media postings. Due to the intricacies of the natural language, ranging from complex legalese in ordinances to informal lingo in tweets, it is practical to harness human judgment here. To this end, we mine ordinances and tweets via reasoning based on commonsense knowledge so as to better account for pragmatics and semantics in the text. Ours is pioneering work in ordinance mining, and thus there is no prior labeled training data available for learning. This gap is filled by commonsense knowledge, a prudent choice in situations involving a lack of adequate training data. The ordinance mining can be beneficial to the public in fathoming policies and to officials in assessing policy effectiveness based on public reactions. This work contributes to smart governance, leveraging transparency in governing processes via public involvement. We focus significantly on ordinances contributing to smart cities, hence an important goal is to assess how well an urban region heads towards a smart city as per its policies mapping with smart city characteristics, and the corresponding public satisfaction.},
  language  = {en}
}
@article{KurpiersNeher2016,
  author    = {Kurpiers, Jona and Neher, Dieter},
  title     = {Dispersive Non-Geminate Recombination in an Amorphous Polymer:Fullerene Blend},
  series = {Scientific reports},
  volume    = {6},
  journal   = {Scientific reports},
  publisher = {Nature Publishing Group},
  address   = {London},
  issn      = {2045-2322},
  doi       = {10.1038/srep26832},
  pages     = {10},
  year      = {2016},
  abstract  = {Recombination of free charge is a key process limiting the performance of solar cells. For low mobility materials, such as organic semiconductors, the kinetics of non-geminate recombination (NGR) is strongly linked to the motion of charges. As these materials possess significant disorder, thermalization of photogenerated carriers in the inhomogeneously broadened density of state distribution is an unavoidable process. Despite its general importance, knowledge about the kinetics of NGR in complete organic solar cells is rather limited. We employ time delayed collection field (TDCF) experiments to study the recombination of photogenerated charge in the high-performance polymer:fullerene blend PCDTBT:PCBM. NGR in the bulk of this amorphous blend is shown to be highly dispersive, with a continuous reduction of the recombination coefficient throughout the entire time scale, until all charge carriers have either been extracted or recombined. Rapid, contact-mediated recombination is identified as an additional loss channel, which, if not properly taken into account, would erroneously suggest a pronounced field dependence of charge generation. These findings are in stark contrast to the results of TDCF experiments on photovoltaic devices made from ordered blends, such as P3HT:PCBM, where non-dispersive recombination was proven to dominate the charge carrier dynamics under application relevant conditions.},
  language  = {en}
}
@article{NeherKniepertElimelechetal.2016,
  author    = {Neher, Dieter and Kniepert, Juliane and Elimelech, Arik and Koster, L. Jan Anton},
  title     = {A New Figure of Merit for Organic Solar Cells with Transport-limited Photocurrents},
  series = {Scientific reports},
  volume    = {6},
  journal   = {Scientific reports},
  publisher = {Nature Publishing Group},
  address   = {London},
  issn      = {2045-2322},
  doi       = {10.1038/srep24861},
  pages     = {9},
  year      = {2016},
  abstract  = {Compared to their inorganic counterparts, organic semiconductors suffer from relatively low charge carrier mobilities. Therefore, expressions derived for inorganic solar cells to correlate characteristic performance parameters to material properties are prone to fail when applied to organic devices. This is especially true for the classical Shockley-equation commonly used to describe current-voltage (JV)-curves, as it assumes a high electrical conductivity of the charge transporting material. Here, an analytical expression for the JV-curves of organic solar cells is derived based on a previously published analytical model. This expression, bearing a similar functional dependence as the Shockley-equation, delivers a new figure of merit α to express the balance between free charge recombination and extraction in low mobility photoactive materials. This figure of merit is shown to determine critical device parameters such as the apparent series resistance and the fill factor.},
  language  = {en}
}
@article{SchindlerMoldenhawerStangeetal.2021,
  author    = {Schindler, Daniel and Moldenhawer, Ted and Stange, Maike and Lepro, Valentino and Beta, Carsten and Holschneider, Matthias and Huisinga, Wilhelm},
  title     = {Analysis of protrusion dynamics in amoeboid cell motility by means of regularized contour flows},
  series = {PLoS Computational Biology : a new community journal},
  volume    = {17},
  journal   = {PLoS Computational Biology : a new community journal},
  number    = {8},
  publisher = {PLoS},
  address   = {San Fransisco},
  issn      = {1553-734X},
  doi       = {10.1371/journal.pcbi.1009268},
  pages     = {33},
  year      = {2021},
  abstract  = {Amoeboid cell motility is essential for a wide range of biological processes including wound healing, embryonic morphogenesis, and cancer metastasis. It relies on complex dynamical patterns of cell shape changes that pose long-standing challenges to mathematical modeling and raise a need for automated and reproducible approaches to extract quantitative morphological features from image sequences. Here, we introduce a theoretical framework and a computational method for obtaining smooth representations of the spatiotemporal contour dynamics from stacks of segmented microscopy images. Based on a Gaussian process regression we propose a one-parameter family of regularized contour flows that allows us to continuously track reference points (virtual markers) between successive cell contours. We use this approach to define a coordinate system on the moving cell boundary and to represent different local geometric quantities in this frame of reference. In particular, we introduce the local marker dispersion as a measure to identify localized membrane expansions and provide a fully automated way to extract the properties of such expansions, including their area and growth time. The methods are available as an open-source software package called AmoePy, a Python-based toolbox for analyzing amoeboid cell motility (based on time-lapse microscopy data), including a graphical user interface and detailed documentation. Due to the mathematical rigor of our framework, we envision it to be of use for the development of novel cell motility models. We mainly use experimental data of the social amoeba Dictyostelium discoideum to illustrate and validate our approach. <br /> Author summary Amoeboid motion is a crawling-like cell migration that plays an important key role in multiple biological processes such as wound healing and cancer metastasis. This type of cell motility results from expanding and simultaneously contracting parts of the cell membrane. From fluorescence images, we obtain a sequence of points, representing the cell membrane, for each time step. By using regression analysis on these sequences, we derive smooth representations, so-called contours, of the membrane. Since the number of measurements is discrete and often limited, the question is raised of how to link consecutive contours with each other. In this work, we present a novel mathematical framework in which these links are described by regularized flows allowing a certain degree of concentration or stretching of neighboring reference points on the same contour. This stretching rate, the so-called local dispersion, is used to identify expansions and contractions of the cell membrane providing a fully automated way of extracting properties of these cell shape changes. We applied our methods to time-lapse microscopy data of the social amoeba Dictyostelium discoideum.},
  language  = {en}
}
@article{PanzerBenderGronau2022,
  author    = {Panzer, Marcel and Bender, Benedict and Gronau, Norbert},
  title     = {Neural agent-based production planning and control},
  series = {Journal of Manufacturing Systems},
  volume    = {65},
  journal   = {Journal of Manufacturing Systems},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0278-6125},
  doi       = {10.1016/j.jmsy.2022.10.019},
  pages     = {743 -- 766},
  year      = {2022},
  abstract  = {Nowadays, production planning and control must cope with mass customization, increased fluctuations in demand, and high competition pressures. Despite prevailing market risks, planning accuracy and increased adaptability in the event of disruptions or failures must be ensured, while simultaneously optimizing key process indicators. To manage that complex task, neural networks that can process large quantities of high-dimensional data in real time have been widely adopted in recent years. Although these are already extensively deployed in production systems, a systematic review of applications and implemented agent embeddings and architectures has not yet been conducted. The main contribution of this paper is to provide researchers and practitioners with an overview of applications and applied embeddings and to motivate further research in neural agent-based production. Findings indicate that neural agents are not only deployed in diverse applications, but are also increasingly implemented in multi-agent environments or in combination with conventional methods — leveraging performances compared to benchmarks and reducing dependence on human experience. This not only implies a more sophisticated focus on distributed production resources, but also broadening the perspective from a local to a global scale. Nevertheless, future research must further increase scalability and reproducibility to guarantee a simplified transfer of results to reality.},
  language  = {en}
}
@article{MontiRautenstrauchGhanbarietal.2022,
  author    = {Monti, Remo and Rautenstrauch, Pia and Ghanbari, Mahsa and Rani James, Alva and Kirchler, Matthias and Ohler, Uwe and Konigorski, Stefan and Lippert, Christoph},
  title     = {Identifying interpretable gene-biomarker associations with functionally informed kernel-based tests in 190,000 exomes},
  series = {Nature Communications},
  volume    = {13},
  journal   = {Nature Communications},
  publisher = {Nature Publishing Group UK},
  address   = {London},
  issn      = {2041-1723},
  doi       = {10.1038/s41467-022-32864-2},
  pages     = {16},
  year      = {2022},
  abstract  = {Here we present an exome-wide rare genetic variant association study for 30 blood biomarkers in 191,971 individuals in the UK Biobank. We compare gene- based association tests for separate functional variant categories to increase interpretability and identify 193 significant gene-biomarker associations. Genes associated with biomarkers were ~ 4.5-fold enriched for conferring Mendelian disorders. In addition to performing weighted gene-based variant collapsing tests, we design and apply variant-category-specific kernel-based tests that integrate quantitative functional variant effect predictions for mis- sense variants, splicing and the binding of RNA-binding proteins. For these tests, we present a computationally efficient combination of the likelihood- ratio and score tests that found 36\% more associations than the score test alone while also controlling the type-1 error. Kernel-based tests identified 13\% more associations than their gene-based collapsing counterparts and had advantages in the presence of gain of function missense variants. We introduce local collapsing by amino acid position for missense variants and use it to interpret associations and identify potential novel gain of function variants in PIEZO1. Our results show the benefits of investigating different functional mechanisms when performing rare-variant association tests, and demonstrate pervasive rare-variant contribution to biomarker variability.},
  language  = {en}
}
@article{TavakoliAlirezazadehHedayatipouretal.2021,
  author    = {Tavakoli, Hamad and Alirezazadeh, Pendar and Hedayatipour, Ava and Nasib, A. H. Banijamali and Landwehr, Niels},
  title     = {Leaf image-based classification of some common bean cultivars using discriminative convolutional neural networks},
  series = {Computers and electronics in agriculture : COMPAG online ; an international journal},
  volume    = {181},
  journal   = {Computers and electronics in agriculture : COMPAG online ; an international journal},
  publisher = {Elsevier},
  address   = {Amsterdam [u.a.]},
  issn      = {0168-1699},
  doi       = {10.1016/j.compag.2020.105935},
  pages     = {11},
  year      = {2021},
  abstract  = {In recent years, many efforts have been made to apply image processing techniques for plant leaf identification. However, categorizing leaf images at the cultivar/variety level, because of the very low inter-class variability, is still a challenging task. In this research, we propose an automatic discriminative method based on convolutional neural networks (CNNs) for classifying 12 different cultivars of common beans that belong to three various species. We show that employing advanced loss functions, such as Additive Angular Margin Loss and Large Margin Cosine Loss, instead of the standard softmax loss function for the classification can yield better discrimination between classes and thereby mitigate the problem of low inter-class variability. The method was evaluated by classifying species (level I), cultivars from the same species (level II), and cultivars from different species (level III), based on images from the leaf foreside and backside. The results indicate that the performance of the classification algorithm on the leaf backside image dataset is superior. The maximum mean classification accuracies of 95.86, 91.37 and 86.87\% were obtained at the levels I, II and III, respectively. The proposed method outperforms the previous relevant works and provides a reliable approach for plant cultivars identification.},
  language  = {en}
}
@article{PfitznerSteckhanArnrich2021,
  author    = {Pfitzner, Bjarne and Steckhan, Nico and Arnrich, Bert},
  title     = {Federated learning in a medical context},
  series = {ACM transactions on internet technology : TOIT / Association for Computing},
  volume    = {21},
  journal   = {ACM transactions on internet technology : TOIT / Association for Computing},
  number    = {2},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  issn      = {1533-5399},
  doi       = {10.1145/3412357},
  pages     = {1 -- 31},
  year      = {2021},
  abstract  = {Data privacy is a very important issue. Especially in fields like medicine, it is paramount to abide by the existing privacy regulations to preserve patients' anonymity. However, data is required for research and training machine learning models that could help gain insight into complex correlations or personalised treatments that may otherwise stay undiscovered. Those models generally scale with the amount of data available, but the current situation often prohibits building large databases across sites. So it would be beneficial to be able to combine similar or related data from different sites all over the world while still preserving data privacy. Federated learning has been proposed as a solution for this, because it relies on the sharing of machine learning models, instead of the raw data itself. That means private data never leaves the site or device it was collected on. Federated learning is an emerging research area, and many domains have been identified for the application of those methods. This systematic literature review provides an extensive look at the concept of and research into federated learning and its applicability for confidential healthcare datasets.},
  language  = {en}
}
@article{GarrelsKhodabakhshRenardetal.2023,
  author    = {Garrels, Tim and Khodabakhsh, Athar and Renard, Bernhard Y. and Baum, Katharina},
  title     = {LazyFox: fast and parallelized overlapping community detection in large graphs},
  series = {PEERJ Computer Science},
  volume    = {9},
  journal   = {PEERJ Computer Science},
  publisher = {PeerJ Inc.},
  address   = {London},
  issn      = {2376-5992},
  doi       = {10.7717/peerj-cs.1291},
  pages     = {30},
  year      = {2023},
  abstract  = {The detection of communities in graph datasets provides insight about a graph's underlying structure and is an important tool for various domains such as social sciences, marketing, traffic forecast, and drug discovery. While most existing algorithms provide fast approaches for community detection, their results usually contain strictly separated communities. However, most datasets would semantically allow for or even require overlapping communities that can only be determined at much higher computational cost. We build on an efficient algorithm, FOX, that detects such overlapping communities. FOX measures the closeness of a node to a community by approximating the count of triangles which that node forms with that community. We propose LAZYFOX, a multi-threaded adaptation of the FOX algorithm, which provides even faster detection without an impact on community quality. This allows for the analyses of significantly larger and more complex datasets. LAZYFOX enables overlapping community detection on complex graph datasets with millions of nodes and billions of edges in days instead of weeks. As part of this work, LAZYFOX's implementation was published and is available as a tool under an MIT licence at https://github.com/TimGarrels/LazyFox.},
  language  = {en}
}