51610
2018
2018
eng
14
19
30
article
Wiley
Hoboken
1
2018-04-25
2018-05-25
--
Weight-based strategy for an I/O-intensive application at a cloud data center
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.
Concurrency and computation : practice & experience
10.1002/cpe.4648
1532-0626
1532-0634
wos:2018
e4648
WOS:000443382700005
Peng, JJ (reprint author), Shanghai Univ, Sch Comp Engn & Sci, Shanghai, Peoples R China., jjie.peng@i.shu.edu.cn
National Natural Science Foundation of ChinaNational Natural Science Foundation of China [61103054, 61572305]
2021-08-27T08:01:25+00:00
sword
importub
filename=package.tar
f0998f761795752129c117a908f1e1fb
Peng, Junjie
false
true
Junjie Peng
Danxu Liu
Yingtao Wang
Ying Zeng
Feng Cheng
Wenqiang Zhang
eng
uncontrolled
IOPS
eng
uncontrolled
process scheduling
eng
uncontrolled
random I
eng
uncontrolled
O
eng
uncontrolled
small files
eng
uncontrolled
weight
Datenverarbeitung; Informatik
Hasso-Plattner-Institut für Digital Engineering gGmbH
Referiert
Import
52385
2018
2018
eng
105
108
4
2-3
32
article
Springer
Heidelberg
1
2018-07-09
2018-07-09
--
Answer set programming unleashed!
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)]
Künstliche Intelligenz
10.1007/s13218-018-0550-z
0933-1875
1610-1987
wos:2018
WOS:000441607800003
Schaub, T (reprint author), Univ Potsdam, Potsdam, Germany., torsten@cs.uni-potsdam.de; woltran@dbai.tuwien.ac.at
German Science Foundation (DFG)German Research Foundation (DFG) [SCHA 550/9, 11]; Austrian Science Fund (FWF)Austrian Science Fund (FWF) [Y698]
2021-10-27T07:35:17+00:00
sword
importub
filename=package.tar
9da8324d773682f826ed3a57fad1bd66
Schaub, Torsten H.
false
true
Torsten H. Schaub
Stefan Woltran
Datenverarbeitung; Informatik
Institut für Informatik und Computational Science
Referiert
Import
52381
2018
2018
eng
101
103
3
2-3
32
other
Springer
Heidelberg
1
2018-08-13
2018-08-13
--
Special issue on answer set programming
Künstliche Intelligenz
10.1007/s13218-018-0554-8
0933-1875
1610-1987
wos:2018
WOS:000441607800002
Schaub, T (reprint author), Univ Potsdam, Potsdam, Germany., torsten@cs.uni-potsdam.de; woltran@dbai.tuwien.ac.at
2021-10-26T12:29:07+00:00
sword
importub
filename=package.tar
7881411cbb585d8e0fb83fec8c8a2904
Schaub, Torsten H.
false
true
Torsten H. Schaub
Stefan Woltran
Datenverarbeitung; Informatik
Institut für Informatik und Computational Science
Referiert
Import
Bronze Open-Access
41449
2015
2019
eng
16
585
postprint
1
2019-02-11
2019-02-11
--
Dual-normal logic programs
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.
Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe
the forgotten class
10.25932/publishup-41449
urn:nbn:de:kobv:517-opus4-414490
1866-8372
online registration
Theory and Practice of Logic Programming 15 (2015) 4–5, pp. 495–510 DOI 10.1017/S1471068415000186
false
true
Keine öffentliche Lizenz: Unter Urheberrechtsschutz
Johannes Klaus Fichte
Miroslaw Truszczynski
Stefan Woltran
Zweitveröffentlichungen der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe
585
eng
uncontrolled
answer set programming
eng
uncontrolled
classes of logic programs
eng
uncontrolled
strong and uniform equivalence
eng
uncontrolled
propositional satisfiability
Datenverarbeitung; Informatik
open_access
Mathematisch-Naturwissenschaftliche Fakultät
Referiert
Open Access
Cambridge University Press (CUP)
Universität Potsdam
https://publishup.uni-potsdam.de/files/41449/pmnr585.pdf
7032
2015
2015
eng
438
conferenceobject
Universitätsverlag Potsdam
Potsdam
1
2015-10-12
--
--
KEYCIT 2014
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.
key competencies in informatics and ICT
7216
urn:nbn:de:kobv:517-opus4-70325
978-3-86956-292-6
SR 910
<hr/> In Printform erschienen im <a href="http://info.ub.uni-potsdam.de/verlag.htm">Universitätsverlag Potsdam</a>:<br/><br/> KEYCIT 2014 : key competencies in informatics and ICT / Torsten Brinda, Nicholas Reynolds, Ralf Romeike, Andreas Schwill (Hrsg.). – Potsdam: Universitätsverlag Potsdam, 2015. – 438 S. : Ill., graph. Darst.<br/> (Commentarii informaticae didacticae ; 7)<br/> ISSN (print) 1868-0844<br/> ISSN (online) 2191-1940<br/> ISBN 978-3-86956-292-6<br/> --> <a href="http://info.ub.uni-potsdam.de/cgi-bin/publika/view.pl?id=864">bestellen</a> <hr/>
Paul Curzon
Ivan Kalas
Sigrid Schubert
Niclas Schaper
Jan Barnes
Steve Kennewell
Kathrin Bröker
Uwe Kastens
Johannes Magenheim
Valentina Dagiene
Gabriele Stupuriene
Jason Brent Ellis
Carla Reis Abreu-Ellis
Andreas Grillenberger
Ralf Romeike
Halvdan Haugsbakken
Anthony Jones
Cathy Lewin
Sarah McNicol
Wolfgang Nelles
Jonas Neugebauer
Laura Ohrndorf
Niclas Schaper
Sigrid Schubert
Simone Opel
Matthias Kramer
Michael Trommen
Florian Pottbäcker
Youssef Ilaghef
David Passig
David Tzuriel
Ganit Eshel Kedmi
Toshinori Saito
Mary Webb
Michael Weigend
Rosa Bottino
Augusto Chioccariello
Rhonda Christensen
Gerald Knezek
Anthony Maina Gioko
Enos Kiforo Angondi
Rosemary Waga
Laura Ohrndorf
Rachel Or-Bach
Christina Preston
Sarah Younie
Mareen Przybylla
Ralf Romeike
Nicholas Reynolds
Andrew Swainston
Faye Bendrups
Maciej M. Sysło
Anna Beata Kwiatkowska
Holger Zieris
Herbert Gerstberger
Wolfgang Müller
Steffen Büchner
Simone Opel
Thomas Schiller
Christian Wegner
Raphael Zender
Ulrike Lucke
Ira Diethelm
Jörn Syrbe
Kwok-Wing Lai
Niki Davis
Birgit Eickelmann
Ola Erstad
Petra Fisser
David Gibson
Ferial Khaddage
Gerald Knezek
Peter Micheuz
Carlos Delgado Kloos
Commentarii informaticae didacticae (CID)
7
deu
uncontrolled
Schlüsselkompetenzen
deu
uncontrolled
Informatik
deu
uncontrolled
Bildung
deu
uncontrolled
ICT
deu
uncontrolled
Informatikdidaktik
eng
uncontrolled
Key Competencies
eng
uncontrolled
Informatics
eng
uncontrolled
education
eng
uncontrolled
ICT
eng
uncontrolled
Computer Science Education
Datenverarbeitung; Informatik
open_access
Commentarii informaticae didacticae (CID)
Institut für Informatik und Computational Science
Extern
Universitätsverlag Potsdam
Universität Potsdam
https://publishup.uni-potsdam.de/files/7032/cid07.pdf
4707
2010
2010
deu
105
conferenceobject
Universitätsverlag Potsdam
Potsdam
1
2010-12-09
--
--
HDI2010 – Tagungsband der 4. Fachtagung zur "Hochschuldidaktik Informatik"
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.
urn:nbn:de:kobv:517-opus-49167
4916
978-3-86956-100-4
<hr/>In Printform erschienen im <a href="http://info.ub.uni-potsdam.de/verlag.htm">Universitätsverlag Potsdam</a>:<br/><br/> HDI2010 - Tagungsband der 4. Fachtagung zur "Hochschuldidaktik Informatik" / Dieter Engbring ; Reinhard Keil ; Johannes Magenheim ; Harald Selke (Hrsg.). - Potsdam : Universitätsverlag Potsdam, 2011. - 105 S. : Ill., graph. Darst.<br/>(Commentarii informaticae didacticae : CID ; 4)<br/>ISBN 978-3-86956-100-4<br/>--> <a href="http://info.ub.uni-potsdam.de/cgi-bin/publika/view.pl?id=606">bestellen</a><hr/>
SR 910
Keine öffentliche Lizenz: Unter Urheberrechtsschutz
Arno Rolf
Marc Berges
Peter Hubwieser
Timo Kehrer
Udo Kelter
Ralf Romeike
Marcus Frenkel
Weicker Karsten
Wolfgang Reinhardt
Michael Mascher
Senol Gül
Johannes Magenheim
Stephan Raimer
Ira Diethelm
Malte Dünnebier
Kiss Gabor
Boll Susanne
Meinhardt Rolf
Sabine Gronewold
Larissa Krekeler
Isa Jahnke
Tobias Haertel
Volker Mattick
Karsten Lettow
Jörg Hafer
Joachim Ludwig
Marlen Schumann
Christoph Laroque
Jonas Schulte
Diana Urban
Commentarii informaticae didacticae (CID)
4
Datenverarbeitung; Informatik
open_access
Commentarii informaticae didacticae (CID)
Institut für Informatik und Computational Science
Universitätsverlag Potsdam
Universität Potsdam
https://publishup.uni-potsdam.de/files/4707/hdi2010.pdf
6199
2010
deu
93
98
6
4
article
Universitätsverlag Potsdam
Potsdam
0
--
--
--
Fallstudien in medialen Räumen
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.
Commentarii informaticae didacticae : (CID)
urn:nbn:de:kobv:517-opus-64431
6443
1868-0844
2191-1940
HDI2010 – Tagungsband der 4. Fachtagung zur „Hochschuldidaktik Informatik“/Engbring et al. (Hrsg.)/ Potsdam: Universitätsverlag Potsdam, 2010/ S. 93-98
SR 910
Keine öffentliche Lizenz: Unter Urheberrechtsschutz
Jörg Hafer
Joachim Ludwig
Marlen Schumann
Datenverarbeitung; Informatik
open_access
CID (2010) 04
Institut für Informatik und Computational Science
Universität Potsdam
https://publishup.uni-potsdam.de/files/6199/93_98_hafer_etal.pdf
58084
2021
2021
eng
45
58
14
1
63
article
De Gruyter
Berlin
1
2021-04-09
2021-04-09
--
Argument mining on twitter
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.
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
a survey
10.1515/itit-2020-0053
1611-2776
2196-7032
outputup:dataSource:WoS:2021
WOS:000728590600005
Schäfer, R (corresponding author), Univ Potsdam, Dept Linguist, D-14476 Potsdam, Germany., robin.schaefer@uni-potsdam.de; stede@uni-potsdam.de
2023-02-20T10:24:24+00:00
sword
importub
filename=package.tar
cf12ace3d3f0fc977cd33ed0eb619d1c
2102301-3
2028598-X
Schäfer, Robin
false
true
CC-BY - Namensnennung 4.0 International
Robin Schäfer
Manfred Stede
eng
uncontrolled
Argument Mining
eng
uncontrolled
Twitter
eng
uncontrolled
Stance Detection
Datenverarbeitung; Informatik
Ingenieurwissenschaften und zugeordnete Tätigkeiten
Referiert
Department Linguistik
Import
43153
2008
2020
eng
17
943
postprint
1
2020-06-04
2020-06-04
--
QuantPrime
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.
Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe
a flexible tool for reliable high-throughput primer design for quantitative PCR
10.25932/publishup-43153
urn:nbn:de:kobv:517-opus4-431531
1866-8372
BMC Bioinformatics 9 (2008) 465 DOI:10.1186/1471-2105-9-465
Samuel Janne Arvidsson
Miroslaw Kwasniewski
Diego Mauricio Riaño- Pachón
Bernd Mueller-Roeber
Zweitveröffentlichungen der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe
943
eng
uncontrolled
prime pair
eng
uncontrolled
genome annotation
eng
uncontrolled
specific prime pair
eng
uncontrolled
primer pair design
eng
uncontrolled
quantification protocol
Datenverarbeitung; Informatik
Biowissenschaften; Biologie
Medizin und Gesundheit
open_access
Mathematisch-Naturwissenschaftliche Fakultät
Referiert
Open Access
Universität Potsdam
https://publishup.uni-potsdam.de/files/43153/pmnr943.pdf
57754
2021
2021
eng
12
149
article
Elsevier
Amsterdam
1
2021-04-01
2021-04-01
--
The effect of calibration data length on the performance of a conceptual hydrological model versus LSTM and GRU
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.
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
a case study for six basins from the CAMELS dataset
10.1016/j.cageo.2021.104708
0098-3004
1873-7803
outputup:dataSource:ScienceDirect:2021
104708
WOS:000632973000002
Ayzel, G (corresponding author), Univ Potsdam, Inst Environm Sci & Geog, Karl Liebknecht Str 24-25, D-14476 Potsdam, Germany., ayzel@uni-potsdam.de; heisterm@uni-potsdam.de
Geo.X, the Research Network for Geosciences in Berlin and Potsdam; ClimXtreme - the Research Network on Climate Change and Extreme Events
Ayzel, Georgy
2023-02-02T11:13:21+00:00
sword
importub
filename=package.tar
264ee3e7880cd9db3d404818be90318b
1499977-8
194894-5
false
true
Georgy Ayzel
Maik Heistermann
eng
uncontrolled
Artificial neural networks
eng
uncontrolled
Calibration
eng
uncontrolled
Deep learning
eng
uncontrolled
Rainfall-runoff
eng
uncontrolled
modelling
Datenverarbeitung; Informatik
Geowissenschaften
Referiert
Institut für Umweltwissenschaften und Geographie
Import