|
|
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.
|
|
|
Compensation of geometric distortion of electrophoretic gel image
Dvořáček, Tomáš ; Vítek, Martin (referee) ; Škutková, Helena (advisor)
This master thesis is engaged in problematics of creation and compensation of geometric distortions in 1D agarose electrophoresis. This master thesis analyze the problematics of cause of these distortions and summarize the theory needed for compensation of these distortions. Based on acquired theory and created electrophoretic phantoms, the master thesis contains several suggestions for compensation of incurred distortions. These suggestions are recreated into functions, which are connected into a functional user interface for gel image analysis and geometric distortions compensation.
|
|
|
Algorithms for Automatic Image Cropping
Ambrož, Vít ; Brejcha, Jan (referee) ; Čadík, Martin (advisor)
The main goal of this bachelor thesis is study and implementation of methods that can automatically crop images, so the result has good usability from a photographic view. In this thesis are made experiments with three methods and possible optimalizations are discussed. The properties of cropping algorithms are also described here and the evaluation of implemented algoritmhs is made according to user testing.
|
|
|
RMS Value Measurement Algoritihms
Zedník, Josef ; Štohl, Radek (referee) ; Šedivá, Soňa (advisor)
This master´s thesis focuses on theoretic analysis selected methods for determination effective value of non-coherent sampled voltage signals. In thesis are described algorithms for calculation effective value in time and frequency domain. One of task this thesis was design methods of program for simulation selected methods of measurement non-coherent sampled voltage signals. This program is realized in developmental environment of LabVIEW and his realization is described in this thesis. User has possibility calculate effective value and bias characteristic depend on selected method and selected input signal. Part of this thesis are simulations, which compares selected methods of calculation effective value.
|
|
|
Navigation in Public Transport
Turic, Matúš ; Křivka, Zbyněk (referee) ; Burget, Radek (advisor)
This master's thesis deals with the issue of traveling in public transport. In the first part the author informs about similar applications and theories necessary for understanding the problems. In the second part, the author describes the design and behavior of the mobile and server application, including the used technologies. Created mobile application has the task of navigating the user from one point to another in the shortest possible time, while it should be possible to replace the current route with faster one.
|
|
|
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.
|
|
|
Desktop Search for Linux
Prívozník, Michal ; Schmidt, Marek (referee) ; Smrž, Pavel (advisor)
This work deals with indexing, difeerent types of indexing structures their advantages and disadvantages. It provides the basis for a search engine with support of morphology or difeerent file formats. Provides insight to the basic ideas, which answer is aim of the master's thesis.
|
|
|
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.
|
|
|
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.
|
|
|
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.
|
guest ::
