Univ., Diplomarbeit, 2004--Frankfurt (Main)

Univ., Diplomarbeit, 2006--Frankfurt (Main)

Das in der Lehre eingesetzte E-Learning-System Autotool zeichnet sich durch die Möglichkeit der automatischen Bewertung von Einsendungen aus. Es kann zu eingesendeten Lösungsversuchen Aussagen über deren Korrektheit treffen und damit dem Nutzer Hinweise bei der Lösungssuche geben. Die Architektur des Autotools richtet sich jedoch nicht nach den zugrundeliegenden Technologien des Web. In der Webprogrammierung ist eine auf REST basierende Architektur empfehlenswert, denn REST ist ein Architekturstil für verteilte Hypermediasysteme, der den Entwurf des HTTP geleitet hat. HTTP ist das Protokoll, das der Kommunikation im Web zugrunde liegt. Durch die URI, der Adresse einer Ressource, werden dabei die Zustände für den Nutzer transparent. Versteckte Zustände werden vermieden. Das erhöht die Benutzerfreundlichkeit und verbessert die Struktur der Webseite. Die bisherige Weboberfläche des Autotool bietet diese Transparenz nicht. Durch den Einsatz von Yesod, einem Framework für Webanwendungsentwicklung, wird dies verbessert. Ein optionaler Bestandteil von Yesod ist Persistent, eine typsichere Datenbankschnittstelle. Persistent soll die bisherige Datenbankanbindung ablösen. Bei der bisherigen Implementierung fallen Datenbankmismatches erst bei der Benutzung durch fehlerhaftes Verhalten der Anwendung auf. Durch die Verwendung von Persistent werden solche Fehler schon zur Compilezeit festgestellt.:1 Einleitung 2 Autotool 2.1 Struktur und Benutzung 2.2 Lösen einer Aufgabe 2.3 Aufbau 3 Anforderungsanalyse 3.1 HTTP-Standard 3.2 Anwendungsfälle 3.2.1 Administrator 3.2.2 Direktor 3.2.3 Tutor 3.2.4 Student 3.2.5 Webseitenbesucher 3.3 Erfolgskriterien 4 Moderne Webprogrammierung 4.1 Representational State Transfer (REST) 4.1.1 Hypertext Transfer Protocol (HTTP) 4.1.2 Ressource-Oriented Architecture (ROA) 4.2 Yesod 4.2.1 Routing 4.2.2 Shakespearean Templates 4.2.3 Persistent 4.2.4 Internationalisierung 4.2.5 Scaffolding 4.3 Haskell 5 Austausch des Webframeworks 5.1 Erstellen der Routen 5.2 Austausch des Webfrontends 5.3 Austausch der Persistenz 5.4 Installation des Autotools 6 Ergebnisse 6.1 REST-Orientierung 6.2 Migration der Datenbank 6.3 Testen der Anwendungsfälle 6.4 Belastungstests 6.5 Weitere Ergebnisse 7 Ausblick

The template system of C++ is expressive enough to allow the programmer to write programs which are evaluated during compile time. This can be exploited for example in generic programming. However, these programs are very often hard to write, read and maintain. We introduce a simple translation from lambda calculus into C++ templates and show how it can be used to simplify C++ metaprograms. This variation of lambda calculus is then extended with Hindley-Milner type system and various other features (Haskell-like syntax, user-defined data types, tools for interaction with existing C++ template code and so on). We then build a compiler capable of transforming programs written in this language into C++ template metaprograms. Powered by TCPDF (www.tcpdf.org)

A constraint is a formula in first-order logic expressing a relation between values of various domains. In order to solve a constraint, constructing a propositional encoding is a successfully applied technique that benefits from substantial progress made in the development of modern SAT solvers. However, propositional encodings are generally created by developing a problem-specific generator program or by crafting them manually, which often is a time-consuming and error-prone process especially for constraints over complex domains. Therefore, the present thesis introduces the constraint solver CO4 that automatically generates propositional encodings for constraints over structured finite domains written in a syntactical subset of the functional programming language Haskell. This subset of Haskell enables the specification of expressive and concise constraints by supporting user-defined algebraic data types, pattern matching, and polymorphic types, as well as higher-order and recursive functions. The constraint solver CO4 transforms a constraint written in this high-level language into a propositional formula. After an external SAT solver determined a satisfying assignment for the variables in the generated formula, a solution in the domain of discourse is derived. This approach is even applicable for finite restrictions of recursively defined algebraic data types. The present thesis describes all aspects of CO4 in detail: the language used for specifying constraints, the solving process and its correctness, as well as exemplary applications of CO4.

A constraint is a formula in first-order logic expressing a relation between values of various domains. In order to solve a constraint, constructing a propositional encoding is a successfully applied technique that benefits from substantial progress made in the development of modern SAT solvers. However, propositional encodings are generally created by developing a problem-specific generator program or by crafting them manually, which often is a time-consuming and error-prone process especially for constraints over complex domains. Therefore, the present thesis introduces the constraint solver CO4 that automatically generates propositional encodings for constraints over structured finite domains written in a syntactical subset of the functional programming language Haskell. This subset of Haskell enables the specification of expressive and concise constraints by supporting user-defined algebraic data types, pattern matching, and polymorphic types, as well as higher-order and recursive functions. The constraint solver CO4 transforms a constraint written in this high-level language into a propositional formula. After an external SAT solver determined a satisfying assignment for the variables in the generated formula, a solution in the domain of discourse is derived. This approach is even applicable for finite restrictions of recursively defined algebraic data types. The present thesis describes all aspects of CO4 in detail: the language used for specifying constraints, the solving process and its correctness, as well as exemplary applications of CO4.

Thesis (D. Min.)--Southwestern Baptist Theological Seminary, 1999. / Includes bibliographical references (leaves 361-380).

The problem has consisted, first, of a mapping of the soil types present in Haskell County; second, a collection of the existing vegetation of each soil type; third, an identification of the vegetation collected and observed; fourth, and lastly, a comparative study of the vegetation of each soil type in an effort to establish a correlation between the vegetation and the soil type.

Call number: LD2668 .T4 1961 L38 / Master of Science

This thesis concerns combinatorial games and algorithms that can be used to play them.Basic definitions and results about combinatorial games are covered, and an implementation of the minimax algorithm with alpha-beta pruning is presented.Following this, we give a description and implementation of the common UCT (Upper Confidence bounds applied to Trees) variant of MCTS (Monte-Carlo tree search).Then, a framework for testing the behavior of UCT as first player, at various numbers of iterations (namely 2,7, ... 27), versus minimax as second player, is described.Finally, we present the results obtained by applying this framework to the 2.2 million smallest non-trivial positional games having winning sets of size either 2 or 3.It is seen that on almost all different classifications of the games studied, UCT converges quickly to near-perfect play. / Denna rapport handlar om kombinatoriska spel och algoritmer som kan användas för att spela dessa.Grundläggande definitioner och resultat som berör kombinatoriska spel täcks, och en implementation av minimax-algoritmen med alpha-beta beskärning ges.Detta följs av en beskrivning samt en implementation av UCT varianten av MCTS (Monte-Carlo tree search).Sedan beskrivs ett ramverk för att testa beteendet för UCT som första spelare, vid olika antal iterationer (nämligen 2, 7, ... 27), mot minimax som andra spelare.Till sist beskrivs resultaten vi funnit genom att använda detta ramverk för att spela de 2,2 miljoner minsta icke triviala positionella spelen med vinstmängder av storlek antingen 2 eller 3.Vi finner att, för nästan alla olika klassificeringar av spel vi studerar, så konvergerar UCT snabbt mot nära perfekt spel.