@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}
}
@misc{PanzerBenderGronau2022,
  author    = {Panzer, Marcel and Bender, Benedict and Gronau, Norbert},
  title     = {Neural agent-based production planning and control},
  series = {Zweitver{\"o}ffentlichungen der Universit{\"a}t Potsdam : Wirtschafts- und Sozialwissenschaftliche Reihe},
  journal   = {Zweitver{\"o}ffentlichungen der Universit{\"a}t Potsdam : Wirtschafts- und Sozialwissenschaftliche Reihe},
  issn      = {1867-5808},
  doi       = {10.25932/publishup-60477},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-604777},
  pages     = {26},
  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{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}
}
@misc{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 = {Zweitver{\"o}ffentlichungen der Universit{\"a}t Potsdam : Reihe der Digital Engineering Fakult{\"a}t},
  journal   = {Zweitver{\"o}ffentlichungen der Universit{\"a}t Potsdam : Reihe der Digital Engineering Fakult{\"a}t},
  number    = {16},
  doi       = {10.25932/publishup-58607},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-586078},
  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{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}
}
@phdthesis{Morozov2005,
  author    = {Morozov, Alexei},
  title     = {Optimierung von Fehlererkennungsschaltungen auf der Grundlage von komplement{\"a}ren Erg{\"a}nzungen f{\"u}r 1-aus-3 und Berger Codes},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-5360},
  school      = {Universit{\"a}t Potsdam},
  year      = {2005},
  abstract  = {Die Dissertation stellt eine neue Herangehensweise an die L{\"o}sung der Aufgabe der funktionalen Diagnostik digitaler Systeme vor. In dieser Arbeit wird eine neue Methode f{\"u}r die Fehlererkennung vorgeschlagen, basierend auf der Logischen Erg{\"a}nzung und der Verwendung von Berger-Codes und dem 1-aus-3 Code. Die neue Fehlererkennungsmethode der Logischen Erg{\"a}nzung gestattet einen hohen Optimierungsgrad der ben{\"o}tigten Realisationsfl{\"a}che der konstruierten Fehlererkennungsschaltungen. Außerdem ist eins der wichtigen in dieser Dissertation gel{\"o}sten Probleme die Synthese vollst{\"a}ndig selbstpr{\"u}fender Schaltungen.},
  subject      = {logische Erg{\"a}nzung},
  language  = {de}
}
@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}
}
@article{BonnetDongNaumannetal.2021,
  author    = {Bonnet, Philippe and Dong, Xin Luna and Naumann, Felix and T{\"o}z{\"u}n, P{\i}nar},
  title     = {VLDB 2021},
  series = {SIGMOD record},
  volume    = {50},
  journal   = {SIGMOD record},
  number    = {4},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  issn      = {0163-5808},
  doi       = {10.1145/3516431.3516447},
  pages     = {50 -- 53},
  year      = {2021},
  abstract  = {The 47th International Conference on Very Large Databases (VLDB'21) was held on August 16-20, 2021 as a hybrid conference. It attracted 180 in-person attendees in Copenhagen and 840 remote attendees. In this paper, we describe our key decisions as general chairs and program committee chairs and share the lessons we learned.},
  language  = {en}
}
@inproceedings{HagemannAbramova2022,
  author    = {Hagemann, Linus and Abramova, Olga},
  title     = {Crafting audience engagement in social media conversations},
  series = {Proceedings of the 55th Hawaii International Conference on System Sciences},
  booktitle = {Proceedings of the 55th Hawaii International Conference on System Sciences},
  publisher = {HICSS Conference Office University of Hawaii at Manoa},
  address   = {Honolulu},
  isbn      = {978-0-9981331-5-7},
  pages     = {3222 -- 3231},
  year      = {2022},
  abstract  = {Observing inconsistent results in prior studies, this paper applies the elaboration likelihood model to investigate the impact of affective and cognitive cues embedded in social media messages on audience engagement during a political event. Leveraging a rich dataset in the context of the 2020 U.S. presidential elections containing more than 3 million tweets, we found the prominence of both cue types. For the overall sample, positivity and sentiment are negatively related to engagement. In contrast, the post-hoc sub-sample analysis of tweets from famous users shows that emotionally charged content is more engaging. The role of sentiment decreases when the number of followers grows and ultimately becomes insignificant for Twitter participants with a vast number of followers. Prosocial orientation ("we-talk") is consistently associated with more likes, comments, and retweets in the overall sample and sub-samples.},
  language  = {en}
}
@inproceedings{Abramova2020,
  author    = {Abramova, Olga},
  title     = {Does a smile open all doors?},
  series = {Proceedings of the 53rd Hawaii International Conference on System Sciences},
  booktitle = {Proceedings of the 53rd Hawaii International Conference on System Sciences},
  publisher = {HICSS Conference Office University of Hawaii at Manoa},
  address   = {Honolulu},
  isbn      = {978-0-9981331-3-3},
  pages     = {831 -- 840},
  year      = {2020},
  abstract  = {Online photographs govern an individual's choices across a variety of contexts. In sharing arrangements, facial appearance has been shown to affect the desire to collaborate, interest to explore a listing, and even willingness to pay for a stay. Because of the ubiquity of online images and their influence on social attitudes, it seems crucial to be able to control these aspects. The present study examines the effect of different photographic self-disclosures on the provider's perceptions and willingness to accept a potential co-sharer. The findings from our experiment in the accommodation-sharing context suggest social attraction mediates the effect of photographic self-disclosures on willingness to host. Implications of the results for IS research and practitioners are discussed.},
  language  = {en}
}
@misc{HaegeleSchlagenhaufRappetal.2014,
  author    = {H{\"a}gele, Claudia and Schlagenhauf, Florian and Rapp, Michael A. and Sterzer, Philipp and Beck, Anne and Bermpohl, Felix and Stoy, Meline and Str{\"o}hle, Andreas and Wittchen, Hans-Ulrich and Dolan, Raymond J. and Heinz, Andreas},
  title     = {Dimensional psychiatry},
  series = {Postprints der Universit{\"a}t Potsdam : Humanwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Humanwissenschaftliche Reihe},
  number    = {653},
  issn      = {1866-8364},
  doi       = {10.25932/publishup-43106},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-431064},
  pages     = {331 -- 341},
  year      = {2014},
  abstract  = {A dimensional approach in psychiatry aims to identify core mechanisms of mental disorders across nosological boundaries. We compared anticipation of reward between major psychiatric disorders, and investigated whether reward anticipation is impaired in several mental disorders and whether there is a common psychopathological correlate (negative mood) of such an impairment. We used functional magnetic resonance imaging (fMRI) and a monetary incentive delay (MID) task to study the functional correlates of reward anticipation across major psychiatric disorders in 184 subjects, with the diagnoses of alcohol dependence (n = 26), schizophrenia (n = 44), major depressive disorder (MDD, n = 24), bipolar disorder (acute manic episode, n = 13), attention deficit/hyperactivity disorder (ADHD, n = 23), and healthy controls (n = 54). Subjects' individual Beck Depression Inventory-and State-Trait Anxiety Inventory-scores were correlated with clusters showing significant activation during reward anticipation. During reward anticipation, we observed significant group differences in ventral striatal (VS) activation: patients with schizophrenia, alcohol dependence, and major depression showed significantly less ventral striatal activation compared to healthy controls. Depressive symptoms correlated with dysfunction in reward anticipation regardless of diagnostic entity. There was no significant correlation between anxiety symptoms and VS functional activation. Our findings demonstrate a neurobiological dysfunction related to reward prediction that transcended disorder categories and was related to measures of depressed mood. The findings underline the potential of a dimensional approach in psychiatry and strengthen the hypothesis that neurobiological research in psychiatric disorders can be targeted at core mechanisms that are likely to be implicated in a range of clinical entities.},
  language  = {en}
}
@phdthesis{Jiang2022,
  author    = {Jiang, Lan},
  title     = {Discovering metadata in data files},
  doi       = {10.25932/publishup-56620},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-566204},
  school      = {Universit{\"a}t Potsdam},
  pages     = {x, ii, 117},
  year      = {2022},
  abstract  = {It is estimated that data scientists spend up to 80\% of the time exploring, cleaning, and transforming their data. A major reason for that expenditure is the lack of knowledge about the used data, which are often from different sources and have heterogeneous structures. As a means to describe various properties of data, metadata can help data scientists understand and prepare their data, saving time for innovative and valuable data analytics. However, metadata do not always exist: some data file formats are not capable of storing them; metadata were deleted for privacy concerns; legacy data may have been produced by systems that were not designed to store and handle meta- data. As data are being produced at an unprecedentedly fast pace and stored in diverse formats, manually creating metadata is not only impractical but also error-prone, demanding automatic approaches for metadata detection. In this thesis, we are focused on detecting metadata in CSV files - a type of plain-text file that, similar to spreadsheets, may contain different types of content at arbitrary positions. We propose a taxonomy of metadata in CSV files and specifically address the discovery of three different metadata: line and cell type, aggregations, and primary keys and foreign keys. Data are organized in an ad-hoc manner in CSV files, and do not follow a fixed structure, which is assumed by common data processing tools. Detecting the structure of such files is a prerequisite of extracting information from them, which can be addressed by detecting the semantic type, such as header, data, derived, or footnote, of each line or each cell. We propose the supervised- learning approach Strudel to detect the type of lines and cells. CSV files may also include aggregations. An aggregation represents the arithmetic relationship between a numeric cell and a set of other numeric cells. Our proposed AggreCol algorithm is capable of detecting aggregations of five arithmetic functions in CSV files. Note that stylistic features, such as font style and cell background color, do not exist in CSV files. Our proposed algorithms address the respective problems by using only content, contextual, and computational features. Storing a relational table is also a common usage of CSV files. Primary keys and foreign keys are important metadata for relational databases, which are usually not present for database instances dumped as plain-text files. We propose the HoPF algorithm to holistically detect both constraints in relational databases. Our approach is capable of distinguishing true primary and foreign keys from a great amount of spurious unique column combinations and inclusion dependencies, which can be detected by state-of-the-art data profiling algorithms.},
  language  = {en}
}
@article{RosinLaiMouldetal.2022,
  author    = {Rosin, Paul L. and Lai, Yu-Kun and Mould, David and Yi, Ran and Berger, Itamar and Doyle, Lars and Lee, Seungyong and Li, Chuan and Liu, Yong-Jin and Semmo, Amir and Shamir, Ariel and Son, Minjung and Winnem{\"o}ller, Holger},
  title     = {NPRportrait 1.0: A three-level benchmark for non-photorealistic rendering of portraits},
  series = {Computational visual media},
  volume    = {8},
  journal   = {Computational visual media},
  number    = {3},
  publisher = {Springer Nature},
  address   = {London},
  issn      = {2096-0433},
  doi       = {10.1007/s41095-021-0255-3},
  pages     = {445 -- 465},
  year      = {2022},
  abstract  = {Recently, there has been an upsurge of activity in image-based non-photorealistic rendering (NPR), and in particular portrait image stylisation, due to the advent of neural style transfer (NST). However, the state of performance evaluation in this field is poor, especially compared to the norms in the computer vision and machine learning communities. Unfortunately, the task of evaluating image stylisation is thus far not well defined, since it involves subjective, perceptual, and aesthetic aspects. To make progress towards a solution, this paper proposes a new structured, three-level, benchmark dataset for the evaluation of stylised portrait images. Rigorous criteria were used for its construction, and its consistency was validated by user studies. Moreover, a new methodology has been developed for evaluating portrait stylisation algorithms, which makes use of the different benchmark levels as well as annotations provided by user studies regarding the characteristics of the faces. We perform evaluation for a wide variety of image stylisation methods (both portrait-specific and general purpose, and also both traditional NPR approaches and NST) using the new benchmark dataset.},
  language  = {en}
}
@inproceedings{RojahnGronau2024,
  author    = {Rojahn, Marcel and Gronau, Norbert},
  title     = {Openness indicators for the evaluation of digital platforms between the launch and maturity phase},
  series = {Proceedings of the 57th Annual Hawaii International Conference on System Sciences},
  booktitle = {Proceedings of the 57th Annual Hawaii International Conference on System Sciences},
  editor    = {Bui, Tung X.},
  publisher = {Department of IT Management Shidler College of Business University of Hawaii},
  address   = {Honolulu, HI},
  isbn      = {978-0-99813-317-1},
  pages     = {4516 -- 4525},
  year      = {2024},
  abstract  = {In recent years, the evaluation of digital platforms has become an important focus in the field of information systems science. The identification of influential indicators that drive changes in digital platforms, specifically those related to openness, is still an unresolved issue. This paper addresses the challenge of identifying measurable indicators and characterizing the transition from launch to maturity in digital platforms. It proposes a systematic analytical approach to identify relevant openness indicators for evaluation purposes. The main contributions of this study are the following (1) the development of a comprehensive procedure for analyzing indicators, (2) the categorization of indicators as evaluation metrics within a multidimensional grid-box model, (3) the selection and evaluation of relevant indicators, (4) the identification and assessment of digital platform architectures during the launch-to-maturity transition, and (5) the evaluation of the applicability of the conceptualization and design process for digital platform evaluation.},
  language  = {en}
}
@misc{Fandino2019,
  author    = {Fandi{\~n}o, Jorge},
  title     = {Founded (auto)epistemic equilibrium logic satisfies epistemic splitting},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  number    = {1060},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-46968},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-469685},
  pages     = {671 -- 687},
  year      = {2019},
  abstract  = {In a recent line of research, two familiar concepts from logic programming semantics (unfounded sets and splitting) were extrapolated to the case of epistemic logic programs. The property of epistemic splitting provides a natural and modular way to understand programs without epistemic cycles but, surprisingly, was only fulfilled by Gelfond's original semantics (G91), among the many proposals in the literature. On the other hand, G91 may suffer from a kind of self-supported, unfounded derivations when epistemic cycles come into play. Recently, the absence of these derivations was also formalised as a property of epistemic semantics called foundedness. Moreover, a first semantics proved to satisfy foundedness was also proposed, the so-called Founded Autoepistemic Equilibrium Logic (FAEEL). In this paper, we prove that FAEEL also satisfies the epistemic splitting property something that, together with foundedness, was not fulfilled by any other approach up to date. To prove this result, we provide an alternative characterisation of FAEEL as a combination of G91 with a simpler logic we called Founded Epistemic Equilibrium Logic (FEEL), which is somehow an extrapolation of the stable model semantics to the modal logic S5.},
  language  = {en}
}
@article{CabalarFandinoFarinasdelCerro2021,
  author    = {Cabalar, Pedro and Fandi{\~n}o, Jorge and Fari{\~n}as del Cerro, Luis},
  title     = {Splitting epistemic logic programs},
  series = {Theory and practice of logic programming / publ. for the Association for Logic Programming},
  volume    = {21},
  journal   = {Theory and practice of logic programming / publ. for the Association for Logic Programming},
  number    = {3},
  publisher = {Cambridge Univ. Press},
  address   = {Cambridge [u.a.]},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068420000058},
  pages     = {296 -- 316},
  year      = {2021},
  abstract  = {Epistemic logic programs constitute an extension of the stable model semantics to deal with new constructs called subjective literals. Informally speaking, a subjective literal allows checking whether some objective literal is true in all or some stable models. As it can be imagined, the associated semantics has proved to be non-trivial, since the truth of subjective literals may interfere with the set of stable models it is supposed to query. As a consequence, no clear agreement has been reached and different semantic proposals have been made in the literature. Unfortunately, comparison among these proposals has been limited to a study of their effect on individual examples, rather than identifying general properties to be checked. In this paper, we propose an extension of the well-known splitting property for logic programs to the epistemic case. We formally define when an arbitrary semantics satisfies the epistemic splitting property and examine some of the consequences that can be derived from that, including its relation to conformant planning and to epistemic constraints. Interestingly, we prove (through counterexamples) that most of the existing approaches fail to fulfill the epistemic splitting property, except the original semantics proposed by Gelfond 1991 and a recent proposal by the authors, called Founded Autoepistemic Equilibrium Logic.},
  language  = {en}
}
@misc{AguadoCabalarFandinoetal.2019,
  author    = {Aguado, Felicidad and Cabalar, Pedro and Fandi{\~n}o, Jorge and Pearce, David and Perez, Gilberto and Vidal, Concepcion},
  title     = {Revisiting explicit negation in answer set programming},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  number    = {1104},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-46969},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-469697},
  pages     = {908 -- 924},
  year      = {2019},
  abstract  = {A common feature in Answer Set Programming is the use of a second negation, stronger than default negation and sometimes called explicit, strong or classical negation. This explicit negation is normally used in front of atoms, rather than allowing its use as a regular operator. In this paper we consider the arbitrary combination of explicit negation with nested expressions, as those defined by Lifschitz, Tang and Turner. We extend the concept of reduct for this new syntax and then prove that it can be captured by an extension of Equilibrium Logic with this second negation. We study some properties of this variant and compare to the already known combination of Equilibrium Logic with Nelson's strong negation.},
  language  = {en}
}
@article{GoebelLagodzinskiSeidel2021,
  author    = {G{\"o}bel, Andreas and Lagodzinski, Julius Albert Gregor and Seidel, Karen},
  title     = {Counting homomorphisms to trees modulo a prime},
  series = {ACM transactions on computation theory : TOCT / Association for Computing Machinery},
  volume    = {13},
  journal   = {ACM transactions on computation theory : TOCT / Association for Computing Machinery},
  number    = {3},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  issn      = {1942-3454},
  doi       = {10.1145/3460958},
  pages     = {1 -- 33},
  year      = {2021},
  abstract  = {Many important graph-theoretic notions can be encoded as counting graph homomorphism problems, such as partition functions in statistical physics, in particular independent sets and colourings. In this article, we study the complexity of \#(p) HOMSTOH, the problem of counting graph homomorphisms from an input graph to a graph H modulo a prime number p. Dyer and Greenhill proved a dichotomy stating that the tractability of non-modular counting graph homomorphisms depends on the structure of the target graph. Many intractable cases in non-modular counting become tractable in modular counting due to the common phenomenon of cancellation. In subsequent studies on counting modulo 2, however, the influence of the structure of H on the tractability was shown to persist, which yields similar dichotomies. <br /> Our main result states that for every tree H and every prime p the problem \#pHOMSTOH is either polynomial time computable or \#P-p-complete. This relates to the conjecture of Faben and Jerrum stating that this dichotomy holds for every graph H when counting modulo 2. In contrast to previous results on modular counting, the tractable cases of \#pHOMSTOH are essentially the same for all values of the modulo when H is a tree. To prove this result, we study the structural properties of a homomorphism. As an important interim result, our study yields a dichotomy for the problem of counting weighted independent sets in a bipartite graph modulo some prime p. These results are the first suggesting that such dichotomies hold not only for the modulo 2 case but also for the modular counting functions of all primes p.},
  language  = {en}
}
@phdthesis{Taleb2024,
  author    = {Taleb, Aiham},
  title     = {Self-supervised deep learning methods for medical image analysis},
  doi       = {10.25932/publishup-64408},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-644089},
  school      = {Universit{\"a}t Potsdam},
  pages     = {xii, 171},
  year      = {2024},
  abstract  = {Deep learning has seen widespread application in many domains, mainly for its ability to learn data representations from raw input data. Nevertheless, its success has so far been coupled with the availability of large annotated (labelled) datasets. This is a requirement that is difficult to fulfil in several domains, such as in medical imaging. Annotation costs form a barrier in extending deep learning to clinically-relevant use cases. The labels associated with medical images are scarce, since the generation of expert annotations of multimodal patient data at scale is non-trivial, expensive, and time-consuming. This substantiates the need for algorithms that learn from the increasing amounts of unlabeled data. Self-supervised representation learning algorithms offer a pertinent solution, as they allow solving real-world (downstream) deep learning tasks with fewer annotations. Self-supervised approaches leverage unlabeled samples to acquire generic features about different concepts, enabling annotation-efficient downstream task solving subsequently. Nevertheless, medical images present multiple unique and inherent challenges for existing self-supervised learning approaches, which we seek to address in this thesis: (i) medical images are multimodal, and their multiple modalities are heterogeneous in nature and imbalanced in quantities, e.g. MRI and CT; (ii) medical scans are multi-dimensional, often in 3D instead of 2D; (iii) disease patterns in medical scans are numerous and their incidence exhibits a long-tail distribution, so it is oftentimes essential to fuse knowledge from different data modalities, e.g. genomics or clinical data, to capture disease traits more comprehensively; (iv) Medical scans usually exhibit more uniform color density distributions, e.g. in dental X-Rays, than natural images. Our proposed self-supervised methods meet these challenges, besides significantly reducing the amounts of required annotations. We evaluate our self-supervised methods on a wide array of medical imaging applications and tasks. Our experimental results demonstrate the obtained gains in both annotation-efficiency and performance; our proposed methods outperform many approaches from related literature. Additionally, in case of fusion with genetic modalities, our methods also allow for cross-modal interpretability. In this thesis, not only we show that self-supervised learning is capable of mitigating manual annotation costs, but also our proposed solutions demonstrate how to better utilize it in the medical imaging domain. Progress in self-supervised learning has the potential to extend deep learning algorithms application to clinical scenarios.},
  language  = {en}
}
@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}
}
@article{VitaglianoHameedJiangetal.2023,
  author    = {Vitagliano, Gerardo and Hameed, Mazhar and Jiang, Lan and Reisener, Lucas and Wu, Eugene and Naumann, Felix},
  title     = {Pollock: a data loading benchmark},
  series = {Proceedings of the VLDB Endowment},
  volume    = {16},
  journal   = {Proceedings of the VLDB Endowment},
  number    = {8},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  issn      = {2150-8097},
  doi       = {10.14778/3594512.3594518},
  pages     = {1870 -- 1882},
  year      = {2023},
  abstract  = {Any system at play in a data-driven project has a fundamental requirement: the ability to load data. The de-facto standard format to distribute and consume raw data is CSV. Yet, the plain text and flexible nature of this format make such files often difficult to parse and correctly load their content, requiring cumbersome data preparation steps. We propose a benchmark to assess the robustness of systems in loading data from non-standard CSV formats and with structural inconsistencies. First, we formalize a model to describe the issues that affect real-world files and use it to derive a systematic lpollutionz process to generate dialects for any given grammar. Our benchmark leverages the pollution framework for the csv format. To guide pollution, we have surveyed thousands of real-world, publicly available csv files, recording the problems we encountered. We demonstrate the applicability of our benchmark by testing and scoring 16 different systems: popular csv parsing frameworks, relational database tools, spreadsheet systems, and a data visualization tool.},
  language  = {en}
}
@inproceedings{MarxBruenkerMirbabaieetal.2024,
  author    = {Marx, Julian and Br{\"u}nker, Felix and Mirbabaie, Milad and Stieglitz, Stefan},
  title     = {Digital activism on social media},
  series = {Proceedings of the 57th Annual Hawaii International Conference on System Sciences},
  booktitle = {Proceedings of the 57th Annual Hawaii International Conference on System Sciences},
  editor    = {Bui, Tung X.},
  publisher = {Department of IT Management Shidler College of Business University of Hawaii},
  address   = {Honolulu, HI},
  isbn      = {978-0-99813-317-1},
  pages     = {7205 -- 7214},
  year      = {2024},
  abstract  = {Social media constitute an important arena for public debates and steady interchange of issues relevant to society. To boost their reputation, commercial organizations also engage in political, social, or environmental debates on social media. To engage in this type of digital activism, organizations increasingly utilize the social media profiles of executive employees and other brand ambassadors. However, the relationship between brand ambassadors' digital activism and corporate reputation is only vaguely understood. The results of a qualitative inquiry suggest that digital activism via brand ambassadors can be risky (e.g., creating additional surface for firestorms, financial loss) and rewarding (e.g., emitting authenticity, employing 'megaphones' for industry change) at the same time. The paper informs both scholarship and practitioners about strategic trade-offs that need to be considered when employing brand ambassadors for digital activism.},
  language  = {en}
}
@inproceedings{MirbabaieRieskampHofeditzetal.2024,
  author    = {Mirbabaie, Milad and Rieskamp, Jonas and Hofeditz, Lennart and Stieglitz, Stefan},
  title     = {Breaking down barriers},
  series = {Proceedings of the 57th Annual Hawaii International Conference on System Sciences},
  booktitle = {Proceedings of the 57th Annual Hawaii International Conference on System Sciences},
  editor    = {Bui, Tung X.},
  publisher = {Department of IT Management Shidler College of Business University of Hawaii},
  address   = {Honolulu, HI},
  isbn      = {978-0-99813-317-1},
  pages     = {672 -- 681},
  year      = {2024},
  abstract  = {Many researchers hesitate to provide full access to their datasets due to a lack of knowledge about research data management (RDM) tools and perceived fears, such as losing the value of one's own data. Existing tools and approaches often do not take into account these fears and missing knowledge. In this study, we examined how conversational agents (CAs) can provide a natural way of guidance through RDM processes and nudge researchers towards more data sharing. This work offers an online experiment in which researchers interacted with a CA on a self-developed RDM platform and a survey on participants' data sharing behavior. Our findings indicate that the presence of a guiding and enlightening CA on an RDM platform has a constructive influence on both the intention to share data and the actual behavior of data sharing. Notably, individual factors do not appear to impede or hinder this effect.},
  language  = {en}
}
@article{NguyenGeorgieKayhanetal.2021,
  author    = {Nguyen, Dong Hai Phuong and Georgie, Yasmin Kim and Kayhan, Ezgi and Eppe, Manfred and Hafner, Verena Vanessa and Wermter, Stefan},
  title     = {Sensorimotor representation learning for an "active self" in robots},
  series = {K{\"u}nstliche Intelligenz : KI ; Forschung, Entwicklung, Erfahrungen ; Organ des Fachbereichs 1 K{\"u}nstliche Intelligenz der Gesellschaft f{\"u}r Informatik e.V., GI / Fachbereich 1 der Gesellschaft f{\"u}r Informatik e.V},
  volume    = {35},
  journal   = {K{\"u}nstliche Intelligenz : KI ; Forschung, Entwicklung, Erfahrungen ; Organ des Fachbereichs 1 K{\"u}nstliche Intelligenz der Gesellschaft f{\"u}r Informatik e.V., GI / Fachbereich 1 der Gesellschaft f{\"u}r Informatik e.V},
  number    = {1},
  publisher = {Springer},
  address   = {Berlin},
  issn      = {0933-1875},
  doi       = {10.1007/s13218-021-00703-z},
  pages     = {9 -- 35},
  year      = {2021},
  abstract  = {Safe human-robot interactions require robots to be able to learn how to behave appropriately in spaces populated by people and thus to cope with the challenges posed by our dynamic and unstructured environment, rather than being provided a rigid set of rules for operations. In humans, these capabilities are thought to be related to our ability to perceive our body in space, sensing the location of our limbs during movement, being aware of other objects and agents, and controlling our body parts to interact with them intentionally. Toward the next generation of robots with bio-inspired capacities, in this paper, we first review the developmental processes of underlying mechanisms of these abilities: The sensory representations of body schema, peripersonal space, and the active self in humans. Second, we provide a survey of robotics models of these sensory representations and robotics models of the self; and we compare these models with the human counterparts. Finally, we analyze what is missing from these robotics models and propose a theoretical computational framework, which aims to allow the emergence of the sense of self in artificial agents by developing sensory representations through self-exploration.},
  language  = {en}
}
@phdthesis{Huegle2024,
  author    = {Huegle, Johannes},
  title     = {Causal discovery in practice: Non-parametric conditional independence testing and tooling for causal discovery},
  doi       = {10.25932/publishup-63582},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-635820},
  school      = {Universit{\"a}t Potsdam},
  pages     = {xiv, 156},
  year      = {2024},
  abstract  = {Knowledge about causal structures is crucial for decision support in various domains. For example, in discrete manufacturing, identifying the root causes of failures and quality deviations that interrupt the highly automated production process requires causal structural knowledge. However, in practice, root cause analysis is usually built upon individual expert knowledge about associative relationships. But, "correlation does not imply causation", and misinterpreting associations often leads to incorrect conclusions. Recent developments in methods for causal discovery from observational data have opened the opportunity for a data-driven examination. Despite its potential for data-driven decision support, omnipresent challenges impede causal discovery in real-world scenarios. In this thesis, we make a threefold contribution to improving causal discovery in practice. (1) The growing interest in causal discovery has led to a broad spectrum of methods with specific assumptions on the data and various implementations. Hence, application in practice requires careful consideration of existing methods, which becomes laborious when dealing with various parameters, assumptions, and implementations in different programming languages. Additionally, evaluation is challenging due to the lack of ground truth in practice and limited benchmark data that reflect real-world data characteristics. To address these issues, we present a platform-independent modular pipeline for causal discovery and a ground truth framework for synthetic data generation that provides comprehensive evaluation opportunities, e.g., to examine the accuracy of causal discovery methods in case of inappropriate assumptions. (2) Applying constraint-based methods for causal discovery requires selecting a conditional independence (CI) test, which is particularly challenging in mixed discrete-continuous data omnipresent in many real-world scenarios. In this context, inappropriate assumptions on the data or the commonly applied discretization of continuous variables reduce the accuracy of CI decisions, leading to incorrect causal structures. Therefore, we contribute a non-parametric CI test leveraging k-nearest neighbors methods and prove its statistical validity and power in mixed discrete-continuous data, as well as the asymptotic consistency when used in constraint-based causal discovery. An extensive evaluation of synthetic and real-world data shows that the proposed CI test outperforms state-of-the-art approaches in the accuracy of CI testing and causal discovery, particularly in settings with low sample sizes. (3) To show the applicability and opportunities of causal discovery in practice, we examine our contributions in real-world discrete manufacturing use cases. For example, we showcase how causal structural knowledge helps to understand unforeseen production downtimes or adds decision support in case of failures and quality deviations in automotive body shop assembly lines.},
  language  = {en}
}
@article{WiemkerBunovaNeufeldetal.2022,
  author    = {Wiemker, Veronika and Bunova, Anna and Neufeld, Maria and Gornyi, Boris and Yurasova, Elena and Konigorski, Stefan and Kalinina, Anna and Kontsevaya, Anna and Ferreira-Borges, Carina and Probst, Charlotte},
  title     = {Pilot study to evaluate usability and acceptability of the 'Animated Alcohol Assessment Tool' in Russian primary healthcare},
  series = {Digital health},
  volume    = {8},
  journal   = {Digital health},
  publisher = {Sage Publications},
  address   = {London},
  issn      = {2055-2076},
  doi       = {10.1177/20552076211074491},
  pages     = {11},
  year      = {2022},
  abstract  = {Background and aims: Accurate and user-friendly assessment tools quantifying alcohol consumption are a prerequisite to effective prevention and treatment programmes, including Screening and Brief Intervention. Digital tools offer new potential in this field. We developed the 'Animated Alcohol Assessment Tool' (AAA-Tool), a mobile app providing an interactive version of the World Health Organization's Alcohol Use Disorders Identification Test (AUDIT) that facilitates the description of individual alcohol consumption via culturally informed animation features. This pilot study evaluated the Russia-specific version of the Animated Alcohol Assessment Tool with regard to (1) its usability and acceptability in a primary healthcare setting, (2) the plausibility of its alcohol consumption assessment results and (3) the adequacy of its Russia-specific vessel and beverage selection. Methods: Convenience samples of 55 patients (47\% female) and 15 healthcare practitioners (80\% female) in 2 Russian primary healthcare facilities self-administered the Animated Alcohol Assessment Tool and rated their experience on the Mobile Application Rating Scale - User Version. Usage data was automatically collected during app usage, and additional feedback on regional content was elicited in semi-structured interviews. Results: On average, patients completed the Animated Alcohol Assessment Tool in 6:38 min (SD = 2.49, range = 3.00-17.16). User satisfaction was good, with all subscale Mobile Application Rating Scale - User Version scores averaging >3 out of 5 points. A majority of patients (53\%) and practitioners (93\%) would recommend the tool to 'many people' or 'everyone'. Assessed alcohol consumption was plausible, with a low number (14\%) of logically impossible entries. Most patients reported the Animated Alcohol Assessment Tool to reflect all vessels (78\%) and all beverages (71\%) they typically used. Conclusion: High acceptability ratings by patients and healthcare practitioners, acceptable completion time, plausible alcohol usage assessment results and perceived adequacy of region-specific content underline the Animated Alcohol Assessment Tool's potential to provide a novel approach to alcohol assessment in primary healthcare. After its validation, the Animated Alcohol Assessment Tool might contribute to reducing alcohol-related harm by facilitating Screening and Brief Intervention implementation in Russia and beyond.},
  language  = {en}
}
@article{OmranianAngeleskaNikoloski2021,
  author    = {Omranian, Sara and Angeleska, Angela and Nikoloski, Zoran},
  title     = {PC2P},
  series = {Bioinformatics},
  volume    = {37},
  journal   = {Bioinformatics},
  number    = {1},
  publisher = {Oxford Univ. Press},
  address   = {Oxford},
  issn      = {1367-4811},
  doi       = {10.1093/bioinformatics/btaa1089},
  pages     = {73 -- 81},
  year      = {2021},
  abstract  = {Motivation: Prediction of protein complexes from protein-protein interaction (PPI) networks is an important problem in systems biology, as they control different cellular functions. The existing solutions employ algorithms for network community detection that identify dense subgraphs in PPI networks. However, gold standards in yeast and human indicate that protein complexes can also induce sparse subgraphs, introducing further challenges in protein complex prediction. Results: To address this issue, we formalize protein complexes as biclique spanned subgraphs, which include both sparse and dense subgraphs. We then cast the problem of protein complex prediction as a network partitioning into biclique spanned subgraphs with removal of minimum number of edges, called coherent partition. Since finding a coherent partition is a computationally intractable problem, we devise a parameter-free greedy approximation algorithm, termed Protein Complexes from Coherent Partition (PC2P), based on key properties of biclique spanned subgraphs. Through comparison with nine contenders, we demonstrate that PC2P: (i) successfully identifies modular structure in networks, as a prerequisite for protein complex prediction, (ii) outperforms the existing solutions with respect to a composite score of five performance measures on 75\% and 100\% of the analyzed PPI networks and gold standards in yeast and human, respectively, and (iii,iv) does not compromise GO semantic similarity and enrichment score of the predicted protein complexes. Therefore, our study demonstrates that clustering of networks in terms of biclique spanned subgraphs is a promising framework for detection of complexes in PPI networks.},
  language  = {en}
}
@book{ZhangPlauthEberhardtetal.2020,
  author    = {Zhang, Shuhao and Plauth, Max and Eberhardt, Felix and Polze, Andreas and Lehmann, Jens and Sejdiu, Gezim and Jabeen, Hajira and Servadei, Lorenzo and M{\"o}stl, Christian and B{\"a}r, Florian and Netzeband, Andr{\´e} and Schmidt, Rainer and Knigge, Marlene and Hecht, Sonja and Prifti, Loina and Krcmar, Helmut and Sapegin, Andrey and Jaeger, David and Cheng, Feng and Meinel, Christoph and Friedrich, Tobias and Rothenberger, Ralf and Sutton, Andrew M. and Sidorova, Julia A. and Lundberg, Lars and Rosander, Oliver and Sk{\"o}ld, Lars and Di Varano, Igor and van der Walt, Est{\´e}e and Eloff, Jan H. P. and Fabian, Benjamin and Baumann, Annika and Ermakova, Tatiana and Kelkel, Stefan and Choudhary, Yash and Cooray, Thilini and Rodr{\´i}guez, Jorge and Medina-P{\´e}rez, Miguel Angel and Trejo, Luis A. and Barrera-Animas, Ari Yair and Monroy-Borja, Ra{\´u}l and L{\´o}pez-Cuevas, Armando and Ram{\´i}rez-M{\´a}rquez, Jos{\´e} Emmanuel and Grohmann, Maria and Niederleithinger, Ernst and Podapati, Sasidhar and Schmidt, Christopher and Huegle, Johannes and de Oliveira, Roberto C. L. and Soares, F{\´a}bio Mendes and van Hoorn, Andr{\´e} and Neumer, Tamas and Willnecker, Felix and Wilhelm, Mathias and Kuster, Bernhard},
  title     = {HPI Future SOC Lab - Proceedings 2017},
  number    = {130},
  editor    = {Meinel, Christoph and Polze, Andreas and Beins, Karsten and Strotmann, Rolf and Seibold, Ulrich and R{\"o}dszus, Kurt and M{\"u}ller, J{\"u}rgen},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-475-3},
  issn      = {1613-5652},
  doi       = {10.25932/publishup-43310},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-433100},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {ix, 235},
  year      = {2020},
  abstract  = {The "HPI Future SOC Lab" is a cooperation of the Hasso Plattner Institute (HPI) and industry partners. Its mission is to enable and promote exchange and interaction between the research community and the industry partners. The HPI Future SOC Lab provides researchers with free of charge access to a complete infrastructure of state of the art hard and software. This infrastructure includes components, which might be too expensive for an ordinary research environment, such as servers with up to 64 cores and 2 TB main memory. The offerings address researchers particularly from but not limited to the areas of computer science and business information systems. Main areas of research include cloud computing, parallelization, and In-Memory technologies. This technical report presents results of research projects executed in 2017. Selected projects have presented their results on April 25th and November 15th 2017 at the Future SOC Lab Day events.},
  language  = {en}
}
@article{UlrichLutfiRutzenetal.2022,
  author    = {Ulrich, Jens-Uwe and Lutfi, Ahmad and Rutzen, Kilian and Renard, Bernhard Y.},
  title     = {ReadBouncer},
  series = {Bioinformatics},
  volume    = {38},
  journal   = {Bioinformatics},
  number    = {SUPPL 1},
  publisher = {Oxford Univ. Press},
  address   = {Oxford},
  issn      = {1367-4803},
  doi       = {10.1093/bioinformatics/btac223},
  pages     = {153 -- 160},
  year      = {2022},
  abstract  = {Motivation: Nanopore sequencers allow targeted sequencing of interesting nucleotide sequences by rejecting other sequences from individual pores. This feature facilitates the enrichment of low-abundant sequences by depleting overrepresented ones in-silico. Existing tools for adaptive sampling either apply signal alignment, which cannot handle human-sized reference sequences, or apply read mapping in sequence space relying on fast graphical processing units (GPU) base callers for real-time read rejection. Using nanopore long-read mapping tools is also not optimal when mapping shorter reads as usually analyzed in adaptive sampling applications. Results: Here, we present a new approach for nanopore adaptive sampling that combines fast CPU and GPU base calling with read classification based on Interleaved Bloom Filters. ReadBouncer improves the potential enrichment of low abundance sequences by its high read classification sensitivity and specificity, outperforming existing tools in the field. It robustly removes even reads belonging to large reference sequences while running on commodity hardware without GPUs, making adaptive sampling accessible for in-field researchers. Readbouncer also provides a user-friendly interface and installer files for end-users without a bioinformatics background.},
  language  = {en}
}
@article{WittigMirandaHoelzeretal.2022,
  author    = {Wittig, Alice and Miranda, Fabio Malcher and H{\"o}lzer, Martin and Altenburg, Tom and Bartoszewicz, Jakub Maciej and Beyvers, Sebastian and Dieckmann, Marius Alfred and Genske, Ulrich and Giese, Sven Hans-Joachim and Nowicka, Melania and Richard, Hugues and Schiebenhoefer, Henning and Schmachtenberg, Anna-Juliane and Sieben, Paul and Tang, Ming and Tembrockhaus, Julius and Renard, Bernhard Y. and Fuchs, Stephan},
  title     = {CovRadar},
  series = {Bioinformatics},
  volume    = {38},
  journal   = {Bioinformatics},
  number    = {17},
  publisher = {Oxford Univ. Press},
  address   = {Oxford},
  issn      = {1367-4803},
  doi       = {10.1093/bioinformatics/btac411},
  pages     = {4223 -- 4225},
  year      = {2022},
  abstract  = {The ongoing pandemic caused by SARS-CoV-2 emphasizes the importance of genomic surveillance to understand the evolution of the virus, to monitor the viral population, and plan epidemiological responses. Detailed analysis, easy visualization and intuitive filtering of the latest viral sequences are powerful for this purpose. We present CovRadar, a tool for genomic surveillance of the SARS-CoV-2 Spike protein. CovRadar consists of an analytical pipeline and a web application that enable the analysis and visualization of hundreds of thousand sequences. First, CovRadar extracts the regions of interest using local alignment, then builds a multiple sequence alignment, infers variants and consensus and finally presents the results in an interactive app, making accessing and reporting simple, flexible and fast.},
  language  = {en}
}
@article{TrautmannZhouBrahmsetal.2021,
  author    = {Trautmann, Justin and Zhou, Lin and Brahms, Clemens Markus and Tunca, Can and Ersoy, Cem and Granacher, Urs and Arnrich, Bert},
  title     = {TRIPOD},
  series = {Data : open access ʻData in scienceʼ journal},
  volume    = {6},
  journal   = {Data : open access ʻData in scienceʼ journal},
  number    = {9},
  publisher = {MDPI},
  address   = {Basel},
  issn      = {2306-5729},
  doi       = {10.3390/data6090095},
  pages     = {19},
  year      = {2021},
  abstract  = {Inertial measurement units (IMUs) enable easy to operate and low-cost data recording for gait analysis. When combined with treadmill walking, a large number of steps can be collected in a controlled environment without the need of a dedicated gait analysis laboratory. In order to evaluate existing and novel IMU-based gait analysis algorithms for treadmill walking, a reference dataset that includes IMU data as well as reliable ground truth measurements for multiple participants and walking speeds is needed. This article provides a reference dataset consisting of 15 healthy young adults who walked on a treadmill at three different speeds. Data were acquired using seven IMUs placed on the lower body, two different reference systems (Zebris FDMT-HQ and OptoGait), and two RGB cameras. Additionally, in order to validate an existing IMU-based gait analysis algorithm using the dataset, an adaptable modular data analysis pipeline was built. Our results show agreement between the pressure-sensitive Zebris and the photoelectric OptoGait system (r = 0.99), demonstrating the quality of our reference data. As a use case, the performance of an algorithm originally designed for overground walking was tested on treadmill data using the data pipeline. The accuracy of stride length and stride time estimations was comparable to that reported in other studies with overground data, indicating that the algorithm is equally applicable to treadmill data. The Python source code of the data pipeline is publicly available, and the dataset will be provided by the authors upon request, enabling future evaluations of IMU gait analysis algorithms without the need of recording new data.},
  language  = {en}
}
@book{MeinelDoellnerWeskeetal.2021,
  author    = {Meinel, Christoph and D{\"o}llner, J{\"u}rgen Roland Friedrich and Weske, Mathias and Polze, Andreas and Hirschfeld, Robert and Naumann, Felix and Giese, Holger and Baudisch, Patrick and Friedrich, Tobias and B{\"o}ttinger, Erwin and Lippert, Christoph and D{\"o}rr, Christian and Lehmann, Anja and Renard, Bernhard and Rabl, Tilmann and Uebernickel, Falk and Arnrich, Bert and H{\"o}lzle, Katharina},
  title     = {Proceedings of the HPI Research School on Service-oriented Systems Engineering 2020 Fall Retreat},
  number    = {138},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-513-2},
  issn      = {1613-5652},
  doi       = {10.25932/publishup-50413},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-504132},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {vi, 144},
  year      = {2021},
  abstract  = {Design and Implementation of service-oriented architectures imposes a huge number of research questions from the fields of software engineering, system analysis and modeling, adaptability, and application integration. Component orientation and web services are two approaches for design and realization of complex web-based system. Both approaches allow for dynamic application adaptation as well as integration of enterprise application. Service-Oriented Systems Engineering represents a symbiosis of best practices in object-orientation, component-based development, distributed computing, and business process management. It provides integration of business and IT concerns. The annual Ph.D. Retreat of the Research School provides each member the opportunity to present his/her current state of their research and to give an outline of a prospective Ph.D. thesis. Due to the interdisciplinary structure of the research school, this technical report covers a wide range of topics. These include but are not limited to: Human Computer Interaction and Computer Vision as Service; Service-oriented Geovisualization Systems; Algorithm Engineering for Service-oriented Systems; Modeling and Verification of Self-adaptive Service-oriented Systems; Tools and Methods for Software Engineering in Service-oriented Systems; Security Engineering of Service-based IT Systems; Service-oriented Information Systems; Evolutionary Transition of Enterprise Applications to Service Orientation; Operating System Abstractions for Service-oriented Computing; and Services Specification, Composition, and Enactment.},
  language  = {en}
}
@article{DeFreitasJohnsonGoldenetal.2021,
  author    = {De Freitas, Jessica K. and Johnson, Kipp W. and Golden, Eddye and Nadkarni, Girish N. and Dudley, Joel T. and B{\"o}ttinger, Erwin and Glicksberg, Benjamin S. and Miotto, Riccardo},
  title     = {Phe2vec},
  series = {Patterns},
  volume    = {2},
  journal   = {Patterns},
  number    = {9},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {2666-3899},
  doi       = {10.1016/j.patter.2021.100337},
  pages     = {9},
  year      = {2021},
  abstract  = {Robust phenotyping of patients from electronic health records (EHRs) at scale is a challenge in clinical informatics. Here, we introduce Phe2vec, an automated framework for disease phenotyping from EHRs based on unsupervised learning and assess its effectiveness against standard rule-based algorithms from Phenotype KnowledgeBase (PheKB). Phe2vec is based on pre-computing embeddings of medical concepts and patients' clinical history. Disease phenotypes are then derived from a seed concept and its neighbors in the embedding space. Patients are linked to a disease if their embedded representation is close to the disease phenotype. Comparing Phe2vec and PheKB cohorts head-to-head using chart review, Phe2vec performed on par or better in nine out of ten diseases. Differently from other approaches, it can scale to any condition and was validated against widely adopted expert-based standards. Phe2vec aims to optimize clinical informatics research by augmenting current frameworks to characterize patients by condition and derive reliable disease cohorts.},
  language  = {en}
}
@misc{KonigorskiWernickeSlosareketal.2023,
  author    = {Konigorski, Stefan and Wernicke, Sarah and Slosarek, Tamara and Zenner, Alexander Maximilian and Strelow, Nils and Ruether, Darius Ferenc and Henschel, Florian and Manaswini, Manisha and Pottb{\"a}cker, Fabian and Edelman, Jonathan Antonio and Owoyele, Babajide and Danieletto, Matteo and Golden, Eddye and Zweig, Micol and Nadkarni, Girish N. and B{\"o}ttinger, Erwin},
  title     = {StudyU: A Platform for Designing and Conducting Innovative Digital N-of-1 Trials},
  series = {Zweitver{\"o}ffentlichungen der Universit{\"a}t Potsdam : Reihe der Digital Engineering Fakult{\"a}t},
  journal   = {Zweitver{\"o}ffentlichungen der Universit{\"a}t Potsdam : Reihe der Digital Engineering Fakult{\"a}t},
  number    = {12},
  doi       = {10.25932/publishup-58037},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-580370},
  pages     = {12},
  year      = {2023},
  abstract  = {N-of-1 trials are the gold standard study design to evaluate individual treatment effects and derive personalized treatment strategies. Digital tools have the potential to initiate a new era of N-of-1 trials in terms of scale and scope, but fully functional platforms are not yet available. Here, we present the open source StudyU platform, which includes the StudyU Designer and StudyU app. With the StudyU Designer, scientists are given a collaborative web application to digitally specify, publish, and conduct N-of-1 trials. The StudyU app is a smartphone app with innovative user-centric elements for participants to partake in trials published through the StudyU Designer to assess the effects of different interventions on their health. Thereby, the StudyU platform allows clinicians and researchers worldwide to easily design and conduct digital N-of-1 trials in a safe manner. We envision that StudyU can change the landscape of personalized treatments both for patients and healthy individuals, democratize and personalize evidence generation for self-optimization and medicine, and can be integrated in clinical practice.},
  language  = {en}
}
@article{FreitasdaCruzPfahringerMartensenetal.2021,
  author    = {Freitas da Cruz, Harry and Pfahringer, Boris and Martensen, Tom and Schneider, Frederic and Meyer, Alexander and B{\"o}ttinger, Erwin and Schapranow, Matthieu-Patrick},
  title     = {Using interpretability approaches to update "black-box" clinical prediction models},
  series = {Artificial intelligence in medicine : AIM},
  volume    = {111},
  journal   = {Artificial intelligence in medicine : AIM},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0933-3657},
  doi       = {10.1016/j.artmed.2020.101982},
  pages     = {13},
  year      = {2021},
  abstract  = {Despite advances in machine learning-based clinical prediction models, only few of such models are actually deployed in clinical contexts. Among other reasons, this is due to a lack of validation studies. In this paper, we present and discuss the validation results of a machine learning model for the prediction of acute kidney injury in cardiac surgery patients initially developed on the MIMIC-III dataset when applied to an external cohort of an American research hospital. To help account for the performance differences observed, we utilized interpretability methods based on feature importance, which allowed experts to scrutinize model behavior both at the global and local level, making it possible to gain further insights into why it did not behave as expected on the validation cohort. The knowledge gleaned upon derivation can be potentially useful to assist model update during validation for more generalizable and simpler models. We argue that interpretability methods should be considered by practitioners as a further tool to help explain performance differences and inform model update in validation studies.},
  language  = {en}
}
@book{AdrianoBleifussChengetal.2019,
  author    = {Adriano, Christian and Bleifuß, Tobias and Cheng, Lung-Pan and Diba, Kiarash and Fricke, Andreas and Grapentin, Andreas and Jiang, Lan and Kovacs, Robert and Krejca, Martin Stefan and Mandal, Sankalita and Marwecki, Sebastian and Matthies, Christoph and Mattis, Toni and Niephaus, Fabio and Pirl, Lukas and Quinzan, Francesco and Ramson, Stefan and Rezaei, Mina and Risch, Julian and Rothenberger, Ralf and Roumen, Thijs and Stojanovic, Vladeta and Wolf, Johannes},
  title     = {Technical report},
  number    = {129},
  editor    = {Meinel, Christoph and Plattner, Hasso and D{\"o}llner, J{\"u}rgen Roland Friedrich and Weske, Mathias and Polze, Andreas and Hirschfeld, Robert and Naumann, Felix and Giese, Holger and Baudisch, Patrick and Friedrich, Tobias and B{\"o}ttinger, Erwin and Lippert, Christoph},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-465-4},
  issn      = {1613-5652},
  doi       = {10.25932/publishup-42753},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-427535},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {vi, 267},
  year      = {2019},
  abstract  = {Design and Implementation of service-oriented architectures imposes a huge number of research questions from the fields of software engineering, system analysis and modeling, adaptability, and application integration. Component orientation and web services are two approaches for design and realization of complex web-based system. Both approaches allow for dynamic application adaptation as well as integration of enterprise application. Commonly used technologies, such as J2EE and .NET, form de facto standards for the realization of complex distributed systems. Evolution of component systems has lead to web services and service-based architectures. This has been manifested in a multitude of industry standards and initiatives such as XML, WSDL UDDI, SOAP, etc. All these achievements lead to a new and promising paradigm in IT systems engineering which proposes to design complex software solutions as collaboration of contractually defined software services. Service-Oriented Systems Engineering represents a symbiosis of best practices in object-orientation, component-based development, distributed computing, and business process management. It provides integration of business and IT concerns. The annual Ph.D. Retreat of the Research School provides each member the opportunity to present his/her current state of their research and to give an outline of a prospective Ph.D. thesis. Due to the interdisciplinary structure of the research school, this technical report covers a wide range of topics. These include but are not limited to: Human Computer Interaction and Computer Vision as Service; Service-oriented Geovisualization Systems; Algorithm Engineering for Service-oriented Systems; Modeling and Verification of Self-adaptive Service-oriented Systems; Tools and Methods for Software Engineering in Service-oriented Systems; Security Engineering of Service-based IT Systems; Service-oriented Information Systems; Evolutionary Transition of Enterprise Applications to Service Orientation; Operating System Abstractions for Service-oriented Computing; and Services Specification, Composition, and Enactment.},
  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     = {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/bbab134},
  pages     = {17},
  year      = {2021},
  abstract  = {Precision oncology is a rapidly evolving interdisciplinary medical specialty. Comprehensive cancer panels are becoming increasingly available at pathology departments worldwide, creating the urgent need for scalable cancer variant annotation and molecularly informed treatment recommendations. A wealth of mainly academia-driven knowledge bases calls for software tools supporting the multi-step diagnostic process. We derive a comprehensive list of knowledge bases relevant for variant interpretation by a review of existing literature followed by a survey among medical experts from university hospitals in Germany. In addition, we review cancer variant interpretation tools, which integrate multiple knowledge bases. We categorize the knowledge bases along the diagnostic process in precision oncology and analyze programmatic access options as well as the integration of knowledge bases into software tools. The most commonly used knowledge bases provide good programmatic access options and have been integrated into a range of software tools. For the wider set of knowledge bases, access options vary across different parts of the diagnostic process. Programmatic access is limited for information regarding clinical classifications of variants and for therapy recommendations. The main issue for databases used for biological classification of pathogenic variants and pathway context information is the lack of standardized interfaces. There is no single cancer variant interpretation tool that integrates all identified knowledge bases. Specialized tools are available and need to be further developed for different steps in the diagnostic process.},
  language  = {en}
}
@article{XinYingTiberiusAlnooretal.2024,
  author    = {XinYing, Chew and Tiberius, Victor and Alnoor, Alhamzah and Camilleri, Mark and Khaw, Khai Wah},
  title     = {The dark side of metaverse: a multi-perspective of deviant behaviors from PLS-SEM and fsQCA findings},
  series = {International journal of human-computer interaction},
  journal   = {International journal of human-computer interaction},
  publisher = {Taylor \& Francis},
  address   = {London},
  issn      = {1044-7318},
  doi       = {10.1080/10447318.2024.2331875},
  pages     = {21},
  year      = {2024},
  abstract  = {The metaverse has created a huge buzz of interest because such a phenomenon is emerging. The behavioral aspect of the metaverse includes user engagement and deviant behaviors in the metaverse. Such technology has brought various dangers to individuals and society. There are growing cases reported of sexual abuse, racism, harassment, hate speech, and bullying because of online disinhibition make us feel more relaxed. This study responded to the literature call by investigating the effect of technical and social features through mediating roles of security and privacy on deviant behaviors in the metaverse. The data collected from virtual network users reached 1121 respondents. Partial Least Squares based structural equation modeling (PLS-SEM) and fuzzy set Qualitative Comparative Analysis (fsQCA) were used. PLS-SEM results revealed that social features such as user-to-user interaction, homophily, social ties, and social identity, and technical design such as immersive experience and invisibility significantly affect users' deviant behavior in the metaverse. The fsQCA results provided insights into the multiple causal solutions and configurations. This study is exceptional because it provided decisive results by understanding the deviant behavior of users based on the symmetrical and asymmetrical approach to virtual networks.},
  language  = {en}
}
@inproceedings{GundlachAbramova2021,
  author    = {Gundlach, Jana and Abramova, Olga},
  title     = {Newsfeed clutter as an inhibitor of sensemaking},
  series = {AMCIS Proceedings 2021},
  booktitle = {AMCIS Proceedings 2021},
  publisher = {AIS},
  address   = {Atlanta},
  isbn      = {978-1-7336325-8-4},
  pages     = {10},
  year      = {2021},
  abstract  = {As a central functionality of SNSs, the newsfeed is responsible for the way, how content is presented. This paper investigates the implications of current content presentation on Facebook, which has appeared to be a matter of users' criticism. Leaning on the communication theory, we conceptualize clutter on a newsfeed as noise that hinders the receiver's adequate message decoding (i.e., sensemaking). We further operationalize newsfeed clutter via perceived disorder, information overload, and system feature overload. Our participants browsed their Facebook newsfeed for at least 5 minutes. The follow-up survey results provide partial support for our hypotheses, with only perceived disorder significantly associated with lower sensemaking. These findings shed new light on user experience and underpin the importance of SNSs as communication systems, adding to the existent literature on the dark sides of social media.},
  language  = {en}
}
@article{KuehlerDrathschmidtGrossmann2024,
  author    = {K{\"u}hler, Jakob and Drathschmidt, Nicolas and Großmann, Daniela},
  title     = {'Modern talking'},
  series = {Information polity},
  volume    = {29},
  journal   = {Information polity},
  number    = {2},
  publisher = {IOS Press},
  address   = {Amsterdam},
  issn      = {1570-1255},
  doi       = {10.3233/IP-230059},
  pages     = {199 -- 216},
  year      = {2024},
  abstract  = {Despite growing interest, we lack a clear understanding of how the arguably ambiguous phenomenon of agile is perceived in government practice. This study aims to alleviate this puzzle by investigating how managers and employees in German public sector organisations make sense of agile as a spreading management fashion in the form of narratives. This is important because narratives function as innovation carriers that ultimately influence the manifestations of the concept in organisations. Based on a multi-case study of 31 interviews and 24 responses to a qualitative online survey conducted in 2021 and 2022, we provide insights into what public sector managers, employees and consultants understand (and, more importantly, do not understand) as agile and how they weave it into their existing reality of bureaucratic organisations. We uncover three meta-narratives of agile government, which we label 'renew', 'complement' and 'integrate'. In particular, the meta-narratives differ in their positioning of how agile interacts with the characteristics of bureaucratic organisations. Importantly, we also show that agile as a management fad serves as a projection surface for what actors want from a modern and digital organisation. Thus, the vocabulary of agile government within the narratives is inherently linked to other diffusing phenomena such as new work or digitalisation.},
  language  = {en}
}
@inproceedings{Brinkmann2021,
  author    = {Brinkmann, Maik},
  title     = {Relevance of public administrations},
  series = {Proceedings of the 54th Hawaii International Conference on System Sciences 2021},
  booktitle = {Proceedings of the 54th Hawaii International Conference on System Sciences 2021},
  publisher = {University of Hawaiʻi at Mānoa},
  address   = {Honolulu, HI},
  isbn      = {978-0-9981331-4-0},
  doi       = {10.24251/HICSS.2021.285},
  pages     = {10},
  year      = {2021},
  abstract  = {Power relations within the area of blockchain governance are complex by definition and a comprehensive analysis that links technological and institutional elements is missing to date. The research that is presented with this article focuses on the visualization of the shifting power relations with the introduction of blockchain. For this purpose, the analysis leverages an adjusted version of the multi-stakeholder influence mapping tool. The analysis considers the various stakeholders within the multi-layered blockchain technology stack and compares three fundamental blockchain scenarios, including public and private blockchain settings. The findings show that public administrations face indeed less power with the introduction of blockchain, while new stakeholders come into play who wield influence rather uncontrolled. Nonetheless, public administrations are not powerless overall and remain influential stakeholders. This paper concludes that blockchain governance is not as democratic as blockchain enthusiasts tend to argue and derives corresponding opportunities for further research.},
  language  = {en}
}
@phdthesis{Hecher2021,
  author    = {Hecher, Markus},
  title     = {Advanced tools and methods for treewidth-based problem solving},
  doi       = {10.25932/publishup-51251},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-512519},
  school      = {Universit{\"a}t Potsdam},
  pages     = {xv, 184},
  year      = {2021},
  abstract  = {In the last decades, there was a notable progress in solving the well-known Boolean satisfiability (Sat) problem, which can be witnessed by powerful Sat solvers. One of the reasons why these solvers are so fast are structural properties of instances that are utilized by the solver's interna. This thesis deals with the well-studied structural property treewidth, which measures the closeness of an instance to being a tree. In fact, there are many problems parameterized by treewidth that are solvable in polynomial time in the instance size when parameterized by treewidth. In this work, we study advanced treewidth-based methods and tools for problems in knowledge representation and reasoning (KR). Thereby, we provide means to establish precise runtime results (upper bounds) for canonical problems relevant to KR. Then, we present a new type of problem reduction, which we call decomposition-guided (DG) that allows us to precisely monitor the treewidth when reducing from one problem to another problem. This new reduction type will be the basis for a long-open lower bound result for quantified Boolean formulas and allows us to design a new methodology for establishing runtime lower bounds for problems parameterized by treewidth. Finally, despite these lower bounds, we provide an efficient implementation of algorithms that adhere to treewidth. Our approach finds suitable abstractions of instances, which are subsequently refined in a recursive fashion, and it uses Sat solvers for solving subproblems. It turns out that our resulting solver is quite competitive for two canonical counting problems related to Sat.},
  language  = {en}
}
@article{SchneiderWenigPapenbrock2021,
  author    = {Schneider, Johannes and Wenig, Phillip and Papenbrock, Thorsten},
  title     = {Distributed detection of sequential anomalies in univariate time series},
  series = {The VLDB journal : the international journal on very large data bases},
  volume    = {30},
  journal   = {The VLDB journal : the international journal on very large data bases},
  number    = {4},
  publisher = {Springer},
  address   = {Berlin},
  issn      = {1066-8888},
  doi       = {10.1007/s00778-021-00657-6},
  pages     = {579 -- 602},
  year      = {2021},
  abstract  = {The automated detection of sequential anomalies in time series is an essential task for many applications, such as the monitoring of technical systems, fraud detection in high-frequency trading, or the early detection of disease symptoms. All these applications require the detection to find all sequential anomalies possibly fast on potentially very large time series. In other words, the detection needs to be effective, efficient and scalable w.r.t. the input size. Series2Graph is an effective solution based on graph embeddings that are robust against re-occurring anomalies and can discover sequential anomalies of arbitrary length and works without training data. Yet, Series2Graph is no t scalable due to its single-threaded approach; it cannot, in particular, process arbitrarily large sequences due to the memory constraints of a single machine. In this paper, we propose our distributed anomaly detection system, short DADS, which is an efficient and scalable adaptation of Series2Graph. Based on the actor programming model, DADS distributes the input time sequence, intermediate state and the computation to all processors of a cluster in a way that minimizes communication costs and synchronization barriers. Our evaluation shows that DADS is orders of magnitude faster than S2G, scales almost linearly with the number of processors in the cluster and can process much larger input sequences due to its scale-out property.},
  language  = {en}
}
@book{JuizBermejoCalleetal.2024,
  author    = {Juiz, Carlos and Bermejo, Belen and Calle, Alejandro and Sidorova, Julia and Lundberg, Lars and Weidmann, Vera and Lowitzki, Leon and Mirtschin, Marvin and Hoorn, Andr{\´e} van and Frank, Markus and Schulz, Henning and Stojanovic, Dragan and Stojanovic, Natalija and Stojnev Ilic, Aleksandra and Friedrich, Tobias and Lenzner, Pascal and Weyand, Christopher and Wagner, Markus and Plauth, Max and Polze, Andreas and Nowicki, Marek and Seth, Sugandh and Kaur Chahal, Kuljit and Singh, Gurwinder and Speth, Sandro and Janes, Andrea and Camilli, Matteo and Ziegler, Erik and Schmidberger, Marcel and P{\"o}rschke, Mats and Bartz, Christian and Lorenz, Martin and Meinel, Christoph and Beilich, Robert and Bertazioli, Dario and Carlomagno, Cristiano and Bedoni, Marzia and Messina, Vincenzina},
  title     = {HPI Future SOC Lab},
  series = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Digital Engineering an der Universit{\"a}t Potsdam},
  journal   = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Digital Engineering an der Universit{\"a}t Potsdam},
  number    = {159},
  editor    = {Meinel, Christoph and Polze, Andreas and Beins, Karsten and Strotmann, Rolf and Seibold, Ulrich and R{\"o}dszus, Kurt and M{\"u}ller, J{\"u}rgen and Sommer, J{\"u}rgen},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-565-1},
  issn      = {1613-5652},
  doi       = {10.25932/publishup-59801},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-598014},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {ix, 142},
  year      = {2024},
  abstract  = {The "HPI Future SOC Lab" is a cooperation of the Hasso Plattner Institute (HPI) and industry partners. Its mission is to enable and promote exchange and interaction between the research community and the industry partners. The HPI Future SOC Lab provides researchers with free of charge access to a complete infrastructure of state of the art hard and software. This infrastructure includes components, which might be too expensive for an ordinary research environment, such as servers with up to 64 cores and 2 TB main memory. The offerings address researchers particularly from but not limited to the areas of computer science and business information systems. Main areas of research include cloud computing, parallelization, and In-Memory technologies. This technical report presents results of research projects executed in 2020. Selected projects have presented their results on April 21st and November 10th 2020 at the Future SOC Lab Day events.},
  language  = {en}
}
@phdthesis{Thiele2011,
  author    = {Thiele, Sven},
  title     = {Modeling biological systems with Answer Set Programming},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-59383},
  school      = {Universit{\"a}t Potsdam},
  year      = {2011},
  abstract  = {Biology has made great progress in identifying and measuring the building blocks of life. The availability of high-throughput methods in molecular biology has dramatically accelerated the growth of biological knowledge for various organisms. The advancements in genomic, proteomic and metabolomic technologies allow for constructing complex models of biological systems. An increasing number of biological repositories is available on the web, incorporating thousands of biochemical reactions and genetic regulations. Systems Biology is a recent research trend in life science, which fosters a systemic view on biology. In Systems Biology one is interested in integrating the knowledge from all these different sources into models that capture the interaction of these entities. By studying these models one wants to understand the emerging properties of the whole system, such as robustness. However, both measurements as well as biological networks are prone to considerable incompleteness, heterogeneity and mutual inconsistency, which makes it highly non-trivial to draw biologically meaningful conclusions in an automated way. Therefore, we want to promote Answer Set Programming (ASP) as a tool for discrete modeling in Systems Biology. ASP is a declarative problem solving paradigm, in which a problem is encoded as a logic program such that its answer sets represent solutions to the problem. ASP has intrinsic features to cope with incompleteness, offers a rich modeling language and highly efficient solving technology. We present ASP solutions, for the analysis of genetic regulatory networks, determining consistency with observed measurements and identifying minimal causes for inconsistency. We extend this approach for computing minimal repairs on model and data that restore consistency. This method allows for predicting unobserved data even in case of inconsistency. Further, we present an ASP approach to metabolic network expansion. This approach exploits the easy characterization of reachability in ASP and its various reasoning methods, to explore the biosynthetic capabilities of metabolic reaction networks and generate hypotheses for extending the network. Finally, we present the BioASP library, a Python library which encapsulates our ASP solutions into the imperative programming paradigm. The library allows for an easy integration of ASP solution into system rich environments, as they exist in Systems Biology.},
  language  = {en}
}
@phdthesis{Floeter2005,
  author    = {Fl{\"o}ter, Andr{\´e}},
  title     = {Analyzing biological expression data based on decision tree induction},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-6416},
  school      = {Universit{\"a}t Potsdam},
  year      = {2005},
  abstract  = {Modern biological analysis techniques supply scientists with various forms of data. One category of such data are the so called "expression data". These data indicate the quantities of biochemical compounds present in tissue samples. Recently, expression data can be generated at a high speed. This leads in turn to amounts of data no longer analysable by classical statistical techniques. Systems biology is the new field that focuses on the modelling of this information. At present, various methods are used for this purpose. One superordinate class of these meth­ods is machine learning. Methods of this kind had, until recently, predominantly been used for classification and prediction tasks. This neglected a powerful secondary benefit: the ability to induce interpretable models. Obtaining such models from data has become a key issue within Systems biology. Numerous approaches have been proposed and intensively discussed. This thesis focuses on the examination and exploitation of one basic technique: decision trees. The concept of comparing sets of decision trees is developed. This method offers the pos­sibility of identifying significant thresholds in continuous or discrete valued attributes through their corresponding set of decision trees. Finding significant thresholds in attributes is a means of identifying states in living organisms. Knowing about states is an invaluable clue to the un­derstanding of dynamic processes in organisms. Applied to metabolite concentration data, the proposed method was able to identify states which were not found with conventional techniques for threshold extraction. A second approach exploits the structure of sets of decision trees for the discovery of com­binatorial dependencies between attributes. Previous work on this issue has focused either on expensive computational methods or the interpretation of single decision trees ­ a very limited exploitation of the data. This has led to incomplete or unstable results. That is why a new method is developed that uses sets of decision trees to overcome these limitations. Both the introduced methods are available as software tools. They can be applied consecu­tively or separately. That way they make up a package of analytical tools that usefully supplement existing methods. By means of these tools, the newly introduced methods were able to confirm existing knowl­edge and to suggest interesting and new relationships between metabolites.},
  subject      = {Molekulare Bioinformatik},
  language  = {en}
}
@phdthesis{Gebser2011,
  author    = {Gebser, Martin},
  title     = {Proof theory and algorithms for answer set programming},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-55425},
  school      = {Universit{\"a}t Potsdam},
  year      = {2011},
  abstract  = {Answer Set Programming (ASP) is an emerging paradigm for declarative programming, in which a computational problem is specified by a logic program such that particular models, called answer sets, match solutions. ASP faces a growing range of applications, demanding for high-performance tools able to solve complex problems. ASP integrates ideas from a variety of neighboring fields. In particular, automated techniques to search for answer sets are inspired by Boolean Satisfiability (SAT) solving approaches. While the latter have firm proof-theoretic foundations, ASP lacks formal frameworks for characterizing and comparing solving methods. Furthermore, sophisticated search patterns of modern SAT solvers, successfully applied in areas like, e.g., model checking and verification, are not yet established in ASP solving. We address these deficiencies by, for one, providing proof-theoretic frameworks that allow for characterizing, comparing, and analyzing approaches to answer set computation. For another, we devise modern ASP solving algorithms that integrate and extend state-of-the-art techniques for Boolean constraint solving. We thus contribute to the understanding of existing ASP solving approaches and their interconnections as well as to their enhancement by incorporating sophisticated search patterns. The central idea of our approach is to identify atomic as well as composite constituents of a propositional logic program with Boolean variables. This enables us to describe fundamental inference steps, and to selectively combine them in proof-theoretic characterizations of various ASP solving methods. In particular, we show that different concepts of case analyses applied by existing ASP solvers implicate mutual exponential separations regarding their best-case complexities. We also develop a generic proof-theoretic framework amenable to language extensions, and we point out that exponential separations can likewise be obtained due to case analyses on them. We further exploit fundamental inference steps to derive Boolean constraints characterizing answer sets. They enable the conception of ASP solving algorithms including search patterns of modern SAT solvers, while also allowing for direct technology transfers between the areas of ASP and SAT solving. Beyond the search for one answer set of a logic program, we address the enumeration of answer sets and their projections to a subvocabulary, respectively. The algorithms we develop enable repetition-free enumeration in polynomial space without being intrusive, i.e., they do not necessitate any modifications of computations before an answer set is found. Our approach to ASP solving is implemented in clasp, a state-of-the-art Boolean constraint solver that has successfully participated in recent solver competitions. Although we do here not address the implementation techniques of clasp or all of its features, we present the principles of its success in the context of ASP solving.},
  language  = {en}
}
@misc{OstrowskiSchaub2012,
  author    = {Ostrowski, Max and Schaub, Torsten},
  title     = {ASP modulo CSP},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  number    = {579},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-41390},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-413908},
  pages     = {19},
  year      = {2012},
  abstract  = {We present the hybrid ASP solver clingcon, combining the simple modeling language and the high performance Boolean solving capacities of Answer Set Programming (ASP) with techniques for using non-Boolean constraints from the area of Constraint Programming (CP). The new clingcon system features an extended syntax supporting global constraints and optimize statements for constraint variables. The major technical innovation improves the interaction between ASP and CP solver through elaborated learning techniques based on irreducible inconsistent sets. A broad empirical evaluation shows that these techniques yield a performance improvement of an order of magnitude.},
  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 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}
}
@phdthesis{Richly2024,
  author    = {Richly, Keven},
  title     = {Memory-efficient data management for spatio-temporal applications},
  doi       = {10.25932/publishup-63547},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-635473},
  school      = {Universit{\"a}t Potsdam},
  pages     = {xii, 181},
  year      = {2024},
  abstract  = {The wide distribution of location-acquisition technologies means that large volumes of spatio-temporal data are continuously being accumulated. Positioning systems such as GPS enable the tracking of various moving objects' trajectories, which are usually represented by a chronologically ordered sequence of observed locations. The analysis of movement patterns based on detailed positional information creates opportunities for applications that can improve business decisions and processes in a broad spectrum of industries (e.g., transportation, traffic control, or medicine). Due to the large data volumes generated in these applications, the cost-efficient storage of spatio-temporal data is desirable, especially when in-memory database systems are used to achieve interactive performance requirements. To efficiently utilize the available 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 structures). By considering horizontal data partitioning, we can independently apply different tuning options on a fine-grained level. 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 thesis, we introduce multiple approaches to improve spatio-temporal data management by automatically optimizing diverse tuning options for the application-specific access patterns and data characteristics. Our contributions are as follows: (1) We introduce a novel approach to determine fine-grained table configurations for spatio-temporal workloads. Our linear programming (LP) approach jointly optimizes the (i) data compression, (ii) ordering, (iii) indexing, and (iv) tiering. We propose different models which address cost dependencies at different levels of accuracy to compute optimized tuning configurations for a given workload, memory budgets, and data characteristics. To yield maintainable and robust configurations, we further extend our LP-based approach to incorporate reconfiguration costs as well as optimizations for multiple potential workload scenarios. (2) To optimize the storage layout of timestamps in columnar databases, we present a heuristic approach for the workload-driven combined selection of a data layout and compression scheme. By considering attribute decomposition strategies, we are able to apply application-specific optimizations that reduce the memory footprint and improve performance. (3) We introduce an approach that leverages past trajectory data to improve the dispatch processes of transportation network companies. Based on location probabilities, we developed risk-averse dispatch strategies that reduce critical delays. (4) Finally, we used the use case of a transportation network company to evaluate our database optimizations on a real-world dataset. We demonstrate that workload-driven fine-grained optimizations allow us to reduce the memory footprint (up to 71\% by equal performance) or increase the performance (up to 90\% by equal memory size) compared to established rule-based heuristics. Individually, our contributions provide novel approaches to the current challenges in spatio-temporal data mining and database research. Combining them allows in-memory databases to store and process spatio-temporal data more cost-efficiently.},
  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}
}
@phdthesis{Lindauer2014,
  author    = {Lindauer, T. Marius},
  title     = {Algorithm selection, scheduling and configuration of Boolean constraint solvers},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-71260},
  school      = {Universit{\"a}t Potsdam},
  pages     = {ii, 130},
  year      = {2014},
  abstract  = {Boolean constraint solving technology has made tremendous progress over the last decade, leading to industrial-strength solvers, for example, in the areas of answer set programming (ASP), the constraint satisfaction problem (CSP), propositional satisfiability (SAT) and satisfiability of quantified Boolean formulas (QBF). However, in all these areas, there exist multiple solving strategies that work well on different applications; no strategy dominates all other strategies. Therefore, no individual solver shows robust state-of-the-art performance in all kinds of applications. Additionally, the question arises how to choose a well-performing solving strategy for a given application; this is a challenging question even for solver and domain experts. One way to address this issue is the use of portfolio solvers, that is, a set of different solvers or solver configurations. We present three new automatic portfolio methods: (i) automatic construction of parallel portfolio solvers (ACPP) via algorithm configuration,(ii) solving the \$NP\$-hard problem of finding effective algorithm schedules with Answer Set Programming (aspeed), and (iii) a flexible algorithm selection framework (claspfolio2) allowing for fair comparison of different selection approaches. All three methods show improved performance and robustness in comparison to individual solvers on heterogeneous instance sets from many different applications. Since parallel solvers are important to effectively solve hard problems on parallel computation systems (e.g., multi-core processors), we extend all three approaches to be effectively applicable in parallel settings. We conducted extensive experimental studies different instance sets from ASP, CSP, MAXSAT, Operation Research (OR), SAT and QBF that indicate an improvement in the state-of-the-art solving heterogeneous instance sets. Last but not least, from our experimental studies, we deduce practical advice regarding the question when to apply which of our methods.},
  language  = {en}
}
@article{FandinoLaferriereRomeroetal.2021,
  author    = {Fandi{\~n}o, Jorge and Laferriere, Francois and Romero, Javier and Schaub, Torsten and Son, Tran Cao},
  title     = {Planning with incomplete information in quantified answer set programming},
  series = {Theory and practice of logic programming},
  volume    = {21},
  journal   = {Theory and practice of logic programming},
  number    = {5},
  publisher = {Cambridge University Press},
  address   = {Cambridge},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068421000259},
  pages     = {663 -- 679},
  year      = {2021},
  abstract  = {We present a general approach to planning with incomplete information in Answer Set Programming (ASP). More precisely, we consider the problems of conformant and conditional planning with sensing actions and assumptions. We represent planning problems using a simple formalism where logic programs describe the transition function between states, the initial states and the goal states. For solving planning problems, we use Quantified Answer Set Programming (QASP), an extension of ASP with existential and universal quantifiers over atoms that is analogous to Quantified Boolean Formulas (QBFs). We define the language of quantified logic programs and use it to represent the solutions different variants of conformant and conditional planning. On the practical side, we present a translation-based QASP solver that converts quantified logic programs into QBFs and then executes a QBF solver, and we evaluate experimentally the approach on conformant and conditional planning benchmarks.},
  language  = {en}
}
@misc{DworschakGrellNikiforovaetal.2008,
  author    = {Dworschak, Steve and Grell, Susanne and Nikiforova, Victoria J. and Schaub, Torsten and Selbig, Joachim},
  title     = {Modeling biological networks by action languages via answer set programming},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch Naturwissenschaftliche Reihe},
  number    = {843},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-42984},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-429846},
  pages     = {47},
  year      = {2008},
  abstract  = {We describe an approach to modeling biological networks by action languages via answer set programming. To this end, we propose an action language for modeling biological networks, building on previous work by Baral et al. We introduce its syntax and semantics along with a translation into answer set programming, an efficient Boolean Constraint Programming Paradigm. Finally, we describe one of its applications, namely, the sulfur starvation response-pathway of the model plant Arabidopsis thaliana and sketch the functionality of our system and its usage.},
  language  = {en}
}
@misc{GebserSchaubThieleetal.2011,
  author    = {Gebser, Martin and Schaub, Torsten and Thiele, Sven and Veber, Philippe},
  title     = {Detecting inconsistencies in large biological networks with answer set programming},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  number    = {561},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-41246},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-412467},
  pages     = {38},
  year      = {2011},
  abstract  = {We introduce an approach to detecting inconsistencies in large biological networks by using answer set programming. To this end, we build upon a recently proposed notion of consistency between biochemical/genetic reactions and high-throughput profiles of cell activity. We then present an approach based on answer set programming to check the consistency of large-scale data sets. Moreover, we extend this methodology to provide explanations for inconsistencies by determining minimal representations of conflicts. In practice, this can be used to identify unreliable data or to indicate missing reactions.},
  language  = {en}
}
@misc{BanbaraSohTamuraetal.2013,
  author    = {Banbara, Mutsunori and Soh, Takehide and Tamura, Naoyuki and Inoue, Katsumi and Schaub, Torsten},
  title     = {Answer set programming as a modeling language for course timetabling},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch Naturwissenschaftliche Reihe},
  number    = {594},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-41546},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-415469},
  pages     = {783 -- 798},
  year      = {2013},
  abstract  = {The course timetabling problem can be generally defined as the task of assigning a number of lectures to a limited set of timeslots and rooms, subject to a given set of hard and soft constraints. The modeling language for course timetabling is required to be expressive enough to specify a wide variety of soft constraints and objective functions. Furthermore, the resulting encoding is required to be extensible for capturing new constraints and for switching them between hard and soft, and to be flexible enough to deal with different formulations. In this paper, we propose to make effective use of ASP as a modeling language for course timetabling. We show that our ASP-based approach can naturally satisfy the above requirements, through an ASP encoding of the curriculum-based course timetabling problem proposed in the third track of the second international timetabling competition (ITC-2007). Our encoding is compact and human-readable, since each constraint is individually expressed by either one or two rules. Each hard constraint is expressed by using integrity constraints and aggregates of ASP. Each soft constraint S is expressed by rules in which the head is the form of penalty (S, V, C), and a violation V and its penalty cost C are detected and calculated respectively in the body. We carried out experiments on four different benchmark sets with five different formulations. We succeeded either in improving the bounds or producing the same bounds for many combinations of problem instances and formulations, compared with the previous best known bounds.},
  language  = {en}
}
@misc{KaminskiSchaubSiegeletal.2013,
  author    = {Kaminski, Roland and Schaub, Torsten and Siegel, Anne and Videla, Santiago},
  title     = {Minimal intervention strategies in logical signaling networks with ASP},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch Naturwissenschaftliche Reihe},
  number    = {4-5},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-41570},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-415704},
  pages     = {675 -- 690},
  year      = {2013},
  abstract  = {Proposing relevant perturbations to biological signaling networks is central to many problems in biology and medicine because it allows for enabling or disabling certain biological outcomes. In contrast to quantitative methods that permit fine-grained (kinetic) analysis, qualitative approaches allow for addressing large-scale networks. This is accomplished by more abstract representations such as logical networks. We elaborate upon such a qualitative approach aiming at the computation of minimal interventions in logical signaling networks relying on Kleene's three-valued logic and fixpoint semantics. We address this problem within answer set programming and show that it greatly outperforms previous work using dedicated algorithms.},
  language  = {en}
}
@misc{HoosLindauerSchaub2014,
  author    = {Hoos, Holger and Lindauer, Marius and Schaub, Torsten},
  title     = {claspfolio 2},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  number    = {606},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-41612},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-416129},
  pages     = {17},
  year      = {2014},
  abstract  = {Building on the award-winning, portfolio-based ASP solver claspfolio, we present claspfolio 2, a modular and open solver architecture that integrates several different portfolio-based algorithm selection approaches and techniques. The claspfolio 2 solver framework supports various feature generators, solver selection approaches, solver portfolios, as well as solver-schedule-based pre-solving techniques. The default configuration of claspfolio 2 relies on a light-weight version of the ASP solver clasp to generate static and dynamic instance features. The flexible open design of claspfolio 2 is a distinguishing factor even beyond ASP. As such, it provides a unique framework for comparing and combining existing portfolio-based algorithm selection approaches and techniques in a single, unified framework. Taking advantage of this, we conducted an extensive experimental study to assess the impact of different feature sets, selection approaches and base solver portfolios. In addition to gaining substantial insights into the utility of the various approaches and techniques, we identified a default configuration of claspfolio 2 that achieves substantial performance gains not only over clasp's default configuration and the earlier version of claspfolio, but also over manually tuned configurations of clasp.},
  language  = {en}
}
@misc{GebserHarrisonKaminskietal.2015,
  author    = {Gebser, Martin and Harrison, Amelia and Kaminski, Roland and Lifschitz, Vladimir and Schaub, Torsten},
  title     = {Abstract gringo},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  number    = {592},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-41475},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-414751},
  pages     = {15},
  year      = {2015},
  abstract  = {This paper defines the syntax and semantics of the input language of the ASP grounder gringo. The definition covers several constructs that were not discussed in earlier work on the semantics of that language, including intervals, pools, division of integers, aggregates with non-numeric values, and lparse-style aggregate expressions. The definition is abstract in the sense that it disregards some details related to representing programs by strings of ASCII characters. It serves as a specification for gringo from Version 4.5 on.},
  language  = {en}
}
@article{SchaubWoltran2018,
  author    = {Schaub, Torsten and Woltran, Stefan},
  title     = {Answer set programming unleashed!},
  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-0550-z},
  pages     = {105 -- 108},
  year      = {2018},
  abstract  = {Answer Set Programming faces an increasing popularity for problem solving in various domains. While its modeling language allows us to express many complex problems in an easy way, its solving technology enables their effective resolution. In what follows, we detail some of the key factors of its success. Answer Set Programming [ASP; Brewka et al. Commun ACM 54(12):92-103, (2011)] is seeing a rapid proliferation in academia and industry due to its easy and flexible way to model and solve knowledge-intense combinatorial (optimization) problems. To this end, ASP offers a high-level modeling language paired with high-performance solving technology. As a result, ASP systems provide out-off-the-box, general-purpose search engines that allow for enumerating (optimal) solutions. They are represented as answer sets, each being a set of atoms representing a solution. The declarative approach of ASP allows a user to concentrate on a problem's specification rather than the computational means to solve it. This makes ASP a prime candidate for rapid prototyping and an attractive tool for teaching key AI techniques since complex problems can be expressed in a succinct and elaboration tolerant way. This is eased by the tuning of ASP's modeling language to knowledge representation and reasoning (KRR). The resulting impact is nicely reflected by a growing range of successful applications of ASP [Erdem et al. AI Mag 37(3):53-68, 2016; Falkner et al. Industrial applications of answer set programming. K++nstliche Intelligenz (2018)]},
  language  = {en}
}
@misc{BrewkaSchaubWoltran2018,
  author    = {Brewka, Gerhard and Schaub, Torsten and Woltran, Stefan},
  title     = {Interview with Gerhard Brewka},
  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-0549-5},
  pages     = {219 -- 221},
  year      = {2018},
  abstract  = {This interview with Gerhard Brewka was conducted by correspondance in May 2018. The question set was compiled by Torsten Schaub and Stefan Woltran.},
  language  = {en}
}
@misc{SchaubWoltran2018,
  author    = {Schaub, Torsten and Woltran, Stefan},
  title     = {Special issue on answer set programming},
  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-0554-8},
  pages     = {101 -- 103},
  year      = {2018},
  language  = {en}
}
@book{GarusSawahnWankeetal.2023,
  author    = {Garus, Marcel and Sawahn, Rohan and Wanke, Jonas and Tiedt, Clemens and Granzow, Clara and Kuffner, Tim and Rosenbaum, Jannis and Hagemann, Linus and Wollnik, Tom and Woth, Lorenz and Auringer, Felix and Kantusch, Tobias and Roth, Felix and Hanff, Konrad and Schilli, Niklas and Seibold, Leonard and Lindner, Marc Fabian and Raschack, Selina},
  title     = {Operating systems II - student projects},
  number    = {142},
  editor    = {Grapentin, Andreas and Tiedt, Clemens and Polze, Andreas},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-524-8},
  issn      = {1613-5652},
  doi       = {10.25932/publishup-52636},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-526363},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {ix, 114},
  year      = {2023},
  abstract  = {This technical report presents the results of student projects which were prepared during the lecture "Operating Systems II" offered by the "Operating Systems and Middleware" group at HPI in the Summer term of 2020. The lecture covered ad- vanced aspects of operating system implementation and architecture on topics such as Virtualization, File Systems and Input/Output Systems. In addition to attending the lecture, the participating students were encouraged to gather practical experience by completing a project on a closely related topic over the course of the semester. The results of 10 selected exceptional projects are covered in this report. The students have completed hands-on projects on the topics of Operating System Design Concepts and Implementation, Hardware/Software Co-Design, Reverse Engineering, Quantum Computing, Static Source-Code Analysis, Operating Systems History, Application Binary Formats and more. It should be recognized that over the course of the semester all of these projects have achieved outstanding results which went far beyond the scope and the expec- tations of the lecture, and we would like to thank all participating students for their commitment and their effort in completing their respective projects, as well as their work on compiling this report.},
  language  = {en}
}
@book{MeinelGalbasHageboelling2023,
  author    = {Meinel, Christoph and Galbas, Michael and Hageb{\"o}lling, David},
  title     = {Digitale Souver{\"a}nit{\"a}t: Erkenntnisse aus dem deutschen Bildungssektor},
  number    = {156},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-560-6},
  issn      = {1613-5652},
  doi       = {10.25932/publishup-59513},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-595138},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {1 -- 29},
  year      = {2023},
  abstract  = {Digitale Technologien bieten erhebliche politische, wirtschaftliche und gesellschaftliche Chancen. Zugleich ist der Begriff digitale Souver{\"a}nit{\"a}t zu einem Leitmotiv im deutschen Diskurs {\"u}ber digitale Technologien geworden: das heißt, die F{\"a}higkeit des Staates, seine Verantwortung wahrzunehmen und die Bef{\"a}higung der Gesellschaft - und des Einzelnen - sicherzustellen, die digitale Transformation selbstbestimmt zu gestalten. Exemplarisch f{\"u}r die Herausforderung in Deutschland und Europa, die Vorteile digitaler Technologien zu nutzen und gleichzeitig Souver{\"a}nit{\"a}tsbedenken zu ber{\"u}cksichtigen, steht der Bildungssektor. Er umfasst Bildung als zentrales {\"o}ffentliches Gut, ein schnell aufkommendes Gesch{\"a}ftsfeld und wachsende Best{\"a}nde an hochsensiblen personenbezogenen Daten. Davon ausgehend beschreibt der Bericht Wege zur Entsch{\"a}rfung des Spannungsverh{\"a}ltnisses zwischen Digitalisierung und Souver{\"a}nit{\"a}t auf drei verschiedenen Ebenen - Staat, Wirtschaft und Individuum - anhand konkreter technischer Projekte im Bildungsbereich: die HPI Schul-Cloud (staatliche Souver{\"a}nit{\"a}t), die MERLOT-Datenr{\"a}ume (wirtschaftliche Souver{\"a}nit{\"a}t) und die openHPI-Plattform (individuelle Souver{\"a}nit{\"a}t).},
  language  = {de}
}
@book{MeinelGalbasHageboelling2023,
  author    = {Meinel, Christoph and Galbas, Michael and Hageb{\"o}lling, David},
  title     = {Digital sovereignty: insights from Germany's education sector},
  number    = {157},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-561-3},
  issn      = {1613-5652},
  doi       = {10.25932/publishup-59772},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-597723},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {1 -- 27},
  year      = {2023},
  abstract  = {Digital technology offers significant political, economic, and societal opportunities. At the same time, the notion of digital sovereignty has become a leitmotif in German discourse: the state's capacity to assume its responsibilities and safeguard society's - and individuals' - ability to shape the digital transformation in a self-determined way. The education sector is exemplary for the challenge faced by Germany, and indeed Europe, of harnessing the benefits of digital technology while navigating concerns around sovereignty. It encompasses education as a core public good, a rapidly growing field of business, and growing pools of highly sensitive personal data. The report describes pathways to mitigating the tension between digitalization and sovereignty at three different levels - state, economy, and individual - through the lens of concrete technical projects in the education sector: the HPI Schul-Cloud (state sovereignty), the MERLOT data spaces (economic sovereignty), and the openHPI platform (individual sovereignty).},
  language  = {en}
}
@misc{HoosKaminskiLindaueretal.2015,
  author    = {Hoos, Holger and Kaminski, Roland and Lindauer, Marius and Schaub, Torsten},
  title     = {aspeed},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  number    = {588},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-41474},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-414743},
  pages     = {26},
  year      = {2015},
  abstract  = {Although Boolean Constraint Technology has made tremendous progress over the last decade, the efficacy of state-of-the-art solvers is known to vary considerably across different types of problem instances, and is known to depend strongly on algorithm parameters. This problem was addressed by means of a simple, yet effective approach using handmade, uniform, and unordered schedules of multiple solvers in ppfolio, which showed very impressive performance in the 2011 Satisfiability Testing (SAT) Competition. Inspired by this, we take advantage of the modeling and solving capacities of Answer Set Programming (ASP) to automatically determine more refined, that is, nonuniform and ordered solver schedules from the existing benchmarking data. We begin by formulating the determination of such schedules as multi-criteria optimization problems and provide corresponding ASP encodings. The resulting encodings are easily customizable for different settings, and the computation of optimum schedules can mostly be done in the blink of an eye, even when dealing with large runtime data sets stemming from many solvers on hundreds to thousands of instances. Also, the fact that our approach can be customized easily enabled us to swiftly adapt it to generate parallel schedules for multi-processor machines.},
  language  = {en}
}
@misc{GebserKaminskiSchaub2011,
  author    = {Gebser, Martin and Kaminski, Roland and Schaub, Torsten},
  title     = {Complex optimization in answer set programming},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  number    = {554},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-41243},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-412436},
  pages     = {19},
  year      = {2011},
  abstract  = {Preference handling and optimization are indispensable means for addressing nontrivial applications in Answer Set Programming (ASP). However, their implementation becomes difficult whenever they bring about a significant increase in computational complexity. As a consequence, existing ASP systems do not offer complex optimization capacities, supporting, for instance, inclusion-based minimization or Pareto efficiency. Rather, such complex criteria are typically addressed by resorting to dedicated modeling techniques, like saturation. Unlike the ease of common ASP modeling, however, these techniques are rather involved and hardly usable by ASP laymen. We address this problem by developing a general implementation technique by means of meta-prpogramming, thus reusing existing ASP systems to capture various forms of qualitative preferences among answer sets. In this way, complex preferences and optimization capacities become readily available for ASP applications.},
  language  = {en}
}
@misc{GebserKaufmannSchaub2012,
  author    = {Gebser, Martin and Kaufmann, Benjamin and Schaub, Torsten},
  title     = {Multi-threaded ASP solving with clasp},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  number    = {586},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-41397},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-413977},
  pages     = {21},
  year      = {2012},
  abstract  = {We present the new multi-threaded version of the state-of-the-art answer set solver clasp. We detail its component and communication architecture and illustrate how they support the principal functionalities of clasp. Also, we provide some insights into the data representation used for different constraint types handled by clasp. All this is accompanied by an extensive experimental analysis of the major features related to multi-threading in clasp.},
  language  = {en}
}
@misc{DurzinskyMarwanOstrowskietal.2011,
  author    = {Durzinsky, Markus and Marwan, Wolfgang and Ostrowski, Max and Schaub, Torsten and Wagler, Annegret},
  title     = {Automatic network reconstruction using ASP},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  number    = {560},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-41241},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-412419},
  pages     = {18},
  year      = {2011},
  abstract  = {Building biological models by inferring functional dependencies from experimental data is an important issue in Molecular Biology. To relieve the biologist from this traditionally manual process, various approaches have been proposed to increase the degree of automation. However, available approaches often yield a single model only, rely on specific assumptions, and/or use dedicated, heuristic algorithms that are intolerant to changing circumstances or requirements in the view of the rapid progress made in Biotechnology. Our aim is to provide a declarative solution to the problem by appeal to Answer Set Programming (ASP) overcoming these difficulties. We build upon an existing approach to Automatic Network Reconstruction proposed by part of the authors. This approach has firm mathematical foundations and is well suited for ASP due to its combinatorial flavor providing a characterization of all models explaining a set of experiments. The usage of ASP has several benefits over the existing heuristic algorithms. First, it is declarative and thus transparent for biological experts. Second, it is elaboration tolerant and thus allows for an easy exploration and incorporation of biological constraints. Third, it allows for exploring the entire space of possible models. Finally, our approach offers an excellent performance, matching existing, special-purpose systems.},
  language  = {en}
}
@phdthesis{Kaufmann2015,
  author    = {Kaufmann, Benjamin},
  title     = {High performance answer set solving},
  pages     = {182},
  year      = {2015},
  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}
}
@book{KubanRottaNolteetal.2024,
  author    = {Kuban, Robert and Rotta, Randolf and Nolte, J{\"o}rg and Chromik, Jonas and Beilharz, Jossekin Jakob and Pirl, Lukas and Friedrich, Tobias and Lenzner, Pascal and Weyand, Christopher and Juiz, Carlos and Bermejo, Belen and Sauer, Joao and Coelh, Leandro dos Santos and Najafi, Pejman and P{\"u}nter, Wenzel and Cheng, Feng and Meinel, Christoph and Sidorova, Julia and Lundberg, Lars and Vogel, Thomas and Tran, Chinh and Moser, Irene and Grunske, Lars and Elsaid, Mohamed Esameldin Mohamed and Abbas, Hazem M. and Rula, Anisa and Sejdiu, Gezim and Maurino, Andrea and Schmidt, Christopher and H{\"u}gle, Johannes and Uflacker, Matthias and Nozza, Debora and Messina, Enza and Hoorn, Andr{\´e} van and Frank, Markus and Schulz, Henning and Alhosseini Almodarresi Yasin, Seyed Ali and Nowicki, Marek and Muite, Benson K. and Boysan, Mehmet Can and Bianchi, Federico and Cremaschi, Marco and Moussa, Rim and Abdel-Karim, Benjamin M. and Pfeuffer, Nicolas and Hinz, Oliver and Plauth, Max and Polze, Andreas and Huo, Da and Melo, Gerard de and Mendes Soares, F{\´a}bio and Oliveira, Roberto C{\´e}lio Lim{\~a}o de and Benson, Lawrence and Paul, Fabian and Werling, Christian and Windheuser, Fabian and Stojanovic, Dragan and Djordjevic, Igor and Stojanovic, Natalija and Stojnev Ilic, Aleksandra and Weidmann, Vera and Lowitzki, Leon and Wagner, Markus and Ifa, Abdessatar Ben and Arlos, Patrik and Megia, Ana and Vendrell, Joan and Pfitzner, Bjarne and Redondo, Alberto and R{\´i}os Insua, David and Albert, Justin Amadeus and Zhou, Lin and Arnrich, Bert and Szab{\´o}, Ildik{\´o} and Fodor, Szabina and Ternai, Katalin and Bhowmik, Rajarshi and Campero Durand, Gabriel and Shevchenko, Pavlo and Malysheva, Milena and Prymak, Ivan and Saake, Gunter},
  title     = {HPI Future SOC Lab - Proceedings 2019},
  number    = {158},
  editor    = {Meinel, Christoph and Polze, Andreas and Beins, Karsten and Strotmann, Rolf and Seibold, Ulrich and R{\"o}dszus, Kurt and M{\"u}ller, J{\"u}rgen},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-564-4},
  issn      = {1613-5652},
  doi       = {10.25932/publishup-59791},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-597915},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {xi, 301},
  year      = {2024},
  abstract  = {The "HPI Future SOC Lab" is a cooperation of the Hasso Plattner Institute (HPI) and industry partners. Its mission is to enable and promote exchange and interaction between the research community and the industry partners. The HPI Future SOC Lab provides researchers with free of charge access to a complete infrastructure of state of the art hard and software. This infrastructure includes components, which might be too expensive for an ordinary research environment, such as servers with up to 64 cores and 2 TB main memory. The offerings address researchers particularly from but not limited to the areas of computer science and business information systems. Main areas of research include cloud computing, parallelization, and In-Memory technologies. This technical report presents results of research projects executed in 2019. Selected projects have presented their results on April 9th and November 12th 2019 at the Future SOC Lab Day events.},
  language  = {en}
}
@phdthesis{Videla2014,
  author    = {Videla, Santiago},
  title     = {Reasoning on the response of logical signaling networks with answer set programming},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-71890},
  school      = {Universit{\"a}t Potsdam},
  year      = {2014},
  abstract  = {Deciphering the functioning of biological networks is one of the central tasks in systems biology. In particular, signal transduction networks are crucial for the understanding of the cellular response to external and internal perturbations. Importantly, in order to cope with the complexity of these networks, mathematical and computational modeling is required. We propose a computational modeling framework in order to achieve more robust discoveries in the context of logical signaling networks. More precisely, we focus on modeling the response of logical signaling networks by means of automated reasoning using Answer Set Programming (ASP). ASP provides a declarative language for modeling various knowledge representation and reasoning problems. Moreover, available ASP solvers provide several reasoning modes for assessing the multitude of answer sets. Therefore, leveraging its rich modeling language and its highly efficient solving capacities, we use ASP to address three challenging problems in the context of logical signaling networks: learning of (Boolean) logical networks, experimental design, and identification of intervention strategies. Overall, the contribution of this thesis is three-fold. Firstly, we introduce a mathematical framework for characterizing and reasoning on the response of logical signaling networks. Secondly, we contribute to a growing list of successful applications of ASP in systems biology. Thirdly, we present a software providing a complete pipeline for automated reasoning on the response of logical signaling networks.},
  language  = {en}
}
@article{DimopoulosGebserLuehneetal.2019,
  author    = {Dimopoulos, Yannis and Gebser, Martin and L{\"u}hne, Patrick and Romero Davila, Javier and Schaub, Torsten},
  title     = {plasp 3},
  series = {Theory and practice of logic programming},
  volume    = {19},
  journal   = {Theory and practice of logic programming},
  number    = {3},
  publisher = {Cambridge Univ. Press},
  address   = {New York},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068418000583},
  pages     = {477 -- 504},
  year      = {2019},
  abstract  = {We describe the new version of the Planning Domain Definition Language (PDDL)-to-Answer Set Programming (ASP) translator plasp. First, it widens the range of accepted PDDL features. Second, it contains novel planning encodings, some inspired by Satisfiability Testing (SAT) planning and others exploiting ASP features such as well-foundedness. All of them are designed for handling multivalued fluents in order to capture both PDDL as well as SAS planning formats. Third, enabled by multishot ASP solving, it offers advanced planning algorithms also borrowed from SAT planning. As a result, plasp provides us with an ASP-based framework for studying a variety of planning techniques in a uniform setting. Finally, we demonstrate in an empirical analysis that these techniques have a significant impact on the performance of ASP planning.},
  language  = {en}
}
@phdthesis{Konczak2007,
  author    = {Konczak, Kathrin},
  title     = {Preferences in answer set programming},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-12058},
  school      = {Universit{\"a}t Potsdam},
  year      = {2007},
  abstract  = {Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm, having its roots in nonmonotonic reasoning, deductive databases, and logic programming with negation as failure. The basic idea of ASP is to represent a computational problem as a logic program whose answer sets correspond to solutions, and then to use an answer set solver for finding answer sets of the program. ASP is particularly suited for solving NP-complete search problems. Among these, we find applications to product configuration, diagnosis, and graph-theoretical problems, e.g. finding Hamiltonian cycles. On different lines of ASP research, many extensions of the basic formalism have been proposed. The most intensively studied one is the modelling of preferences in ASP. They constitute a natural and effective way of selecting preferred solutions among a plethora of solutions for a problem. For example, preferences have been successfully used for timetabling, auctioning, and product configuration. In this thesis, we concentrate on preferences within answer set programming. Among several formalisms and semantics for preference handling in ASP, we concentrate on ordered logic programs with the underlying D-, W-, and B-semantics. In this setting, preferences are defined among rules of a logic program. They select preferred answer sets among (standard) answer sets of the underlying logic program. Up to now, those preferred answer sets have been computed either via a compilation method or by meta-interpretation. Hence, the question comes up, whether and how preferences can be integrated into an existing ASP solver. To solve this question, we develop an operational graph-based framework for the computation of answer sets of logic programs. Then, we integrate preferences into this operational approach. We empirically observe that our integrative approach performs in most cases better than the compilation method or meta-interpretation. Another research issue in ASP are optimization methods that remove redundancies, as also found in database query optimizers. For these purposes, the rather recently suggested notion of strong equivalence for ASP can be used. If a program is strongly equivalent to a subprogram of itself, then one can always use the subprogram instead of the original program, a technique which serves as an effective optimization method. Up to now, strong equivalence has not been considered for logic programs with preferences. In this thesis, we tackle this issue and generalize the notion of strong equivalence to ordered logic programs. We give necessary and sufficient conditions for the strong equivalence of two ordered logic programs. Furthermore, we provide program transformations for ordered logic programs and show in how far preferences can be simplified. Finally, we present two new applications for preferences within answer set programming. First, we define new procedures for group decision making, which we apply to the problem of scheduling a group meeting. As a second new application, we reconstruct a linguistic problem appearing in German dialects within ASP. Regarding linguistic studies, there is an ongoing debate about how unique the rule systems of language are in human cognition. The reconstruction of grammatical regularities with tools from computer science has consequences for this debate: if grammars can be modelled this way, then they share core properties with other non-linguistic rule systems.},
  language  = {en}
}
@misc{LifschitzSchaubWoltran2018,
  author    = {Lifschitz, Vladimir and Schaub, Torsten and Woltran, Stefan},
  title     = {Interview with Vladimir Lifschitz},
  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-0552-x},
  pages     = {213 -- 218},
  year      = {2018},
  abstract  = {This interview with Vladimir Lifschitz was conducted by Torsten Schaub at the University of Texas at Austin in August 2017. The question set was compiled by Torsten Schaub and Stefan Woltran.},
  language  = {en}
}
@book{MeinelMichaelDengeletal.2024,
  author    = {Meinel, Christoph and Michael, Galbas and Dengel, Andreas and Wendlandt, Matthias},
  title     = {Konzeption eines integrativen Schulfaches „Digitale Welt" f{\"u}r hessische Schulen},
  number    = {160},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-582-8},
  issn      = {1613-5652},
  doi       = {10.25932/publishup-63911},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-639113},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {34},
  year      = {2024},
  abstract  = {Um in der Schule bereits fr{\"u}hzeitig ein Verst{\"a}ndnis f{\"u}r informatische Prozesse zu vermitteln wurde das neue Informatikfach Digitale Welt f{\"u}r die Klassenstufe 5 konzipiert mit der bundesweit einmaligen Verbindung von Informatik mit anwendungsbezogenen und gesellschaftlich relevanten Bez{\"u}gen zur {\"O}kologie und {\"O}konomie. Der Technische Report gibt eine Handreichung zur Einf{\"u}hrung des neuen Faches.},
  language  = {de}
}
@misc{Krasnova2023,
  author    = {Krasnova, Hanna},
  title     = {Interview with Christoph Neuberger on "How digital technologies are shaping our society and what we can do about it"},
  series = {Business \& information systems engineering},
  volume    = {65},
  journal   = {Business \& information systems engineering},
  number    = {5},
  publisher = {Springer Fachmedien},
  address   = {Wiesbaden},
  issn      = {2363-7005},
  doi       = {10.1007/s12599-023-00832-9},
  pages     = {609 -- 611},
  year      = {2023},
  language  = {en}
}
@inproceedings{GonnermannMuellerTeichmann2024,
  author    = {Gonnermann-M{\"u}ller, Jana and Teichmann, Malte},
  title     = {Examining the learner's cognitive load in response to different learning material in high and low immersive virtual learning environments},
  series = {Information systems and neuroscience},
  volume    = {68},
  booktitle = {Information systems and neuroscience},
  editor    = {Davis, Fred D. and Riedl, Ren{\´e} and vom Brocke, Jan and L{\´e}ger, Pierre-Majorique and Randolph, Adriane B. and M{\"u}ller-Putz, Gernot R.},
  publisher = {Springer},
  address   = {Cham},
  isbn      = {978-3-031-58395-7},
  doi       = {10.1007/978-3-031-58396-4_29},
  pages     = {333 -- 344},
  year      = {2024},
  abstract  = {Learning in virtual, immersive environments must be well-designed to foster learning instead of overwhelming and distracting the learner. So far, learning instructions based on cognitive load theory recommend keeping the learning instructions clean and simple to reduce the extraneous cognitive load of the learner to foster learning performance. The advantages of immersive learning, such as multiple options for realistic simulation, movement and feedback, raise questions about the tension between an increase of excitement and flow with highly realistic environments on the one hand and a reduction of cognitive load by developing clean and simple surroundings on the other hand. This study aims to gain insights into learners' cognitive responses during the learning process by continuously assessing cognitive load through eye-tracking. The experiment compares two distinct immersive learning environments and varying methods of content presentation.},
  language  = {en}
}
@book{MeinelWillemsStaubitzetal.2022,
  author    = {Meinel, Christoph and Willems, Christian and Staubitz, Thomas and Sauer, Dominic and Hagedorn, Christiane},
  title     = {openHPI},
  number    = {150},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-546-0},
  issn      = {1613-5652},
  doi       = {10.25932/publishup-56179},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-561792},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {86},
  year      = {2022},
  abstract  = {Anl{\"a}sslich des 10-j{\"a}hrigen Jubil{\"a}ums von openHPI informiert dieser technische Bericht {\"u}ber die HPI-MOOC-Plattform einschließlich ihrer Kernfunktionen, Technologie und Architektur. In einer Einleitung wird die Plattformfamilie mit allen Partnerplattformen vorgestellt; diese belaufen sich inklusive openHPI aktuell auf neun Plattformen. In diesem Abschnitt wird außerdem gezeigt, wie openHPI als Berater und Forschungspartner in verschiedenen Projekten fungiert. Im zweiten Kapitel werden die Funktionalit{\"a}ten und g{\"a}ngigen Kursformate der Plattform pr{\"a}sentiert. Die Funktionalit{\"a}ten sind in Lerner- und Admin-Funktionen unterteilt. Der Bereich Lernerfunktionen bietet detaillierte Informationen zu Leistungsnachweisen, Kursen und den Lernmaterialien, aus denen sich ein Kurs zusammensetzt: Videos, Texte und Quiz. Dar{\"u}ber hinaus k{\"o}nnen die Lernmaterialien durch externe {\"U}bungstools angereichert werden, die {\"u}ber den Standard Learning Tools Interoperability (LTI) mit der HPI MOOC-Plattform kommunizieren. Das Konzept der Peer-Assessments rundet die m{\"o}glichen Lernmaterialien ab. Der Abschnitt geht dann weiter auf das Diskussionsforum ein, das einen grundlegenden Unterschied von MOOCs im Vergleich zu traditionellen E-Learning-Angeboten darstellt. Zum Abschluss des Abschnitts folgen eine Beschreibung von Quiz-Recap, Lernzielen, mobilen Anwendungen, spielerischen Lernens und dem Helpdesk. Der n{\"a}chste Teil dieses Kapitels besch{\"a}ftigt sich mit den Admin-Funktionen. Die Funktionalit{\"a}tsbeschreibung beschr{\"a}nkt sich Neuigkeiten und Ank{\"u}ndigungen, Dashboards und Statistiken, Berichtsfunktionen, Forschungsoptionen mit A/B-Tests, den Kurs-Feed und das TransPipe-Tool zur Unterst{\"u}tzung beim Erstellen von automatischen oder manuellen Untertiteln. Die Plattform unterst{\"u}tzt außerdem eine Vielzahl zus{\"a}tzlicher Funktionen, doch eine detaillierte Beschreibung dieser Funktionen w{\"u}rde den Rahmen des Berichts sprengen. Das Kapitel geht dann auf g{\"a}ngige Kursformate und openHPI-Lehrveranstaltungen am HPI ein, bevor es mit einigen Best Practices f{\"u}r die Gestaltung und Durchf{\"u}hrung von Kursen schließt. Zum Abschluss des technischen Berichts gibt das letzte Kapitel eine Zusammenfassung und einen Ausblick auf die Zukunft der digitalen Bildung. Ein besonderes Merkmal des openHPI-Projekts ist die bewusste Entscheidung, die komplette Anwendung von den physischen Netzwerkkomponenten bis zur Plattformentwicklung eigenst{\"a}ndig zu betreiben. Bei der vorliegenden deutschen Variante handelt es sich um eine gek{\"u}rzte {\"U}bersetzung des technischen Berichts 148, bei der kein Einblick in die Technologien und Architektur von openHPI gegeben wird. Interessierte Leser:innen k{\"o}nnen im technischen Bericht 148 (vollst{\"a}ndige englische Version) detaillierte Informationen zum Rechenzentrum und den Ger{\"a}ten, der Cloud-Software und dem openHPI Cloud Service aber auch zu Infrastruktur-Anwendungskomponenten wie Entwicklungstools, Automatisierung, Deployment-Pipeline und Monitoring erhalten. Außerdem finden sich dort weitere Informationen {\"u}ber den Technologiestack und konkrete Implementierungsdetails der Plattform inklusive der serviceorientierten Ruby on Rails-Anwendung, die Kommunikation zwischen den Diensten, {\"o}ffentliche APIs, sowie Designsystem und -komponenten. Der Abschnitt schließt mit einer Diskussion {\"u}ber die urspr{\"u}ngliche Microservice-Architektur und die Migration zu einer monolithischen Anwendung.},
  language  = {de}
}
@article{BaumBaumannBatzel2024,
  author    = {Baum, Katharina and Baumann, Annika and Batzel, Katharina},
  title     = {Investigating innovation diffusion in gender-specific medicine},
  series = {Business \& information systems engineering},
  volume    = {66},
  journal   = {Business \& information systems engineering},
  number    = {3},
  publisher = {Springer Fachmedien},
  address   = {Wiesbaden},
  issn      = {2363-7005},
  doi       = {10.1007/s12599-024-00875-6},
  pages     = {335 -- 355},
  year      = {2024},
  abstract  = {The field of healthcare is characterized by constant innovation, with gender-specific medicine emerging as a new subfield that addresses sex and gender disparities in clinical manifestations, outcomes, treatment, and prevention of disease. Despite its importance, the adoption of gender-specific medicine remains understudied, posing potential risks to patient outcomes due to a lack of awareness of the topic. Building on the Innovation Decision Process Theory, this study examines the spread of information about gender-specific medicine in online networks. The study applies social network analysis to a Twitter dataset reflecting online discussions about the topic to gain insights into its adoption by health professionals and patients online. Results show that the network has a community structure with limited information exchange between sub-communities and that mainly medical experts dominate the discussion. The findings suggest that the adoption of gender-specific medicine might be in its early stages, focused on knowledge exchange. Understanding the diffusion of gender-specific medicine among medical professionals and patients may facilitate its adoption and ultimately improve health outcomes.},
  language  = {en}
}
@misc{MeythalerBaumannKrasnovaetal.2023,
  author    = {Meythaler, Antonia and Baumann, Annika and Krasnova, Hanna and Hinz, Oliver and Spiekermann, Sarah},
  title     = {Technology for humanity},
  series = {Business \& information systems engineering},
  volume    = {65},
  journal   = {Business \& information systems engineering},
  number    = {5},
  publisher = {Springer Fachmedien},
  address   = {Wiesbaden},
  issn      = {2363-7005},
  doi       = {10.1007/s12599-023-00831-w},
  pages     = {487 -- 496},
  year      = {2023},
  language  = {en}
}
@phdthesis{Dehnert2022,
  author    = {Dehnert, Maik},
  title     = {Studies on the Digital Transformation of Incumbent Organizations},
  doi       = {10.25932/publishup-54832},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-548324},
  school      = {Universit{\"a}t Potsdam},
  pages     = {339},
  year      = {2022},
  abstract  = {Traditional organizations are strongly encouraged by emerging digital customer behavior and digital competition to transform their businesses for the digital age. Incumbents are particularly exposed to the field of tension between maintaining and renewing their business model. Banking is one of the industries most affected by digitalization, with a large stream of digital innovations around Fintech. Most research contributions focus on digital innovations, such as Fintech, but there are only a few studies on the related challenges and perspectives of incumbent organizations, such as traditional banks. Against this background, this dissertation examines the specific causes, effects and solutions for traditional banks in digital transformation - an underrepresented research area so far. The first part of the thesis examines how digitalization has changed the latent customer expectations in banking and studies the underlying technological drivers of evolving business-to-consumer (B2C) business models. Online consumer reviews are systematized to identify latent concepts of customer behavior and future decision paths as strategic digitalization effects. Furthermore, the service attribute preferences, the impact of influencing factors and the underlying customer segments are uncovered for checking accounts in a discrete choice experiment. The dissertation contributes here to customer behavior research in digital transformation, moving beyond the technology acceptance model. In addition, the dissertation systematizes value proposition types in the evolving discourse around smart products and services as key drivers of business models and market power in the platform economy. The second part of the thesis focuses on the effects of digital transformation on the strategy development of financial service providers, which are classified along with their firm performance levels. Standard types are derived based on fuzzy-set qualitative comparative analysis (fsQCA), with facade digitalization as one typical standard type for low performing incumbent banks that lack a holistic strategic response to digital transformation. Based on this, the contradictory impact of digitalization measures on key business figures is examined for German savings banks, confirming that the shift towards digital customer interaction was not accompanied by new revenue models diminishing bank profitability. The dissertation further contributes to the discourse on digitalized work designs and the consequences for job perceptions in banking customer advisory. The threefold impact of the IT support perceived in customer interaction on the job satisfaction of customer advisors is disentangled. In the third part of the dissertation, solutions are developed design-oriented for core action areas of digitalized business models, i.e., data and platforms. A consolidated taxonomy for data-driven business models and a future reference model for digital banking have been developed. The impact of the platform economy is demonstrated here using the example of the market entry by Bigtech. The role-based e3-value modeling is extended by meta-roles and role segments and linked to value co-creation mapping in VDML. In this way, the dissertation extends enterprise modeling research on platform ecosystems and value co-creation using the example of banking.},
  language  = {en}
}
@inproceedings{Dehnert2020,
  author    = {Dehnert, Maik},
  title     = {Organizational change toward IT-supported personal advisory in incumbent banks},
  series = {Perspectives in business informatics research},
  volume    = {398},
  booktitle = {Perspectives in business informatics research},
  editor    = {Buchmann, Robert Andrei and Polini, Andrea and Johansson, Bj{\"o}rn and Karagiannis, Dimitris},
  publisher = {Springer},
  address   = {Cham},
  isbn      = {978-3-030-61139-2},
  doi       = {10.1007/978-3-030-61140-8_14},
  pages     = {205 -- 219},
  year      = {2020},
  abstract  = {Due to changing customer behavior in digitalization, banks urge to change their traditional value creation in order to improve interaction with customers. New digital technologies such as core banking solutions change organizational structures to provide organizational and individual affordances in IT-supported personal advisory. Based on adaptive structuration theory and with qualitative data from 24 German banks, we identify first, second and third order issues of organizational change in value creation, which are connected with a set of affordances and constraints as the outcomes for customer interaction.},
  language  = {en}
}
@inproceedings{DehnertGleissReiss2021,
  author    = {Dehnert, Maik and Gleiß, Alexander and Reiss, Frederick},
  title     = {What makes a data-driven business model?},
  series = {ECIS Proceedings 2021},
  booktitle = {ECIS Proceedings 2021},
  publisher = {AIS},
  address   = {Atlanta},
  isbn      = {978-1-7336325-6-0},
  year      = {2021},
  abstract  = {The usage of data to improve or create business models has become vital for companies in the 21st century. However, to extract value from data it is important to understand the business model. Taxonomies for data-driven business models (DDBM) aim to provide guidance for the development and ideation of new business models relying on data. In IS research, however, different taxonomies have emerged in recent years, partly redundant, partly contradictory. Thus, there is a need to synthesize the common ground of these taxonomies within IS research. Based on 26 IS-related taxonomies and 30 cases, we derive and define 14 generic building blocks of DDBM to develop a consolidated taxonomy that represents the current state-of-the-art. Thus, we integrate existing research on DDBM and provide avenues for further exploration of data-induced potentials for business models as well as for the development and analysis of general or industry-specific DDBM.},
  language  = {en}
}
@article{GebserKaminskiKaufmannetal.2018,
  author    = {Gebser, Martin and Kaminski, Roland and Kaufmann, Benjamin and L{\"u}hne, Patrick and Obermeier, Philipp and Ostrowski, Max and Romero Davila, Javier and Schaub, Torsten and Schellhorn, Sebastian and Wanko, Philipp},
  title     = {The Potsdam Answer Set Solving Collection 5.0},
  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-0528-x},
  pages     = {181 -- 182},
  year      = {2018},
  abstract  = {The Potsdam answer set solving collection, or Potassco for short, bundles various tools implementing and/or applying answer set programming. The article at hand succeeds an earlier description of the Potassco project published in Gebser et al. (AI Commun 24(2):107-124, 2011). Hence, we concentrate in what follows on the major features of the most recent, fifth generation of the ASP system clingo and highlight some recent resulting application systems.},
  language  = {en}
}
@article{HaubeltNeubauerSchaubetal.2018,
  author    = {Haubelt, Christian and Neubauer, Kai and Schaub, Torsten and Wanko, Philipp},
  title     = {Design space exploration with answer set programming},
  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-0530-3},
  pages     = {205 -- 206},
  year      = {2018},
  abstract  = {The aim of our project design space exploration with answer set programming is to develop a general framework based on Answer Set Programming (ASP) that finds valid solutions to the system design problem and simultaneously performs Design Space Exploration (DSE) to find the most favorable alternatives. We leverage recent developments in ASP solving that allow for tight integration of background theories to create a holistic framework for effective DSE.},
  language  = {en}
}
@article{AbramovaGladkaya2024,
  author    = {Abramova, Olga and Gladkaya, Margarita},
  title     = {Behind videoconferencing fatigue at work},
  series = {Business \& information systems engineering},
  journal   = {Business \& information systems engineering},
  publisher = {Springer Fachmedien},
  address   = {Wiesbaden},
  issn      = {2363-7005},
  doi       = {10.1007/s12599-024-00874-7},
  pages     = {19},
  year      = {2024},
  abstract  = {A remarkable peculiarity of videoconferencing (VC) applications - the self-view - a.k.a. digital mirror, is examined as a potential reason behind the voiced exhaustion among users. This work draws on technostress research and objective self-awareness theory and proposes the communication role (sender vs. receiver) as an interaction variable. We report the results of two studies among European employees (n1 = 176, n2 = 253) with a one-year time lag. A higher frequency of self-view in a VC when receiving a message, i.e., listening to others, indirectly increases negative affect (study 1 \& 2) and exhaustion (study 2) via the increased state of public self-awareness. Self-viewing in the role of message sender, e.g., as an online presenter, also increases public self-awareness, but its overall effects are less harmful. As for individual differences, users predisposed to public self-consciousness were more concerned with how other VC participants perceived them. Gender effects were insignificant.},
  language  = {en}
}
@inproceedings{Grum2024,
  author    = {Grum, Marcus},
  title     = {Researching multi-site artificial neural networks' activation rates and activation cycles},
  series = {Business modeling and software design : 14th International Symposium, BMSD 2024, Luxembourg City, Luxembourg, July 1-3, 2024, proceedings},
  booktitle = {Business modeling and software design : 14th International Symposium, BMSD 2024, Luxembourg City, Luxembourg, July 1-3, 2024, proceedings},
  editor    = {Shishkov, Boris},
  publisher = {Springer},
  address   = {Cham},
  isbn      = {978-3-031-64072-8},
  doi       = {10.1007/978-3-031-64073-5_12},
  pages     = {186 -- 206},
  year      = {2024},
  abstract  = {With the further development of more and more production machines into cyber-physical systems, and their greater integration with artificial intelligence (AI) techniques, the coordination of intelligent systems is a highly relevant target factor for the operation and improvement of networked processes, such as they can be found in cross-organizational production contexts spanning multiple distributed locations. This work aims to extend prior research on managing their artificial knowledge transfers as coordination instrument by examining effects of different activation types (respective activation rates and cycles) on by Artificial Neural Network (ANN)-instructed production machines. For this, it provides a new integration type of ANN-based cyber-physical production system as a tool to research artificial knowledge transfers: In a design-science-oriented way, a prototype of a simulation system is constructed as Open Source information system which will be used in on-building research to (I) enable research on ANN activation types in production networks, (II) illustrate ANN-based production networks disrupted by activation types and clarify the need for harmonizing them, and (III) demonstrate conceptual management interventions. This simulator shall establish the importance of site-specific coordination mechanisms and novel forms of management interventions as drivers of efficient artificial knowledge transfer.},
  language  = {en}
}
@inproceedings{Grum2024,
  author    = {Grum, Marcus},
  title     = {Managing multi-site artificial neural networks' activation rates and activation cycles},
  series = {Business modeling and software design : 14th International Symposium, BMSD 2024, Luxembourg City, Luxembourg, July 1-3, 2024, proceedings},
  booktitle = {Business modeling and software design : 14th International Symposium, BMSD 2024, Luxembourg City, Luxembourg, July 1-3, 2024, proceedings},
  editor    = {Shishkov, Boris},
  publisher = {Springer},
  address   = {Cham},
  isbn      = {978-3-031-64072-8},
  doi       = {10.1007/978-3-031-64073-5_17},
  pages     = {258 -- 269},
  year      = {2024},
  abstract  = {Traditionally, business models and software designs used to model the usage of artificial intelligence (AI) at a very specific point in the process or rather fix implemented application. Since applications can be based on AI, such as networked artificial neural networks (ANN) on top of which applications are installed, these on-top applications can be instructed directly from their underlying ANN compartments [1]. However, with the integration of several AI-based systems, their coordination is a highly relevant target factor for the operation and improvement of networked processes, such as they can be found in cross-organizational production contexts spanning multiple distributed locations. This work aims to extend prior research on managing artificial knowledge transfers among interlinked AIs as coordination instrument by examining effects of different activation types (respective activation rates and cycles) on by ANN-instructed production machines. In a design-science-oriented way, this paper conceptualizes rhythmic state descriptions for dynamic systems and associated 14 experiment designs. Two experiments have been realized, analyzed and evaluated thereafter in regard with their activities and processes induced. Findings show that the simulator [2] used and experiments designed and realized, here, (I) enable research on ANN activation types, (II) illustrate ANN-based production networks disrupted by activation types and clarify the need for harmonizing them. Further, (III) management interventions are derived for harmonizing interlinked ANNs. This study establishes the importance of site-specific coordination mechanisms and novel forms of management interventions as drivers of efficient artificial knowledge transfer.},
  language  = {en}
}