Institut für Informatik und Computational Science
Refine
Year of publication
- 2015 (30) (remove)
Document Type
- Article (18)
- Doctoral Thesis (6)
- Part of a Book (2)
- Conference Proceeding (2)
- Monograph/Edited Volume (1)
- Master's Thesis (1)
Is part of the Bibliography
- yes (30) (remove)
Keywords
- Answer set programming (2)
- AODV (1)
- Ad hoc routing (1)
- Assessment (1)
- Backdoors (1)
- Bildung (1)
- Boolean logic models (1)
- Cluster Computing (1)
- Combinatorial multi-objective optimization (1)
- Computational complexity (1)
- Computational grid (1)
- Computer Science Education (1)
- Defining characteristics of physical computing (1)
- E-learning (1)
- Educational game (1)
- FOSS (1)
- Framework (1)
- Hybrid App (1)
- ICT (1)
- Informatics (1)
- Informatik (1)
- Informatikdidaktik (1)
- Interface design (1)
- Kernelization (1)
- Key Competencies (1)
- Load Balancing (1)
- Location awareness (1)
- Mobile Campus Application (1)
- Mobile application (1)
- Multiple interpretation scheme (1)
- NUI (1)
- Navigation (1)
- Parallel job execution time estimation (1)
- Parameterized complexity (1)
- Performance Evaluation (1)
- Pervasive computing (1)
- RSA triangle (1)
- Schlüsselkompetenzen (1)
- Service-oriented Architecture (1)
- Signaling transduction networks (1)
- Systems biology (1)
- User submission pattern (1)
- algorithm schedules (1)
- answer set programming (1)
- collaborative learning (1)
- computational thinking (1)
- conductive argument (1)
- digitally-enabled pedagogies (1)
- eLectures (1)
- education (1)
- educational systems (1)
- external ambiguity (1)
- formal argumentation systems (1)
- freie Daten (1)
- freie Software (1)
- informal and formal learning (1)
- informal logic (1)
- internal ambiguity (1)
- key competences in physical computing (1)
- mobile learning (1)
- mobile technologies and apps (1)
- navigation (1)
- o-ambiguity (1)
- organisational evolution (1)
- paper prototyping (1)
- physical computing tools (1)
- portfolio-based solving (1)
- premise acceptability (1)
- real arguments (1)
- regular language (1)
- relevance (1)
- sufficiency (1)
- tele-teaching (1)
- video annotation (1)
Institute
In diesem Papier wird das Konzept eines Lernzentrums für die Informatik (LZI) an der Universität Paderborn vorgestellt. Ausgehend von den fachspezifischen Schwierigkeiten der Informatik Studierenden werden die Angebote des LZIs erläutert, die sich über die vier Bereiche Individuelle Beratung und Betreuung, „Offener Lernraum“, Workshops und Lehrveranstaltungen sowie Forschung erstrecken. Eine erste Evaluation mittels Feedbackbögen zeigt, dass das Angebot bei den Studierenden positiv aufgenommen wird. Zukünftig soll das Angebot des LZIs weiter ausgebaut und verbessert werden. Ausgangsbasis dazu sind weitere Studien.
The in-memory revolution
(2015)
This book describes the next generation of business applications enabled by SAP's in-memory database, SAP HANA. In particular, the authors show the substantial changes introduced in S4/HANA by switching to SAP HANA. Using numerous examples and use cases from the authors' wealth of real-world experience, it illustrates the quantum leap in performance made possible by the new technology. The book is written by two of the most prominent actors in the area of business application systems: Hasso Plattner, co-founder of SAP and inaugurator of the Hasso Plattner Institute at the University of Potsdam, and Bernd Leukert, member of the Executive Board and the Global Managing Board of SAP. This clearly structured, highly illustrated book takes an exciting new technology and presents the practicality and success of first mover applications.
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)).
Time-series data from multicomponent systems capture the dynamics of the ongoing processes and reflect the interactions between the components. The progression of processes in such systems usually involves check-points and events at which the relationships between the components are altered in response to stimuli. Detecting these events together with the implicated components can help understand the temporal aspects of complex biological systems. Here we propose a regularized regression-based approach for identifying breakpoints and corresponding segments from multivariate time-series data. In combination with techniques from clustering, the approach also allows estimating the significance of the determined breakpoints as well as the key components implicated in the emergence of the breakpoints. Comparative analysis with the existing alternatives demonstrates the power of the approach to identify biologically meaningful breakpoints in diverse time-resolved transcriptomics data sets from the yeast Saccharomyces cerevisiae and the diatom Thalassiosira pseudonana.
Pervasive educational games have the potential to transfer learning content to real-life experiences beyond lecture rooms, through realizing field trips in an augmented or virtual manner. This article introduces the pervasive educational game "RouteMe" that brings the rather abstract topic of routing in ad hoc networks to real-world environments. The game is designed for university-level courses and supports these courses in a motivating manner to deepen the learning experience. Students slip into the role of either routing nodes or applications with routing demands. On three consecutive levels of difficulty, they get introduced with the game concept, learn the basic routing mechanisms and become aware of the general limitations and functionality of routing nodes. This paper presents the pedagogical and technical game concept as well as findings from an evaluation in a university setting.
Refined elasticity sampling for Monte Carlo-based identification of stabilizing network patterns
(2015)
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.