|
|
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.
|
|
|
The Parallel Genetic Algorithm for Multicore Systems
Vrábel, Lukáš ; Šimek, Václav (referee) ; Jaroš, Jiří (advisor)
Genetický algoritmus je optimalizačná metóda zameraná na efektívne hľadanie riešení rozličných problémov. Je založená na princípe evolúcie a prirodzeného výberu najschopnejších jedincov v prírode. Keďže je táto metóda výpočtovo náročná, bolo vymyslených veľa spôsobov na jej paralelizáciu. Avšak väčšina týchto metód je z historických dôvodov založená na superpočítačoch alebo rozsiahlych počítačových systémoch. Moderný vývoj v oblasti informačných technológií prináša na trh osobných počítačov stále lacnejšie a výkonnejšie viacjadrové systémy. Táto práca sa zaoberá návrhom nových metód paralelizácie genetického algoritmu, ktoré sa snažia naplno využiť možnosti práve týchto počítačových systémov. Tieto metódy sú následne naimplementované v programovacom jazyku C za využitia knižnice OpenMP určenej na paralelizáciu. Implementácia je následne použitá na experimentálne ohodnotenie rozličných charakteristík každej z prezentovaných metód (zrýchlenie oproti sekvenčnej verzii, závislosť konvergencie výsledných hodnôt od miery paralelizácie alebo od vyťaženia procesoru, ...). V poslednej časti práce sú prezentované porovnania nameraných hodnôt a závery vyplývajúce z týchto meraní. Následne sú prediskutované možné vylepšenia daných metód vyplývajúce z týchto záverov, ako aj možnosti spracovania väčšieho množstva charakteristík na presnejšie ohodnotenie efektivity paralelizácie genetických algoritmov.
|
|
|
Parsing Based on Random Context Grammars
Mikita, Martin ; Solár, Peter (referee) ; Vrábel, Lukáš (advisor)
This thesis describes a random context grammar and the implementation of an application which will convert this grammar (respecting the LL condition) to an equivalent context-free grammar (also satisfying the LL condition). The resulting grammar can be used in the existing parser generator that accepts a yacc-compatible format. This thesis uses the GNU Bison generator, for which the encapsulated script was introduced. The potential advantage of random context grammar consists in the proven efficient description compared to context-free grammar for some languages.
|
|
|
Parsing Based on Deep Pushdown Automata
Senko, Jozef ; Vrábel, Lukáš (referee) ; Solár, Peter (advisor)
This thesis is concerning with syntax analysis based on deep pushdown automata. In theoretical part are defined themselves deep pushdown automata, all the necessary theoretical concepts and then is discussed the implementation of these deep pushdown automata embedded in the educational program for students.
|
|
|
Parsing Based on State Grammars
Svatý, Lukáš ; Vrábel, Lukáš (referee) ; Solár, Peter (advisor)
Syntax-directed translation based on state grammars is introduced in this bachelor's thesis. Theoretical section of this thesis is focused on the introduction of theoretical models that are necessary for understanding syntax analysis based on state grammars. The most important theoretical formal models in this thesis include deep pushdown transducer and translation grammar based on state grammar, which can be used in syntax analysis. Practical section of this thesis is focused on bottom-up syntax analysis using state grammar and its implementation.
|
|
|
Non-Returning Turing Machines
Surovič, Marek ; Vrábel, Lukáš (referee) ; Meduna, Alexandr (advisor)
This work introduces a restricted variant of the Turing machine which cannot move left, thus return on its tape. Other properties, such as the potentially infinite symbol tape or the ability to rewrite symbols on the tape, remain unchanged. By introducing this restriction we limit the expressive power of the Turing machine to the point, where a non-returning Turing machine is equivalent to a finite automaton and can be transformed into one. A transformation algorithm is presented and described in detail.
|
|
|
Testing of Automated Trading Systems
Zapletal, Martin ; Vrábel, Lukáš (referee) ; Petřík, Patrik (advisor)
This thesis deals with testing of automated systems used for stock market trading. The reader acquires basic knowledge about financial markets and stock market. Subsequently, performance indicators for the whole trading system and for the prediction model used in the system are introduced. The explanation of influence of input data selection on trading system performance is the most crucial part of the paper. Selected trading system tests were done using the application, which was made as a part of this thesis. Results of these tests are also presented.
|
|
|
Simulation of Lazy Finite Automata
Vrábel, Lukáš ; Masařík, Karel (referee) ; Lukáš, Roman (advisor)
This bachelor's thesis introduces a formal model of the lazy finite state machine and implementation of application based on this model. The application demonstrates functionality of new model, and pros and cons of this approach. This model has advantage over existing models in easier definitions of transition rules.
|
|
|
Generator of 3D Objects Based on L-Systems
Kvita, Jakub ; Solár, Peter (referee) ; Vrábel, Lukáš (advisor)
The aim of this bachelor thesis was to create an interactive system for generating 3D models. The generator is based on L-systems as a kind of formal grammars and turtle graphics for 3D modeling. The application was created in Java SE using JOGL library as access point for OpenGL and rendering. The thesis analyze the theoretical basis of L-systems, turtle graphics and rendering 3D objects and then describes creation of application using the acquired knowledge.
|
|
|
Simulation of Lazy Finite Automata
Vrábel, Lukáš ; Masařík, Karel (referee) ; Lukáš, Roman (advisor)
This bachelor's thesis introduces a formal model of the lazy finite state machine and implementation of application based on this model. The application demonstrates functionality of new model, and pros and cons of this approach. This model has advantage over existing models in easier definitions of transition rules.
|
guest ::
RSS feed.