|
|
Intelligent Web Work Planner
Kmeť, Miroslav ; Vrábel, Lukáš (referee) ; Čermák, Martin (advisor)
This thesis describes basic principles governing the use of evolutionary algorithms. Thesis deals with the usage of the evolutionary algorithms for scheduling the work between group of employees. Genetic algorithms, which represents intelligent stochastic optimization techniques based on the mechanism of natural selection and genetics are mainly used to solve this problem. Each solution is represented as an individual in population and only the most adapted ones are selected for the process of reproduction.
|
|
|
Facebook Contacts Export
Škrabánek, Ondřej ; Čermák, Martin (referee) ; Koutný, Jiří (advisor)
This bachelor thesis deals mainly with issues of social networking websites, especially of web Facebook, and program Microsoft Outlook. The application is designed to export contact informations of friends at the Facebook social network site. The implementation uses the technology of Microsoft C#.NET, Visual Studio Tools for Office, Microsof Office Document Imaging and Facebook SDK.
|
|
|
Fractals and Their Applications in Computer Graphics
Tesař, Martin ; Čermák, Martin (referee) ; Koutný, Jiří (advisor)
First part of this bachelors thesis consists of fractal theory, Hausdorff dimension and their applications in computer graphics. In second part is choosen idea for application. It is interactive creation of flame fractals. In this section, there is defined mathematical system of iterated functions, that is the heart of flame fractals. After mathematical examination follows analysis of original algorithm for creation of flame fractals. Thesis continues with methods for image improvement and suggests new enhancements.
|
|
|
GPU Image Processing Library
Čermák, Michal ; Španěl, Michal (referee) ; Smrž, Pavel (advisor)
This work is concerned with architecture of recent Nvidia graphics cards and application programming interface CUDA. That is used to create accelerated image processing library. It place emphasis on testing performance gain compassion with high optimized and used OpenCv library.
|
|
|
Lexical Analyzer for Multiprocesor Computers
Otáhal, Jiří ; Goldefus, Filip (referee) ; Čermák, Martin (advisor)
Aim of this thesis is to invent method, which should accelerate speed of the analysis of source texts with multiprocessor computers. For this purpose application runs multiple process in Unix system. Each undergoing process analyzes exact partition in source file and then closes itself. Outcome of this process are internal structures, which presents exact partition. Inter-code is sequentially built from the structures which are subsequently interpreted. This kind of parallel analysis achieves acceleration of speed on the contrary of typical sequential analysis.
|
|
|
Analysis and Visualization of NC Code
Konečný, Michal ; Čermák, Martin (referee) ; Koutný, Jiří (advisor)
This project deals with NC tooling visualization and NC code analysis problems. Implementation`s solutions for tooling`s techniques and tools are described in the project . Here visualization`s solution of the tooling`s proces are described, for this OpenGL library si used. In this work problems, we encoutered during work on this project, are analyzed.
|
|
|
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.
|
|
| |
guest ::
RSS feed.