@article{PengLiuWangetal.2018,
  author    = {Peng, Junjie and Liu, Danxu and Wang, Yingtao and Zeng, Ying and Cheng, Feng and Zhang, Wenqiang},
  title     = {Weight-based strategy for an I/O-intensive application at a cloud data center},
  series = {Concurrency and computation : practice \& experience},
  volume    = {30},
  journal   = {Concurrency and computation : practice \& experience},
  number    = {19},
  publisher = {Wiley},
  address   = {Hoboken},
  issn      = {1532-0626},
  doi       = {10.1002/cpe.4648},
  pages     = {14},
  year      = {2018},
  abstract  = {Applications with different characteristics in the cloud may have different resources preferences. However, traditional resource allocation and scheduling strategies rarely take into account the characteristics of applications. Considering that an I/O-intensive application is a typical type of application and that frequent I/O accesses, especially small files randomly accessing the disk, may lead to an inefficient use of resources and reduce the quality of service (QoS) of applications, a weight allocation strategy is proposed based on the available resources that a physical server can provide as well as the characteristics of the applications. Using the weight obtained, a resource allocation and scheduling strategy is presented based on the specific application characteristics in the data center. Extensive experiments show that the strategy is correct and can guarantee a high concurrency of I/O per second (IOPS) in a cloud data center with high QoS. Additionally, the strategy can efficiently improve the utilization of the disk and resources of the data center without affecting the service quality of applications.},
  language  = {en}
}
@article{SchaubWoltran2018,
  author    = {Schaub, Torsten H. and Woltran, Stefan},
  title     = {Answer set programming unleashed!},
  series = {K{\"u}nstliche Intelligenz},
  volume    = {32},
  journal   = {K{\"u}nstliche Intelligenz},
  number    = {2-3},
  publisher = {Springer},
  address   = {Heidelberg},
  issn      = {0933-1875},
  doi       = {10.1007/s13218-018-0550-z},
  pages     = {105 -- 108},
  year      = {2018},
  abstract  = {Answer Set Programming faces an increasing popularity for problem solving in various domains. While its modeling language allows us to express many complex problems in an easy way, its solving technology enables their effective resolution. In what follows, we detail some of the key factors of its success. Answer Set Programming [ASP; Brewka et al. Commun ACM 54(12):92-103, (2011)] is seeing a rapid proliferation in academia and industry due to its easy and flexible way to model and solve knowledge-intense combinatorial (optimization) problems. To this end, ASP offers a high-level modeling language paired with high-performance solving technology. As a result, ASP systems provide out-off-the-box, general-purpose search engines that allow for enumerating (optimal) solutions. They are represented as answer sets, each being a set of atoms representing a solution. The declarative approach of ASP allows a user to concentrate on a problem's specification rather than the computational means to solve it. This makes ASP a prime candidate for rapid prototyping and an attractive tool for teaching key AI techniques since complex problems can be expressed in a succinct and elaboration tolerant way. This is eased by the tuning of ASP's modeling language to knowledge representation and reasoning (KRR). The resulting impact is nicely reflected by a growing range of successful applications of ASP [Erdem et al. AI Mag 37(3):53-68, 2016; Falkner et al. Industrial applications of answer set programming. K++nstliche Intelligenz (2018)]},
  language  = {en}
}
@misc{SchaubWoltran2018,
  author    = {Schaub, Torsten H. and Woltran, Stefan},
  title     = {Special issue on answer set programming},
  series = {K{\"u}nstliche Intelligenz},
  volume    = {32},
  journal   = {K{\"u}nstliche Intelligenz},
  number    = {2-3},
  publisher = {Springer},
  address   = {Heidelberg},
  issn      = {0933-1875},
  doi       = {10.1007/s13218-018-0554-8},
  pages     = {101 -- 103},
  year      = {2018},
  language  = {en}
}
@misc{FichteTruszczynskiWoltran2015,
  author    = {Fichte, Johannes Klaus and Truszczynski, Miroslaw and Woltran, Stefan},
  title     = {Dual-normal logic programs},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  number    = {585},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-41449},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-414490},
  pages     = {16},
  year      = {2015},
  abstract  = {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.},
  language  = {en}
}
@inproceedings{CurzonKalasSchubertetal.2015,
  author    = {Curzon, Paul and Kalas, Ivan and Schubert, Sigrid and Schaper, Niclas and Barnes, Jan and Kennewell, Steve and Br{\"o}ker, Kathrin and Kastens, Uwe and Magenheim, Johannes and Dagiene, Valentina and Stupuriene, Gabriele and Ellis, Jason Brent and Abreu-Ellis, Carla Reis and Grillenberger, Andreas and Romeike, Ralf and Haugsbakken, Halvdan and Jones, Anthony and Lewin, Cathy and McNicol, Sarah and Nelles, Wolfgang and Neugebauer, Jonas and Ohrndorf, Laura and Schaper, Niclas and Schubert, Sigrid and Opel, Simone and Kramer, Matthias and Trommen, Michael and Pottb{\"a}cker, Florian and Ilaghef, Youssef and Passig, David and Tzuriel, David and Kedmi, Ganit Eshel and Saito, Toshinori and Webb, Mary and Weigend, Michael and Bottino, Rosa and Chioccariello, Augusto and Christensen, Rhonda and Knezek, Gerald and Gioko, Anthony Maina and Angondi, Enos Kiforo and Waga, Rosemary and Ohrndorf, Laura and Or-Bach, Rachel and Preston, Christina and Younie, Sarah and Przybylla, Mareen and Romeike, Ralf and Reynolds, Nicholas and Swainston, Andrew and Bendrups, Faye and Sysło, Maciej M. and Kwiatkowska, Anna Beata and Zieris, Holger and Gerstberger, Herbert and M{\"u}ller, Wolfgang and B{\"u}chner, Steffen and Opel, Simone and Schiller, Thomas and Wegner, Christian and Zender, Raphael and Lucke, Ulrike and Diethelm, Ira and Syrbe, J{\"o}rn and Lai, Kwok-Wing and Davis, Niki and Eickelmann, Birgit and Erstad, Ola and Fisser, Petra and Gibson, David and Khaddage, Ferial and Knezek, Gerald and Micheuz, Peter and Kloos, Carlos Delgado},
  title     = {KEYCIT 2014},
  editor    = {Brinda, Torsten and Reynolds, Nicholas and Romeike, Ralf and Schwill, Andreas},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-292-6},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-70325},
  pages     = {438},
  year      = {2015},
  abstract  = {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.},
  language  = {en}
}
@inproceedings{RolfBergesHubwieseretal.2010,
  author    = {Rolf, Arno and Berges, Marc and Hubwieser, Peter and Kehrer, Timo and Kelter, Udo and Romeike, Ralf and Frenkel, Marcus and Karsten, Weicker and Reinhardt, Wolfgang and Mascher, Michael and G{\"u}l, Senol and Magenheim, Johannes and Raimer, Stephan and Diethelm, Ira and D{\"u}nnebier, Malte and Gabor, Kiss and Susanne, Boll and Rolf, Meinhardt and Gronewold, Sabine and Krekeler, Larissa and Jahnke, Isa and Haertel, Tobias and Mattick, Volker and Lettow, Karsten and Hafer, J{\"o}rg and Ludwig, Joachim and Schumann, Marlen and Laroque, Christoph and Schulte, Jonas and Urban, Diana},
  title     = {HDI2010 - Tagungsband der 4. Fachtagung zur "Hochschuldidaktik Informatik"},
  editor    = {Engbring, Dieter and Keil, Reinhard and Magenheim, Johannes and Selke, Harald},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-100-4},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-49167},
  pages     = {105},
  year      = {2010},
  abstract  = {Mit der 4. Tagung zur Hochschuldidaktik Informatik wird eine Reihe fortgesetzt, die ihren Anfang 1998 in Stuttgart unter der {\"U}berschrift „Informatik und Ausbildung" genommen hat. Seither dienen diese Tagungen den Lehrenden im Bereich der Hochschulinformatik als Forum der Information und des Diskurses {\"u}ber aktuelle didaktische und bildungspolitische Entwicklungen im Bereich der Informatikausbildung. Aktuell z{\"a}hlen dazu insbesondere Fragen der Bildungsrelevanz informatischer Inhalte und der Herausforderung durch eine st{\"a}rkere Kompetenzorientierung in der Informatik. Die eingereichten Beitr{\"a}ge zur HDI 2010 in Paderborn veranschaulichen unterschiedliche Bem{\"u}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 {\"u}berzeugen, dass sie uneingeschr{\"a}nkt in ihrer Langfassung akzeptiert wurden. Neun weitere Einreichungen waren trotz Kritik {\"u}berwiegend positiv begutachtet worden, so dass wir diese als Kurzfassung bzw. Diskussionspapier in die Tagung aufgenommen haben.},
  language  = {de}
}
@article{HaferLudwigSchumann2010,
  author    = {Hafer, J{\"o}rg and Ludwig, Joachim and Schumann, Marlen},
  title     = {Fallstudien in medialen R{\"a}umen},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {4},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-64431},
  pages     = {93 -- 98},
  year      = {2010},
  abstract  = {Ziel dieses Beitrages ist es, das didaktische Konzept Fallstudien und seine lerntheoretisch-didaktische Begr{\"u}ndung vorzustellen. Es wird die These begr{\"u}ndet, dass mediale R{\"a}ume f{\"u}r die Bearbeitung von Fallstudien lernunterst{\"u}tzend wirken und sich in besonderer Weise f{\"u}r Prozesse der Lernberatung und Lernbegleitung in der Hochschule eignen. Diese These wird entlang dem lerntheoretischen Konzept der Bedeutungsr{\"a}ume von Studierenden in Verbindung mit den Spezifika medialer R{\"a}ume entfaltet. F{\"u}r den daraus entstandenen E-Learning-Ansatz Online-Fallstudien kann hier lediglich ein Ausblick gegeben werden.},
  language  = {de}
}
@article{SchaeferStede2021,
  author    = {Sch{\"a}fer, Robin and Stede, Manfred},
  title     = {Argument mining on twitter},
  series = {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},
  volume    = {63},
  journal   = {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},
  number    = {1},
  publisher = {De Gruyter},
  address   = {Berlin},
  issn      = {1611-2776},
  doi       = {10.1515/itit-2020-0053},
  pages     = {45 -- 58},
  year      = {2021},
  abstract  = {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.},
  language  = {en}
}
@misc{ArvidssonKwasniewskiRianoPachonetal.2008,
  author    = {Arvidsson, Samuel Janne and Kwasniewski, Miroslaw and Ria{\~n}o- Pach{\´o}n, Diego Mauricio and Mueller-Roeber, Bernd},
  title     = {QuantPrime},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  number    = {943},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-43153},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-431531},
  pages     = {17},
  year      = {2008},
  abstract  = {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.},
  language  = {en}
}
@article{AyzelHeistermann2021,
  author    = {Ayzel, Georgy and Heistermann, Maik},
  title     = {The effect of calibration data length on the performance of a conceptual hydrological model versus LSTM and GRU},
  series = {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},
  volume    = {149},
  journal   = {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},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0098-3004},
  doi       = {10.1016/j.cageo.2021.104708},
  pages     = {12},
  year      = {2021},
  abstract  = {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.},
  language  = {en}
}