Search
Now showing items 1-10 of 24
Technischer Report
20. Theorietag der GI-Fachgruppe "Automaten und Formale Sprachen"
(2010-11-05)
Die Fachgruppe AFS (früher Fachgruppe 0.1.5) der Gesellschaft für Informatik
veranstaltet seit 1991 einmal im Jahr ein Treffen der Fachgruppe im Rahmen eines Theorietags, der traditionell eineinhalb Tage dauert. Seit dem Jahr 1996 wird dem eigentlichen Theorietag noch ein eintägiger Workshop zu speziellen Themen der theoretischen Informatik vorangestellt.
In diesem Jahr wurde der Theorietag vom Fachgebiet "Theoretische Informatik"
des Fachbereichs Elektrotechnik/Informatik der Universität Kassel organisiert. Er ...
Technischer Report
Small World Folksonomies: Clustering in Tri-Partite Hypergraphs
(2006-12-04)
Many recent Web 2.0 resource sharing applications can be subsumed under the "folksonomy" moniker. Regardless of the type of resource shared, all of these share a common structure describing the assignment of tags to resources by users.
In this report, we generalize the notions of clustering and characteristic path length which play a major role in the current research on networks, where they are used to describe the small-world effects on many observable network datasets. To that end, we show that the notion of ...
Technischer Report
Automatische Dienstvermittlung in dienstorientierten Architekturen
(2007-07-02)
Die Technologie dienstorientierter Architekturen (Service-oriented Architectures, kurz SOA) weckt große Visionen auf Seiten der Industrie wie auch der Forschung. Sie hat sich als derzeit
ideale Lösung für Umgebungen, in denen sich die Anforderungen an die IT-Bedürfnisse rapide ändern, erwiesen. Heutige IT-Systeme müssen Managementaufgaben wie Softwareinstallation, -anpassung oder -austausch erlauben, ohne dabei den laufenden Betrieb wesentlich zu stören. Die dafür nötige Flexibilität bieten dienstorientierte ...
Technischer Report
The Degree of Word-Expansion of Lexicalized RRWW-Automata
(2007-11-26)
Restarting automata can be seen as analytical variants of classical automata as well as of regulated rewriting systems. We study a measure for the degree of nondeterminism of (context-free) languages in terms of deterministic restarting automata that are (strongly) lexicalized. This measure is based on the number of auxiliary symbols (categories) used for recognizing a language as the projection of its characteristic language onto its input alphabet. This type of recognition is typical for analysis by reduction, a ...
Technischer Report
Observations on the Publicity and Usage of Parallel Programming Systems and Languages: A Survey Approach
(2007-05-08)
In this publication, we report on an online survey that was carried out among parallel programmers. More than 250 people worldwide have submitted answers to our questions, and their responses are analyzed here. Although not statistically sound, the data we provide give useful insights about which parallel programming systems and languages are known and in actual use. For instance, the collected data indicate that for our survey group MPI and (to a lesser extent) C are the most widely used parallel programming system ...
Technischer Report
Lower Bounds for Nonforgetting Restarting Automata and CD-Systems of Restarting Automata
(2008-10-06)
The nonforgetting restarting automaton is a generalization of the restarting automaton
that, when executing a restart operation, changes its internal state based on the
current state and the actual contents of its read/write window instead of resetting it to the initial state. Another generalization of the restarting automaton is the cooperating distributed system (CD-system) of restarting automata. Here a finite system of restarting automata works together in analyzing a given sentence, where they interact based ...
Technischer Report
On Alternating Non-Context-Free Grammars
(2007-11-07)
We study several extensions of the notion of alternation from context-free grammars to context-sensitive and arbitrary phrase-structure grammars. Thereby new grammatical characterizations are obtained for the class of languages that are accepted by alternating pushdown automata.
Technischer Report
Evaluating the state of the art of parallel programming systems
(Universität Kassel, FB 16, Elektrotechnik/Informatik, 2005-12-20)
This paper describes our plans to evaluate the present state of affairs concerning parallel programming and its systems. Three subprojects are proposed: a survey among programmers and scientists, a comparison of parallel programming systems using a standard set of test programs, and a wiki resource for the parallel programming community - the Parawiki. We would like to invite you to participate and turn these subprojects into true community efforts.
Technischer Report
1st Kassel Student Workshop on Security in Distributed Systems
(2008-04-14)
With this document, we provide a compilation of in-depth discussions on some of the most current security issues in distributed systems. The six contributions have been collected and presented at the 1st Kassel Student Workshop on Security in Distributed Systems (KaSWoSDS’08). We are pleased to present a collection of papers not only shedding light on the theoretical aspects of their topics, but also being accompanied with elaborate practical examples. In Chapter 1, Stephan Opfer discusses Viruses, one of the oldest ...
Technischer Report
Automatische Dienstvermittlung in dienstorientierten Architekturen in Aktion (ADDOaction)
(2010-04-27)
In diesem Bericht werden die Ergebnisse und Fortschritte des Forschungsprojekts ADDOaction vorgestellt.
Durch die Entwicklung in den letzten Jahrzehnten wurde das Internet zu einer wichtigen Infrastruktur für Geschäftsprozesse. Beliebige Anwendungen können als Dienste angeboten und übers Internet den Kunden online zur Verfügung gestellt werden. Eine flexible Dienstarchitektur ist dabei durch einen gewissen Grad an Dynamik gekennzeichnet, wo Dienste angepasst, ausgetauscht oder entfernt werden können und eventuell ...