|
|
Scrabble for Mobil Phones
Kaněčka, Ondřej ; Kunc, Michael (referee) ; Schönecker, Rudolf (advisor)
This paper deals with an usage of searching algorithms and lexical data structures for platforms with limited computing power and accessible memory (celluar phones and similar) in SCRABBLE brand crossword game. There are also shown its advantages and disadvantages on this platform. The Appel-Jacobson searching algorithm is used to search possible moves. The lexicon with all words is available for this algorithm. It's stored in Directed Acyclic Word Graph (DAWG), which provides fast data searching and data compression too, so the size of the lexicon is comparatively small considering the target platform. The final Java application for celluar phones (MIDP 2.0) adds graphical interface and game control so it provides playing SCRABBLE brand crossword game against artificial intelligence or against human.
|
|
|
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.
|
|
|
3D Pathfinding -- Searching Path in a Building
Macek, Ján ; Rozman, Jaroslav (referee) ; Samek, Jan (advisor)
The subject of this thesis is the description of the algorithms used for searching in the state space and the subsequent implementation of a searching path for the building. The first part of the thesis is devoted to methods for area description. The next chapter explains the methods of pathfinding in space. The third part of the paper describes the implementation of an application. In conclusion, are the results of testing and their assessment.
|
|
|
Implementation of SQL/MM DM for Association Rules
Škodík, Zdeněk ; Bartík, Vladimír (referee) ; Zendulka, Jaroslav (advisor)
This project is concerned with problems of knowledge discovery in databases, in the concrete then is concerned with an association rules, which are part of the system of data mining. By that way we try to get knowledge which we can´t find directly in the database and which can be useful. There is the description of SQL/MM DM, especially then all user-defined types given by standard for association rules as well as common types which create framework for data mining. Before the description of implementation these types, there is mentioned the instruments which are used for that - programming language PL/SQL and Oracle Data Mining support. The accuracy of implementation is verified by a sample application. In the conclusion, achieved results are evaluated and possible continuation of this work is mentioned.
|
|
|
Model Checking Infinite-State Systems Using Language Inference
Rozehnal, Pavel ; Křena, Bohuslav (referee) ; Vojnar, Tomáš (advisor)
Regular model checking is a method for verifying infinite-state systems based on coding their configurations as words over a finite alphabet, sets of configurations as finite automata, and transitions as finite transducers. We implement regular model checking using inference of regular languages. The method builds upon the observations that for infinite-state systems whose behavior can be modeled using length-preserving transducers, there is a finite computation for obtaining all reachable configurations. Our new approach to regular model checking via inference of regular languages is based on the Angluin's L* algorithm that is used for finding out an invariant which can answer our question whether the system satisfies some property. We also provide an intro to the theory of finite automata, model checking, SAT solving and Anguin's L* and Bierman algorithm of learning finite automata.
|
|
|
Interception of Modern Encrypted Protocols
Marček, Ján ; Korček, Pavol (referee) ; Kajan, Michal (advisor)
This thesis deals with the introduction to the security mechanism.The procedure explains the basic concepts, principles of cryptography and security of modern protocols and basic principles that are used for information transmission network. The work also describes the most common types of attacks targeting the eavesdropping of communication. The result is a design of the eavesdropping and the implementation of an attack on the secure communication of the SSL protocol..The attacker uses a false certificate and attacks based on poisoning the ARP and DNS tables for this purpose. The thesis discusses the principles of the SSL protocol and methodology of attacks on the ARP and DNS tables.
|
|
|
Composite Subband Adaptive Speech Enhancement
Hovorka, Jaroslav ; Vlček, Čestmír (referee) ; Křesálek,, Vojtěch (referee) ; Sysel, Petr (advisor)
The thesis deals with single channel and multiple channel algorithms for speech enhancement. The goal of this work is to perform the deep analysis of both single channel and multiple channel algorithms in sense of their behaviour in noisy environment of combat vehicles and platforms. Based on this analysis a new composite speech enhancement algorithm will be designed. This new approach is expected to increase quality of the processed speech in military communications systems. These systems are characterised by their operation under very noisy conditions where background noise is very high and signal-to-noise ratio extremely low. These noisy conditions are typical for the range of military and combat platforms and vehicles.
|
|
|
The Comparison of the Algorithms for the Solution of Travel Sales Problem
Kopřiva, Jan ; Všetička, Martin (referee) ; Dostál, Petr (advisor)
The Master Thesis deals with logistic module innovation of information system ERP. The principle of innovation is based on implementation of heuristic algorithms which solve Travel Salesman Problems (TSP). The software MATLAB is used for analysis and tests of these algorithms. The goal of Master Thesis is the comparison of selections algorithm, which are suitable for economic purposes (accuracy of solution, speed of calculation and memory demands).
|
|
|
Multiagent system for traffic flow simulation and analysis
Koutný, Vladimír ; Hynčica, Ondřej (referee) ; Honzík, Petr (advisor)
This diploma thesis deals with an oriented graph processing applying a multi-agent system designated for traffic simulation. The thesis was written as a research study. Based on the study, a simulation environment was created able to respond to various stimuli. Meant as the agents, there are vehicles and their drivers that have various features, based on which they respond to the given stimuli. Communication is conducted via a so-called super-agent that monitors all action on the map and passes this information on particular agents. The agents are able to respond in advance to traffic jams (closures, accidents). In such situations, an algorithm designated for a new route finding is conducted. Besides the controlled ones, there can operate on the map also agents simulating common traffic.
|
|
|
Multichannel Image Deconvolution
Bradáč, Pavel ; Kolář, Radim (referee) ; Jiřík, Radovan (advisor)
This Master Thesis deals with image restoration using deconvolution. The terms introducing into deconvolution theory like two-dimensional signal, distortion model, noise and convolution are explained in the first part of thesis. The second part deals with deconvolution methods via utilization of the Bayes approach which is based on the probability principle. The third part is focused on the Alternating Minimization Algorithm for Multichannel Blind Deconvolution. At the end this algorithm is written in Matlab with utilization of the NAG C Library. Then comparison of different optimization methods follows (simplex, steepest descent, quasi-Newton), regularization forms (Tichonov, Total Variation) and other parameters used by this deconvolution algorithm.
|
guest ::
