|
|
Notový editor
Kopenec, Lukáš ; Bednárek, David (advisor) ; Obdržálek, David (referee)
The goal of this work was to design and implement a WYSIWYG musical notation editor that would solve some of the problems that the musicians encounter in their practice and would try to eliminate several imperfections of existing products. The principal motivation is the author's experience from the musical schools. The teachers own large amounts of printed scores that they need to distribute to their students and to the accompanying musicians which is very costly (paper, toner) and leads to disorganization of the ownership, number and placement of the scores. This work tries to provide the schools with a cheap platform for distribution and organization of their notation materials. A secondary motivation is the fact that the conception of existing notation editors has remained unchanged during the last two decades and offers only a limited control of the overall content of the musical projects. The proposed editor allows the user to create richer and more complex scores (e.g. songbooks or musical schoolbooks). It also provides the possibility to insert additional content (such as mp3 recordings or accompanying texts) directly into the created project.
|
|
|
C library for symbolic manipulation
Gurský, Štefan ; Holan, Tomáš (advisor) ; Bednárek, David (referee)
There are many programs doing symbolic manipulation with mathematical expressions. They are called Computer Algebra Systems and most of them contain some programming language. In this bachelor thesis a library for C programming language was created that allows using C as a language for symbolic manipulation. With provided functions user can store mathematical expressions in C variables and work with them in an easy and convenient way. It is possible to build expressions containing standard mathematical operations and functions, reduce them, expand them, find derivatives and Taylor polynomials. The library (called SymCe) is easy to understand not only for user, but also for a programmer that wishes to see its inner working and possibly extend it. Simplicity is the main feature that distinguishes SymCe from other similar pieces of software.
|
|
|
Information system for educational agencies
Marván, Tomáš ; Bednárek, David (advisor) ; Zavoral, Filip (referee)
The goal of this work is to implement an internet and intranet information system for registering lectors and students in an educational agency, together with their abilities, requirements, time possibilities etc. The system allows all the administrator, lectors and students to enter data. The entered data are liable to validation by the administrator. The system is able to partly automate administrator's tasks within pairing of lectors and students according to the entered information.
|
|
|
Design and analysis of personal agency database system development
Zásměta, Jakub ; Štanclová, Jana (advisor) ; Bednárek, David (referee)
The objective of this thesis is design and analysis of database system development for personal agency, which provides brigade services for students. The system offers native support of common processes and employees within the agency. Moreover, the system includes integration into the web portal. The system is designed for being used by brigade applicants and companies offering jobs. The design of the system covers also the data interface to different information system and the user authentication based on the directory LDAP server technologies.
|
|
|
Collecting XML data and meta-data from the Internet
Sochna, Jan ; Bednárek, David (advisor) ; Žemlička, Michal (referee)
The Diploma Thesis is targeted to design and implement the system for collecting XML-family data from the Internet. The aim of the task is to automate the data collection process and download full structures of XML documents. A comparison of four existing data collection systems took place at the beginning to choose one of the systems as a base of the solution. The open source web crawler Apache Nutch was identified as the most suitable. Then necessary extensions and modifications of the crawler were designed and implemented in order to make the crawler efficient in downloading XML-family documents. Downloaded XML-family data were analyzed and evaluated using the Analyzer application, which was enhanced within this Diploma Thesis in order to process the data. The main outcome of Diploma Thesis is an exploitable system collecting the XML-family documents from the Internet. Implemented modification and extensions of the system lead to elimination of "useless" documents download, improving the ratio targeted XML-family documents.
|
|
|
Tools for experiments with grammar and languages
Krejsa, Jiří ; Bednárek, David (advisor) ; Král, Jaroslav (referee)
The main goal of the thesis is the design and implementation environment that provides tools for working with grammars and languages. The environment is implemented by the library to which the user is working through the API. The library enables manipulation with languages represented as grammars or automata, transfer language between its various representations and to test whether the grammar is regular, linear or LR(k). The library found counterexamples in case that condition is violated. The thesis also highlights the future library expansion. Part of this work is a sample implementation of library usage. The library and samples are written in C++.
|
|
|
Run-time syntax extensions
Šašek, Pavel ; Žemlička, Michal (advisor) ; Bednárek, David (referee)
Extensible languages are more and more popular now and bring many advantages. Such languages contain a relatively small base which a programmer can learn easily and are better adjustable for a particular problem { the code is then more legible, easier to debug and maintain. This work deals with the possibility of syntax extensions during the input text analysis, the input text can contain instructions for such extensions. An extension can be either permanent (valid to the input text end) or local (valid just temporarily). The work brings an implementation of an extensible parser based on kind grammars which supports permanent and local extensions.
|
|
|
A modern implementation of LALR(1) parser generator
Fišer, Karel ; Bednárek, David (advisor) ; Hnětynka, Petr (referee)
The goal of this thesis is to design and implement a modern parser generator. The result is a program that reads description of some context-free LALR(1) grammar and semantic actions from an input file. To output files the program generates source codes in several target modern object-oriented programming languages for implementation of the syntax analyzer which, when parsing the language corresponding to the given grammar, executes the given semantic actions. Powered by TCPDF (www.tcpdf.org)
|
|
|
Graph drawing test environment
Baštecký, Pavel ; Dokulil, Jiří (advisor) ; Bednárek, David (referee)
The graph is a mathematical structure which despite its simplicity has become a perfect instrument for modeling common processes of our world. This success would not have been possible without algorithms which give deeper meaning to static structure of graph itself. With never-ending expansion of informatics science there is need for solving problems which are easy to transform to the world of vertices and edges. The goal of this document is a description of the Graph Editor program which was created to support the design and testing of graph algorithms. Text doesn't describe only the function and implementation of the editor but reader will be also familiar with the way of creating extensible application with the possibility of loading additional modules and the communication among them.
|
|
|
RoboRally
Královec, Jiří ; Holan, Tomáš (advisor) ; Bednárek, David (referee)
Title: RoboRally Author: Jiří Královec Department: Department of Software and Computer Science Education Supervisor: RNDr. Tomáš Holan, Ph.D., Department of Software and Computer Science Education Abstract: This work deals with the implementation of computer version of the board game RoboRally. The computer program which was created enables game for one or more players on one computer. Computer driven players can also be added into a game. Because of creating the artificial intelligence for driving computer players, two different engines (computer players) were created. In addition another program was created for searching adequate setting of the parameters of the engines. The program conducts the search using the technique called genetic algorithms. Using created tools, good enough settings were found to make created engines equivalent opponents for human players. Keywords: RoboRally, board game, artificial intelligence, genetic algorithms
|
guest ::
