|
| |
|
|
Mining Multiple Level Association Rules
Nguyenová, Thanh Lam ; Burget, Radek (referee) ; Bartík, Vladimír (advisor)
This bachelor thesis deals with multiple level association rules mining. The aim of this work is to focus on available algorithms for mining multiple level association rules and to implement an application with a graphical user interface that will demonstrate the functionality of these algorithms. Five algorithms based on the Apriori algorithm were chosen. Experiments with each algorithm were performed using the application and the results were compared and evaluated at the end of the thesis.
|
|
|
PLC Control of Mobile Robotics Platform
Konečný, Michael ; Lang, Stanislav (referee) ; Matoušek, Radomil (advisor)
The aim of this master's thesis was to create a design for a prototype of a mobile robotic platform and its physical fabrication. Another goal of this master's thesis was to develop a control algorithm and its implementation into a prototype. In addition, the thesis was extended by an autonomous motion mode, an algorithm for robot path planning, and the design of the Human Machine Interface (HMI). The introduction contains a description of some already created mobile robotic platforms, a presentation of the company B&R and the theory needed to understand omnidirectional mobility. The next chapters describe the design and construction of a prototype with a selection of electronic components and their wiring, implementation of an algorithm for robot path planning, implementation of a control algorithm and design, together with the implementation of the user environment. At the end of this master's thesis, the possibilities of extending the project to future years are described.
|
|
|
Analysis and Improvement of Distributed Systems
Kenyeres, Martin ; Sýkora, Jiří (referee) ; Klučik,, Stanislav (referee) ; Škorpil, Vladislav (advisor)
A significant progress in the evolution of the computer systems and their interconnection over the past 70 years has allowed replacing the frequently used centralized architectures with the highly distributed ones, formed by independent entities fulfilling specific functionalities as one user-intransparent unit. This has resulted in an intense scientic interest in distributed algorithms and their frequent implementation into real systems. Especially, distributed algorithms for multi-sensor data fusion, ensuring an enhanced QoS of executed applications, find a wide usage. This doctoral thesis addresses an optimization and an analysis of the distributed systems, namely the distributed consensus-based algorithms for an aggregate function estimation (primarily, my attention is focused on a mean estimation). The first section is concerned with a theoretical background of the distributed systems, their evolution, their architectures, and a comparison with the centralized systems (i.e. their advantages/disadvantages). The second chapter deals with multi-sensor data fusion, its application, the classification of the distributed estimation techniques, their mathematical modeling, and frequently quoted algorithms for distributed averaging (e.g. protocol Push-Sum, Metropolis-Hastings weights, Best Constant weights etc.). The practical part is focused on mechanisms for an optimization of the distributed systems, the proposal of novel algorithms and complements for the distributed systems, their analysis, and comparative studies in terms of such as the convergence rate, the estimation precision, the robustness, the applicability to real systems etc.
|
|
|
Adaptive Digital Filtering of Biological Signals
Ištok, Martin ; Kozumplík, Jiří (referee) ; Provazník, Ivo (advisor)
The main objective of this bachelor’s thesis was to describe adaptive digital filtering theory including different types of the adaptive algorithm and adaptive filter. An adaptive systém is used for power line interference canceller for ECG signal. The thesis includes design of 4 adaptive filters: simple adaptive filter, simple adaptive notch filter, adaptive notch filter using resonator and adaptive notch filter using adaptive resonator. It also contains basic testing of the filters based on different settings. Different settings are also evaluated.
|
|
|
Blind Image Deconvolution in STEM mode of Electron Microscope
Valterová, Eva ; Walek, Petr (referee) ; Potočňák, Tomáš (advisor)
Slepá dekonvoluce je metoda, při které je rozptylová funkce a skutečný obraz rekonstruován zároveň. Cílem této práce je představit různé metody slepé dekonvoluce a najít optimální metodu rekonstrukce původního obrazu a rozptylové funkce. Jako nejvhodnější metoda slepé dekonvoluce byl zvolen algoritmus střídavé minimalizace, který byl upraven a testován. Vlastnosti navrženého algoritmu byly testovány na uměle degradovaných datech a na reálných datech pořízených skenovacím transmisním elektronovým mikroskopem. Účinnost algoritmu byla hodnocena hned několika hodnotícími kritérii. Byla zjištěna omezení algoritmu a tím specifikováno jeho využití.
|
|
|
Novel Applications of Ant Algorithms
Korgo, Jakub ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
Ant algorithms have been used for a variety of combinatorial optimization problems. One of these problems, where ant algorithms haven't been used, is the design of transition rules for cellular automata (CA). Which is a problem that this master's thesis is focused on. This work begins with an introduction into ant algorithms and a overview of its applications, followed by an introduction into CA. In the next part the author proposes a way how to encode rules of CA into a graph which is used in ant algorithms. The last part of this thesis contains an application of encoded graph on elitist ant system and MAX-MIN ant system. This is followed by experimental results of creating transition rules for CA problems by these algorithms.
|
|
|
Ant colony
Hart, Pavel ; Hynčica, Ondřej (referee) ; Honzík, Petr (advisor)
First part of the thesis is about literature research of optimization algorithms. Three of the algorithms were implemented and tested, concretely the ant colony algorithm, tabu search and simulated annealing. All three algorithms were implemented to solve the traveling salesman problem. In second part of the thesis the algorithms were tested and compared. In last part the influence of the ant colony parameters was evaluated.
|
|
|
Knowledge Discovery from Process Logs
Kluska, Martin ; Burgetová, Ivana (referee) ; Bartík, Vladimír (advisor)
This Master's describes knownledge discovery from process logs by using process mining algorithms. Chosen algorithms are described in detail. These aim to create process model based on event log analysis. The goal is to design such components, which would be able to import the process and run the simulations. Results from components can be used for short term planning.
|
|
|
Hierarchical methods of path planning
Gáčová, Veronika ; Šoustek, Petr (referee) ; Dvořák, Jiří (advisor)
The master thesis deals with hierarchical methods of path planning. The theoretical part is focused on representation of map environment and provides description of path planning algorithms. Further in this thesis description of hierarchical path planning and selected hierarchical methods is provided. In the practical part selected hierarchical methods were implemented. Subsequently in created simulation environment the selected hierarchical methods were compared and evaluated.
|
guest ::
