@book{Kowark2010,
  author    = {Kowark, Thomas},
  title     = {Towards a service landscape for a real-time project manager dasboard},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{Kluth2010,
  author    = {Kluth, Stephan},
  title     = {Handling of closed networks in FMC-QE},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{Kiss2010,
  author    = {Kiss, G{\´a}bor},
  title     = {Analyse der Studienleistungen von Studierenden an der Universit{\"a}t {\´O}buda und deren Implikationen f{\"u}r die Informatikausbildung},
  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-64364},
  pages     = {71 -- 77},
  year      = {2010},
  abstract  = {In der letzten Jahren ist die Zahl der erfolgreichen Pr{\"u}fungen von Studierenden im Informatikkurs des ersten Studienjahres f{\"u}r verschiedene Studieng{\"a}nge an der Universit{\"a}t {\´O}buda stark gesunken. Dies betrifft Pr{\"u}fungen in den Teilgebieten Rechnerarchitektur, Betrieb von Peripherieger{\"a}ten, Bin{\"a}re Codierung und logische Operationen, Computerviren, Computernetze und das Internet, Steganographie und Kryptographie, Betriebsysteme. Mehr als der H{\"a}lfte der Studenten konnte die Pr{\"u}fungen der ersten Semester nicht erfolgreich absolvieren. Die hier vorgelegte Analyse der Studienleistungen zielt darauf ab, Gr{\"u}nde f{\"u}r diese Entwicklung zu identifizieren, die Zahl der Abbrecher zu reduzieren und die Leistungen der Studenten zu verbessern. Die Analyse zeigt, dass die Studenten die erforderlichen Lehrmaterialen erst ein bis zwei Tage vor oder sogar erst am Tag der Klausuren vom Server downloaden, so dass sie nicht mehr hinreichend Zeit zum Lernen haben. Diese Tendenz zeigt sich bei allen Teilgebieten des Studiengangs. Ein Mangel an kontinuierlicher Mitarbeit scheint einer der Gr{\"u}nde f{\"u}r ein fr{\"u}hes Scheitern zu sein. Ferner zeigt sich die Notwendigkeit, dass bei den Lehrangeboten in Informatik auf eine kontinuierliche Kommunikation mit den Studierenden und R{\"u}ckmeldung zu aktuellen Unterrichtsinhalten zu achten ist. Dies kann durch motivierende Maßnahmen zur Teilnahme an den {\"U}bungen oder durch kleine w{\"o}chentliche schriftliche Tests geschehen.},
  language  = {de}
}
@article{KehrerKelter2010,
  author    = {Kehrer, Timo and Kelter, Udo},
  title     = {Eine aufwandsbeschr{\"a}nkte Einf{\"u}hrung in die modellbasierte Softwareentwicklung},
  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-64304},
  pages     = {23 -- 33},
  year      = {2010},
  abstract  = {Zusammenfassung: Game-based Learning und Edutainment sind aktuelle Schlagworte im Bereich der Hochschulausbildung. Zun{\"a}chst verbindet man damit die Integration einer Spiel- und Spaßkultur in die herk{\"o}mmlichen Lehrveranstaltungen wie Vorlesungen, {\"U}bungen, Praktika und Seminare. Die nachfolgenden Ausf{\"u}hrungen gehen einer genaueren Begriffsanalyse nach und untersuchen, ob Game-based Learning und Edutainment tats{\"a}chlich neuartige Unterrichtsformen erfordern oder neue didaktische {\"U}berlegungen in bestehendes Unterrichtsgeschehen bringen - oder ob es nicht doch an einigen Stellen „alter Wein in neuen Schl{\"a}uchen" ist.},
  language  = {de}
}
@article{JahnkeHaertelMattiketal.2010,
  author    = {Jahnke, Isa and Haertel, Tobias and Mattik, Volker and Lettow, Karsten},
  title     = {Was ist eine kreative Leistung Studierender?},
  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-64386},
  pages     = {87 -- 92},
  year      = {2010},
  abstract  = {Was ist eine kreative Leistung von Studierenden? Dies ist die Ausgangsfrage, wenn Lehre kreativit{\"a}tsf{\"o}rderlicher als bislang gestaltet werden soll. In diesem Beitrag wird ein Modell zur F{\"o}rderung von Kreativit{\"a}t in der Hochschullehre vorgestellt und mit einem Beispiel verdeutlicht. Es wird die ver{\"a}nderte Konzeption der Vorlesung Informatik \& Gesellschaft illustriert: Studierende hatten die Aufgabe, eine „e-Infrastruktur f{\"u}r die Universit{\"a}t NeuDoBoDu" zu entwickeln. Hierzu werden die Ergebnisse der Evaluation und Erfahrungen erl{\"a}utert.},
  language  = {de}
}
@phdthesis{Ishebabi2010,
  author    = {Ishebabi, Harold},
  title     = {Architecture synthesis for adaptive multiprocessor systems on chip},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41316},
  school      = {Universit{\"a}t Potsdam},
  year      = {2010},
  abstract  = {This thesis presents methods for automated synthesis of flexible chip multiprocessor systems from parallel programs targeted at FPGAs to exploit both task-level parallelism and architecture customization. Automated synthesis is necessitated by the complexity of the design space. A detailed description of the design space is provided in order to determine which parameters should be modeled to facilitate automated synthesis by optimizing a cost function, the emphasis being placed on inclusive modeling of parameters from application, architectural and physical subspaces, as well as their joint coverage in order to avoid pre-constraining the design space. Given a parallel program and a set of an IP library, the automated synthesis problem is to simultaneously (i) select processors (ii) map and schedule tasks to them, and (iii) select one or several networks for inter-task communications such that design constraints and optimization objectives are met. The research objective in this thesis is to find a suitable model for automated synthesis, and to evaluate methods of using the model for architectural optimizations. Our contributions are a holistic approach for the design of such systems, corresponding models to facilitate automated synthesis, evaluation of optimization methods using state of the art integer linear and answer set programming, as well as the development of synthesis heuristics to solve runtime challenges.},
  language  = {en}
}
@phdthesis{Hilscher2010,
  author    = {Hilscher, Martin},
  title     = {Testdatenkompaktion durch beschleunigte Schieberegister mit vielen X-Werten},
  address   = {Potsdam},
  pages     = {112, 5 S.},
  year      = {2010},
  language  = {de}
}
@article{Hildebrandt2010,
  author    = {Hildebrandt, Dieter},
  title     = {Towards service-oriented, standards-based, image-based provisioning, interaction with and styling of geovirtual 3D environments},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{HermenegildoSchaub2010,
  author    = {Hermenegildo, Manuel and Schaub, Torsten},
  title     = {Introduction to the technical communications of the 26th International Conference on Logic Programming : special issue},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068410000153},
  year      = {2010},
  language  = {en}
}
@book{Hentschel2010,
  author    = {Hentschel, Uwe M.Sc.},
  title     = {Services for real -time computing},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{Hagedorn2010,
  author    = {Hagedorn, Benjamin},
  title     = {Service-Based, interactive portrayal of 3D geovirtual environments},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@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}
}
@book{Grell2010,
  author    = {Grell, Petra},
  title     = {Einf{\"u}hrung zur Tagung 2009 : eLearning interaktiv, kooperativ und studierendenzentriert nutzen : eLeaning UP 2009 : Sonderveranstaltung 2009-11-25},
  publisher = {Univ.-Bibl.},
  address   = {Potsdam},
  year      = {2010},
  language  = {de}
}
@inproceedings{GeskeWolf2010,
  author    = {Geske, Ulrich and Wolf, Armin},
  title     = {Preface},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41401},
  year      = {2010},
  abstract  = {The workshops on (constraint) logic programming (WLP) are the annual meeting of the Society of Logic Programming (GLP e.V.) and bring together researchers interested in logic programming, constraint programming, and related areas like databases, artificial intelligence and operations research. In this decade, previous workshops took place in Dresden (2008), W{\"u}rzburg (2007), Vienna (2006), Ulm (2005), Potsdam (2004), Dresden (2002), Kiel (2001), and W{\"u}rzburg (2000). Contributions to workshops deal with all theoretical, experimental, and application aspects of constraint programming (CP) and logic programming (LP), including foundations of constraint/ logic programming. Some of the special topics are constraint solving and optimization, extensions of functional logic programming, deductive databases, data mining, nonmonotonic reasoning, , interaction of CP/LP with other formalisms like agents, XML, JAVA, program analysis, program transformation, program verification, meta programming, parallelism and concurrency, answer set programming, implementation and software techniques (e.g., types, modularity, design patterns), applications (e.g., in production, environment, education, internet), constraint/logic programming for semantic web systems and applications, reasoning on the semantic web, data modelling for the web, semistructured data, and web query languages.},
  language  = {en}
}
@inproceedings{GeskeGoltz2010,
  author    = {Geske, Ulrich and Goltz, Hans-Joachim},
  title     = {Efficiency of difference-list programming},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41563},
  year      = {2010},
  abstract  = {The difference-list technique is described in literature as effective method for extending lists to the right without using calls of append/3. There exist some proposals for automatic transformation of list programs into differencelist programs. However, we are interested in construction of difference-list programs by the programmer, avoiding the need of a transformation step. In [GG09] it was demonstrated, how left-recursive procedures with a dangling call of append/3 can be transformed into right-recursion using the unfolding technique. For simplification of writing difference-list programs using a new cons/2 procedure was introduced. In the present paper, we investigate how efficieny is influenced using cons/2. We measure the efficiency of procedures using accumulator technique, cons/2, DCG's, and difference lists and compute the resulting speedup in respect to the simple procedure definition using append/3. Four Prolog systems were investigated and we found different behaviour concerning the speedup by difference lists. A result of our investigations is, that an often advice given in the literature for avoiding calls append/3 could not be confirmed in this strong formulation.},
  language  = {en}
}
@inproceedings{GebserHinrichsSchaubetal.2010,
  author    = {Gebser, Martin and Hinrichs, Henrik and Schaub, Torsten and Thiele, Sven},
  title     = {xpanda: a (simple) preprocessor for adding multi-valued propositions to ASP},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41466},
  year      = {2010},
  abstract  = {We introduce a simple approach extending the input language of Answer Set Programming (ASP) systems by multi-valued propositions. Our approach is implemented as a (prototypical) preprocessor translating logic programs with multi-valued propositions into logic programs with Boolean propositions only. Our translation is modular and heavily benefits from the expressive input language of ASP. The resulting approach, along with its implementation, allows for solving interesting constraint satisfaction problems in ASP, showing a good performance.},
  language  = {en}
}
@article{FrenkelWeicker2010,
  author    = {Frenkel, Marcus and Weicker, Karsten},
  title     = {Pseudo},
  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-64328},
  pages     = {47 -- 52},
  year      = {2010},
  abstract  = {Pseudo ist eine auf Pseudocode basierende Programmiersprache, welche in der akademischen Lehre zum Einsatz kommen und hier die Vermittlung und Untersuchung von Algorithmen und Datenstrukturen unterst{\"u}tzen soll. Dieser Beitrag geht auf die Besonderheiten der Sprache sowie m{\"o}gliche didaktische Szenarien ein.},
  language  = {de}
}
@book{Feinbube2010,
  author    = {Feinbube, Frank},
  title     = {On Programming models for multi-core computers},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{DuennebierDiethelm2010,
  author    = {D{\"u}nnebier, Malte and Diethelm, Ira},
  title     = {Ein virtueller Lernraum f{\"u}r die Informatiklehrerweiterbildung},
  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-64359},
  pages     = {65 -- 70},
  year      = {2010},
  abstract  = {Bei der Suche nach M{\"o}glichkeiten, die Weiterbildung f{\"u}r Informatiklehrkr{\"a}fte auszubauen, bietet sich der Einsatz virtueller Lernr{\"a}ume an. Dieses Papier berichtet {\"u}ber ein Projekt, in dem ein exemplarischer virtueller Lernraum f{\"u}r kollaboratives Lernen in der Lehrerweiterbildung in Informatik theoriegeleitet erstellt, erprobt und bewertet wurde. Die erzielten Ergebnisse {\"u}ber das Nutzungsverhalten k{\"o}nnen f{\"u}r weitere E-Learningprojekte in der Lehrerbildung hilfreich sein. Der Schwerpunkt dieses Papiers liegt auf der Gestaltung des Lernraums unter Beachtung der speziellen Situation der Informatiklehrkr{\"a}fte, nicht auf der didaktischen Aufbereitung der betreffenden Lerneinheit.},
  language  = {de}
}
@article{CsuhajVarjuDassowVaszil2010,
  author    = {Csuhaj-Varj{\´u}, Erzs{\´e}bet and Dassow, Juergen and Vaszil, Gy{\"o}rgy},
  title     = {Variants of competence-based derivations in CD grammar systems},
  issn      = {0129-0541},
  doi       = {10.1142/S0129054110007428},
  year      = {2010},
  abstract  = {In this paper we introduce and study some new cooperation protocols for cooperating distributed (CD) grammar systems. These derivation modes depend on the number of different nonterminals present in the sentential form obtained when a component finished a derivation phase. This measure describes the competence of the grammar on the string (the competence is high if the number of the different nonterminals is small). It is also a measure of the efficiency of the grammar on the given string (a component is more efficient than another one if it is able to decrease the number of nonterminals in the string to a greater extent). We prove that if the underlying derivation mode is the t-mode derivation, then some variants of these systems determine the class of random context ET0L languages. If these CD grammar systems use the k step limited derivations as underlying derivation mode, then they are able to generate any recursively enumerable language.},
  language  = {en}
}