|
|
Context-Dependent Scanner
Hatina, Peter ; Koutný, Jiří (referee) ; Čermák, Martin (advisor)
This paper is devoted to principles of a lexical analysis and to a means of context resolution of a lexeme type, depending on its source code position. The lexical analysis, process of a lexical analyzer creation and possible solution for context lexeme recognition, based on a multiple automata system, is described. Lexical analyzer functionality is extended to accept tokens in other languages code blocks.
|
|
|
L-Systems and Their Applications in Computer Graphics
Sojma, Zdeněk ; Čermák, Martin (referee) ; Koutný, Jiří (advisor)
This Bachelor's thesis describes deterministic context-free L-systems (D0L-systems), which function is parallel rewriting symbols in string for purpose of modeling plant-like structures, mainly plant leaves. Next it shows how to use such L-systems in computer graphics and explains usage of stochastic L-systems. They effect topology and geometry of plant by randomizing interpretation of the L-system and allow us to generate whole class of respectively different but still simile leaves. L-system interpreter is implemented in .NET framework with OpenGL library.
|
|
|
Suffix Trees Construction and Their Use in Bioinformatics
Hlaváček, Pavel ; Čermák, Martin (referee) ; Martínek, Tomáš (advisor)
This work discusses problems of suffix trees implementation and their use in bioinformatics. There are given different sorts of algorithms for building suffix trees in this work. In the first place, it deals with the on-line method implementation for building suffix trees, proposed by E. Ukkonen and approximate string matching. That is made by application of dynamic programming principles, adapted for using suffix trees. Both of these methods are described by pseudocode and implemented in a work supplement.
|
|
| |
|
|
Arpitha - hippocentre Podolí u Brna
Čermák, Martin ; Muroň, Ivo (referee) ; Ležatka, Lukáš (advisor) ; Sobotka, Jindřich (advisor)
The bachelor's thesis is based on the project of the Hippocentre, or training center for horses, processed in the third semester of the bachelor's study. The equestrian center is designed on a plot in the village of Podolí near Brno. It is a plot of land on the outskirts of the village next to the agricultural cooperative. The designed area is divided into several operating units. In the northern part of the plot there is a technical section, where the supply of hay, manure removal, horse loading and also the parking of the necessary equipment for the operation will take place. The technical part is separated from the public by the stables and warehouse buildings, but the connection through the passage between the buildings is maintained. Public traffic is located in the middle of the plot. At the entrance to the complex, it is possible to park the vehicle in 9 parking spaces. The car park is connected to the clubhouse with an outdoor terrace, where there is a buffet to serve visitors. In the basement there is a sauna with a private outdoor area overlooking the horse paddocks. The most dominant element of the area is the riding hall, which has a separate entrance for the public and for employees and horses. The entrance is directly connected to the outdoor riding area for warming up the horse before the performance. In the lower part there is a path to the paddocks with a circle. The equestrian center is designed to meet the requirements of running with such specific animals as horses, but at the same time the public is integrated here when organizing social events, races or children's camps.
|
|
| |
|
|
Card Game Tarot For Mobile Devices
Sykala, Vít ; Čermák, Martin (referee) ; Křivka, Zbyněk (advisor)
This thesis describes development of the Tarot game for mobile devices. The game is developed in Java - J2ME. The application allows to play Tarot to one through four people. The player intelligence represented by the mobile device is implemented as an expert system. The expert system rules can be changed without necessity to recompile the application. Designed and implemented expert system uses a lightweight version of Prolog language as a knowledge base. The system requires the rules of precisely defined form specified in this thesis.
|
|
|
Parsing Based on Multigeneration
Kleiner, Miloš ; Čermák, Martin (referee) ; Meduna, Alexandr (advisor)
Multygeneratic system is based on cooperation action of infinity count of context-free grammars. All this context free-grammars parallel and synchronous derivate individual sentential form. During generation came in each specific derivation step to checking of correction of each generated sentential forms. This checking can be made by different ways. Solution is then so-called multistring (vector of strings), so by the help of this is defined generated language.
|
|
| |
|
|
Optic disc detection in video sequences from video ophthalmoscope
Čermák, Marek ; Mézl, Martin (referee) ; Odstrčilík, Jan (advisor)
This work is focused on automatic detection of optic disc in retinal images. There is briefly described anatomy of human eye, principles of retinal imaging and also overview of the methods used for optic disc detection. The practical part describes developed procedures for optic disc detection, ie detection based on watershed transform, active contours and also on region growing technique. The main method of this work is the method of circular transformation, which as the only one allowed to detect the optic disc on the images of video ophtalmoscope and also on the high quality images from fundus cameras. This method was tested on three datasets. The average overlap 92,44 % was achieved for HRF dataset, 91,03 for DRIONS dataset and 77,36 for images of video ophtalmoscope.
|
guest ::
RSS feed.