National Repository of Grey Literature 46 records found  beginprevious27 - 36next  jump to record: Search took 3.27 seconds. 
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.
Application of distributed and stochastic algorithms in network.
Yarmolskyy, Oleksandr ; Kenyeres, Martin (referee) ; Škorpil, Vladislav (advisor)
This thesis deals with the distributed and stochastic algorithms, including testing their convergence in networks. The theoretical part briefly describes above mentioned algorithms, including their division, problems, advantages and disadvantages. Futhermore, two distributed algorithms and two stochastic algorithms are chosen. The practical part is done by comparing the speed of convergence on various network topologies in MATLAB.
RNA secondary structure prediction
Hadwigerová, Michaela ; Provazník, Ivo (referee) ; Maděránková, Denisa (advisor)
Since the time RNA has been discovered by the nature scientist Miescher the structure and function of it has been forgotten for a long time. The prime role in science had always DNA. An increase of interest in RNA came with the discovery of the tRNA structure and its catalytic and enzymatic properties. These discoveries led to a great development wave of bioinformatics and structure and function analysis of RNA.
Application of distributed and stochastic algorithms in network.
Yarmolskyy, Oleksandr ; Kenyeres, Martin (referee) ; Novotný, Bohumil (advisor)
This thesis deals with the distributed and stochastic algorithms including testing their convergence in networks. The theoretical part briefly describes above mentioned algorithms, including their division, problems, advantages and disadvantages. Furthermore, two distributed algorithms and two stochastic algorithms are chosen. The practical part is done by comparing the speed of convergence on various network topologies in Matlab.
Searching trails in maps
Drahovský, Robin ; Pangrác, Ondřej (advisor) ; Veselý, Pavel (referee)
This thesis describes design and implementation of an application capable of finding the shortest paths in real world map data, while taking elevation data into account. Path finding is fast and can be adjusted to user's needs without the need for graph rebuilding, what differentiates this application from others, that only allow user to work with predefined search profiles. In addition to path finding, the application can generate highly compact graph from map data in OSM format. This allows fast access to information necessary for finding the shortest path. The application can render map data with custom rendering style and contour lines, but also can display map from OpenStreetMaps project servers.
Pupils' strategies for solving additive algorithms
Khanová, Alžběta ; Kloboučková, Jaroslava (advisor) ; Slezáková, Jana (referee)
This thesis deals with the strategies that pupils use for solving additive tasks. The theoretical part focuses on younger-school ages, the transformation of education in the 20th century and the addition operation. The practical part describes a series of experiments realized in mathematics lessons with pupils from the 1st elementary school. During the experiment, pupils have met the environment of the hundred board. I compared pupils's numerical strategies for solving additive algorithms, after the end of the experiment. Also I compared results between pupils, who were part of the experiment and are taught by textbooks from "Nakladatelství Fraus" with pupils who did not participate in the experiment and are taught by textbooks from "Nakladatelství ALTER".
Visualisation of adaptive ant colony optimization algorithm
Tichý, Vojtěch ; Kumpán, Pavel (referee) ; Appel, Martin (advisor)
Bachelor thesis was dealing with programming and creating model for education and understanding of Ant Colony Optimization functioning, which was modified to be able to adapt on the change of terrain. Thesis was further focused on comparing several optimization methods inspired by nature and demarcation their utilization in practical situations.
Application of distributed and stochastic algorithms in network.
Yarmolskyy, Oleksandr ; Kenyeres, Martin (referee) ; Novotný, Bohumil (advisor)
This thesis deals with the distributed and stochastic algorithms including testing their convergence in networks. The theoretical part briefly describes above mentioned algorithms, including their division, problems, advantages and disadvantages. Furthermore, two distributed algorithms and two stochastic algorithms are chosen. The practical part is done by comparing the speed of convergence on various network topologies in Matlab.
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.

National Repository of Grey Literature : 46 records found   beginprevious27 - 36next  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.