@incollection{KnothKiyKlein2015,
  author    = {Knoth, Alexander Henning and Kiy, Alexander and Klein, M.},
  title     = {Mobil in und aus Situationen lernen: Erste Erfahrungen zum Studieneinstieg von Studierenden verschiedener Fachrichtungen},
  series = {Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft f{\"u}r Informatik},
  booktitle = {Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft f{\"u}r Informatik},
  number    = {247},
  publisher = {Gesellschaft fur Informatik e.V.},
  address   = {Bonn},
  isbn      = {978-3-88579-641-1},
  issn      = {1617-5468},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {81 -- 93},
  year      = {2015},
  language  = {de}
}
@phdthesis{Wust2015,
  author    = {Wust, Johannes},
  title     = {Mixed workload managment for in-memory databases},
  pages     = {VIII, 167},
  year      = {2015},
  language  = {en}
}
@phdthesis{Jung2015,
  author    = {Jung, J{\"o}rg},
  title     = {Efficient credit based server load balancing},
  school      = {Universit{\"a}t Potsdam},
  pages     = {353},
  year      = {2015},
  language  = {en}
}
@article{LiangLiuLiuetal.2015,
  author    = {Liang, Feng and Liu, Yunzhen and Liu, Hai and Ma, Shilong and Schnor, Bettina},
  title     = {A Parallel Job Execution Time Estimation Approach Based on User Submission Patterns within Computational Grids},
  series = {International journal of parallel programming},
  volume    = {43},
  journal   = {International journal of parallel programming},
  number    = {3},
  publisher = {Springer},
  address   = {New York},
  issn      = {0885-7458},
  doi       = {10.1007/s10766-013-0294-1},
  pages     = {440 -- 454},
  year      = {2015},
  abstract  = {Scheduling performance in computational grid can potentially benefit a lot from accurate execution time estimation for parallel jobs. Most existing approaches for the parallel job execution time estimation, however, require ample past job traces and the explicit correlations between the job execution time and the outer layout parameters such as the consumed processor numbers, the user-estimated execution time and the job ID, which are hard to obtain or reveal. This paper presents and evaluates a novel execution time estimation approach for parallel jobs, the user-behavior clustering for execution time estimation, which can give more accurate execution time estimation for parallel jobs through exploring the job similarity and revealing the user submission patterns. Experiment results show that compared to the state-of-art algorithms, our approach can improve the accuracy of the job execution time estimation up to 5.6 \%, meanwhile the time that our approach spends on calculation can be reduced up to 3.8 \%.},
  language  = {en}
}
@article{JungKiertscherMenskietal.2015,
  author    = {Jung, J{\"o}rg and Kiertscher, Simon and Menski, Sebastian and Schnor, Bettina},
  title     = {Self-Adapting Load Balancing for DNS},
  series = {Journal of networks},
  volume    = {10},
  journal   = {Journal of networks},
  number    = {4},
  publisher = {Kluwer Academic Publishers},
  address   = {Oulu},
  doi       = {10.1109/SPECTS.2014.6879994},
  pages     = {222 -- 231},
  year      = {2015},
  abstract  = {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)).},
  language  = {en}
}
@article{PabloAlarconArroyoBordihnetal.2015,
  author    = {Pablo Alarcon, Pedro and Arroyo, Fernando and Bordihn, Henning and Mitrana, Victor and Mueller, Mike},
  title     = {Ambiguity of the multiple interpretations on regular languages},
  series = {Fundamenta informaticae},
  volume    = {138},
  journal   = {Fundamenta informaticae},
  number    = {1-2},
  publisher = {IOS Press},
  address   = {Amsterdam},
  issn      = {0169-2968},
  doi       = {10.3233/FI-2015-1200},
  pages     = {85 -- 95},
  year      = {2015},
  abstract  = {A multiple interpretation scheme is an ordered sequence of morphisms. The ordered multiple interpretation of a word is obtained by concatenating the images of that word in the given order of morphisms. The arbitrary multiple interpretation of a word is the semigroup generated by the images of that word. These interpretations are naturally extended to languages. Four types of ambiguity of multiple interpretation schemata on a language are defined: o-ambiguity, internal ambiguity, weakly external ambiguity and strongly external ambiguity. We investigate the problem of deciding whether a multiple interpretation scheme is ambiguous on regular languages.},
  language  = {en}
}
@article{ChildsGrimbsSelbig2015,
  author    = {Childs, Dorothee and Grimbs, Sergio and Selbig, Joachim},
  title     = {Refined elasticity sampling for Monte Carlo-based identification of stabilizing network patterns},
  series = {Bioinformatics},
  volume    = {31},
  journal   = {Bioinformatics},
  number    = {12},
  publisher = {Oxford Univ. Press},
  address   = {Oxford},
  issn      = {1367-4803},
  doi       = {10.1093/bioinformatics/btv243},
  pages     = {214 -- 220},
  year      = {2015},
  abstract  = {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.},
  language  = {en}
}
@article{LemckeHaedgeZenderetal.2015,
  author    = {Lemcke, Stefanie and Haedge, Kora and Zender, Raphael and Lucke, Ulrike},
  title     = {RouteMe: a multilevel pervasive game on mobile ad hoc routing},
  series = {Personal and ubiquitous computing},
  volume    = {19},
  journal   = {Personal and ubiquitous computing},
  number    = {3-4},
  publisher = {Springer},
  address   = {London},
  issn      = {1617-4909},
  doi       = {10.1007/s00779-015-0843-2},
  pages     = {537 -- 549},
  year      = {2015},
  abstract  = {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.},
  language  = {en}
}
@article{VidelaGuziolowskiEduatietal.2015,
  author    = {Videla, Santiago and Guziolowski, Carito and Eduati, Federica and Thiele, Sven and Gebser, Martin and Nicolas, Jacques and Saez-Rodriguez, Julio and Schaub, Torsten H. and Siegel, Anne},
  title     = {Learning Boolean logic models of signaling networks with ASP},
  series = {Theoretical computer science},
  volume    = {599},
  journal   = {Theoretical computer science},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0304-3975},
  doi       = {10.1016/j.tcs.2014.06.022},
  pages     = {79 -- 101},
  year      = {2015},
  abstract  = {Boolean networks provide a simple yet powerful qualitative modeling approach in systems biology. However, manual identification of logic rules underlying the system being studied is in most cases out of reach. Therefore, automated inference of Boolean logical networks from experimental data is a fundamental question in this field. This paper addresses the problem consisting of learning from a prior knowledge network describing causal interactions and phosphorylation activities at a pseudo-steady state, Boolean logic models of immediate-early response in signaling transduction networks. The underlying optimization problem has been so far addressed through mathematical programming approaches and the use of dedicated genetic algorithms. In a recent work we have shown severe limitations of stochastic approaches in this domain and proposed to use Answer Set Programming (ASP), considering a simpler problem setting. Herein, we extend our previous work in order to consider more realistic biological conditions including numerical datasets, the presence of feedback-loops in the prior knowledge network and the necessity of multi-objective optimization. In order to cope with such extensions, we propose several discretization schemes and elaborate upon our previous ASP encoding. Towards real-world biological data, we evaluate the performance of our approach over in silico numerical datasets based on a real and large-scale prior knowledge network. The correctness of our encoding and discretization schemes are dealt with in Appendices A-B. (C) 2014 Elsevier B.V. All rights reserved.},
  language  = {en}
}
@phdthesis{Heinze2015,
  author    = {Heinze, Theodor},
  title     = {Analyse von Patientendaten und Entscheidungsunterst{\"u}tzung in der Telemedizin},
  school      = {Universit{\"a}t Potsdam},
  pages     = {173},
  year      = {2015},
  language  = {de}
}