|
|
Historical development of numerical methods and computational techniques.
DIVÍŠKOVÁ, Michaela
In my bachelor thesis I deal with historical development of numerical methods and computational techniques. In the first chapter, the introduction of the concept of number and the writing process. In the second chapter, I present the basic numerical methods and algorithms for a variety of mathematical operations. In the third chapter, I will devote counting techniques and aids to facilitate calculations. The final chapter, I focus on computation of periodic rational and irrational numbers.
|
|
|
Fast signal processing
Rychlý, Ivo ; Langerová, Petra (referee) ; Mikulka, Jan (advisor)
Zvětšující se množství dat v moderním zpracování obrazu vyžaduje nový postupy v psaní algoritmů. Největší překážkou pro úspěšné zrychlení algoritmu je paralelizace a následná optimalizace. Programy jako CUDA a OpenCL s modifikovaným programovacím jazykem a rozhraním pomáhají s tímto problémem a otevírají paralelní zpracování širšímu okruhu lidí. V této práci zabývám základy zpracování obrazu a tomu jak paralelizace algoritmů může urychlit zpracování obrazu.
|
|
|
Application for Detection of Plagiarism
Šalplachta, Pavel ; Techet, Jiří (referee) ; Lukáš, Roman (advisor)
Bachelor's thesis is focused on programming in language C and a method of detecting plagiarism in programs written in this language. The result of thesis is application in language C too, which according similarity source codes decides if it is a plagiarism or not. Application is first of all indicated for control plagiarism in homework in subject Algorithms at Fakulty of information technogy at Brno university of technology.
|
|
| |
|
|
Packet Classification Algorithms
Foukal, Martin ; Kajan, Michal (referee) ; Puš, Viktor (advisor)
This work deals with the packet classification algorithms for traffic filtering in computer networks. It contains summary of different areas where packet classification is used. It describes various algorithms and their memory and speed characteristics. Then this work describes implementation of two chosen algorithms based on bit paralelism and bit vectors which were integrated into Netbench, framework for evaluation and experiments with packet processing algorithms. There are described memory requirements of both these algorithms which were tested for different sets of rules. These requirements are compared with other algorithms in Netbench.
|
|
|
Graphical Educational System
Hotař, Roman ; Seeman, Michal (referee) ; Štancl, Vít (advisor)
The purpose of this thesis is the proposal of the issue of education software for learning algorithms. Work approach to the problem, both from a theoretical point of view, of education and learning to new things, so and more important from a practical point of view for introduction to the process algorithmization. It also discusses the problem of learning algorithms in Czech schools and describes the resulting program, which was created along with this thesis. Contribution of this thesis is the summary of the requirements for the software and implementing software of this type, where is possible to demonstrate the problems and requirements of the draft programs of this kind. This thesis also describes the reactions of teachers to created application.
|
|
|
AI Algorithms
Petrželka, Jan ; Hrubý, Martin (referee) ; Janoušek, Vladimír (advisor)
This master's thesis describes artificial intelligence algorithms based on the book Artificial Inteligence: A Modern Approach by S. Russel and P. Norvig and implementation of the algorithms in the Squeak Smalltalk programming language with object oriented approach. Algorithms are based on pseudocode in the book and existing implementations in Lisp, Python and Java language. Main concepts are intelligent agents, agent simulation environments, state space search, game playing, planning, uncertainty and learning.
|
|
|
Longest Prefix Match in High-Speed Networks
Skačan, Martin ; Tobola, Jiří (referee) ; Kořenek, Jan (advisor)
This thesis deals with the Longest Prefix Matching (LPM), which is a time-critical operation in packet forwarding. To achieve 100Gbps throughput, this operation has to be implemented in hardware and a forwarding table has to fit into the on-chip memory, which is limited by its small size. Current LPM algorithms need large memory to store IPv6 forwarding tables or cannot be simply implemented in HW. Therefore we performed an analysis of available IPv6 forwarding tables and several LPM algorithms. Based on this analysis, we propose a new algorithm which is able to provide very low memory demands for IPv4/IPv6 lookups. To the best of our knowledge, the proposed algorithm has the lowest memory requirements in comparison to existing LPM algorithms. Moreover, the proposed algorithm is suitable for IP lookup in 100Gbps networks, which is shown on new pipelined hardware architecture with 140Gbps throughput.
|
|
|
Indoor Robot - Control Neural Network
Křepelka, Pavel ; Kopečný, Lukáš (referee) ; Žalud, Luděk (advisor)
In this document, I describe possibilities of mobile robot navigation. This problems are solving many different ways, but there isn’t satisfactorily result to this day. You find there describe of deterministic algorithms, this algorithms can be used for simply actions like obstacle avoiding or travel in corridor. For global navigation this algorithms fails. In next part of document is theory of artificial neural nets (perceptron, multi layer neural nets, self organization map) and using them in mobile robots. Own navigation algorithms was tested on constructed mobile robot or simulated in SW described in chapter 6. Design own control algorithms is based on neural net (Kohonen net). Designed algorithms can be used for one-point navigation or complex global navigation. In document, there is comparing of various ways to navigation, their advantages and disadvantages. Goal of this document is find effective algorithm for navigation and artificial intelligence appears to be the right solution.
|
|
| |
guest ::
