TY - GEN
A1 - Fichte, Johannes Klaus
A1 - Truszczynski, Miroslaw
A1 - Woltran, Stefan
T1 - Dual-normal logic programs
BT - the forgotten class
T2 - Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe
N2 - Disjunctive Answer Set Programming is a powerful declarative programming paradigm with complexity beyond NP. Identifying classes of programs for which the consistency problem is in NP is of interest from the theoretical standpoint and can potentially lead to improvements in the design of answer set programming solvers. One of such classes consists of dual-normal programs, where the number of positive body atoms in proper rules is at most one. Unlike other classes of programs, dual-normal programs have received little attention so far. In this paper we study this class. We relate dual-normal programs to propositional theories and to normal programs by presenting several inter-translations. With the translation from dual-normal to normal programs at hand, we introduce the novel class of body-cycle free programs, which are in many respects dual to head-cycle free programs. We establish the expressive power of dual-normal programs in terms of SE- and UE-models, and compare them to normal programs. We also discuss the complexity of deciding whether dual-normal programs are strongly and uniformly equivalent.
T3 - Zweitveröffentlichungen der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe - 585
KW - answer set programming
KW - classes of logic programs
KW - strong and uniform equivalence
KW - propositional satisfiability
Y1 - 2019
U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-414490
SN - 1866-8372
IS - 585
ER -
TY - CHAP
A1 - Curzon, Paul
A1 - Kalas, Ivan
A1 - Schubert, Sigrid
A1 - Schaper, Niclas
A1 - Barnes, Jan
A1 - Kennewell, Steve
A1 - Bröker, Kathrin
A1 - Kastens, Uwe
A1 - Magenheim, Johannes
A1 - Dagiene, Valentina
A1 - Stupuriene, Gabriele
A1 - Ellis, Jason Brent
A1 - Abreu-Ellis, Carla Reis
A1 - Grillenberger, Andreas
A1 - Romeike, Ralf
A1 - Haugsbakken, Halvdan
A1 - Jones, Anthony
A1 - Lewin, Cathy
A1 - McNicol, Sarah
A1 - Nelles, Wolfgang
A1 - Neugebauer, Jonas
A1 - Ohrndorf, Laura
A1 - Schaper, Niclas
A1 - Schubert, Sigrid
A1 - Opel, Simone
A1 - Kramer, Matthias
A1 - Trommen, Michael
A1 - Pottbäcker, Florian
A1 - Ilaghef, Youssef
A1 - Passig, David
A1 - Tzuriel, David
A1 - Kedmi, Ganit Eshel
A1 - Saito, Toshinori
A1 - Webb, Mary
A1 - Weigend, Michael
A1 - Bottino, Rosa
A1 - Chioccariello, Augusto
A1 - Christensen, Rhonda
A1 - Knezek, Gerald
A1 - Gioko, Anthony Maina
A1 - Angondi, Enos Kiforo
A1 - Waga, Rosemary
A1 - Ohrndorf, Laura
A1 - Or-Bach, Rachel
A1 - Preston, Christina
A1 - Younie, Sarah
A1 - Przybylla, Mareen
A1 - Romeike, Ralf
A1 - Reynolds, Nicholas
A1 - Swainston, Andrew
A1 - Bendrups, Faye
A1 - Sysło, Maciej M.
A1 - Kwiatkowska, Anna Beata
A1 - Zieris, Holger
A1 - Gerstberger, Herbert
A1 - Müller, Wolfgang
A1 - Büchner, Steffen
A1 - Opel, Simone
A1 - Schiller, Thomas
A1 - Wegner, Christian
A1 - Zender, Raphael
A1 - Lucke, Ulrike
A1 - Diethelm, Ira
A1 - Syrbe, Jörn
A1 - Lai, Kwok-Wing
A1 - Davis, Niki
A1 - Eickelmann, Birgit
A1 - Erstad, Ola
A1 - Fisser, Petra
A1 - Gibson, David
A1 - Khaddage, Ferial
A1 - Knezek, Gerald
A1 - Micheuz, Peter
A1 - Kloos, Carlos Delgado
ED - Brinda, Torsten
ED - Reynolds, Nicholas
ED - Romeike, Ralf
ED - Schwill, Andreas
T1 - KEYCIT 2014
BT - key competencies in informatics and ICT
N2 - In our rapidly changing world it is increasingly important not only to be an expert in a chosen field of study but also to be able to respond to developments, master new approaches to solving problems, and fulfil changing requirements in the modern world and in the job market. In response to these needs key competencies in understanding, developing and using new digital technologies are being brought into focus in school and university programmes. The IFIP TC3 conference "KEYCIT – Key Competences in Informatics and ICT (KEYCIT 2014)" was held at the University of Potsdam in Germany from July 1st to 4th, 2014 and addressed the combination of key competencies, Informatics and ICT in detail. The conference was organized into strands focusing on secondary education, university education and teacher education (organized by IFIP WGs 3.1 and 3.3) and provided a forum to present and to discuss research, case studies, positions, and national perspectives in this field.
T3 - Commentarii informaticae didacticae (CID) - 7
KW - Schlüsselkompetenzen
KW - Informatik
KW - Bildung
KW - ICT
KW - Informatikdidaktik
KW - Key Competencies
KW - Informatics
KW - education
KW - ICT
KW - Computer Science Education
Y1 - 2015
U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-70325
SN - 978-3-86956-292-6
PB - Universitätsverlag Potsdam
CY - Potsdam
ER -
TY - CHAP
A1 - Rolf, Arno
A1 - Berges, Marc
A1 - Hubwieser, Peter
A1 - Kehrer, Timo
A1 - Kelter, Udo
A1 - Romeike, Ralf
A1 - Frenkel, Marcus
A1 - Karsten, Weicker
A1 - Reinhardt, Wolfgang
A1 - Mascher, Michael
A1 - Gül, Senol
A1 - Magenheim, Johannes
A1 - Raimer, Stephan
A1 - Diethelm, Ira
A1 - Dünnebier, Malte
A1 - Gabor, Kiss
A1 - Susanne, Boll
A1 - Rolf, Meinhardt
A1 - Gronewold, Sabine
A1 - Krekeler, Larissa
A1 - Jahnke, Isa
A1 - Haertel, Tobias
A1 - Mattick, Volker
A1 - Lettow, Karsten
A1 - Hafer, Jörg
A1 - Ludwig, Joachim
A1 - Schumann, Marlen
A1 - Laroque, Christoph
A1 - Schulte, Jonas
A1 - Urban, Diana
ED - Engbring, Dieter
ED - Keil, Reinhard
ED - Magenheim, Johannes
ED - Selke, Harald
T1 - HDI2010 – Tagungsband der 4. Fachtagung zur "Hochschuldidaktik Informatik"
N2 - Mit der 4. Tagung zur Hochschuldidaktik Informatik wird eine Reihe fortgesetzt, die ihren Anfang 1998 in Stuttgart unter der Überschrift „Informatik und Ausbildung“ genommen hat. Seither dienen diese Tagungen den Lehrenden im Bereich der Hochschulinformatik als Forum der Information und des Diskurses über aktuelle didaktische und bildungspolitische Entwicklungen im Bereich der Informatikausbildung. Aktuell zählen dazu insbesondere Fragen der Bildungsrelevanz informatischer Inhalte und der Herausforderung durch eine stärkere Kompetenzorientierung in der Informatik. Die eingereichten Beiträge zur HDI 2010 in Paderborn veranschaulichen unterschiedliche Bemühungen, sich mit relevanten Problemen der Informatikdidaktik an Hochschulen in Deutschland (und z. T. auch im Ausland) auseinanderzusetzen. Aus der Breite des Spektrums der Einreichungen ergaben sich zugleich Probleme bei der Begutachtung. Letztlich konnten von den zahlreichen Einreichungen nur drei die Gutachter so überzeugen, dass sie uneingeschränkt in ihrer Langfassung akzeptiert wurden. Neun weitere Einreichungen waren trotz Kritik überwiegend positiv begutachtet worden, so dass wir diese als Kurzfassung bzw. Diskussionspapier in die Tagung aufgenommen haben.
T3 - Commentarii informaticae didacticae (CID) - 4
Y1 - 2010
U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-49167
SN - 978-3-86956-100-4
PB - Universitätsverlag Potsdam
CY - Potsdam
ER -
TY - JOUR
A1 - Hafer, Jörg
A1 - Ludwig, Joachim
A1 - Schumann, Marlen
T1 - Fallstudien in medialen Räumen
JF - Commentarii informaticae didacticae : (CID)
N2 - Ziel dieses Beitrages ist es, das didaktische Konzept Fallstudien und seine lerntheoretisch-didaktische Begründung vorzustellen. Es wird die These begründet, dass mediale Räume für die Bearbeitung von Fallstudien lernunterstützend wirken und sich in besonderer Weise für Prozesse der Lernberatung und Lernbegleitung in der Hochschule eignen. Diese These wird entlang dem lerntheoretischen Konzept der Bedeutungsräume von Studierenden in Verbindung mit den Spezifika medialer Räume entfaltet. Für den daraus entstandenen E-Learning-Ansatz Online-Fallstudien kann hier lediglich ein Ausblick gegeben werden.
Y1 - 2010
U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-64431
SN - 1868-0844
SN - 2191-1940
IS - 4
SP - 93
EP - 98
PB - Universitätsverlag Potsdam
CY - Potsdam
ER -
TY - JOUR
A1 - Schäfer, Robin
A1 - Stede, Manfred
T1 - Argument mining on twitter
BT - a survey
JF - Information technology : it ; Methoden und innovative Anwendungen der Informatik und Informationstechnik ; Organ der Fachbereiche 3 und 4 der GI e.V. und des Fachbereichs 6 der ITG
N2 - In the last decade, the field of argument mining has grown notably. However, only relatively few studies have investigated argumentation in social media and specifically on Twitter. Here, we provide the, to our knowledge, first critical in-depth survey of the state of the art in tweet-based argument mining. We discuss approaches to modelling the structure of arguments in the context of tweet corpus annotation, and we review current progress in the task of detecting argument components and their relations in tweets. We also survey the intersection of argument mining and stance detection, before we conclude with an outlook.
KW - Argument Mining
KW - Twitter
KW - Stance Detection
Y1 - 2021
U6 - https://doi.org/10.1515/itit-2020-0053
SN - 1611-2776
SN - 2196-7032
VL - 63
IS - 1
SP - 45
EP - 58
PB - De Gruyter
CY - Berlin
ER -
TY - GEN
A1 - Arvidsson, Samuel Janne
A1 - Kwasniewski, Miroslaw
A1 - Riaño- Pachón, Diego Mauricio
A1 - Mueller-Roeber, Bernd
T1 - QuantPrime
BT - a flexible tool for reliable high-throughput primer design for quantitative PCR
T2 - Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe
N2 - Background
Medium- to large-scale expression profiling using quantitative polymerase chain reaction (qPCR) assays are becoming increasingly important in genomics research. A major bottleneck in experiment preparation is the design of specific primer pairs, where researchers have to make several informed choices, often outside their area of expertise. Using currently available primer design tools, several interactive decisions have to be made, resulting in lengthy design processes with varying qualities of the assays.
Results
Here we present QuantPrime, an intuitive and user-friendly, fully automated tool for primer pair design in small- to large-scale qPCR analyses. QuantPrime can be used online through the internet http://www.quantprime.de/ or on a local computer after download; it offers design and specificity checking with highly customizable parameters and is ready to use with many publicly available transcriptomes of important higher eukaryotic model organisms and plant crops (currently 295 species in total), while benefiting from exon-intron border and alternative splice variant information in available genome annotations. Experimental results with the model plant Arabidopsis thaliana, the crop Hordeum vulgare and the model green alga Chlamydomonas reinhardtii show success rates of designed primer pairs exceeding 96%.
Conclusion
QuantPrime constitutes a flexible, fully automated web application for reliable primer design for use in larger qPCR experiments, as proven by experimental data. The flexible framework is also open for simple use in other quantification applications, such as hydrolyzation probe design for qPCR and oligonucleotide probe design for quantitative in situ hybridization. Future suggestions made by users can be easily implemented, thus allowing QuantPrime to be developed into a broad-range platform for the design of RNA expression assays.
T3 - Zweitveröffentlichungen der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe - 943
KW - prime pair
KW - genome annotation
KW - specific prime pair
KW - primer pair design
KW - quantification protocol
Y1 - 2020
U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-431531
SN - 1866-8372
IS - 943
ER -
TY - JOUR
A1 - Ayzel, Georgy
A1 - Heistermann, Maik
T1 - The effect of calibration data length on the performance of a conceptual hydrological model versus LSTM and GRU
BT - a case study for six basins from the CAMELS dataset
JF - Computers & geosciences : an international journal devoted to the publication of papers on all aspects of geocomputation and to the distribution of computer programs and test data sets ; an official journal of the International Association for Mathematical Geology
N2 - We systematically explore the effect of calibration data length on the performance of a conceptual hydrological model, GR4H, in comparison to two Artificial Neural Network (ANN) architectures: Long Short-Term Memory Networks (LSTM) and Gated Recurrent Units (GRU), which have just recently been introduced to the field of hydrology. We implemented a case study for six river basins across the contiguous United States, with 25 years of meteorological and discharge data. Nine years were reserved for independent validation; two years were used as a warm-up period, one year for each of the calibration and validation periods, respectively; from the remaining 14 years, we sampled increasing amounts of data for model calibration, and found pronounced differences in model performance. While GR4H required less data to converge, LSTM and GRU caught up at a remarkable rate, considering their number of parameters. Also, LSTM and GRU exhibited the higher calibration instability in comparison to GR4H. These findings confirm the potential of modern deep-learning architectures in rainfall runoff modelling, but also highlight the noticeable differences between them in regard to the effect of calibration data length.
KW - Artificial neural networks
KW - Calibration
KW - Deep learning
KW - Rainfall-runoff
KW - modelling
Y1 - 2021
U6 - https://doi.org/10.1016/j.cageo.2021.104708
SN - 0098-3004
SN - 1873-7803
VL - 149
PB - Elsevier
CY - Amsterdam
ER -
TY - JOUR
A1 - Kossmann, Jan
A1 - Halfpap, Stefan
A1 - Jankrift, Marcel
A1 - Schlosser, Rainer
T1 - Magic mirror in my hand, which is the best in the land?
BT - an experimental evaluation of index selection algorithms
JF - Proceedings of the VLDB Endowment
N2 - Indexes are essential for the efficient processing of database workloads. Proposed solutions for the relevant and challenging index selection problem range from metadata-based simple heuristics, over sophisticated multi-step algorithms, to approaches that yield optimal results. The main challenges are (i) to accurately determine the effect of an index on the workload cost while considering the interaction of indexes and (ii) a large number of possible combinations resulting from workloads containing many queries and massive schemata with possibly thousands of attributes.
In this work, we describe and analyze eight index selection algorithms that are based on different concepts and compare them along different dimensions, such as solution quality, runtime, multi-column support, solution granularity, and complexity. In particular, we analyze the solutions of the algorithms for the challenging analytical Join Order, TPC-H, and TPC-DS benchmarks. Afterward, we assess strengths and weaknesses, infer insights for index selection in general and each approach individually, before we give recommendations on when to use which approach.
Y1 - 2020
U6 - https://doi.org/10.14778/3407790.3407832
SN - 2150-8097
VL - 13
IS - 11
SP - 2382
EP - 2395
PB - Association for Computing Machinery
CY - New York
ER -
TY - JOUR
A1 - Kaya, Adem
A1 - Freitag, Melina A.
T1 - Conditioning analysis for discrete Helmholtz problems
JF - Computers and mathematics with applications : an international journal
N2 - In this paper, we examine conditioning of the discretization of the Helmholtz problem. Although the discrete Helmholtz problem has been studied from different perspectives, to the best of our knowledge, there is no conditioning analysis for it. We aim to fill this gap in the literature. We propose a novel method in 1D to observe the near-zero eigenvalues of a symmetric indefinite matrix. Standard classification of ill-conditioning based on the matrix condition number is not true for the discrete Helmholtz problem. We relate the ill-conditioning of the discretization of the Helmholtz problem with the condition number of the matrix. We carry out analytical conditioning analysis in 1D and extend our observations to 2D with numerical observations. We examine several discretizations. We find different regions in which the condition number of the problem shows different characteristics. We also explain the general behavior of the solutions in these regions.
KW - Helmholtz problem
KW - Condition number
KW - Ill-conditioning
KW - Indefinite
KW - matrices
Y1 - 2022
U6 - https://doi.org/10.1016/j.camwa.2022.05.016
SN - 0898-1221
SN - 1873-7668
VL - 118
SP - 171
EP - 182
PB - Elsevier Science
CY - Amsterdam
ER -
TY - JOUR
A1 - Mattis, Toni
A1 - Beckmann, Tom
A1 - Rein, Patrick
A1 - Hirschfeld, Robert
T1 - First-class concepts
BT - Reified architectural knowledge beyond dominant decompositions
JF - Journal of object technology : JOT / ETH Zürich, Department of Computer Science
N2 - Ideally, programs are partitioned into independently maintainable and understandable modules. As a system grows, its architecture gradually loses the capability to accommodate new concepts in a modular way. While refactoring is expensive and not always possible, and the programming language might lack dedicated primary language constructs to express certain cross-cutting concerns, programmers are still able to explain and delineate convoluted concepts through secondary means: code comments, use of whitespace and arrangement of code, documentation, or communicating tacit knowledge.
Secondary constructs are easy to change and provide high flexibility in communicating cross-cutting concerns and other concepts among programmers. However, such secondary constructs usually have no reified representation that can be explored and manipulated as first-class entities through the programming environment.
In this exploratory work, we discuss novel ways to express a wide range of concepts, including cross-cutting concerns, patterns, and lifecycle artifacts independently of the dominant decomposition imposed by an existing architecture. We propose the representation of concepts as first-class objects inside the programming environment that retain the capability to change as easily as code comments. We explore new tools that allow programmers to view, navigate, and change programs based on conceptual perspectives. In a small case study, we demonstrate how such views can be created and how the programming experience changes from draining programmers' attention by stretching it across multiple modules toward focusing it on cohesively presented concepts. Our designs are geared toward facilitating multiple secondary perspectives on a system to co-exist in symbiosis with the original architecture, hence making it easier to explore, understand, and explain complex contexts and narratives that are hard or impossible to express using primary modularity constructs.
KW - software engineering
KW - modularity
KW - exploratory programming
KW - program
KW - comprehension
KW - remodularization
KW - architecture recovery
Y1 - 2022
U6 - https://doi.org/10.5381/jot.2022.21.2.a6
SN - 1660-1769
VL - 21
IS - 2
SP - 1
EP - 15
PB - ETH Zürich, Department of Computer Science
CY - Zürich
ER -