@inproceedings{KeilKonertDamniketal.2018,
  author    = {Keil, Reinhard and Konert, Johannes and Damnik, Gregor and Gierl, Mark J. and Proske, Antje and K{\"o}rndle, Hermann and Narciss, Susanne and Wahl, Marina and H{\"o}lscher, Michael and Mariani, Ennio and Jaisli, Isabel and Tscherejkina, Anna and Morgiel, Anna and Moebert, Tobias and Herbstreit, Stephanie and M{\"a}ker, Daniela and Szalai, Cynthia and Braun, Iris and Kapp, Felix and Hara, Tenshi C. and Kubica, Tommy and Stumpf, Sarah},
  title     = {E-Learning Symposium 2018},
  editor    = {Lucke, Ulrike and Strickroth, Sven},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  doi       = {10.25932/publishup-42071},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-420711},
  pages     = {71},
  year      = {2018},
  abstract  = {In den vergangenen Jahren sind viele E-Learning-Innovationen entstanden. Einige davon wurden auf den vergangenen E-Learning Symposien der Universit{\"a}t Potsdam pr{\"a}sentiert: Das erste E-Learning Symposium im Jahr 2012 konzentrierte sich auf unterschiedliche M{\"o}glichkeiten der Studierendenaktivierung und Lehrgestaltung. Das Symposium 2014 r{\"u}ckte vor allem die Studierenden ins Zentrum der Aufmerksamkeit. Im Jahr 2016 kam es durch das Zusammengehen des Symposiums mit der DeLFI-Tagung zu einer Fokussierung auf technische Innovationen. Doch was ist aus den Leuchtt{\"u}rmen von gestern geworden, und brauchen wir {\"u}berhaupt noch neue Leuchtt{\"u}rme? Das Symposium setzt sich in diesem Jahr unter dem Motto „Innovation und Nachhaltigkeit - (k)ein Gegensatz?" mit mediengest{\"u}tzten Lehr- und Lernprozessen im universit{\"a}ren Kontext auseinander und reflektiert aktuelle technische sowie didaktische Entwicklungen mit Blick auf deren mittel- bis langfristigen Einsatz in der Praxis. Dieser Tagungsband zum E-Learning Symposium 2018 an der Universit{\"a}t Potsdam beinhaltet eine Mischung von Forschungs- und Praxisbeitr{\"a}gen aus verschiedenen Fachdisziplinen und er{\"o}ffnet vielschichtige Perspektiven auf das Thema E-Learning. Dabei werden die Vielfalt der didaktischen Einsatzszenarien als auch die Potentiale von Werk-zeugen und Methoden der Informatik in ihrem Zusammenspiel beleuchtet. In seiner Keynote widmet sich Reinhard Keil dem Motto des Symposiums und geht der Nachhaltigkeit bei E-Learning-Projekten auf den Grund. Dabei analysiert und beleuchtet er anhand seiner {\"u}ber 15-j{\"a}hrigen Forschungspraxis die wichtigsten Wirkfaktoren und formuliert Empfehlungen zur Konzeption von E-Learning-Projekten. Im Gegensatz zu rein auf Kostenersparnis ausgerichteten (hochschul-)politischen Forderungen proklamiert er den Ansatz der hypothesengeleiteten Technikgestaltung, in der Nachhaltigkeit als Leitfrage oder Forschungsstrategie verstanden werden kann. In eine {\"a}hnliche Richtung geht der Beitrag von Iris Braun et al., die {\"u}ber Erfolgsfaktoren beim Einsatz von Audience Response Systemen in der universit{\"a}ren Lehre berichten. Ein weiteres aktuelles Thema, sowohl f{\"u}r die Bildungstechnologie als auch in den Bildungswissenschaften allgemein, ist die Kompetenzorientierung und -modellierung. Hier geht es darum (Probleml{\"o}se-)F{\"a}higkeiten gezielt zu beschreiben und in den Mittelpunkt der Lehre zu stellen. Johannes Konert stellt in einem eingeladenen Vortrag zwei Projekte vor, die den Prozess beginnend bei der Definition von Kompetenzen, deren Modellierung in einem semantischen maschinenlesbaren Format bis hin zur Erarbeitung von Methoden zur Kompetenzmessung und der elektronischen Zertifizierung aufzeigen. Dabei geht er auf technische M{\"o}glichkeiten, aber auch Grenzen ein. Auf einer spezifischeren Ebene besch{\"a}ftigt sich Sarah Stumpf mit digitalen bzw. mediendidaktischen Kompetenzen im Lehramtsstudium und stellt ein Framework f{\"u}r die F{\"o}rderung ebensolcher Kompetenzen bei angehenden Lehrkr{\"a}ften vor. Der Einsatz von E-Learning birgt noch einige Herausforderungen. Dabei geht es oft um die Verbindung von Didaktik und Technik, den Erhalt von Aufmerksamkeit oder den Aufwand f{\"u}r das Erstellen von interaktiven Lehr- und Lerninhalten. Drei Beitr{\"a}ge in diesem Tagungsband besch{\"a}ftigen sich mit dieser Thematik in unterschiedlichen Kontexten und zeigen Best-Practices und L{\"o}sungsans{\"a}tze auf: Der Beitrag von Martina Wahl und Michael H{\"o}lscher behandelt den besonderen Kontext von Blended Learning-Szenarien in berufsbegleitenden Studieng{\"a}ngen. Um die Ver{\"o}ffentlichung eines global frei verf{\"u}gbaren Onlinekurses abseits der großen MOOC Plattformen und den didaktischen Herausforderungen auch hinsichtlich der Motivation geht es im Beitrag von Ennio Marani und Isabel Jaisli. Schließlich schlagen Gregor Damnik et al. die automatische Erzeugung von Aufgaben zur Erh{\"o}hung von Interaktivit{\"a}t und Adaptivit{\"a}t in digitalen Lernressourcen vor, um den teilweise erheblichen Erstellungsaufwand zu reduzieren. Zum Thema E-Learning z{\"a}hlen auch immer mobile Apps bzw. Spiele. Gleich zwei Beitr{\"a}ge besch{\"a}ftigen sich mit dem Einsatz von E-Learning-Tools im Gesundheitskontext: Anna Tscherejkina und Anna Morgiel stellen in ihrem Beitrag Minispiele zum Training von sozio-emotionalen Kompetenzen f{\"u}r Menschen mit Autismus vor, und Stephanie Herbstreit et al. berichten vom Einsatz einer mobilen Lern-App zur Verbesserung von klinisch-praktischem Unterricht.},
  language  = {de}
}
@inproceedings{SeegererRomeikeTillmannetal.2018,
  author    = {Seegerer, Stefan and Romeike, Ralf and Tillmann, Alexander and Kr{\"o}mker, Detlef and Horn, Florian and Gattinger, Thorsten and Weicker, Karsten and Schmitz, Dennis and Moldt, Daniel and R{\"o}pke, Ren{\´e} and Larisch, Kathrin and Schroeder, Ulrik and Keverp{\"u}tz, Claudia and K{\"u}ppers, Bastian and Striewe, Michael and Kramer, Matthias and Grillenberger, Andreas and Frede, Christiane and Knobelsdorf, Maria and Greven, Christoph},
  title     = {Hochschuldidaktik der Informatik HDI 2018},
  series = {Commentarii informaticae didacticae (CID)},
  booktitle = {Commentarii informaticae didacticae (CID)},
  number    = {12},
  editor    = {Bergner, Nadine and R{\"o}pke, Ren{\´e} and Schroeder, Ulrik and Kr{\"o}mker, Detlef},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-435-7},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-413542},
  pages     = {161},
  year      = {2018},
  abstract  = {Die 8. Fachtagung f{\"u}r Hochschuldidaktik der Informatik (HDI) fand im September 2018 zusammen mit der Deutschen E-Learning Fachtagung Informatik (DeLFI) unter dem gemeinsamen Motto „Digitalisierungswahnsinn? - Wege der Bildungstransformationen" in Frankfurt statt. Dabei widmet sich die HDI allen Fragen der informatischen Bildung im Hochschulbereich. Schwerpunkte bildeten in diesem Jahr u. a.: - Analyse der Inhalte und anzustrebenden Kompetenzen in Informatikveranstaltungen - Programmieren lernen \& Einstieg in Softwareentwicklung - Spezialthemen: Data Science, Theoretische Informatik und Wissenschaftliches Arbeiten Die Fachtagung widmet sich ausgew{\"a}hlten Fragestellungen dieser Themenkomplexe, die durch Vortr{\"a}ge ausgewiesener Experten und durch eingereichte Beitr{\"a}ge intensiv behandelt werden.},
  language  = {de}
}
@article{BorchertMockTomczaketal.2021,
  author    = {Borchert, Florian and Mock, Andreas and Tomczak, Aurelie and H{\"u}gel, Jonas and Alkarkoukly, Samer and Knurr, Alexander and Volckmar, Anna-Lena and Stenzinger, Albrecht and Schirmacher, Peter and Debus, J{\"u}rgen and J{\"a}ger, Dirk and Longerich, Thomas and Fr{\"o}hling, Stefan and Eils, Roland and Bougatf, Nina and Sax, Ulrich and Schapranow, Matthieu-Patrick},
  title     = {Correction to: Knowledge bases and software support for variant interpretation in precision oncology},
  series = {Briefings in bioinformatics},
  volume    = {22},
  journal   = {Briefings in bioinformatics},
  number    = {6},
  publisher = {Oxford Univ. Press},
  address   = {Oxford},
  issn      = {1467-5463},
  doi       = {10.1093/bib/bbab246},
  pages     = {1},
  year      = {2021},
  language  = {en}
}
@article{IhdePufahlVoelkeretal.2022,
  author    = {Ihde, Sven and Pufahl, Luise and V{\"o}lker, Maximilian and Goel, Asvin and Weske, Mathias},
  title     = {A framework for modeling and executing task},
  series = {Computing : archives for informatics and numerical computation},
  volume    = {104},
  journal   = {Computing : archives for informatics and numerical computation},
  publisher = {Springer},
  address   = {Wien},
  issn      = {0010-485X},
  doi       = {10.1007/s00607-022-01093-2},
  pages     = {2405 -- 2429},
  year      = {2022},
  abstract  = {As resources are valuable assets, organizations have to decide which resources to allocate to business process tasks in a way that the process is executed not only effectively but also efficiently. Traditional role-based resource allocation leads to effective process executions, since each task is performed by a resource that has the required skills and competencies to do so. However, the resulting allocations are typically not as efficient as they could be, since optimization techniques have yet to find their way in traditional business process management scenarios. On the other hand, operations research provides a rich set of analytical methods for supporting problem-specific decisions on resource allocation. This paper provides a novel framework for creating transparency on existing tasks and resources, supporting individualized allocations for each activity in a process, and the possibility to integrate problem-specific analytical methods of the operations research domain. To validate the framework, the paper reports on the design and prototypical implementation of a software architecture, which extends a traditional process engine with a dedicated resource management component. This component allows us to define specific resource allocation problems at design time, and it also facilitates optimized resource allocation at run time. The framework is evaluated using a real-world parcel delivery process. The evaluation shows that the quality of the allocation results increase significantly with a technique from operations research in contrast to the traditional applied rule-based approach.},
  language  = {en}
}
@misc{CombiOliboniWeskeetal.2018,
  author    = {Combi, Carlo and Oliboni, Barbara and Weske, Mathias and Zerbato, Francesca},
  title     = {Conceptual modeling of processes and data},
  series = {Conceptual Modeling, ER 2018},
  volume    = {11157},
  journal   = {Conceptual Modeling, ER 2018},
  editor    = {Trujillo, JC Davis},
  publisher = {Springer},
  address   = {Cham},
  isbn      = {978-3-030-00847-5},
  issn      = {0302-9743},
  doi       = {10.1007/978-3-030-00847-5_18},
  pages     = {236 -- 250},
  year      = {2018},
  abstract  = {Business processes constantly generate, manipulate, and consume data that are managed by organizational databases. Despite being central to process modeling and execution, the link between processes and data is often handled by developers when the process is implemented, thus leaving the connection unexplored during the conceptual design. In this paper, we introduce, formalize, and evaluate a novel conceptual view that bridges the gap between process and data models, and show some kinds of interesting insights that can be derived from this novel proposal.},
  language  = {en}
}
@inproceedings{GonnermannTeichmann2023,
  author    = {Gonnermann, Jana and Teichmann, Malte},
  title     = {Influence of pre-experience on learning, usability and cognitive load in a virtual learning environment},
  series = {Americas conference on information systems},
  booktitle = {Americas conference on information systems},
  number    = {1871},
  publisher = {AIS},
  address   = {Atlanta},
  year      = {2023},
  abstract  = {Virtual reality can have advantages for education and learning. However, it must be adequately designed so that the learner benefits from the technological possibilities. Understanding the underlying effects of the virtual learning environment and the learner's prior experience with virtual reality or prior knowledge of the content is necessary to design a proper virtual learning environment. This article presents a pre-study testing the design of a virtual learning environment for engineering vocational training courses. In the pre-study, 12 employees of two companies joined the training course in one of the two degrees of immersion (desktop VR and VR HMD). Quantitative results on learning success, cognitive load, usability, and motivation and qualitative learning process data were presented. The qualitative data assessment shows that overall, the employees were satisfied with the learning environment regardless of the level of immersion and that the participants asked for more guidance and structure accompanying the learning process. Further research is needed to test for solid group differences.},
  language  = {en}
}
@article{CombiOliboniWeskeetal.2021,
  author    = {Combi, Carlo and Oliboni, Barbara and Weske, Mathias and Zerbato, Francesca},
  title     = {Seamless conceptual modeling of processes with transactional and analytical data},
  series = {Data \& knowledge engineering},
  volume    = {134},
  journal   = {Data \& knowledge engineering},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0169-023X},
  doi       = {10.1016/j.datak.2021.101895},
  pages     = {14},
  year      = {2021},
  abstract  = {In the field of Business Process Management (BPM), modeling business processes and related data is a critical issue since process activities need to manage data stored in databases. The connection between processes and data is usually handled at the implementation level, even if modeling both processes and data at the conceptual level should help designers in improving business process models and identifying requirements for implementation. Especially in data -and decision-intensive contexts, business process activities need to access data stored both in databases and data warehouses. In this paper, we complete our approach for defining a novel conceptual view that bridges process activities and data. The proposed approach allows the designer to model the connection between business processes and database models and define the operations to perform, providing interesting insights on the overall connected perspective and hints for identifying activities that are crucial for decision support.},
  language  = {en}
}
@article{Schladebach2022,
  author    = {Schladebach, Marcus},
  title     = {Satelliten-Megakonstellationen im Weltraumrecht},
  series = {Kommunikation \& Recht : K \& R / Beihefter},
  journal   = {Kommunikation \& Recht : K \& R / Beihefter},
  number    = {2},
  publisher = {dfv-Mediengruppe},
  address   = {Frankfurt am Main},
  issn      = {1434-6354},
  pages     = {26 -- 29},
  year      = {2022},
  language  = {de}
}
@article{KoerppenUllrichBertheau2021,
  author    = {K{\"o}rppen, Tim and Ullrich, Andr{\´e} and Bertheau, Clementine},
  title     = {Durchblick statt Bauchgef{\"u}hl - Transformation zur Data-Driven Organization},
  series = {Wirtschaftsinformatik \& Management},
  volume    = {13},
  journal   = {Wirtschaftsinformatik \& Management},
  number    = {6},
  publisher = {Springer Gabler},
  address   = {Wiesbaden},
  issn      = {1867-5905},
  doi       = {10.1365/s35764-021-00370-7},
  pages     = {452 -- 459},
  year      = {2021},
  abstract  = {Um in der digitalisierten Wirtschaft mitzuspielen, m{\"u}ssen Unternehmen, Markt und insbesondere Kunden detailliert verstanden werden. Neben den „Big Playern" aus dem Silicon Valley sieht der deutsche Mittelstand, der zu großen Teilen noch auf gewachsenen IT-Infrastrukturen und Prozessen agiert, oft alt aus. Um in den n{\"a}chsten Jahren nicht g{\"a}nzlich abgeh{\"a}ngt zu werden, ist ein Umbruch notwendig. Sowohl Leistungserstellungsprozesse als auch Leistungsangebot m{\"u}ssen transparent und datenbasiert ausgerichtet werden. Nur so k{\"o}nnen Gesch{\"a}ftsvorf{\"a}lle, das Marktgeschehen sowie Handeln der Akteure integrativ bewertet und fundierte Entscheidungen getroffen werden. In diesem Beitrag wird das Konzept der Data-Driven Organization vorgestellt und aufgezeigt, wie Unternehmen den eigenen Analyticsreifegrad ermitteln und in einem iterativen Transformationsprozess steigern k{\"o}nnen.},
  language  = {de}
}
@article{UllrichTeichmannGronau2021,
  author    = {Ullrich, Andr{\´e} and Teichmann, Malte and Gronau, Norbert},
  title     = {Fast trainable capabilities in software engineering-skill development in learning factories},
  series = {Ji suan ji jiao yu = Computer Education / Qing hua da xue},
  journal   = {Ji suan ji jiao yu = Computer Education / Qing hua da xue},
  number    = {12},
  publisher = {[Verlag nicht ermittelbar]},
  address   = {Bei jing shi},
  issn      = {1672-5913},
  doi       = {10.16512/j.cnki.jsjjy.2020.12.002},
  pages     = {2 -- 10},
  year      = {2021},
  abstract  = {The increasing demand for software engineers cannot completely be fulfilled by university education and conventional training approaches due to limited capacities. Accordingly, an alternative approach is necessary where potential software engineers are being educated in software engineering skills using new methods. We suggest micro tasks combined with theoretical lessons to overcome existing skill deficits and acquire fast trainable capabilities. This paper addresses the gap between demand and supply of software engineers by introducing an actionoriented and scenario-based didactical approach, which enables non-computer scientists to code. Therein, the learning content is provided in small tasks and embedded in learning factory scenarios. Therefore, different requirements for software engineers from the market side and from an academic viewpoint are analyzed and synthesized into an integrated, yet condensed skills catalogue. This enables the development of training and education units that focus on the most important skills demanded on the market. To achieve this objective, individual learning scenarios are developed. Of course, proper basic skills in coding cannot be learned over night but software programming is also no sorcery.},
  language  = {en}
}
@book{BarkowskyGiese2023,
  author    = {Barkowsky, Matthias and Giese, Holger},
  title     = {Triple graph grammars for multi-version models},
  number    = {155},
  isbn      = {978-3-86956-556-9},
  issn      = {1613-5652},
  doi       = {10.25932/publishup-57399},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-573994},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {28 -- 28},
  year      = {2023},
  abstract  = {Like conventional software projects, projects in model-driven software engineering require adequate management of multiple versions of development artifacts, importantly allowing living with temporary inconsistencies. In the case of model-driven software engineering, employed versioning approaches also have to handle situations where different artifacts, that is, different models, are linked via automatic model transformations. In this report, we propose a technique for jointly handling the transformation of multiple versions of a source model into corresponding versions of a target model, which enables the use of a more compact representation that may afford improved execution time of both the transformation and further analysis operations. Our approach is based on the well-known formalism of triple graph grammars and a previously introduced encoding of model version histories called multi-version models. In addition to showing the correctness of our approach with respect to the standard semantics of triple graph grammars, we conduct an empirical evaluation that demonstrates the potential benefit regarding execution time performance.},
  language  = {en}
}
@article{BaberowskiLeonhardtRentschetal.2023,
  author    = {Baberowski, David and Leonhardt, Thiemo and Rentsch, Susanne and Bergner, Nadine},
  title     = {Aufbau informatischer Kompetenzen im Kontext KI bei Lehramtsstudierenden des Faches Politik},
  series = {Hochschuldidaktik Informatik HDI 2021 (Commentarii informaticae didacticae)},
  journal   = {Hochschuldidaktik Informatik HDI 2021 (Commentarii informaticae didacticae)},
  number    = {13},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-548-4},
  issn      = {1868-0844},
  doi       = {10.25932/publishup-61599},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-615995},
  pages     = {189 -- 209},
  year      = {2023},
  abstract  = {Lehrkr{\"a}fte aller F{\"a}cher ben{\"o}tigen informatische Kompetenzen, um der wachsenden Alltagsrelevanz von Informatik und aktuell g{\"u}ltigen Lehrpl{\"a}nen gerecht zu werden. Beispielsweise verweist in Sachsen der Lehrplan f{\"u}r das Fach Gemeinschaftskunde, Rechtserziehung und Wirtschaft am Gymnasium mit dem f{\"u}r die Jahrgangsstufe 11 vorgesehenem Thema „Digitalisierung und sozialer Wandel" auf K{\"u}nstliche Intelligenz (KI) und explizit auf die Bedeutung der informatischen Bildung. Um die n{\"o}tigen informatischen Grundlagen zu vermitteln, wurde f{\"u}r Lehramtsstudierende des Faches Politik ein Workshop erarbeitet, der die Grundlagen der Funktionsweise von KI anhand von {\"u}berwachtem maschinellen Lernen in neuronalen Netzen vermittelt. Inhalt des Workshops ist es, mit Bezug auf gesellschaftliche Implikationen wie Datenschutz bei Trainingsdaten und algorithmic bias einen informierten Diskurs zu politischen Themen zu erm{\"o}glichen. Ziele des Workshops f{\"u}r Lehramtsstudierende mit dem Fach Politik sind: (1) Aufbau informatischer Kompetenzen in Bezug zum Thema KI, (2) St{\"a}rkung der Diskussionsf{\"a}higkeiten der Studierenden durch passende informatische Kompetenzen und (3) Anregung der Studierenden zum Transfer auf passende Themenstellungen im Politikunterricht. Das Evaluationskonzept umfasst eine Pre-Post-Befragung zur Zuversicht zur Vermittlungskompetenz unter Bezug auf maschinelles Lernen in neuronalen Netzen im Unterricht, sowie die Analyse einer abschließenden Diskussion. F{\"u}r die Pre-Post-Befragung konnte eine Steigerung der Zuversicht zur Vermittlungskompetenz beobachtet werden. Die Analyse der Diskussion zeigte das Bewusstsein der Alltagsrelevanz des Themas KI bei den Teilnehmenden, aber noch keine Anwendung der informatischen Inhalte des Workshops zur St{\"u}tzung der Argumente in der Diskussion.},
  language  = {de}
}
@article{ThorbrueggeDeselSchaefer2023,
  author    = {Thorbr{\"u}gge, Carsten and Desel, J{\"o}rg and Sch{\"a}fer, Len Ole},
  title     = {Vorqualifikationen und Anerkennungsoptionen im Informatikstudium},
  series = {Hochschuldidaktik Informatik HDI 2021 (Commentarii informaticae didacticae)},
  journal   = {Hochschuldidaktik Informatik HDI 2021 (Commentarii informaticae didacticae)},
  number    = {13},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-548-4},
  issn      = {1868-0844},
  doi       = {10.25932/publishup-61394},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-613942},
  pages     = {73 -- 89},
  year      = {2023},
  abstract  = {Viele Informatikstudierende sammeln bereits vor ihrem Studium berufliche Erfahrungen im Informatikbereich, ohne dass diese inhaltlich und didaktisch im Studium ber{\"u}cksichtigt werden. Dieser Beitrag geht der Frage nach, welche Kompetenzen aus beruflichen Vorqualifikationen bei Informatikstudierenden existieren und wie diese in Bezug zu Anerkennungsoptionen gesetzt werden k{\"o}nnen. Betrachtet werden: die pauschale Anerkennung, die auf erworbenen Zertifikaten beruht; die individuelle Anerkennung, bei der individuell erworbene Kompetenzen nachgewiesen werden; die Adaption von individuellen Lernwegen, die Teilkompetenzen der Studierenden ber{\"u}cksichtigt. Es wird eine Interviewstudie vorgestellt, in der Kompetenzen f{\"u}r ein Sample von Informatikstudierenden mit Vorqualifikation als Fachinformatiker/in erhoben und eine Zuordnung zu den Anerkennungsoptionen vorgenommen wurde. F{\"u}r die pr{\"a}zisere Gestaltung von Anerkennungsprozessen und zur kritischen Reflexion der eingesetzten hochschuldidaktischen Konzepte wurde eine empirische Basis geschaffen. Die vorhandenen Konzepte richten sich traditionell an Abiturienten/ innen mit sehr geringem Informatikhintergrund und ber{\"u}cksichtigen die tats{\"a}chlich existierende Heterogenit{\"a}t der Studienanf{\"a}nger/innen nicht angemessen. Die Ergebnisse zeigen, dass die Befragten aus ihrer Vorqualifikation relevante fachliche Kompetenzen mitbringen, die mit den Anerkennungsoptionen korrespondieren und deren Weiterentwicklung dienen k{\"o}nnen. Dar{\"u}ber hinaus werden aus {\"u}berfachlichen Kompetenzen wie Selbststeuerungskompetenzen weitere Erkenntnisse zur Studiengestaltung gewonnen.},
  language  = {de}
}
@article{MarxFreundlichKlotzetal.2021,
  author    = {Marx, Susanne and Freundlich, Heidi and Klotz, Michael and Kyl{\"a}nen, Mika and Niedoszytko, Grazyna and Swacha, Jakub and Vollerthum, Anne},
  title     = {Towards an Online Learning Community on Digitalization in Tourism},
  series = {EMOOCs 2021},
  journal   = {EMOOCs 2021},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-512-5},
  doi       = {10.25932/publishup-51598},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-515986},
  pages     = {9},
  year      = {2021},
  abstract  = {Information technology and digital solutions as enablers in the tourism sector require continuous development of skills, as digital transformation is characterized by fast change, complexity and uncertainty. This research investigates how a cMOOC concept could support the tourism industry. A consortium of three universities, a tourism association, and a tourist attraction investigates online learning needs and habits of tourism industry stakeholders in the field of digitalization in a cross-border study in the Baltic Sea region. The multi-national survey (n = 244) reveals a high interest in participating in an online learning community, with two-thirds of respondents seeing opportunities to contributing to such community apart from consuming knowledge. The paper demonstrates preferred ways of learning, motivational and hampering aspects as well as types of possible contributions.},
  language  = {en}
}
@article{Weicker2023,
  author    = {Weicker, Karsten},
  title     = {Peer-Review als Katalysator im Lernprozess},
  series = {Hochschuldidaktik Informatik HDI 2021 (Commentarii informaticae didacticae)},
  journal   = {Hochschuldidaktik Informatik HDI 2021 (Commentarii informaticae didacticae)},
  number    = {13},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-548-4},
  issn      = {1868-0844},
  doi       = {10.25932/publishup-61602},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-616025},
  pages     = {257 -- 277},
  year      = {2023},
  abstract  = {Peer-Reviews werden seit geraumer Zeit in unterschiedlichen Lehrszenarien eingesetzt. In diesem Paper wird untersucht, inwieweit das Peer- Review die Auseinandersetzung mit den Inhalten eines Grundlagenmoduls in einem pr{\"a}senzfreien Lehrszenario bef{\"o}rdern kann. Dabei scheint in den Ergebnissen die Qualit{\"a}t der selbst erstellten Reviews einer der wichtigsten Einflussfaktoren f{\"u}r den Lernerfolg zu sein, w{\"a}hrend Experten-Feedback und weitere Faktoren deutlich untergeordnet erscheinen. Die F{\"a}higkeit ausf{\"u}hrliche Peer-Reviews zu verfassen geht einher mit dem Erwerb von fachlicher Kompetenz bzw. entsprechenden fachlichen Vorkenntnissen.},
  language  = {de}
}
@article{OpelNetzerDesel2023,
  author    = {Opel, Simone and Netzer, Cajus Marian and Desel, J{\"o}rg},
  title     = {Adaption von Lernwegen in adaptierten Lehrmaterialien f{\"u}r Studierende mit Berufsausbildungsabschluss},
  series = {Hochschuldidaktik Informatik HDI 2021 (Commentarii informaticae didacticae)},
  journal   = {Hochschuldidaktik Informatik HDI 2021 (Commentarii informaticae didacticae)},
  number    = {13},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-548-4},
  issn      = {1868-0844},
  doi       = {10.25932/publishup-61418},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-614188},
  pages     = {91 -- 114},
  year      = {2023},
  abstract  = {Obwohl immer mehr Menschen nicht direkt ein Studium aufnehmen, sondern zuvor eine berufliche Ausbildung absolvieren, werden die in der Ausbildung erworbenen Kompetenzen von den Hochschulen inhaltlich und didaktisch meist ignoriert. Ein Ansatz, diese Kompetenzen zu w{\"u}rdigen, ist die formale Anrechnung von mitgebrachten Kompetenzen als (f{\"u}r den Studienabschluss erforderliche) Leistungspunkte. Eine andere Variante ist der Einsatz von speziell f{\"u}r die Zielgruppe der Studierenden mit Vorkenntnissen adaptiertem Lehr-Lernmaterial. Um dar{\"u}ber hinaus individuelle Unterschiede zu ber{\"u}cksichtigen, erlaubt eine weitere Adaption individueller Lernpfade den Lernenden, genau die jeweils fehlenden Kompetenzen zu erwerben. In diesem Beitrag stellen wir die exemplarische Entwicklung derartigen Materials anhand des Kurses „Datenbanken" f{\"u}r die Zielgruppe der Studierenden mit einer abgeschlossenen Ausbildung zum Fachinformatiker bzw. zur Fachinformatikerin vor.},
  language  = {de}
}
@article{Weber2023,
  author    = {Weber, Gerhard},
  title     = {Informatik und Barrierefreiheit},
  series = {Hochschuldidaktik Informatik HDI 2021 (Commentarii informaticae didacticae)},
  journal   = {Hochschuldidaktik Informatik HDI 2021 (Commentarii informaticae didacticae)},
  number    = {13},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-548-4},
  issn      = {1868-0844},
  doi       = {10.25932/publishup-61387},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-613874},
  pages     = {35 -- 50},
  year      = {2023},
  abstract  = {Barrierefreiheit kann durch Methoden der Informatik hergestellt und ausgebaut werden. Dieser eingeladene Beitrag stellt die Anforderungen von Menschen mit den umfangreichsten Benutzererfordernissen an Software vor, die z. B. eigene Schriftsysteme wie Braille und entsprechende taktile Ausgabeger{\"a}te verwenden. Assistive Technologien umfassen dabei auch Software verschiedenster Art. Es werden die wichtigsten Kompetenzen daf{\"u}r vorgestellt. Im Curriculum der Informatik k{\"o}nnen diese Kompetenzen im Rahmen von speziellen Vorlesungen und {\"U}bungen vermittelt werden oder sie werden in die jeweiligen Fachgebiete integriert. Um den Studienbetrieb ebenfalls barrierefrei zu gestalten, sind weitere Anstrengungen notwendig, die Lehrende, Verwaltung und die Hochschulleitung einbeziehen.},
  language  = {de}
}
@article{SchellSchwill2023,
  author    = {Schell, Timon and Schwill, Andreas},
  title     = {„Es ist kompliziert, alles inklusive Privatleben unter einen Hut zu bekommen"},
  series = {Hochschuldidaktik Informatik HDI 2021 (Commentarii informaticae didacticae)},
  journal   = {Hochschuldidaktik Informatik HDI 2021 (Commentarii informaticae didacticae)},
  number    = {13},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-548-4},
  issn      = {1868-0844},
  doi       = {10.25932/publishup-61388},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-613882},
  pages     = {53 -- 71},
  year      = {2023},
  abstract  = {Eine {\"u}bliche Erz{\"a}hlung verkn{\"u}pft lange Studienzeiten und hohe Abbrecherquoten im Informatikstudium zum einen mit der sehr gut bezahlten Nebent{\"a}tigkeit von Studierenden in der Informatikbranche, die deutlich studienzeitverl{\"a}ngernd sei; zum anderen werde wegen des hohen Bedarfs an Informatikern ein formeller Studienabschluss von den Studierenden h{\"a}ufig als entbehrlich betrachtet und eine Karriere in der Informatikbranche ohne abgeschlossenes Studium begonnen. In dieser Studie, durchgef{\"u}hrt an der Universit{\"a}t Potsdam, untersuchen wir, wie viele Informatikstudierende neben dem Studium innerhalb und außerhalb der Informatikbranche arbeiten, welche Erwartungen sie neben der Bezahlung damit verbinden und wie sich die T{\"a}tigkeit auf ihr Studium und ihre sp{\"a}tere berufliche Perspektive auswirkt. Aus aktuellem Anlass interessieren uns auch die Auswirkungen der Covid-19-Pandemie auf die Arbeitst{\"a}tigkeiten der Informatikstudierenden.},
  language  = {de}
}
@article{RoostapourNeumannNeumannetal.2022,
  author    = {Roostapour, Vahid and Neumann, Aneta and Neumann, Frank and Friedrich, Tobias},
  title     = {Pareto optimization for subset selection with dynamic cost constraints},
  series = {Artificial intelligence},
  volume    = {302},
  journal   = {Artificial intelligence},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0004-3702},
  doi       = {10.1016/j.artint.2021.103597},
  pages     = {17},
  year      = {2022},
  abstract  = {We consider the subset selection problem for function f with constraint bound B that changes over time. Within the area of submodular optimization, various greedy approaches are commonly used. For dynamic environments we observe that the adaptive variants of these greedy approaches are not able to maintain their approximation quality. Investigating the recently introduced POMC Pareto optimization approach, we show that this algorithm efficiently computes a phi=(alpha(f)/2)(1 - 1/e(alpha)f)-approximation, where alpha(f) is the submodularity ratio of f, for each possible constraint bound b <= B. Furthermore, we show that POMC is able to adapt its set of solutions quickly in the case that B increases. Our experimental investigations for the influence maximization in social networks show the advantage of POMC over generalized greedy algorithms. We also consider EAMC, a new evolutionary algorithm with polynomial expected time guarantee to maintain phi approximation ratio, and NSGA-II with two different population sizes as advanced multi-objective optimization algorithm, to demonstrate their challenges in optimizing the maximum coverage problem. Our empirical analysis shows that, within the same number of evaluations, POMC is able to perform as good as NSGA-II under linear constraint, while EAMC performs significantly worse than all considered algorithms in most cases.},
  language  = {en}
}
@inproceedings{KrasnovaGundlachBaumann2022,
  author    = {Krasnova, Hanna and Gundlach, Jana and Baumann, Annika},
  title     = {Coming back for more},
  series = {PACIS 2022 proceedings},
  booktitle = {PACIS 2022 proceedings},
  publisher = {AIS Electronic Library (AISeL)},
  address   = {[Erscheinungsort nicht ermittelbar]},
  isbn      = {9781958200018},
  year      = {2022},
  abstract  = {Recent spikes in social networking site (SNS) usage times have launched investigations into reasons for excessive SNS usage. Extending research on social factors (i.e., fear of missing out), this study considers the News Feed setup. More specifically, we suggest that the order of the News Feed (chronological vs. algorithmically assembled posts) affects usage behaviors. Against the background of the variable reward schedule, this study hypothesizes that the different orders exert serendipity differently. Serendipity, termed as unexpected lucky encounters with information, resembles variable rewards. Studies have evidenced a relation between variable rewards and excessive behaviors. Similarly, we hypothesize that order-induced serendipitous encounters affect SNS usage times and explore this link in a two-wave survey with an experimental setup (users using either chronological or algorithmic News Feeds). While theoretically extending explanations for increased SNS usage times by considering the News Feed order, practically the study will offer recommendations for relevant stakeholders.},
  language  = {en}
}
@inproceedings{AbramovaGundlachBilda2021,
  author    = {Abramova, Olga and Gundlach, Jana and Bilda, Juliane},
  title     = {Understanding the role of newsfeed clutter in stereotype activation},
  series = {PACIS 2021 proceedings},
  booktitle = {PACIS 2021 proceedings},
  number    = {473},
  publisher = {AIS Electronic Library (AISeL)},
  address   = {[Erscheinungsort nicht ermittelbar]},
  isbn      = {978-1-7336325-7-7},
  year      = {2021},
  abstract  = {Despite the phenomenal growth of Big Data Analytics in the last few years, little research is done to explicate the relationship between Big Data Analytics Capability (BDAC) and indirect strategic value derived from such digital capabilities. We attempt to address this gap by proposing a conceptual model of the BDAC - Innovation relationship using dynamic capability theory. The work expands on BDAC business value research and extends the nominal research done on BDAC - innovation. We focus on BDAC's relationship with different innovation objects, namely product, business process, and business model innovation, impacting all value chain activities. The insights gained will stimulate academic and practitioner interest in explicating strategic value generated from BDAC and serve as a framework for future research on the subject},
  language  = {en}
}
@article{NdashimyeHebieTjaden2022,
  author    = {Ndashimye, Felix and Hebie, Oumarou and Tjaden, Jasper},
  title     = {Effectiveness of WhatsApp for measuring migration in follow-up phone surveys},
  series = {Social science computer review},
  journal   = {Social science computer review},
  publisher = {Sage},
  address   = {Thousand Oaks},
  issn      = {0894-4393},
  doi       = {10.1177/08944393221111340},
  pages     = {20},
  year      = {2022},
  abstract  = {Phone surveys have increasingly become important data collection tools in developing countries, particularly in the context of sudden contact restrictions due to the COVID-19 pandemic. So far, there is limited evidence regarding the potential of the messenger service WhatsApp for remote data collection despite its large global coverage and expanding membership. WhatsApp may offer advantages in terms of reducing panel attrition and cutting survey costs. WhatsApp may offer additional benefits to migration scholars interested in cross-border migration behavior which is notoriously difficult to measure using conventional face-to-face surveys. In this field experiment, we compared the response rates between WhatsApp and interactive voice response (IVR) modes using a sample of 8446 contacts in Senegal and Guinea. At 12\%, WhatsApp survey response rates were nearly eight percentage points lower than IVR survey response rates. However, WhatsApp offers higher survey completion rates, substantially lower costs and does not introduce more sample selection bias compared to IVR. We discuss the potential of WhatsApp surveys in low-income contexts and provide practical recommendations for field implementation.},
  language  = {en}
}
@article{SpiekermannKrasnovaHinzetal.2022,
  author    = {Spiekermann, Sarah and Krasnova, Hanna and Hinz, Oliver and Baumann, Annika and Benlian, Alexander and Gimpel, Henner and Heimbach, Irina and Koester, Antonia and Maedche, Alexander and Niehaves, Bjoern and Risius, Marten and Trenz, Manuel},
  title     = {Values and ethics in information systems},
  series = {Business \& information systems engineering},
  volume    = {64},
  journal   = {Business \& information systems engineering},
  number    = {2},
  publisher = {Springer Gabler},
  address   = {Wiesbaden},
  issn      = {2363-7005},
  doi       = {10.1007/s12599-021-00734-8},
  pages     = {247 -- 264},
  year      = {2022},
  language  = {en}
}
@book{GerkenUebernickeldePaula2022,
  author    = {Gerken, Stefanie and Uebernickel, Falk and de Paula, Danielly},
  title     = {Design Thinking: a Global Study on Implementation Practices in Organizations},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-525-5},
  doi       = {10.25932/publishup-53466},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-534668},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {230},
  year      = {2022},
  abstract  = {These days design thinking is no longer a "new approach". Among practitioners, as well as academics, interest in the topic has gathered pace over the last two decades. However, opinions are divided over the longevity of the phenomenon: whether design thinking is merely "old wine in new bottles," a passing trend, or still evolving as it is being spread to an increasing number of organizations and industries. Despite its growing relevance and the diffusion of design thinking, knowledge on the actual status quo in organizations remains scarce. With a new study, the research team of Prof. Uebernickel and Stefanie Gerken investigates temporal developments and changes in design thinking practices in organizations over the past six years comparing the results of the 2015 "Parts without a whole" study with current practices and future developments. Companies of all sizes and from different parts of the world participated in the survey. The findings from qualitative interviews with experts, i.e., people who have years of knowledge with design thinking, were cross-checked with the results from an exploratory analysis of the survey data. This analysis uncovers significant variances and similarities in how design thinking is interpreted and applied in businesses.},
  language  = {en}
}
@book{FlottererMaximovaSchneideretal.2022,
  author    = {Flotterer, Boris and Maximova, Maria and Schneider, Sven and Dyck, Johannes and Z{\"o}llner, Christian and Giese, Holger and H{\´e}ly, Christelle and Gaucherel, C{\´e}dric},
  title     = {Modeling and Formal Analysis of Meta-Ecosystems with Dynamic Structure using Graph Transformation},
  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    = {147},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-533-0},
  issn      = {1613-5652},
  doi       = {10.25932/publishup-54764},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-547643},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {47},
  year      = {2022},
  abstract  = {The dynamics of ecosystems is of crucial importance. Various model-based approaches exist to understand and analyze their internal effects. In this paper, we model the space structure dynamics and ecological dynamics of meta-ecosystems using the formal technique of Graph Transformation (short GT). We build GT models to describe how a meta-ecosystem (modeled as a graph) can evolve over time (modeled by GT rules) and to analyze these GT models with respect to qualitative properties such as the existence of structural stabilities. As a case study, we build three GT models describing the space structure dynamics and ecological dynamics of three different savanna meta-ecosystems. The first GT model considers a savanna meta-ecosystem that is limited in space to two ecosystem patches, whereas the other two GT models consider two savanna meta-ecosystems that are unlimited in the number of ecosystem patches and only differ in one GT rule describing how the space structure of the meta-ecosystem grows. In the first two GT models, the space structure dynamics and ecological dynamics of the meta-ecosystem shows two main structural stabilities: the first one based on grassland-savanna-woodland transitions and the second one based on grassland-desert transitions. The transition between these two structural stabilities is driven by high-intensity fires affecting the tree components. In the third GT model, the GT rule for savanna regeneration induces desertification and therefore a collapse of the meta-ecosystem. We believe that GT models provide a complementary avenue to that of existing approaches to rigorously study ecological phenomena.},
  language  = {en}
}
@misc{HempelKoseskaNikoloskietal.2017,
  author    = {Hempel, Sabrina and Koseska, Aneta and Nikoloski, Zoran and Kurths, J{\"u}rgen},
  title     = {Unraveling gene regulatory networks from time-resolved gene expression data},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-400924},
  pages     = {26},
  year      = {2017},
  abstract  = {Background: Inferring regulatory interactions between genes from transcriptomics time-resolved data, yielding reverse engineered gene regulatory networks, is of paramount importance to systems biology and bioinformatics studies. Accurate methods to address this problem can ultimately provide a deeper insight into the complexity, behavior, and functions of the underlying biological systems. However, the large number of interacting genes coupled with short and often noisy time-resolved read-outs of the system renders the reverse engineering a challenging task. Therefore, the development and assessment of methods which are computationally efficient, robust against noise, applicable to short time series data, and preferably capable of reconstructing the directionality of the regulatory interactions remains a pressing research problem with valuable applications. Results: Here we perform the largest systematic analysis of a set of similarity measures and scoring schemes within the scope of the relevance network approach which are commonly used for gene regulatory network reconstruction from time series data. In addition, we define and analyze several novel measures and schemes which are particularly suitable for short transcriptomics time series. We also compare the considered 21 measures and 6 scoring schemes according to their ability to correctly reconstruct such networks from short time series data by calculating summary statistics based on the corresponding specificity and sensitivity. Our results demonstrate that rank and symbol based measures have the highest performance in inferring regulatory interactions. In addition, the proposed scoring scheme by asymmetric weighting has shown to be valuable in reducing the number of false positive interactions. On the other hand, Granger causality as well as information-theoretic measures, frequently used in inference of regulatory networks, show low performance on the short time series analyzed in this study. Conclusions: Our study is intended to serve as a guide for choosing a particular combination of similarity measures and scoring schemes suitable for reconstruction of gene regulatory networks from short time series data. We show that further improvement of algorithms for reverse engineering can be obtained if one considers measures that are rooted in the study of symbolic dynamics or ranks, in contrast to the application of common similarity measures which do not consider the temporal character of the employed data. Moreover, we establish that the asymmetric weighting scoring scheme together with symbol based measures (for low noise level) and rank based measures (for high noise level) are the most suitable choices.},
  language  = {en}
}
@article{CsehJuhos2021,
  author    = {Cseh, {\´A}gnes and Juhos, Attila},
  title     = {Pairwise preferences in the stable marriage problem},
  series = {ACM Transactions on Economics and Computation / Association for Computing Machinery},
  volume    = {9},
  journal   = {ACM Transactions on Economics and Computation / Association for Computing Machinery},
  number    = {1},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  issn      = {2167-8375},
  doi       = {10.1145/3434427},
  pages     = {28},
  year      = {2021},
  abstract  = {We study the classical, two-sided stable marriage problem under pairwise preferences. In the most general setting, agents are allowed to express their preferences as comparisons of any two of their edges, and they also have the right to declare a draw or even withdraw from such a comparison. This freedom is then gradually restricted as we specify six stages of orderedness in the preferences, ending with the classical case of strictly ordered lists. We study all cases occurring when combining the three known notions of stability-weak, strong, and super-stability-under the assumption that each side of the bipartite market obtains one of the six degrees of orderedness. By designing three polynomial algorithms and two NP-completeness proofs, we determine the complexity of all cases not yet known and thus give an exact boundary in terms of preference structure between tractable and intractable cases.},
  language  = {en}
}
@article{CsehKavitha2021,
  author    = {Cseh, {\´A}gnes and Kavitha, Telikepalli},
  title     = {Popular matchings in complete graphs},
  series = {Algorithmica : an international journal in computer science},
  volume    = {83},
  journal   = {Algorithmica : an international journal in computer science},
  number    = {5},
  publisher = {Springer},
  address   = {New York},
  issn      = {0178-4617},
  doi       = {10.1007/s00453-020-00791-7},
  pages     = {1493 -- 1523},
  year      = {2021},
  abstract  = {Our input is a complete graph G on n vertices where each vertex has a strict ranking of all other vertices in G. The goal is to construct a matching in G that is popular. A matching M is popular if M does not lose a head-to-head election against any matching M ': here each vertex casts a vote for the matching in {M,M '} in which it gets a better assignment. Popular matchings need not exist in the given instance G and the popular matching problem is to decide whether one exists or not. The popular matching problem in G is easy to solve for odd n. Surprisingly, the problem becomes NP-complete for even n, as we show here. This is one of the few graph theoretic problems efficiently solvable when n has one parity and NP-complete when n has the other parity.},
  language  = {en}
}
@article{BredeBotta2021,
  author    = {Brede, Nuria and Botta, Nicola},
  title     = {On the correctness of monadic backward induction},
  series = {Journal of functional programming},
  volume    = {31},
  journal   = {Journal of functional programming},
  publisher = {Cambridge University Press},
  address   = {Cambridge},
  issn      = {1469-7653},
  doi       = {10.1017/S0956796821000228},
  pages     = {39},
  year      = {2021},
  abstract  = {In control theory, to solve a finite-horizon sequential decision problem (SDP) commonly means to find a list of decision rules that result in an optimal expected total reward (or cost) when taking a given number of decision steps. SDPs are routinely solved using Bellman's backward induction. Textbook authors (e.g. Bertsekas or Puterman) typically give more or less formal proofs to show that the backward induction algorithm is correct as solution method for deterministic and stochastic SDPs. Botta, Jansson and Ionescu propose a generic framework for finite horizon, monadic SDPs together with a monadic version of backward induction for solving such SDPs. In monadic SDPs, the monad captures a generic notion of uncertainty, while a generic measure function aggregates rewards. In the present paper, we define a notion of correctness for monadic SDPs and identify three conditions that allow us to prove a correctness result for monadic backward induction that is comparable to textbook correctness proofs for ordinary backward induction. The conditions that we impose are fairly general and can be cast in category-theoretical terms using the notion of Eilenberg-Moore algebra. They hold in familiar settings like those of deterministic or stochastic SDPs, but we also give examples in which they fail. Our results show that backward induction can safely be employed for a broader class of SDPs than usually treated in textbooks. However, they also rule out certain instances that were considered admissible in the context of Botta et al. 's generic framework. Our development is formalised in Idris as an extension of the Botta et al. framework and the sources are available as supplementary material.},
  language  = {en}
}
@article{StaufferMengeshaSeifertetal.2022,
  author    = {Stauffer, Maxime and Mengesha, Isaak and Seifert, Konrad and Krawczuk, Igor and Fischer, Jens and Serugendo, Giovanna Di Marzo},
  title     = {A computational turn in policy process studies},
  series = {Complexity},
  volume    = {2022},
  journal   = {Complexity},
  publisher = {Wiley-Hindawi},
  address   = {London},
  issn      = {1076-2787},
  doi       = {10.1155/2022/8210732},
  pages     = {17},
  year      = {2022},
  abstract  = {The past three decades of policy process studies have seen the emergence of a clear intellectual lineage with regard to complexity. Implicitly or explicitly, scholars have employed complexity theory to examine the intricate dynamics of collective action in political contexts. However, the methodological counterparts to complexity theory, such as computational methods, are rarely used and, even if they are, they are often detached from established policy process theory. Building on a critical review of the application of complexity theory to policy process studies, we present and implement a baseline model of policy processes using the logic of coevolving networks. Our model suggests that an actor's influence depends on their environment and on exogenous events facilitating dialogue and consensus-building. Our results validate previous opinion dynamics models and generate novel patterns. Our discussion provides ground for further research and outlines the path for the field to achieve a computational turn.},
  language  = {en}
}
@article{WenderingNikoloski2022,
  author    = {Wendering, Philipp and Nikoloski, Zoran},
  title     = {COMMIT},
  series = {PLoS Computational Biology : a new community journal / publ. by the Public Library of Science (PLoS) in association with the International Society for Computational Biology (ISCB)},
  volume    = {18},
  journal   = {PLoS Computational Biology : a new community journal / publ. by the Public Library of Science (PLoS) in association with the International Society for Computational Biology (ISCB)},
  number    = {3},
  publisher = {Public Library of Science},
  address   = {San Fransisco},
  issn      = {1553-734X},
  doi       = {10.1371/journal.pcbi.1009906},
  pages     = {24},
  year      = {2022},
  abstract  = {Composition and functions of microbial communities affect important traits in diverse hosts, from crops to humans. Yet, mechanistic understanding of how metabolism of individual microbes is affected by the community composition and metabolite leakage is lacking. Here, we first show that the consensus of automatically generated metabolic reconstructions improves the quality of the draft reconstructions, measured by comparison to reference models. We then devise an approach for gap filling, termed COMMIT, that considers metabolites for secretion based on their permeability and the composition of the community. By applying COMMIT with two soil communities from the Arabidopsis thaliana culture collection, we could significantly reduce the gap-filling solution in comparison to filling gaps in individual reconstructions without affecting the genomic support. Inspection of the metabolic interactions in the soil communities allows us to identify microbes with community roles of helpers and beneficiaries. Therefore, COMMIT offers a versatile fully automated solution for large-scale modelling of microbial communities for diverse biotechnological applications. <br /> Author summaryMicrobial communities are important in ecology, human health, and crop productivity. However, detailed information on the interactions within natural microbial communities is hampered by the community size, lack of detailed information on the biochemistry of single organisms, and the complexity of interactions between community members. Metabolic models are comprised of biochemical reaction networks based on the genome annotation, and can provide mechanistic insights into community functions. Previous analyses of microbial community models have been performed with high-quality reference models or models generated using a single reconstruction pipeline. However, these models do not contain information on the composition of the community that determines the metabolites exchanged between the community members. In addition, the quality of metabolic models is affected by the reconstruction approach used, with direct consequences on the inferred interactions between community members. Here, we use fully automated consensus reconstructions from four approaches to arrive at functional models with improved genomic support while considering the community composition. We applied our pipeline to two soil communities from the Arabidopsis thaliana culture collection, providing only genome sequences. Finally, we show that the obtained models have 90\% genomic support and demonstrate that the derived interactions are corroborated by independent computational predictions.},
  language  = {en}
}
@misc{BenlianWienerCrametal.2022,
  author    = {Benlian, Alexander and Wiener, Martin and Cram, W. Alec and Krasnova, Hanna and Maedche, Alexander and Mohlmann, Mareike and Recker, Jan and Remus, Ulrich},
  title     = {Algorithmic management},
  series = {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},
  number    = {6},
  issn      = {2363-7005},
  doi       = {10.25932/publishup-60711},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-607112},
  pages     = {17},
  year      = {2022},
  language  = {en}
}
@article{BenlianWienerCrametal.2022,
  author    = {Benlian, Alexander and Wiener, Martin and Cram, W. Alec and Krasnova, Hanna and Maedche, Alexander and Mohlmann, Mareike and Recker, Jan and Remus, Ulrich},
  title     = {Algorithmic management},
  series = {Business and information systems engineering},
  volume    = {64},
  journal   = {Business and information systems engineering},
  number    = {6},
  publisher = {Springer Gabler},
  address   = {Wiesbaden},
  issn      = {2363-7005},
  doi       = {10.1007/s12599-022-00764-w},
  pages     = {825 -- 839},
  year      = {2022},
  language  = {en}
}
@article{BensonMakaitRabl2021,
  author    = {Benson, Lawrence and Makait, Hendrik and Rabl, Tilmann},
  title     = {Viper},
  series = {Proceedings of the VLDB Endowment},
  volume    = {14},
  journal   = {Proceedings of the VLDB Endowment},
  number    = {9},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  issn      = {2150-8097},
  doi       = {10.14778/3461535.3461543},
  pages     = {1544 -- 1556},
  year      = {2021},
  abstract  = {Key-value stores (KVSs) have found wide application in modern software systems. For persistence, their data resides in slow secondary storage, which requires KVSs to employ various techniques to increase their read and write performance from and to the underlying medium. Emerging persistent memory (PMem) technologies offer data persistence at close-to-DRAM speed, making them a promising alternative to classical disk-based storage. However, simply drop-in replacing existing storage with PMem does not yield good results, as block-based access behaves differently in PMem than on disk and ignores PMem's byte addressability, layout, and unique performance characteristics. In this paper, we propose three PMem-specific access patterns and implement them in a hybrid PMem-DRAM KVS called Viper. We employ a DRAM-based hash index and a PMem-aware storage layout to utilize the random-write speed of DRAM and efficient sequential-write performance PMem. Our evaluation shows that Viper significantly outperforms existing KVSs for core KVS operations while providing full data persistence. Moreover, Viper outperforms existing PMem-only, hybrid, and disk-based KVSs by 4-18x for write workloads, while matching or surpassing their get performance.},
  language  = {en}
}
@inproceedings{SultanowChircuWuestemannetal.2022,
  author    = {Sultanow, Eldar and Chircu, Alina and W{\"u}stemann, Stefanie and Schwan, Andr{\´e} and Lehmann, Andreas and Sept, Andr{\´e} and Szymaski, Oliver and Venkatesan, Sripriya and Ritterbusch, Georg David and Teichmann, Malte Rolf},
  title     = {Metaverse opportunities for the public sector},
  series = {International Conference on Information Systems 2022 : Special Interest Group on Big Data : Proceedings},
  booktitle = {International Conference on Information Systems 2022 : Special Interest Group on Big Data : Proceedings},
  publisher = {AIS},
  address   = {Atlanta},
  year      = {2022},
  abstract  = {The metaverse is envisioned as a virtual shared space facilitated by emerging technologies such as virtual reality (VR), augmented reality (AR), the Internet of Things (IoT), 5G, artificial intelligence (AI), big data, spatial computing, and digital twins (Allam et al., 2022; Dwivedi et al., 2022; Ravenscraft, 2022; Wiles, 2022). While still a nascent concept, the metaverse has the potential to "transform the physical world, as well as transport or extend physical activities to a virtual world" (Wiles, 2022). Big data technologies will also be essential in managing the enormous amounts of data created in the metaverse (Sun et al., 2022). Metaverse technologies can offer the public sector a host of benefits, such as simplified information exchange, stronger communication with citizens, better access to public services, or benefiting from a new virtual economy. Implementations are underway in several cities around the world (Geraghty et al., 2022). In this paper, we analyze metaverse opportunities for the public sector and explore their application in the context of Germany's Federal Employment Agency. Based on an analysis of academic literature and practical examples, we create a capability map for potential metaverse business capabilities for different areas of the public sector (broadly defined). These include education (virtual training and simulation, digital campuses that offer not just online instruction but a holistic university campus experience, etc.), tourism (virtual travel to remote locations and museums, virtual festival participation, etc.), health (employee training - as for emergency situations, virtual simulations for patient treatment - for example, for depression or anxiety, etc.), military (virtual training to experience operational scenarios without being exposed to a real-world threats, practice strategic decision-making, or gain technical knowledge for operating and repairing equipment, etc.), administrative services (document processing, virtual consultations for citizens, etc.), judiciary (AI decision-making aids, virtual proceedings, etc.), public safety (virtual training for procedural issues, special operations, or unusual situations, etc.), emergency management (training for natural disasters, etc.), and city planning (visualization of future development projects and interactive feedback, traffic management, attraction gamification, etc.), among others. We further identify several metaverse application areas for Germany's Federal Employment Agency. These applications can help it realize the goals of the German government for digital transformation that enables faster, more effective, and innovative government services. They include training of employees, training of customers, and career coaching for customers. These applications can be implemented using interactive learning games with AI agents, virtual representations of the organizational spaces, and avatars interacting with each other in these spaces. Metaverse applications will both use big data (to design the virtual environments) and generate big data (from virtual interactions). Issues related to data availability, quality, storage, processing (and related computing power requirements), interoperability, sharing, privacy and security will need to be addressed in these emerging metaverse applications (Sun et al., 2022). Special attention is needed to understand the potential for power inequities (wealth inequity, algorithmic bias, digital exclusion) due to technologies such as VR (Egliston \& Carter, 2021), harmful surveillance practices (Bibri \& Allam, 2022), and undesirable user behavior or negative psychological impacts (Dwivedi et al., 2022). The results of this exploratory study can inform public sector organizations of emerging metaverse opportunities and enable them to develop plans for action as more of the metaverse technologies become a reality. While the metaverse body of research is still small and research agendas are only now starting to emerge (Dwivedi et al., 2022), this study offers a building block for future development and analysis of metaverse applications.},
  language  = {en}
}
@inproceedings{KrauseBaumann2021,
  author    = {Krause, Hannes-Vincent and Baumann, Annika},
  title     = {The devil in disguise},
  series = {ICIS 2021: user behaviors, engagement, and consequences},
  booktitle = {ICIS 2021: user behaviors, engagement, and consequences},
  publisher = {AIS Electronic Library (AISeL)},
  address   = {[Erscheinungsort nicht ermittelbar]},
  year      = {2021},
  abstract  = {Envy constitutes a serious issue on Social Networking Sites (SNSs), as this painful emotion can severely diminish individuals' well-being. With prior research mainly focusing on the affective consequences of envy in the SNS context, its behavioral consequences remain puzzling. While negative interactions among SNS users are an alarming issue, it remains unclear to which extent the harmful emotion of malicious envy contributes to these toxic dynamics. This study constitutes a first step in understanding malicious envy's causal impact on negative interactions within the SNS sphere. Within an online experiment, we experimentally induce malicious envy and measure its immediate impact on users' negative behavior towards other users. Our findings show that malicious envy seems to be an essential factor fueling negativity among SNS users and further illustrate that this effect is especially pronounced when users are provided an objective factor to mask their envy and justify their norm-violating negative behavior.},
  language  = {en}
}
@misc{SeewannVerwiebeBuderetal.2022,
  author    = {Seewann, Lena and Verwiebe, Roland and Buder, Claudia and Fritsch, Nina-Sophie},
  title     = {"Broadcast your gender."},
  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},
  number    = {152},
  issn      = {1867-5808},
  doi       = {10.25932/publishup-56628},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-566287},
  pages     = {16},
  year      = {2022},
  abstract  = {Social media platforms provide a large array of behavioral data relevant to social scientific research. However, key information such as sociodemographic characteristics of agents are often missing. This paper aims to compare four methods of classifying social attributes from text. Specifically, we are interested in estimating the gender of German social media creators. By using the example of a random sample of 200 YouTube channels, we compare several classification methods, namely (1) a survey among university staff, (2) a name dictionary method with the World Gender Name Dictionary as a reference list, (3) an algorithmic approach using the website gender-api.com, and (4) a Multinomial Na{\"i}ve Bayes (MNB) machine learning technique. These different methods identify gender attributes based on YouTube channel names and descriptions in German but are adaptable to other languages. Our contribution will evaluate the share of identifiable channels, accuracy and meaningfulness of classification, as well as limits and benefits of each approach. We aim to address methodological challenges connected to classifying gender attributes for YouTube channels as well as related to reinforcing stereotypes and ethical implications.},
  language  = {en}
}
@article{SeewannVerwiebeBuderetal.2022,
  author    = {Seewann, Lena and Verwiebe, Roland and Buder, Claudia and Fritsch, Nina-Sophie},
  title     = {"Broadcast your gender."},
  series = {Frontiers in Big Data},
  journal   = {Frontiers in Big Data},
  number    = {5},
  publisher = {Frontiers},
  address   = {Lausanne, Schweiz},
  issn      = {2624-909X},
  doi       = {10.3389/fdata.2022.908636},
  pages     = {16},
  year      = {2022},
  abstract  = {Social media platforms provide a large array of behavioral data relevant to social scientific research. However, key information such as sociodemographic characteristics of agents are often missing. This paper aims to compare four methods of classifying social attributes from text. Specifically, we are interested in estimating the gender of German social media creators. By using the example of a random sample of 200 YouTube channels, we compare several classification methods, namely (1) a survey among university staff, (2) a name dictionary method with the World Gender Name Dictionary as a reference list, (3) an algorithmic approach using the website gender-api.com, and (4) a Multinomial Na{\"i}ve Bayes (MNB) machine learning technique. These different methods identify gender attributes based on YouTube channel names and descriptions in German but are adaptable to other languages. Our contribution will evaluate the share of identifiable channels, accuracy and meaningfulness of classification, as well as limits and benefits of each approach. We aim to address methodological challenges connected to classifying gender attributes for YouTube channels as well as related to reinforcing stereotypes and ethical implications.},
  language  = {en}
}
@article{WrightWachsHarper2018,
  author    = {Wright, Michelle F. and Wachs, Sebastian and Harper, Bridgette D.},
  title     = {The moderation of empathy in the longitudinal association between witnessing cyberbullying, depression, and anxiety},
  series = {Journal of Psychosocial Research on Cyberspace},
  volume    = {12},
  journal   = {Journal of Psychosocial Research on Cyberspace},
  number    = {4},
  publisher = {Masrykova Univ.},
  address   = {Brno},
  issn      = {1802-7962},
  doi       = {10.5817/CP2018-4-6},
  pages     = {14},
  year      = {2018},
  abstract  = {While the role of and consequences of being a bystander to face-to-face bullying has received some attention in the literature, to date, little is known about the effects of being a bystander to cyberbullying. It is also unknown how empathy might impact the negative consequences associated with being a bystander of cyberbullying. The present study focused on examining the longitudinal association between bystander of cyberbullying depression, and anxiety, and the moderating role of empathy in the relationship between bystander of cyberbullying and subsequent depression and anxiety. There were 1,090 adolescents (M-age = 12.19; 50\% female) from the United States included at Time 1, and they completed questionnaires on empathy, cyberbullying roles (bystander, perpetrator, victim), depression, and anxiety. One year later, at Time 2, 1,067 adolescents (M-age = 13.76; 51\% female) completed questionnaires on depression and anxiety. Results revealed a positive association between bystander of cyberbullying and depression and anxiety. Further, empathy moderated the positive relationship between bystander of cyberbullying and depression, but not for anxiety. Implications for intervention and prevention programs are discussed.},
  language  = {en}
}
@article{XuRazaghiMoghadamNikoloski2021,
  author    = {Xu, Rudan and Razaghi-Moghadam, Zahra and Nikoloski, Zoran},
  title     = {Maximization of non-idle enzymes improves the coverage of the estimated maximal in vivo enzyme catalytic rates in Escherichia coli},
  series = {Bioinformatics},
  volume    = {37},
  journal   = {Bioinformatics},
  number    = {21},
  publisher = {Oxford Univ. Press},
  address   = {Oxford},
  issn      = {1367-4803},
  doi       = {10.1093/bioinformatics/btab575},
  pages     = {3848 -- 3855},
  year      = {2021},
  abstract  = {Motivation: Constraint-based modeling approaches allow the estimation of maximal in vivo enzyme catalytic rates that can serve as proxies for enzyme turnover numbers. Yet, genome-scale flux profiling remains a challenge in deploying these approaches to catalogue proxies for enzyme catalytic rates across organisms. Results: Here, we formulate a constraint-based approach, termed NIDLE-flux, to estimate fluxes at a genome-scale level by using the principle of efficient usage of expressed enzymes. Using proteomics data from Escherichia coli, we show that the fluxes estimated by NIDLE-flux and the existing approaches are in excellent qualitative agreement (Pearson correlation > 0.9). We also find that the maximal in vivo catalytic rates estimated by NIDLE-flux exhibits a Pearson correlation of 0.74 with in vitro enzyme turnover numbers. However, NIDLE-flux results in a 1.4-fold increase in the size of the estimated maximal in vivo catalytic rates in comparison to the contenders. Integration of the maximum in vivo catalytic rates with publically available proteomics and metabolomics data provide a better match to fluxes estimated by NIDLE-flux. Therefore, NIDLE-flux facilitates more effective usage of proteomics data to estimate proxies for kcatomes.},
  language  = {en}
}
@article{AngeleskaOmranianNikoloski2021,
  author    = {Angeleska, Angela and Omranian, Sara and Nikoloski, Zoran},
  title     = {Coherent network partitions},
  series = {Theoretical computer science : the journal of the EATCS},
  volume    = {894},
  journal   = {Theoretical computer science : the journal of the EATCS},
  publisher = {Elsevier},
  address   = {Amsterdam [u.a.]},
  issn      = {0304-3975},
  doi       = {10.1016/j.tcs.2021.10.002},
  pages     = {3 -- 11},
  year      = {2021},
  abstract  = {We continue to study coherent partitions of graphs whereby the vertex set is partitioned into subsets that induce biclique spanned subgraphs. The problem of identifying the minimum number of edges to obtain biclique spanned connected components (CNP), called the coherence number, is NP-hard even on bipartite graphs. Here, we propose a graph transformation geared towards obtaining an O (log n)-approximation algorithm for the CNP on a bipartite graph with n vertices. The transformation is inspired by a new characterization of biclique spanned subgraphs. In addition, we study coherent partitions on prime graphs, and show that finding coherent partitions reduces to the problem of finding coherent partitions in a prime graph. Therefore, these results provide future directions for approximation algorithms for the coherence number of a given graph.},
  language  = {en}
}
@phdthesis{SchulzHanke2023,
  author    = {Schulz-Hanke, Christian},
  title     = {BCH Codes mit kombinierter Korrektur und Erkennung},
  doi       = {10.25932/publishup-61794},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-617943},
  school      = {Universit{\"a}t Potsdam},
  pages     = {ii, 191},
  year      = {2023},
  abstract  = {BCH Codes mit kombinierter Korrektur und Erkennung In dieser Arbeit wird auf Grundlage des BCH Codes untersucht, wie eine Fehlerkorrektur mit einer Erkennung h{\"o}herer Fehleranzahlen kombiniert werden kann. Mit dem Verfahren der 1-Bit Korrektur mit zus{\"a}tzlicher Erkennung h{\"o}herer Fehler wurde ein Ansatz entwickelt, welcher die Erkennung zus{\"a}tzlicher Fehler durch das parallele L{\"o}sen einfacher Gleichungen der Form s_x = s_1^x durchf{\"u}hrt. Die Anzahl dieser Gleichungen ist linear zu der Anzahl der zu {\"u}berpr{\"u}fenden h{\"o}heren Fehler. In dieser Arbeit wurde zus{\"a}tzlich f{\"u}r bis zu 4-Bit Korrekturen mit zus{\"a}tzlicher Erkennung h{\"o}herer Fehler ein weiterer allgemeiner Ansatz vorgestellt. Dabei werden parallel f{\"u}r alle korrigierbaren Fehleranzahlen spekulative Fehlerkorrekturen durchgef{\"u}hrt. Aus den bestimmten Fehlerstellen werden spekulative Syndromkomponenten erzeugt, durch welche die Fehlerstellen best{\"a}tigt und h{\"o}here erkennbare Fehleranzahlen ausgeschlossen werden k{\"o}nnen. Die vorgestellten Ans{\"a}tze unterscheiden sich von dem in entwickelten Ansatz, bei welchem die Anzahl der Fehlerstellen durch die Berechnung von Determinanten in absteigender Reihenfolge berechnet wird, bis die erste Determinante 0 bildet. Bei dem bekannten Verfahren ist durch die Berechnung der Determinanten eine faktorielle Anzahl an Berechnungen in Relation zu der Anzahl zu {\"u}berpr{\"u}fender Fehler durchzuf{\"u}hren. Im Vergleich zu dem bekannten sequentiellen Verfahrens nach Berlekamp Massey besitzen die Berechnungen im vorgestellten Ansatz simple Gleichungen und k{\"o}nnen parallel durchgef{\"u}hrt werden.Bei dem bekannten Verfahren zur parallelen Korrektur von 4-Bit Fehlern ist eine Gleichung vierten Grades im GF(2^m) zu l{\"o}sen. Dies erfolgt, indem eine Hilfsgleichung dritten Grades und vier Gleichungen zweiten Grades parallel gel{\"o}st werden. In der vorliegenden Arbeit wurde gezeigt, dass sich eine Gleichung zweiten Grades einsparen l{\"a}sst, wodurch sich eine Vereinfachung der Hardware bei einer parallelen Realisierung der 4-Bit Korrektur ergibt. Die erzielten Ergebnisse wurden durch umfangreiche Simulationen in Software und Hardwareimplementierungen {\"u}berpr{\"u}ft.},
  language  = {de}
}
@article{ChenLangeAndjelkovicetal.2022,
  author    = {Chen, Junchao and Lange, Thomas and Andjelkovic, Marko and Simevski, Aleksandar and Lu, Li and Krstić, Miloš},
  title     = {Solar particle event and single event upset prediction from SRAM-based monitor and supervised machine learning},
  series = {IEEE transactions on emerging topics in computing / IEEE Computer Society, Institute of Electrical and Electronics Engineers},
  volume    = {10},
  journal   = {IEEE transactions on emerging topics in computing / IEEE Computer Society, Institute of Electrical and Electronics Engineers},
  number    = {2},
  publisher = {Institute of Electrical and Electronics Engineers},
  address   = {[New York, NY]},
  issn      = {2168-6750},
  doi       = {10.1109/TETC.2022.3147376},
  pages     = {564 -- 580},
  year      = {2022},
  abstract  = {The intensity of cosmic radiation may differ over five orders of magnitude within a few hours or days during the Solar Particle Events (SPEs), thus increasing for several orders of magnitude the probability of Single Event Upsets (SEUs) in space-borne electronic systems. Therefore, it is vital to enable the early detection of the SEU rate changes in order to ensure timely activation of dynamic radiation hardening measures. In this paper, an embedded approach for the prediction of SPEs and SRAM SEU rate is presented. The proposed solution combines the real-time SRAM-based SEU monitor, the offline-trained machine learning model and online learning algorithm for the prediction. With respect to the state-of-the-art, our solution brings the following benefits: (1) Use of existing on-chip data storage SRAM as a particle detector, thus minimizing the hardware and power overhead, (2) Prediction of SRAM SEU rate one hour in advance, with the fine-grained hourly tracking of SEU variations during SPEs as well as under normal conditions, (3) Online optimization of the prediction model for enhancing the prediction accuracy during run-time, (4) Negligible cost of hardware accelerator design for the implementation of selected machine learning model and online learning algorithm. The proposed design is intended for a highly dependable and self-adaptive multiprocessing system employed in space applications, allowing to trigger the radiation mitigation mechanisms before the onset of high radiation levels.},
  language  = {en}
}
@phdthesis{Hosp2015,
  author    = {Hosp, Sven},
  title     = {Modifizierte Cross-Party Codes zur schnellen Mehrbit-Fehlerkorrektur},
  pages     = {105},
  year      = {2015},
  language  = {de}
}
@article{TalebRohrerBergneretal.2022,
  author    = {Taleb, Aiham and Rohrer, Csaba and Bergner, Benjamin and De Leon, Guilherme and Rodrigues, Jonas Almeida and Schwendicke, Falk and Lippert, Christoph and Krois, Joachim},
  title     = {Self-supervised learning methods for label-efficient dental caries classification},
  series = {Diagnostics : open access journal},
  volume    = {12},
  journal   = {Diagnostics : open access journal},
  number    = {5},
  publisher = {MDPI},
  address   = {Basel},
  issn      = {2075-4418},
  doi       = {10.3390/diagnostics12051237},
  pages     = {15},
  year      = {2022},
  abstract  = {High annotation costs are a substantial bottleneck in applying deep learning architectures to clinically relevant use cases, substantiating the need for algorithms to learn from unlabeled data. In this work, we propose employing self-supervised methods. To that end, we trained with three self-supervised algorithms on a large corpus of unlabeled dental images, which contained 38K bitewing radiographs (BWRs). We then applied the learned neural network representations on tooth-level dental caries classification, for which we utilized labels extracted from electronic health records (EHRs). Finally, a holdout test-set was established, which consisted of 343 BWRs and was annotated by three dental professionals and approved by a senior dentist. This test-set was used to evaluate the fine-tuned caries classification models. Our experimental results demonstrate the obtained gains by pretraining models using self-supervised algorithms. These include improved caries classification performance (6 p.p. increase in sensitivity) and, most importantly, improved label-efficiency. In other words, the resulting models can be fine-tuned using few labels (annotations). Our results show that using as few as 18 annotations can produce >= 45\% sensitivity, which is comparable to human-level diagnostic performance. This study shows that self-supervision can provide gains in medical image analysis, particularly when obtaining labels is costly and expensive.},
  language  = {en}
}
@inproceedings{VladovaUllrichSultanowetal.2023,
  author    = {Vladova, Gergana and Ullrich, Andr{\´e} and Sultanow, Eldar and Tobolla, Marinho and Sebrak, Sebastian and Czarnecki, Christian and Brockmann, Carsten},
  title     = {Visual analytics for knowledge management},
  series = {Informatik 2023},
  booktitle = {Informatik 2023},
  editor    = {Klein, Maike and Krupka, Daniel and Winter, Cornelia and Wohlgemuth, Volker},
  publisher = {Gesellschaft f{\"u}r Informatik e.V. (GI)},
  address   = {Bonn},
  isbn      = {978-3-88579-731-9},
  issn      = {1617-5468},
  doi       = {10.18420/inf2023_187},
  pages     = {1851 -- 1870},
  year      = {2023},
  abstract  = {The management of knowledge in organizations considers both established long-term processes and cooperation in agile project teams. Since knowledge can be both tacit and explicit, its transfer from the individual to the organizational knowledge base poses a challenge in organizations. This challenge increases when the fluctuation of knowledge carriers is exceptionally high. Especially in large projects in which external consultants are involved, there is a risk that critical, company-relevant knowledge generated in the project will leave the company with the external knowledge carrier and thus be lost. In this paper, we show the advantages of an early warning system for knowledge management to avoid this loss. In particular, the potential of visual analytics in the context of knowledge management systems is presented and discussed. We present a project for the development of a business-critical software system and discuss the first implementations and results.},
  language  = {en}
}
@phdthesis{Halfpap2024,
  author    = {Halfpap, Stefan},
  title     = {Integer linear programming-based heuristics for partially replicated database clusters and selecting indexes},
  doi       = {10.25932/publishup-63361},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-633615},
  school      = {Universit{\"a}t Potsdam},
  pages     = {iii, 185},
  year      = {2024},
  abstract  = {Column-oriented database systems can efficiently process transactional and analytical queries on a single node. However, increasing or peak analytical loads can quickly saturate single-node database systems. Then, a common scale-out option is using a database cluster with a single primary node for transaction processing and read-only replicas. Using (the naive) full replication, queries are distributed among nodes independently of the accessed data. This approach is relatively expensive because all nodes must store all data and apply all data modifications caused by inserts, deletes, or updates. In contrast to full replication, partial replication is a more cost-efficient implementation: Instead of duplicating all data to all replica nodes, partial replicas store only a subset of the data while being able to process a large workload share. Besides lower storage costs, partial replicas enable (i) better scaling because replicas must potentially synchronize only subsets of the data modifications and thus have more capacity for read-only queries and (ii) better elasticity because replicas have to load less data and can be set up faster. However, splitting the overall workload evenly among the replica nodes while optimizing the data allocation is a challenging assignment problem. The calculation of optimized data allocations in a partially replicated database cluster can be modeled using integer linear programming (ILP). ILP is a common approach for solving assignment problems, also in the context of database systems. Because ILP is not scalable, existing approaches (also for calculating partial allocations) often fall back to simple (e.g., greedy) heuristics for larger problem instances. Simple heuristics may work well but can lose optimization potential. In this thesis, we present optimal and ILP-based heuristic programming models for calculating data fragment allocations for partially replicated database clusters. Using ILP, we are flexible to extend our models to (i) consider data modifications and reallocations and (ii) increase the robustness of allocations to compensate for node failures and workload uncertainty. We evaluate our approaches for TPC-H, TPC-DS, and a real-world accounting workload and compare the results to state-of-the-art allocation approaches. Our evaluations show significant improvements for varied allocation's properties: Compared to existing approaches, we can, for example, (i) almost halve the amount of allocated data, (ii) improve the throughput in case of node failures and workload uncertainty while using even less memory, (iii) halve the costs of data modifications, and (iv) reallocate less than 90\% of data when adding a node to the cluster. Importantly, we can calculate the corresponding ILP-based heuristic solutions within a few seconds. Finally, we demonstrate that the ideas of our ILP-based heuristics are also applicable to the index selection problem.},
  language  = {en}
}
@article{HagemannAbramova2023,
  author    = {Hagemann, Linus and Abramova, Olga},
  title     = {Emotions and information diffusion on social media},
  series = {AIS transactions on replication research},
  volume    = {9},
  journal   = {AIS transactions on replication research},
  number    = {1},
  publisher = {AIS},
  address   = {Atlanta},
  issn      = {2473-3458},
  doi       = {10.17705/1atrr.00079},
  pages     = {1 -- 19},
  year      = {2023},
  abstract  = {This paper presents a methodological and conceptual replication of Stieglitz and Dang-Xuan's (2013) investigation of the role of sentiment in information-sharing behavior on social media. Whereas Stieglitz and Dang-Xuan (2013) focused on Twitter communication prior to the state parliament elections in the German states Baden-Wurttemberg, Rheinland-Pfalz, and Berlin in 2011, we test their theoretical propositions in the context of the state parliament elections in Saxony-Anhalt (Germany) 2021. We confirm the positive link between sentiment in a political Twitter message and its number of retweets in a methodological replication. In a conceptual replication, where sentiment was assessed with the alternative dictionary-based tool LIWC, the sentiment was negatively associated with the retweet volume. In line with the original study, the strength of association between sentiment and retweet time lag insignificantly differs between tweets with negative sentiment and tweets with positive sentiment. We also found that the number of an author's followers was an essential determinant of sharing behavior. However, two hypotheses supported in the original study did not hold for our sample. Precisely, the total amount of sentiments was insignificantly linked to the time lag to the first retweet. Finally, in our data, we do not observe that the association between the overall sentiment and retweet quantity is stronger for tweets with negative sentiment than for those with positive sentiment.},
  language  = {en}
}
@article{Steinroetter2021,
  author    = {Steinr{\"o}tter, Bj{\"o}rn},
  title     = {Das Konzept einer datenaltruistischen Organisation},
  series = {Datenschutz und Datensicherheit},
  volume    = {45},
  journal   = {Datenschutz und Datensicherheit},
  number    = {12},
  publisher = {Springer},
  address   = {Berlin},
  issn      = {1862-2607},
  doi       = {10.1007/s11623-021-1539-6},
  pages     = {794 -- 798},
  year      = {2021},
  abstract  = {Dass Technologien wie Machine Learning-Anwendungen oder Big bzw. Smart Data- Verfahren unbedingt Daten in ausreichender Menge und G{\"u}te ben{\"o}tigen, erscheint inzwischen als Binsenweisheit. Vor diesem Hintergrund hat insbesondere der EU-Gesetzgeber f{\"u}r sich zuletzt ein neues Bet{\"a}tigungsfeld entdeckt, indem er versucht, auf unterschiedlichen Wegen Anreize zum Datenteilen zu schaffen, um Innovation zu kreieren. Hierzu z{\"a}hlt auch eine geradezu wohlt{\"o}nend mit ,,Datenaltruismus'' verschlagwortete Konstellation. Der Beitrag stellt die diesbez{\"u}glichen Regulierungserw{\"a}gungen auf supranationaler Ebene dar und nimmt eine erste Analyse vor.},
  language  = {de}
}
@misc{WrightWachsHarper2018,
  author    = {Wright, Michelle F. and Wachs, Sebastian and Harper, Bridgette D.},
  title     = {The moderation of empathy in the longitudinal association between witnessing cyberbullying, depression, and anxiety},
  series = {Postprints der Universit{\"a}t Potsdam : Humanwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Humanwissenschaftliche Reihe},
  number    = {689},
  issn      = {1866-8364},
  doi       = {10.25932/publishup-47050},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-470505},
  pages     = {16},
  year      = {2018},
  abstract  = {While the role of and consequences of being a bystander to face-to-face bullying has received some attention in the literature, to date, little is known about the effects of being a bystander to cyberbullying. It is also unknown how empathy might impact the negative consequences associated with being a bystander of cyberbullying. The present study focused on examining the longitudinal association between bystander of cyberbullying depression, and anxiety, and the moderating role of empathy in the relationship between bystander of cyberbullying and subsequent depression and anxiety. There were 1,090 adolescents (M-age = 12.19; 50\% female) from the United States included at Time 1, and they completed questionnaires on empathy, cyberbullying roles (bystander, perpetrator, victim), depression, and anxiety. One year later, at Time 2, 1,067 adolescents (M-age = 13.76; 51\% female) completed questionnaires on depression and anxiety. Results revealed a positive association between bystander of cyberbullying and depression and anxiety. Further, empathy moderated the positive relationship between bystander of cyberbullying and depression, but not for anxiety. Implications for intervention and prevention programs are discussed.},
  language  = {en}
}
@book{OPUS4-10026,
  title     = {Proceedings of the 10th Ph.D. Retreat of the HPI Research School on Service-oriented Systems Engineering},
  number    = {111},
  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 M{\"u}ller, Emmanuel},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-390-9},
  issn      = {1613-5652},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-100260},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {vi, 255},
  year      = {2016},
  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}
}
@phdthesis{Takouna2014,
  author    = {Takouna, Ibrahim},
  title     = {Energy-efficient and performance-aware virtual machine management for cloud data centers},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-72399},
  school      = {Universit{\"a}t Potsdam},
  year      = {2014},
  abstract  = {Virtualisierte Cloud Datenzentren stellen nach Bedarf Ressourcen zur Verf{\"u}gu-ng, erm{\"o}glichen agile Ressourcenbereitstellung und beherbergen heterogene Applikationen mit verschiedenen Anforderungen an Ressourcen. Solche Datenzentren verbrauchen enorme Mengen an Energie, was die Erh{\"o}hung der Betriebskosten, der W{\"a}rme innerhalb der Zentren und des Kohlendioxidausstoßes verursacht. Der Anstieg des Energieverbrauches kann durch ein ineffektives Ressourcenmanagement, das die ineffiziente Ressourcenausnutzung verursacht, entstehen. Die vorliegende Dissertation stellt detaillierte Modelle und neue Verfahren f{\"u}r virtualisiertes Ressourcenmanagement in Cloud Datenzentren vor. Die vorgestellten Verfahren ziehen das Service-Level-Agreement (SLA) und die Heterogenit{\"a}t der Auslastung bez{\"u}glich des Bedarfs an Speicherzugriffen und Kommunikationsmustern von Web- und HPC- (High Performance Computing) Applikationen in Betracht. Um die pr{\"a}sentierten Techniken zu evaluieren, verwenden wir Simulationen und echte Protokollierung der Auslastungen von Web- und HPC- Applikationen. Außerdem vergleichen wir unser Techniken und Verfahren mit anderen aktuellen Verfahren durch die Anwendung von verschiedenen Performance Metriken. Die Hauptbeitr{\"a}ge dieser Dissertation sind Folgendes: Ein Proaktives auf robuster Optimierung basierendes Ressourcenbereitstellungsverfahren. Dieses Verfahren erh{\"o}ht die F{\"a}higkeit der Hostes zur Verf{\"u}g-ungsstellung von mehr VMs. Gleichzeitig aber wird der unn{\"o}tige Energieverbrauch minimiert. Zus{\"a}tzlich mindert diese Technik unerw{\"u}nschte {\"A}nde-rungen im Energiezustand des Servers. Die vorgestellte Technik nutzt einen auf Intervall basierenden Vorhersagealgorithmus zur Implementierung einer robusten Optimierung. Dabei werden unsichere Anforderungen in Betracht gezogen. Ein adaptives und auf Intervall basierendes Verfahren zur Vorhersage des Arbeitsaufkommens mit hohen, in k{\"u}rzer Zeit auftretenden Schwankungen. Die Intervall basierende Vorhersage ist implementiert in der Standard Abweichung Variante und in der Median absoluter Abweichung Variante. Die Intervall-{\"A}nderungen basieren auf einem adaptiven Vertrauensfenster um die Schwankungen des Arbeitsaufkommens zu bew{\"a}ltigen. Eine robuste VM Zusammenlegung f{\"u}r ein effizientes Energie und Performance Management. Dies erm{\"o}glicht die gegenseitige Abh{\"a}ngigkeit zwischen der Energie und der Performance zu minimieren. Unser Verfahren reduziert die Anzahl der VM-Migrationen im Vergleich mit den neu vor kurzem vorgestellten Verfahren. Dies tr{\"a}gt auch zur Reduzierung des durch das Netzwerk verursachten Energieverbrauches. Außerdem reduziert dieses Verfahren SLA-Verletzungen und die Anzahl von {\"A}nderungen an Energiezus-t{\"a}nden. Ein generisches Modell f{\"u}r das Netzwerk eines Datenzentrums um die verz{\"o}-gerte Kommunikation und ihre Auswirkung auf die VM Performance und auf die Netzwerkenergie zu simulieren. Außerdem wird ein generisches Modell f{\"u}r ein Memory-Bus des Servers vorgestellt. Dieses Modell beinhaltet auch Modelle f{\"u}r die Latenzzeit und den Energieverbrauch f{\"u}r verschiedene Memory Frequenzen. Dies erlaubt eine Simulation der Memory Verz{\"o}gerung und ihre Auswirkung auf die VM-Performance und auf den Memory Energieverbrauch. Kommunikation bewusste und Energie effiziente Zusammenlegung f{\"u}r parallele Applikationen um die dynamische Entdeckung von Kommunikationsmustern und das Umplanen von VMs zu erm{\"o}glichen. Das Umplanen von VMs benutzt eine auf den entdeckten Kommunikationsmustern basierende Migration. Eine neue Technik zur Entdeckung von dynamischen Mustern ist implementiert. Sie basiert auf der Signal Verarbeitung des Netzwerks von VMs, anstatt die Informationen des virtuellen Umstellung der Hosts oder der Initiierung der VMs zu nutzen. Das Ergebnis zeigt, dass unsere Methode die durchschnittliche Anwendung des Netzwerks reduziert und aufgrund der Reduzierung der aktiven Umstellungen Energie gespart. Außerdem bietet sie eine bessere VM Performance im Vergleich zu der CPU-basierten Platzierung. Memory bewusste VM Zusammenlegung f{\"u}r unabh{\"a}ngige VMs. Sie nutzt die Vielfalt des VMs Memory Zuganges um die Anwendung vom Memory-Bus der Hosts zu balancieren. Die vorgestellte Technik, Memory-Bus Load Balancing (MLB), verteilt die VMs reaktiv neu im Bezug auf ihre Anwendung vom Memory-Bus. Sie nutzt die VM Migration um die Performance des gesamtem Systems zu verbessern. Außerdem sind die dynamische Spannung, die Frequenz Skalierung des Memory und die MLB Methode kombiniert um ein besseres Energiesparen zu leisten.},
  language  = {en}
}
@book{OPUS4-6157,
  title     = {Theories and intricacies of information security problems},
  editor    = {Kayem, Anne V. D. M. and Meinel, Christoph},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-204-9},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-60455},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {i, 48},
  year      = {2013},
  abstract  = {INTRICATE/SEC 2012 Workshop held in Conjunction with The 11th Information Security South Africa Conference (ISSA 2012).},
  language  = {de}
}
@book{OPUS4-4643,
  title     = {Dritter Deutscher IPv6 Gipfel 2010},
  editor    = {Meinel, Christoph and Sack, Harald},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-092-2},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-46134},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {112},
  year      = {2010},
  abstract  = {Am 24. und 25. Juni 2010 fand am Hasso-Plattner-Institut f{\"u}r Softwaresystemtechnik GmbH in Potsdam der 3. Deutsche IPv6 Gipfel 2010 statt, dessen Dokumentation der vorliegende technische Report dient. Als nationaler Arm des weltweiten IPv6-Forums f{\"o}rdert der Deutsche IPv6-Rat den {\"U}bergangsprozess zur neuen Internetgeneration und brachte in diesem Rahmen nationale und internationale Experten aus Wirtschaft, Wissenschaft und {\"o}ffentlicher Verwaltung zusammen, um Awareness f{\"u}r das Zukunftsthema IPv6 zu schaffen und um ein Resum{\´e} {\"u}ber die bislang erzielten Fortschritte zu ziehen. Die Grenzen des alten Internetprotokolls IPv4 sind in den vergangenen zwei Jahren deutlicher denn je zutage getreten. Waren im vergangenen Jahr anl{\"a}sslich des 2. IPv6 Gipfels noch 11\% aller zu vergebenden IPv4 Adressen verf{\"u}gbar, ist diese Zahl mittlerweile auf nur noch 6\% geschrumpft. Ehrengast war in diesem Jahr der „europ{\"a}ische Vater" des Internets, Prof. Peter T. Kirstein vom University College London, dessen Hauptvortrag von weiteren Beitr{\"a}gen hochrangiger Vertretern aus Politik, Wissenschaft und Wirtschaft erg{\"a}nzt wurde.},
  language  = {mul}
}
@phdthesis{Steinmetz2013,
  author    = {Steinmetz, Nadine},
  title     = {Context-aware semantic analysis of video metadata},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-70551},
  school      = {Universit{\"a}t Potsdam},
  year      = {2013},
  abstract  = {Im Vergleich zu einer stichwortbasierten Suche erm{\"o}glicht die semantische Suche ein pr{\"a}ziseres und anspruchsvolleres Durchsuchen von (Web)-Dokumenten, weil durch die explizite Semantik Mehrdeutigkeiten von nat{\"u}rlicher Sprache vermieden und semantische Beziehungen in das Suchergebnis einbezogen werden k{\"o}nnen. Eine semantische, Entit{\"a}ten-basierte Suche geht von einer Anfrage mit festgelegter Bedeutung aus und liefert nur Dokumente, die mit dieser Entit{\"a}t annotiert sind als Suchergebnis. Die wichtigste Voraussetzung f{\"u}r eine Entit{\"a}ten-zentrierte Suche stellt die Annotation der Dokumente im Archiv mit Entit{\"a}ten und Kategorien dar. Textuelle Informationen werden analysiert und mit den entsprechenden Entit{\"a}ten und Kategorien versehen, um den Inhalt semantisch erschließen zu k{\"o}nnen. Eine manuelle Annotation erfordert Dom{\"a}nenwissen und ist sehr zeitaufwendig. Die semantische Annotation von Videodokumenten erfordert besondere Aufmerksamkeit, da inhaltsbasierte Metadaten von Videos aus verschiedenen Quellen stammen, verschiedene Eigenschaften und Zuverl{\"a}ssigkeiten besitzen und daher nicht wie Fließtext behandelt werden k{\"o}nnen. Die vorliegende Arbeit stellt einen semantischen Analyseprozess f{\"u}r Video-Metadaten vor. Die Eigenschaften der verschiedenen Metadatentypen werden analysiert und ein Konfidenzwert ermittelt. Dieser Wert spiegelt die Korrektheit und die wahrscheinliche Mehrdeutigkeit eines Metadatums wieder. Beginnend mit dem Metadatum mit dem h{\"o}chsten Konfidenzwert wird der Analyseprozess innerhalb eines Kontexts in absteigender Reihenfolge des Konfidenzwerts durchgef{\"u}hrt. Die bereits analysierten Metadaten dienen als Referenzpunkt f{\"u}r die weiteren Analysen. So kann eine m{\"o}glichst korrekte Analyse der heterogen strukturierten Daten eines Kontexts sichergestellt werden. Am Ende der Analyse eines Metadatums wird die f{\"u}r den Kontext relevanteste Entit{\"a}t aus einer Liste von Kandidaten identifiziert - das Metadatum wird disambiguiert. Hierf{\"u}r wurden verschiedene Disambiguierungsalgorithmen entwickelt, die Beschreibungstexte und semantische Beziehungen der Entit{\"a}tenkandidaten zum gegebenen Kontext in Betracht ziehen. Der Kontext f{\"u}r die Disambiguierung wird f{\"u}r jedes Metadatum anhand der Eigenschaften und Konfidenzwerte zusammengestellt. Der vorgestellte Analyseprozess ist an zwei Hypothesen angelehnt: Um die Analyseergebnisse verbessern zu k{\"o}nnen, sollten die Metadaten eines Kontexts in absteigender Reihenfolge ihres Konfidenzwertes verarbeitet werden und die Kontextgrenzen von Videometadaten sollten durch Segmentgrenzen definiert werden, um m{\"o}glichst Kontexte mit koh{\"a}rentem Inhalt zu erhalten. Durch ausf{\"u}hrliche Evaluationen konnten die gestellten Hypothesen best{\"a}tigt werden. Der Analyseprozess wurden gegen mehrere State-of-the-Art Methoden verglichen und erzielt verbesserte Ergebnisse in Bezug auf Recall und Precision, besonders f{\"u}r Metadaten, die aus weniger zuverl{\"a}ssigen Quellen stammen. Der Analyseprozess ist Teil eines Videoanalyse-Frameworks und wurde bereits erfolgreich in verschiedenen Projekten eingesetzt.},
  language  = {en}
}
@phdthesis{Wang2011,
  author    = {Wang, Long},
  title     = {X-tracking the usage interest on web sites},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-51077},
  school      = {Universit{\"a}t Potsdam},
  year      = {2011},
  abstract  = {The exponential expanding of the numbers of web sites and Internet users makes WWW the most important global information resource. From information publishing and electronic commerce to entertainment and social networking, the Web allows an inexpensive and efficient access to the services provided by individuals and institutions. The basic units for distributing these services are the web sites scattered throughout the world. However, the extreme fragility of web services and content, the high competence between similar services supplied by different sites, and the wide geographic distributions of the web users drive the urgent requirement from the web managers to track and understand the usage interest of their web customers. This thesis, "X-tracking the Usage Interest on Web Sites", aims to fulfill this requirement. "X" stands two meanings: one is that the usage interest differs from various web sites, and the other is that usage interest is depicted from multi aspects: internal and external, structural and conceptual, objective and subjective. "Tracking" shows that our concentration is on locating and measuring the differences and changes among usage patterns. This thesis presents the methodologies on discovering usage interest on three kinds of web sites: the public information portal site, e-learning site that provides kinds of streaming lectures and social site that supplies the public discussions on IT issues. On different sites, we concentrate on different issues related with mining usage interest. The educational information portal sites were the first implementation scenarios on discovering usage patterns and optimizing the organization of web services. In such cases, the usage patterns are modeled as frequent page sets, navigation paths, navigation structures or graphs. However, a necessary requirement is to rebuild the individual behaviors from usage history. We give a systematic study on how to rebuild individual behaviors. Besides, this thesis shows a new strategy on building content clusters based on pair browsing retrieved from usage logs. The difference between such clusters and the original web structure displays the distance between the destinations from usage side and the expectations from design side. Moreover, we study the problem on tracking the changes of usage patterns in their life cycles. The changes are described from internal side integrating conceptual and structure features, and from external side for the physical features; and described from local side measuring the difference between two time spans, and global side showing the change tendency along the life cycle. A platform, Web-Cares, is developed to discover the usage interest, to measure the difference between usage interest and site expectation and to track the changes of usage patterns. E-learning site provides the teaching materials such as slides, recorded lecture videos and exercise sheets. We focus on discovering the learning interest on streaming lectures, such as real medias, mp4 and flash clips. Compared to the information portal site, the usage on streaming lectures encapsulates the variables such as viewing time and actions during learning processes. The learning interest is discovered in the form of answering 6 questions, which covers finding the relations between pieces of lectures and the preference among different forms of lectures. We prefer on detecting the changes of learning interest on the same course from different semesters. The differences on the content and structure between two courses leverage the changes on the learning interest. We give an algorithm on measuring the difference on learning interest integrated with similarity comparison between courses. A search engine, TASK-Moniminer, is created to help the teacher query the learning interest on their streaming lectures on tele-TASK site. Social site acts as an online community attracting web users to discuss the common topics and share their interesting information. Compared to the public information portal site and e-learning web site, the rich interactions among users and web content bring the wider range of content quality, on the other hand, provide more possibilities to express and model usage interest. We propose a framework on finding and recommending high reputation articles in a social site. We observed that the reputation is classified into global and local categories; the quality of the articles having high reputation is related with the content features. Based on these observations, our framework is implemented firstly by finding the articles having global or local reputation, and secondly clustering articles based on their content relations, and then the articles are selected and recommended from each cluster based on their reputation ranks.},
  language  = {en}
}
@book{MeinelWillems2013,
  author    = {Meinel, Christoph and Willems, Christian},
  title     = {openHPI : the MOOC offer at Hasso Plattner Institute},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-264-3},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-67176},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {21},
  year      = {2013},
  abstract  = {The new interactive online educational platform openHPI, (https://openHPI.de) from Hasso Plattner Institute (HPI), offers freely accessible courses at no charge for all who are interested in subjects in the field of information technology and computer science. Since 2011, "Massive Open Online Courses," called MOOCs for short, have been offered, first at Stanford University and then later at other U.S. elite universities. Following suit, openHPI provides instructional videos on the Internet and further reading material, combined with learning-supportive self-tests, homework and a social discussion forum. Education is further stimulated by the support of a virtual learning community. In contrast to "traditional" lecture platforms, such as the tele-TASK portal (http://www.tele-task.de) where multimedia recorded lectures are available on demand, openHPI offers didactic online courses. The courses have a fixed start date and offer a balanced schedule of six consecutive weeks presented in multimedia and, whenever possible, interactive learning material. Each week, one chapter of the course subject is treated. In addition, a series of learning videos, texts, self-tests and homework exercises are provided to course participants at the beginning of the week. The course offering is combined with a social discussion platform where participants have the opportunity to enter into an exchange with course instructors and fellow participants. Here, for example, they can get answers to questions and discuss the topics in depth. The participants naturally decide themselves about the type and range of their learning activities. They can make personal contributions to the course, for example, in blog posts or tweets, which they can refer to in the forum. In turn, other participants have the chance to comment on, discuss or expand on what has been said. In this way, the learners become the teachers and the subject matter offered to a virtual community is linked to a social learning network.},
  language  = {en}
}
@book{MeinelWillemsRoschkeetal.2011,
  author    = {Meinel, Christoph and Willems, Christian and Roschke, Sebastian and Schnjakin, Maxim},
  title     = {Virtualisierung und Cloud Computing : Konzepte, Technologiestudie, Markt{\"u}bersicht},
  isbn      = {978-3-86956-113-4},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-49708},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {2011},
  abstract  = {Virtualisierung und Cloud Computing geh{\"o}ren derzeit zu den wichtigsten Schlagworten f{\"u}r Betreiber von IT Infrastrukturen. Es gibt eine Vielzahl unterschiedlicher Technologien, Produkte und Gesch{\"a}ftsmodelle f{\"u}r vollkommen verschiedene Anwendungsszenarien. Die vorliegende Studie gibt zun{\"a}chst einen detaillierten {\"U}berblick {\"u}ber aktuelle Entwicklungen in Konzepten und Technologien der Virtualisierungstechnologie - von klassischer Servervirtualisierung {\"u}ber Infrastrukturen f{\"u}r virtuelle Arbeitspl{\"a}tze bis zur Anwendungsvirtualisierung und macht den Versuch einer Klassifikation der Virtualisierungsvarianten. Bei der Betrachtung des Cloud Computing-Konzepts werden deren Grundz{\"u}ge sowie verschiedene Architekturvarianten und Anwendungsf{\"a}lle eingef{\"u}hrt. Die ausf{\"u}hrliche Untersuchung von Vorteilen des Cloud Computing sowie m{\"o}glicher Bedenken, die bei der Nutzung von Cloud-Ressourcen im Unternehmen beachtet werden m{\"u}ssen, zeigt, dass Cloud Computing zwar große Chancen bietet, aber nicht f{\"u}r jede Anwendung und nicht f{\"u}r jeden rechtlichen und wirtschaftlichen Rahmen in Frage kommt.. Die anschließende Markt{\"u}bersicht f{\"u}r Virtualisierungstechnologie zeigt, dass die großen Hersteller - Citrix, Microsoft und VMware - jeweils Produkte f{\"u}r fast alle Virtualisierungsvarianten anbieten und hebt entscheidende Unterschiede bzw. die St{\"a}rken der jeweiligen Anbieter heraus. So ist beispielsweise die L{\"o}sung von Citrix f{\"u}r Virtual Desktop Infrastructures sehr ausgereift, w{\"a}hrend Microsoft hier nur auf Standardtechnologie zur{\"u}ckgreifen kann. VMware hat als Marktf{\"u}hrer die gr{\"o}ßte Verbreitung in Rechenzentren gefunden und bietet als einziger Hersteller echte Fehlertoleranz. Microsoft hingegen punktet mit der nahtlosen Integration ihrer Virtualisierungsprodukte in bestehende Windows-Infrastrukturen. Im Bereich der Cloud Computing-Systeme zeigen sich einige quelloffene Softwareprojekte, die durchaus f{\"u}r den produktiven Betrieb von sogenannten privaten Clouds geeignet sind.},
  language  = {de}
}
@book{MeinelWillems2013,
  author    = {Meinel, Christoph and Willems, Christian},
  title     = {openHPI : das MOOC-Angebot des Hasso-Plattner-Instituts},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-259-9},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-66802},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {22},
  year      = {2013},
  abstract  = {Die neue interaktive Online-Bildungsplattform openHPI (https://openHPI.de) des Hasso-Plattner-Instituts (HPI) bietet frei zug{\"a}ngliche und kostenlose Onlinekurse f{\"u}r interessierte Teilnehmer an, die sich mit Inhalten aus dem Bereich der Informationstechnologien und Informatik besch{\"a}ftige¬n. Wie die seit 2011 zun{\"a}chst von der Stanford University, sp{\"a}ter aber auch von anderen Elite-Universit{\"a}ten der USA angeboten „Massive Open Online Courses", kurz MOOCs genannt, bietet openHPI im Internet Lernvideos und weiterf{\"u}hrenden Lesestoff in einer Kombination mit lernunterst{\"u}tzenden Selbsttests, Hausaufgaben und einem sozialen Diskussionsforum an und stimuliert die Ausbildung einer das Lernen f{\"o}rdernden virtuellen Lerngemeinschaft. Im Unterschied zu „traditionellen" Vorlesungsportalen, wie z.B. dem tele-TASK Portal (http://www.tele-task.de), bei dem multimedial aufgezeichnete Vorlesungen zum Abruf bereit gestellt werden, bietet openHPI didaktisch aufbereitete Onlinekurse an. Diese haben einen festen Starttermin und bieten dann in einem austarierten Zeitplan von sechs aufeinanderfolgenden Kurswochen multimedial aufbereitete und wann immer m{\"o}glich interaktive Lehrmaterialien. In jeder Woche wird ein Kapitel des Kursthemas behandelt. Dazu werden zu Wochenbeginn eine Reihe von Lehrvideos, Texten, Selbsttests und ein Hausaufgabenblatt bereitgestellt, mit denen sich die Kursteilnehmer in dieser Woche besch{\"a}ftigen. Kombiniert sind die Angebote mit einer sozialen Diskussionsplattform, auf der sich die Teilnehmer mit den Kursbetreuern und anderen Teilnehmern austauschen, Fragen kl{\"a}ren und weiterf{\"u}hrende Themen diskutieren k{\"o}nnen. Nat{\"u}rlich entscheiden die Teilnehmer selbst {\"u}ber Art und Umfang ihrer Lernaktivit{\"a}ten. Sie k{\"o}nnen in den Kurs eigene Beitr{\"a}ge einbringen, zum Beispiel durch Blogposts oder Tweets, auf die sie im Forum verweisen. Andere Lernende k{\"o}nnen diese dann kommentieren, diskutieren oder ihrerseits erweitern. Auf diese Weise werden die Lernenden, die Lehrenden und die angebotenen Lerninhalte in einer virtuellen Gemeinschaft, einem sozialen Lernnetzwerk miteinander verkn{\"u}pft.},
  language  = {de}
}
@book{MeinelRenzLuderichetal.2019,
  author    = {Meinel, Christoph and Renz, Jan and Luderich, Matthias and Malyska, Vivien and Kaiser, Konstantin and Oberl{\"a}nder, Arne},
  title     = {Die HPI Schul-Cloud},
  number    = {125},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-453-1},
  issn      = {1613-5652},
  doi       = {10.25932/publishup-42306},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-423062},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {57},
  year      = {2019},
  abstract  = {Die digitale Transformation durchdringt alle gesellschaftlichen Ebenen und Felder, nicht zuletzt auch das Bildungssystem. Dieses ist auf die Ver{\"a}nderungen kaum vorbereitet und begegnet ihnen vor allem auf Basis des Eigenengagements seiner Lehrer*innen. Strukturelle Reaktionen auf den Mangel an qualitativ hochwertigen Fortbildungen, auf schlecht ausgestattete Unterrichtsr{\"a}ume und nicht professionell gewartete Computersysteme gibt es erst seit kurzem. Doch auch wenn Beharrungskr{\"a}fte unter P{\"a}dagog*innen verbreitet sind, erfordert die Transformation des Systems Schule auch eine neue Mentalit{\"a}t und neue Arbeits- und Kooperationsformen. Zeitgem{\"a}ßer Unterricht ben{\"o}tigt moderne Technologie und zeitgem{\"a}ße IT-Architekturen. Nur Systeme, die f{\"u}r Lehrer*innen und Sch{\"u}ler*innen problemlos verf{\"u}gbar, benutzerfreundlich zu bedienen und didaktisch flexibel einsetzbar sind, finden in Schulen Akzeptanz. Hierf{\"u}r haben wir die HPI Schul-Cloud entwickelt. Sie erm{\"o}glicht den einfachen Zugang zu neuesten, professionell gewarteten Anwendungen, verschiedensten digitalen Medien, die Vernetzung verschiedener Lernorte und den rechtssicheren Einsatz von Kommunikations- und Kollaborationstools. Die Entwicklung der HPI Schul-Cloud ist umso notwendiger, als dass rechtliche Anforderungen - insbesondere aus der Datenschutzgrundverordnung der EU herr{\"u}hrend - den Einsatz von Cloud-Anwendungen, die in der Arbeitswelt verbreitet sind, in Schulen unm{\"o}glich machen. Im Bildungsbereich verbreitete Anwendungen sind gr{\"o}ßtenteils technisch veraltet und nicht benutzerfreundlich. Dies n{\"o}tigt die Bundesl{\"a}nder zu kostspieligen Eigenentwicklungen mit Aufw{\"a}nden im zweistelligen Millionenbereich - Projekte die teilweise gescheitert sind. Dank der modularen Micro-Service-Architektur k{\"o}nnen die Bundesl{\"a}nder zuk{\"u}nftig auf die HPI Schul-Cloud als technische Grundlage f{\"u}r ihre Eigen- oder Gemeinschaftsprojekte zur{\"u}ckgreifen. Hierf{\"u}r gilt es, eine nachhaltige Struktur f{\"u}r die Weiterentwicklung der Open-Source-Software HPI Schul-Cloud zu schaffen. Dieser Bericht beschreibt den Entwicklungsstand und die weiteren Perspektiven des Projekts HPI Schul-Cloud im Januar 2019. 96 Schulen deutschlandweit nutzen die HPI Schul-Cloud, bereitgestellt durch das Hasso-Plattner-Institut. Weitere 45 Schulen und Studienseminare nutzen die Nieders{\"a}chsische Bildungscloud, die technisch auf der HPI Schul-Cloud basiert. Das vom Bundesministerium f{\"u}r Bildung und Forschung gef{\"o}rderte Projekt l{\"a}uft in der gegenw{\"a}rtigen Roll-Out-Phase bis zum 31. Juli 2021. Gemeinsam mit unserem Kooperationspartner MINT-EC streben wir an, die HPI Schul-Cloud m{\"o}glichst an allen Schulen des Netzwerks einzusetzen.},
  language  = {de}
}
@book{OPUS4-5821,
  title     = {Vierter Deutscher IPv6 Gipfel 2011},
  editor    = {Meinel, Christoph and Sack, Harald},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-194-3},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-60214},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {112},
  year      = {2012},
  abstract  = {Am 1. und 2. Dezember 2011 fand am Hasso-Plattner-Institut f{\"u}r Softwaresystemtechnik GmbH in Potsdam der 4. Deutsche IPv6 Gipfel 2011 statt, dessen Dokumentation der vorliegende technische Report dient. Wie mit den vorhergegangenen nationalen IPv6-Gipfeln verfolgte der Deutsche IPv6-Rat auch mit dem 4. Gipfel, der unter dem Motto „Online on the Road - Der neue Standard IPv6 als Treiber der mobilen Kommunikation" stand, das Ziel, Einblicke in aktuelle Entwicklungen rund um den Einsatz von IPv6 diesmal mit einem Fokus auf die automobile Vernetzung zu geben. Gleichzeitig wurde betont, den effizienten und fl{\"a}chendeckenden Umstieg auf IPv6 voranzutreiben, Erfahrungen mit dem Umstieg auf und dem Einsatz von IPv6 auszutauschen, Wirtschaft und {\"o}ffentliche Verwaltung zu ermutigen und motivieren, IPv6-basierte L{\"o}sungen einzusetzen und das {\"o}ffentliche Problembewusstsein f{\"u}r die Notwendigkeit des Umstiegs auf IPv6 zu erh{\"o}hen. Ehrengast war in diesem Jahr die EU-Kommissarin f{\"u}r die Digitale Agenda, Neelie Kroes deren Vortrag von weiteren Beitr{\"a}gen hochrangiger Vertretern aus Politik, Wissenschaft und Wirtschaft erg{\"a}nzt wurde.},
  language  = {de}
}
@book{OPUS4-6247,
  title     = {F{\"u}nfter Deutscher IPv6 Gipfel 2012},
  editor    = {Meinel, Christoph and Sack, Harald},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-225-4},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-63947},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {110},
  year      = {2013},
  abstract  = {Am 29. und 30. November 2012 fand am Hasso-Plattner-Institut f{\"u}r Softwaresystemtechnik GmbH in Potsdam der 5. Deutsche IPv6 Gipfel 2012 statt, als dessen Dokumentation der vorliegende technische Report dient. Wie mit den vorhergegangenen nationalen IPv6 Gipfeln verfolgte der Deutsche IPv6-Rat auch mit dem 5. Gipfel, der unter dem Motto „IPv6- der Wachstumstreiber f{\"u}r die Deutsche Wirtschaft" stand, das Ziel, Einblicke in aktuelle Entwicklungen rund um den Einsatz von IPv6 zu geben. Unter anderem wurden die Vorz{\"u}ge des neue Internetstandards IPv6 vorgestellt und {\"u}ber die Anwendung von IPv6 auf dem Massenmarkt, sowie den Einsatz von IPv6 in Unternehmen und in der {\"o}ffentlichen Verwaltung referiert. Weitere Themen des Gipfels bezogen sich auf Aktionen und Bedingungen in Unternehmen und Privathaushalten, die f{\"u}r den Umstieg auf IPv6 notwendig sind und welche Erfahrungen dabei bereits gesammelt werden konnten. Neben Vortr{\"a}gen des Bundesbeauftragten f{\"u}r Datenschutz Peter Schaar und des Gesch{\"a}ftsf{\"u}hrers der Technik Telekom Deutschland GmbH, Bruno Jacobfeuerborn, wurden weiteren Beitr{\"a}ge hochrangiger Vertretern aus Politik, Wissenschaft und Wirtschaft pr{\"a}sentiert, die in diesem technischen Bericht zusammengestellt sind.},
  language  = {de}
}
@book{RanaMohapatraSidorovaetal.2022,
  author    = {Rana, Kaushik and Mohapatra, Durga Prasad and Sidorova, Julia and Lundberg, Lars and Sk{\"o}ld, Lars and Lopes Grim, Lu{\´i}s Fernando and Sampaio Gradvohl, Andr{\´e} Leon and Cremerius, Jonas and Siegert, Simon and Weltzien, Anton von and Baldi, Annika and Klessascheck, Finn and Kalancha, Svitlana and Lichtenstein, Tom and Shaabani, Nuhad and Meinel, Christoph and Friedrich, Tobias and Lenzner, Pascal and Schumann, David and Wiese, Ingmar and Sarna, Nicole and Wiese, Lena and Tashkandi, Araek Sami and van der Walt, Est{\´e}e and Eloff, Jan H. P. and Schmidt, Christopher and H{\"u}gle, Johannes and Horschig, Siegfried and Uflacker, Matthias and Najafi, Pejman and Sapegin, Andrey and Cheng, Feng and Stojanovic, Dragan and Stojnev Ilić, Aleksandra and Djordjevic, Igor and Stojanovic, Natalija and Predic, Bratislav and Gonz{\´a}lez-Jim{\´e}nez, Mario and de Lara, Juan and Mischkewitz, Sven and Kainz, Bernhard and van Hoorn, Andr{\´e} and Ferme, Vincenzo and Schulz, Henning and Knigge, Marlene and Hecht, Sonja and Prifti, Loina and Krcmar, Helmut and Fabian, Benjamin and Ermakova, Tatiana and Kelkel, Stefan and Baumann, Annika and Morgenstern, Laura and Plauth, Max and Eberhard, Felix and Wolff, Felix and Polze, Andreas and Cech, Tim and Danz, Noel and Noack, Nele Sina and Pirl, Lukas and Beilharz, Jossekin Jakob and De Oliveira, Roberto C. L. and Soares, F{\´a}bio Mendes and Juiz, Carlos and Bermejo, Belen and M{\"u}hle, Alexander and Gr{\"u}ner, Andreas and Saxena, Vageesh and Gayvoronskaya, Tatiana and Weyand, Christopher and Krause, Mirko and Frank, Markus and Bischoff, Sebastian and Behrens, Freya and R{\"u}ckin, Julius and Ziegler, Adrian and Vogel, Thomas and Tran, Chinh and Moser, Irene and Grunske, Lars and Sz{\´a}rnyas, G{\´a}bor and Marton, J{\´o}zsef and Maginecz, J{\´a}nos and Varr{\´o}, D{\´a}niel and Antal, J{\´a}nos Benjamin},
  title     = {HPI Future SOC Lab - Proceedings 2018},
  number    = {151},
  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-547-7},
  issn      = {1613-5652},
  doi       = {10.25932/publishup-56371},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-563712},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {x, 277},
  year      = {2022},
  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 2018. Selected projects have presented their results on April 17th and November 14th 2017 at the Future SOC Lab Day events.},
  language  = {en}
}
@phdthesis{Gruener2022,
  author    = {Gr{\"u}ner, Andreas},
  title     = {Towards practical and trust-enhancing attribute aggregation for self-sovereign identity},
  doi       = {10.25932/publishup-56745},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-567450},
  school      = {Universit{\"a}t Potsdam},
  pages     = {xvii, 175},
  year      = {2022},
  abstract  = {Identity management is at the forefront of applications' security posture. It separates the unauthorised user from the legitimate individual. Identity management models have evolved from the isolated to the centralised paradigm and identity federations. Within this advancement, the identity provider emerged as a trusted third party that holds a powerful position. Allen postulated the novel self-sovereign identity paradigm to establish a new balance. Thus, extensive research is required to comprehend its virtues and limitations. Analysing the new paradigm, initially, we investigate the blockchain-based self-sovereign identity concept structurally. Moreover, we examine trust requirements in this context by reference to patterns. These shapes comprise major entities linked by a decentralised identity provider. By comparison to the traditional models, we conclude that trust in credential management and authentication is removed. Trust-enhancing attribute aggregation based on multiple attribute providers provokes a further trust shift. Subsequently, we formalise attribute assurance trust modelling by a metaframework. It encompasses the attestation and trust network as well as the trust decision process, including the trust function, as central components. A secure attribute assurance trust model depends on the security of the trust function. The trust function should consider high trust values and several attribute authorities. Furthermore, we evaluate classification, conceptual study, practical analysis and simulation as assessment strategies of trust models. For realising trust-enhancing attribute aggregation, we propose a probabilistic approach. The method exerts the principle characteristics of correctness and validity. These values are combined for one provider and subsequently for multiple issuers. We embed this trust function in a model within the self-sovereign identity ecosystem. To practically apply the trust function and solve several challenges for the service provider that arise from adopting self-sovereign identity solutions, we conceptualise and implement an identity broker. The mediator applies a component-based architecture to abstract from a single solution. Standard identity and access management protocols build the interface for applications. We can conclude that the broker's usage at the side of the service provider does not undermine self-sovereign principles, but fosters the advancement of the ecosystem. The identity broker is applied to sample web applications with distinct attribute requirements to showcase usefulness for authentication and attribute-based access control within a case study.},
  language  = {en}
}
@book{GayvoronskayaMeinelSchnjakin2018,
  author    = {Gayvoronskaya, Tatiana and Meinel, Christoph and Schnjakin, Maxim},
  title     = {Blockchain},
  number    = {113},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-394-7},
  issn      = {1613-5652},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-103141},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {109},
  year      = {2018},
  abstract  = {Der Begriff Blockchain ist in letzter Zeit zu einem Schlagwort geworden, aber nur wenige wissen, was sich genau dahinter verbirgt. Laut einer Umfrage, die im ersten Quartal 2017 ver{\"o}ffentlicht wurde, ist der Begriff nur bei 35 Prozent der deutschen Mittelst{\"a}ndler bekannt. Dabei ist die Blockchain-Technologie durch ihre rasante Entwicklung und die globale Eroberung unterschiedlicher M{\"a}rkte f{\"u}r Massenmedien sehr interessant. So sehen viele die Blockchain-Technologie entweder als eine Allzweckwaffe, zu der aber nur wenige einen Zugang haben, oder als eine Hacker-Technologie f{\"u}r geheime Gesch{\"a}fte im Darknet. Dabei liegt die Innovation der Blockchain-Technologie in ihrer erfolgreichen Zusammensetzung bereits vorhandener Ans{\"a}tze: dezentrale Netzwerke, Kryptographie, Konsensfindungsmodelle. Durch das innovative Konzept wird ein Werte-Austausch in einem dezentralen System m{\"o}glich. Dabei wird kein Vertrauen zwischen dessen Knoten (z.B. Nutzer) vorausgesetzt. Mit dieser Studie m{\"o}chte das Hasso-Plattner-Institut den Lesern helfen, ihren eigenen Standpunkt zur Blockchain-Technologie zu finden und dabei dazwischen unterscheiden zu k{\"o}nnen, welche Eigenschaften wirklich innovativ und welche nichts weiter als ein Hype sind. Die Autoren der vorliegenden Arbeit analysieren positive und negative Eigenschaften, welche die Blockchain-Architektur pr{\"a}gen, und stellen m{\"o}gliche Anpassungs- und L{\"o}sungsvorschl{\"a}ge vor, die zu einem effizienten Einsatz der Technologie beitragen k{\"o}nnen. Jedem Unternehmen, bevor es sich f{\"u}r diese Technologie entscheidet, wird dabei empfohlen, f{\"u}r den geplanten Anwendungszweck zun{\"a}chst ein klares Ziel zu definieren, das mit einem angemessenen Kosten-Nutzen-Verh{\"a}ltnis angestrebt werden kann. Dabei sind sowohl die M{\"o}glichkeiten als auch die Grenzen der Blockchain-Technologie zu beachten. Die relevanten Schritte, die es in diesem Zusammenhang zu beachten gilt, fasst die Studie f{\"u}r die Leser {\"u}bersichtlich zusammen. Es wird ebenso auf akute Fragestellungen wie Skalierbarkeit der Blockchain, geeigneter Konsensalgorithmus und Sicherheit eingegangen, darunter verschiedene Arten m{\"o}glicher Angriffe und die entsprechenden Gegenmaßnahmen zu deren Abwehr. Neue Blockchains etwa laufen Gefahr, geringere Sicherheit zu bieten, da {\"A}nderungen an der bereits bestehenden Technologie zu Schutzl{\"u}cken und M{\"a}ngeln f{\"u}hren k{\"o}nnen. Nach Diskussion der innovativen Eigenschaften und Probleme der Blockchain-Technologie wird auf ihre Umsetzung eingegangen. Interessierten Unternehmen stehen viele Umsetzungsm{\"o}glichkeiten zur Verf{\"u}gung. Die zahlreichen Anwendungen haben entweder eine eigene Blockchain als Grundlage oder nutzen bereits bestehende und weitverbreitete Blockchain-Systeme. Zahlreiche Konsortien und Projekte bieten „Blockchain-as-a-Service" an und unterst{\"u}tzen andere Unternehmen beim Entwickeln, Testen und Bereitstellen von Anwendungen. Die Studie gibt einen detaillierten {\"U}berblick {\"u}ber zahlreiche relevante Einsatzbereiche und Projekte im Bereich der Blockchain-Technologie. Dadurch, dass sie noch relativ jung ist und sich schnell entwickelt, fehlen ihr noch einheitliche Standards, die Zusammenarbeit der verschiedenen Systeme erlauben und an die sich alle Entwickler halten k{\"o}nnen. Aktuell orientieren sich Entwickler an Bitcoin-, Ethereum- und Hyperledger-Systeme, diese dienen als Grundlage f{\"u}r viele weitere Blockchain-Anwendungen. Ziel ist, den Lesern einen klaren und umfassenden {\"U}berblick {\"u}ber die Blockchain-Technologie und deren M{\"o}glichkeiten zu vermitteln.},
  language  = {de}
}
@article{PuriVardeMelo2023,
  author    = {Puri, Manish and Varde, Aparna S. and Melo, Gerard de},
  title     = {Commonsense based text mining on urban policy},
  series = {Language resources and evaluation},
  volume    = {57},
  journal   = {Language resources and evaluation},
  publisher = {Springer},
  address   = {Dordrecht [u.a.]},
  issn      = {1574-020X},
  doi       = {10.1007/s10579-022-09584-6},
  pages     = {733 -- 763},
  year      = {2023},
  abstract  = {Local laws on urban policy, i.e., ordinances directly affect our daily life in various ways (health, business etc.), yet in practice, for many citizens they remain impervious and complex. This article focuses on an approach to make urban policy more accessible and comprehensible to the general public and to government officials, while also addressing pertinent social media postings. Due to the intricacies of the natural language, ranging from complex legalese in ordinances to informal lingo in tweets, it is practical to harness human judgment here. To this end, we mine ordinances and tweets via reasoning based on commonsense knowledge so as to better account for pragmatics and semantics in the text. Ours is pioneering work in ordinance mining, and thus there is no prior labeled training data available for learning. This gap is filled by commonsense knowledge, a prudent choice in situations involving a lack of adequate training data. The ordinance mining can be beneficial to the public in fathoming policies and to officials in assessing policy effectiveness based on public reactions. This work contributes to smart governance, leveraging transparency in governing processes via public involvement. We focus significantly on ordinances contributing to smart cities, hence an important goal is to assess how well an urban region heads towards a smart city as per its policies mapping with smart city characteristics, and the corresponding public satisfaction.},
  language  = {en}
}
@misc{KurpiersNeher2016,
  author    = {Kurpiers, Jona and Neher, Dieter},
  title     = {Dispersive Non-Geminate Recombination in an Amorphous Polymer:Fullerene Blend},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-91541},
  pages     = {10},
  year      = {2016},
  abstract  = {Recombination of free charge is a key process limiting the performance of solar cells. For low mobility materials, such as organic semiconductors, the kinetics of non-geminate recombination (NGR) is strongly linked to the motion of charges. As these materials possess significant disorder, thermalization of photogenerated carriers in the inhomogeneously broadened density of state distribution is an unavoidable process. Despite its general importance, knowledge about the kinetics of NGR in complete organic solar cells is rather limited. We employ time delayed collection field (TDCF) experiments to study the recombination of photogenerated charge in the high-performance polymer:fullerene blend PCDTBT:PCBM. NGR in the bulk of this amorphous blend is shown to be highly dispersive, with a continuous reduction of the recombination coefficient throughout the entire time scale, until all charge carriers have either been extracted or recombined. Rapid, contact-mediated recombination is identified as an additional loss channel, which, if not properly taken into account, would erroneously suggest a pronounced field dependence of charge generation. These findings are in stark contrast to the results of TDCF experiments on photovoltaic devices made from ordered blends, such as P3HT:PCBM, where non-dispersive recombination was proven to dominate the charge carrier dynamics under application relevant conditions.},
  language  = {en}
}
@misc{NeherKniepertElimelechetal.2016,
  author    = {Neher, Dieter and Kniepert, Juliane and Elimelech, Arik and Koster, L. Jan Anton},
  title     = {A New Figure of Merit for Organic Solar Cells with Transport-limited Photocurrents},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-91414},
  pages     = {9},
  year      = {2016},
  abstract  = {Compared to their inorganic counterparts, organic semiconductors suffer from relatively low charge carrier mobilities. Therefore, expressions derived for inorganic solar cells to correlate characteristic performance parameters to material properties are prone to fail when applied to organic devices. This is especially true for the classical Shockley-equation commonly used to describe current-voltage (JV)-curves, as it assumes a high electrical conductivity of the charge transporting material. Here, an analytical expression for the JV-curves of organic solar cells is derived based on a previously published analytical model. This expression, bearing a similar functional dependence as the Shockley-equation, delivers a new figure of merit α to express the balance between free charge recombination and extraction in low mobility photoactive materials. This figure of merit is shown to determine critical device parameters such as the apparent series resistance and the fill factor.},
  language  = {en}
}
@article{KurpiersNeher2016,
  author    = {Kurpiers, Jona and Neher, Dieter},
  title     = {Dispersive Non-Geminate Recombination in an Amorphous Polymer:Fullerene Blend},
  series = {Scientific reports},
  volume    = {6},
  journal   = {Scientific reports},
  publisher = {Nature Publishing Group},
  address   = {London},
  issn      = {2045-2322},
  doi       = {10.1038/srep26832},
  pages     = {10},
  year      = {2016},
  abstract  = {Recombination of free charge is a key process limiting the performance of solar cells. For low mobility materials, such as organic semiconductors, the kinetics of non-geminate recombination (NGR) is strongly linked to the motion of charges. As these materials possess significant disorder, thermalization of photogenerated carriers in the inhomogeneously broadened density of state distribution is an unavoidable process. Despite its general importance, knowledge about the kinetics of NGR in complete organic solar cells is rather limited. We employ time delayed collection field (TDCF) experiments to study the recombination of photogenerated charge in the high-performance polymer:fullerene blend PCDTBT:PCBM. NGR in the bulk of this amorphous blend is shown to be highly dispersive, with a continuous reduction of the recombination coefficient throughout the entire time scale, until all charge carriers have either been extracted or recombined. Rapid, contact-mediated recombination is identified as an additional loss channel, which, if not properly taken into account, would erroneously suggest a pronounced field dependence of charge generation. These findings are in stark contrast to the results of TDCF experiments on photovoltaic devices made from ordered blends, such as P3HT:PCBM, where non-dispersive recombination was proven to dominate the charge carrier dynamics under application relevant conditions.},
  language  = {en}
}
@article{NeherKniepertElimelechetal.2016,
  author    = {Neher, Dieter and Kniepert, Juliane and Elimelech, Arik and Koster, L. Jan Anton},
  title     = {A New Figure of Merit for Organic Solar Cells with Transport-limited Photocurrents},
  series = {Scientific reports},
  volume    = {6},
  journal   = {Scientific reports},
  publisher = {Nature Publishing Group},
  address   = {London},
  issn      = {2045-2322},
  doi       = {10.1038/srep24861},
  pages     = {9},
  year      = {2016},
  abstract  = {Compared to their inorganic counterparts, organic semiconductors suffer from relatively low charge carrier mobilities. Therefore, expressions derived for inorganic solar cells to correlate characteristic performance parameters to material properties are prone to fail when applied to organic devices. This is especially true for the classical Shockley-equation commonly used to describe current-voltage (JV)-curves, as it assumes a high electrical conductivity of the charge transporting material. Here, an analytical expression for the JV-curves of organic solar cells is derived based on a previously published analytical model. This expression, bearing a similar functional dependence as the Shockley-equation, delivers a new figure of merit α to express the balance between free charge recombination and extraction in low mobility photoactive materials. This figure of merit is shown to determine critical device parameters such as the apparent series resistance and the fill factor.},
  language  = {en}
}
@article{SchindlerMoldenhawerStangeetal.2021,
  author    = {Schindler, Daniel and Moldenhawer, Ted and Stange, Maike and Lepro, Valentino and Beta, Carsten and Holschneider, Matthias and Huisinga, Wilhelm},
  title     = {Analysis of protrusion dynamics in amoeboid cell motility by means of regularized contour flows},
  series = {PLoS Computational Biology : a new community journal},
  volume    = {17},
  journal   = {PLoS Computational Biology : a new community journal},
  number    = {8},
  publisher = {PLoS},
  address   = {San Fransisco},
  issn      = {1553-734X},
  doi       = {10.1371/journal.pcbi.1009268},
  pages     = {33},
  year      = {2021},
  abstract  = {Amoeboid cell motility is essential for a wide range of biological processes including wound healing, embryonic morphogenesis, and cancer metastasis. It relies on complex dynamical patterns of cell shape changes that pose long-standing challenges to mathematical modeling and raise a need for automated and reproducible approaches to extract quantitative morphological features from image sequences. Here, we introduce a theoretical framework and a computational method for obtaining smooth representations of the spatiotemporal contour dynamics from stacks of segmented microscopy images. Based on a Gaussian process regression we propose a one-parameter family of regularized contour flows that allows us to continuously track reference points (virtual markers) between successive cell contours. We use this approach to define a coordinate system on the moving cell boundary and to represent different local geometric quantities in this frame of reference. In particular, we introduce the local marker dispersion as a measure to identify localized membrane expansions and provide a fully automated way to extract the properties of such expansions, including their area and growth time. The methods are available as an open-source software package called AmoePy, a Python-based toolbox for analyzing amoeboid cell motility (based on time-lapse microscopy data), including a graphical user interface and detailed documentation. Due to the mathematical rigor of our framework, we envision it to be of use for the development of novel cell motility models. We mainly use experimental data of the social amoeba Dictyostelium discoideum to illustrate and validate our approach. <br /> Author summary Amoeboid motion is a crawling-like cell migration that plays an important key role in multiple biological processes such as wound healing and cancer metastasis. This type of cell motility results from expanding and simultaneously contracting parts of the cell membrane. From fluorescence images, we obtain a sequence of points, representing the cell membrane, for each time step. By using regression analysis on these sequences, we derive smooth representations, so-called contours, of the membrane. Since the number of measurements is discrete and often limited, the question is raised of how to link consecutive contours with each other. In this work, we present a novel mathematical framework in which these links are described by regularized flows allowing a certain degree of concentration or stretching of neighboring reference points on the same contour. This stretching rate, the so-called local dispersion, is used to identify expansions and contractions of the cell membrane providing a fully automated way of extracting properties of these cell shape changes. We applied our methods to time-lapse microscopy data of the social amoeba Dictyostelium discoideum.},
  language  = {en}
}
@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}
}
@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}
}
@book{KubanRottaNolteetal.2023,
  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      = {2023},
  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}
}
@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}
}
@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}
}
@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{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}
}
@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}
}
@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}
}