TY - JOUR A1 - Ahmad, Nadeem A1 - Shoaib, Umar A1 - Prinetto, Paolo T1 - Usability of Online Assistance From Semiliterate Users' Perspective JF - International journal of human computer interaction Y1 - 2015 U6 - https://doi.org/10.1080/10447318.2014.925772 SN - 1044-7318 SN - 1532-7590 VL - 31 IS - 1 SP - 55 EP - 64 PB - Taylor & Francis Group CY - Philadelphia ER - TY - JOUR A1 - Childs, Dorothee A1 - Grimbs, Sergio A1 - Selbig, Joachim T1 - Refined elasticity sampling for Monte Carlo-based identification of stabilizing network patterns JF - Bioinformatics N2 - Motivation: Structural kinetic modelling (SKM) is a framework to analyse whether a metabolic steady state remains stable under perturbation, without requiring detailed knowledge about individual rate equations. It provides a representation of the system's Jacobian matrix that depends solely on the network structure, steady state measurements, and the elasticities at the steady state. For a measured steady state, stability criteria can be derived by generating a large number of SKMs with randomly sampled elasticities and evaluating the resulting Jacobian matrices. The elasticity space can be analysed statistically in order to detect network positions that contribute significantly to the perturbation response. Here, we extend this approach by examining the kinetic feasibility of the elasticity combinations created during Monte Carlo sampling. Results: Using a set of small example systems, we show that the majority of sampled SKMs would yield negative kinetic parameters if they were translated back into kinetic models. To overcome this problem, a simple criterion is formulated that mitigates such infeasible models. After evaluating the small example pathways, the methodology was used to study two steady states of the neuronal TCA cycle and the intrinsic mechanisms responsible for their stability or instability. The findings of the statistical elasticity analysis confirm that several elasticities are jointly coordinated to control stability and that the main source for potential instabilities are mutations in the enzyme alpha-ketoglutarate dehydrogenase. Y1 - 2015 U6 - https://doi.org/10.1093/bioinformatics/btv243 SN - 1367-4803 SN - 1460-2059 VL - 31 IS - 12 SP - 214 EP - 220 PB - Oxford Univ. Press CY - Oxford 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 - JOUR A1 - Fichte, Johannes Klaus A1 - Szeider, Stefan T1 - Backdoors to tractable answer set programming JF - Artificial intelligence N2 - Answer Set Programming (ASP) is an increasingly popular framework for declarative programming that admits the description of problems by means of rules and constraints that form a disjunctive logic program. In particular, many Al problems such as reasoning in a nonmonotonic setting can be directly formulated in ASP. Although the main problems of ASP are of high computational complexity, complete for the second level of the Polynomial Hierarchy, several restrictions of ASP have been identified in the literature, under which ASP problems become tractable. In this paper we use the concept of backdoors to identify new restrictions that make ASP problems tractable. Small backdoors are sets of atoms that represent "clever reasoning shortcuts" through the search space and represent a hidden structure in the problem input. The concept of backdoors is widely used in theoretical investigations in the areas of propositional satisfiability and constraint satisfaction. We show that it can be fruitfully adapted to ASP. We demonstrate how backdoors can serve as a unifying framework that accommodates several tractable restrictions of ASP known from the literature. Furthermore, we show how backdoors allow us to deploy recent algorithmic results from parameterized complexity theory to the domain of answer set programming. (C) 2015 Elsevier B.V. All rights reserved. KW - Answer set programming KW - Backdoors KW - Computational complexity KW - Parameterized complexity KW - Kernelization Y1 - 2015 U6 - https://doi.org/10.1016/j.artint.2014.12.001 SN - 0004-3702 SN - 1872-7921 VL - 220 SP - 64 EP - 103 PB - Elsevier CY - Amsterdam ER - TY - JOUR A1 - Grünewald, Franka A1 - Meinel, Christoph T1 - Implementation and Evaluation of Digital E-Lecture Annotation in Learning Groups to Foster Active Learning JF - IEEE transactions on learning technologies N2 - The use of video lectures in distance learning involves the two major problems of searchability and active user participation. In this paper, we promote the implementation and usage of a collaborative educational video annotation functionality to overcome these two challenges. Different use cases and requirements, as well as details of the implementation, are explained. Furthermore, we suggest more improvements to foster a culture of participation and an algorithm for the extraction of semantic data. Finally, evaluations in the form of user tests and questionnaires in a MOOC setting are presented. The results of the evaluation are promising, as they indicate not only that students perceive it as useful, but also that the learning effectiveness increases. The combination of personal lecture video annotations with a semantic topic map was also evaluated positively and will thus be investigated further, as will the implementation in a MOOC context. KW - eLectures KW - tele-teaching KW - video annotation KW - collaborative learning Y1 - 2015 U6 - https://doi.org/10.1109/TLT.2015.2396042 SN - 1939-1382 VL - 8 IS - 3 SP - 286 EP - 298 PB - Inst. of Electr. and Electronics Engineers CY - Los Alamitos ER - TY - JOUR A1 - Hoos, Holger A1 - Kaminski, Roland A1 - Lindauer, Marius A1 - Schaub, Torsten H. T1 - aspeed: Solver scheduling via answer set programming JF - Theory and practice of logic programming N2 - Although Boolean Constraint Technology has made tremendous progress over the last decade, the efficacy of state-of-the-art solvers is known to vary considerably across different types of problem instances, and is known to depend strongly on algorithm parameters. This problem was addressed by means of a simple, yet effective approach using handmade, uniform, and unordered schedules of multiple solvers in ppfolio, which showed very impressive performance in the 2011 Satisfiability Testing (SAT) Competition. Inspired by this, we take advantage of the modeling and solving capacities of Answer Set Programming (ASP) to automatically determine more refined, that is, nonuniform and ordered solver schedules from the existing benchmarking data. We begin by formulating the determination of such schedules as multi-criteria optimization problems and provide corresponding ASP encodings. The resulting encodings are easily customizable for different settings, and the computation of optimum schedules can mostly be done in the blink of an eye, even when dealing with large runtime data sets stemming from many solvers on hundreds to thousands of instances. Also, the fact that our approach can be customized easily enabled us to swiftly adapt it to generate parallel schedules for multi-processor machines. KW - algorithm schedules KW - answer set programming KW - portfolio-based solving Y1 - 2015 U6 - https://doi.org/10.1017/S1471068414000015 SN - 1471-0684 SN - 1475-3081 VL - 15 SP - 117 EP - 142 PB - Cambridge Univ. Press CY - New York ER - TY - THES A1 - Jung, Jörg T1 - Efficient credit based server load balancing Y1 - 2015 ER - TY - JOUR A1 - Jung, Jörg A1 - Kiertscher, Simon A1 - Menski, Sebastian A1 - Schnor, Bettina T1 - Self-Adapting Load Balancing for DNS JF - Journal of networks N2 - The Domain Name System belongs to the core services of the Internet infrastructure. Hence, DNS availability and performance is essential for the operation of the Internet and replication as well as load balancing are used for the root and top level name servers. This paper proposes an architecture for credit based server load balancing (SLB) for DNS. Compared to traditional load balancing algorithms like round robin or least connection, the benefit of credit based SLB is that the load balancer can adapt more easily to heterogeneous load requests and back end server capacities. The challenge of this approach is the definition of a suited credit metric. While this was done before for TCP based services like HTTP, the problem was not solved for UDP based services like DNS. In the following an approach is presented to define credits also for UDP based services. This UDP/DNS approach is implemented within the credit based SLB implementation salbnet. The presented measurements confirm the benefit of the self-adapting credit based SLB approach. In our experiments, the mean (first) response time dropped significantly compared to weighted round robin (WRR) (from over 4 ms to about 0.6 ms for dynamic pressure relieve (DPR)). KW - Load Balancing KW - Cluster Computing KW - Performance Evaluation Y1 - 2015 U6 - https://doi.org/10.1109/SPECTS.2014.6879994 VL - 10 IS - 4 SP - 222 EP - 231 PB - Kluwer Academic Publishers CY - Oulu ER - TY - THES A1 - Kaufmann, Benjamin T1 - High performance answer set solving Y1 - 2015 ER - TY - CHAP A1 - Kiy, Alexander A1 - Geßner, Hendrik A1 - Lucke, Ulrike A1 - Grünewald, Franka T1 - A Hybrid and Modular Framework for Mobile Campus Applications T2 - i-com N2 - Mobile devices and associated applications (apps) are an indispensable part of daily life and provide access to important information anytime and anywhere. However, the availability of university-wide services in the mobile sector is still poor. If they exist they usually result from individual activities of students and teachers. Mobile applications can have an essential impact on the improvement of students’ self-organization as well as on the design and enhancement of specific learning scenarios, though. This article introduces a mobile campus app framework, which integrates central campus services and decentralized learning applications. An analysis of strengths and weaknesses of different approaches is presented to summarize and evaluate them in terms of requirements, development, maintenance and operation. The article discusses the underlying service-oriented architecture that allows transferring the campus app to other universities or institutions at reasonable cost. It concludes with a presentation of the results as well as ongoing discussions and future work KW - Mobile Campus Application KW - Hybrid App KW - Framework KW - Service-oriented Architecture Y1 - 2015 UR - http://www.degruyter.com/view/j/icom.2015.14.issue-1/icom-2015-0016/icom-2015-0016.xml U6 - https://doi.org/10.1515/icom-2015-0016 SN - 2196-6826 VL - 2015 IS - 14 SP - 63 EP - 73 PB - de Gruyter CY - Berlin ER -