National Repository of Grey Literature 47 records found  previous11 - 20nextend  jump to record: Search took 0.01 seconds. 
Genomic Data Mining Techniques
Jaša, Petr ; Křivka, Zbyněk (referee) ; Burgetová, Ivana (advisor)
First of all, this thesis sets itself a goal to introduce some common technics for datamining in genomics and as a next step to implement own algorithm like algorithm BLAST. In the concrete, this work is pointed to sequences of DNA. The DNA sequence contains in itself genetic information, which is template for living organism. For explanation this information can be used number of technics. This paper describes algorithm Fasta and algorithms from BLAST family. With these algorithms, it is possible to gain a lot of important information even about such DNA sequences, where only primary structure is known. Principle of these algorithms is based on alignments of one query sequence, which we want to obtain some information from, with many sequences stored in database. According to result alignment, it is possible to determine many features of the query sequence.
Online System for Visual Geo-Localization in Natural Environment
Pospíšil, Miroslav ; Čadík, Martin (referee) ; Brejcha, Jan (advisor)
The goal of this master thesis is creation of an online system serving as a performing application for presentation results of visual geo-localization in nature and mountain environment. The system offers the users to choose one of the pre-defined photographs or~to~upload one's own photography while choosing a file or inserting an URL address. The~system will localizate a camera of a given image based on a visual geo-localization. The~geo-localization uses the mountain horizon as a key characteristic when searching for similar horizons. The~curve line of the horizon is extracted by a fully automatic algorithm based on supervised learning and dynamic programming. Visual geo-localization running on the server which using new inversed index with cache politic. This allows further scaling of the system. The server processing detected horizon curve and respond with set of the best candidates on results. Results are visualised to the user in form of classic map, detailed sattelite view and rendering of found panorama.
Database of acoustic records
Terz, Marek ; Schimmel, Jiří (referee) ; Sysel, Petr (advisor)
The databsae of accoustical recordings is a web-based application, which is accessible with an usual web browser. There were used technologies, that are ussually used in web applications. This ensures, that the application is open for using by wide range of users. The application enables uploading WAWE files to the server and allows the user to add various description of the recordings. The application allows also comparing the quality of recordings, which were processed with some method for highlighting the accoustical signal from noise. This function is established by listening tests, which are open for every user, who wants to join the tests.
Suffix Trees Capabilities
Chlubna, Pavel ; Hynek, Jiří (referee) ; Burgetová, Ivana (advisor)
This thesis discusses structure of suffix trees, their implementation and problematics, we can solved with suffix trees. The thesis also focuses on construction of suffix trees, with usage of Ukkonen's algorithm. Apart of implementation of this structure this thesis deals with comparing other commonly used algorithms with suffix trees in term of time complexity. A result of this thesis is application with graphical interface, that shows usage of suffix trees in solving various problematics and shows comparison of this structure to other algorithms.
Dynamic Time Warping
Černohous, Lukáš ; Pikula, Stanislav (referee) ; Klusáček, Jan (advisor)
This thesis describes the method of dynamic Time Warping (DTW), its principles and method of calculation options. Additionally, it lists some of the typical examples of its implementation. In the practical part, it focuses on the creation oof a simple signature verification model using DTW and it evaluates the results. The model was programmed in MATLAB.
Dynamic Time Warping
Černohous, Lukáš ; Hynčica, Ondřej (referee) ; Honzík, Petr (advisor)
This thesis describes the method of dynamic Time Warping (DTW), its principles and method of calculation options. Additionally, it lists some of the typical examples of its implementation.
Coverage Path Planning for Autonomous Robotic Lawn Mower
Moninec, Michal ; Šoustek, Petr (referee) ; Kůdela, Jakub (advisor)
This diploma thesis is covering the coverage path planning problem for autonomous robotic lawn mower in an area, which is fully defined before and is not changing. It contains a review of the currently used methods and an implementation of a software with a graphic user interface, which is capable of generating optimalized path.
Optimal path planning for electric vehicles
Horák, Filip ; Šoustek, Petr (referee) ; Kůdela, Jakub (advisor)
This master’s thesis is about optimal route planning for electric vehicles. The first, theoretical part of this work introduces the issue and describes several heuristic methods that have been used to address optimization tasks. A practical part of the thesis is based around software implementation of the methods described earlier. Finally, several experiments and comparisons of obtained results are carried out.
Suffix Trees Capabilities
Chlubna, Pavel ; Hynek, Jiří (referee) ; Burgetová, Ivana (advisor)
This thesis discusses structure of suffix trees, their implementation and problematics, we can solved with suffix trees. The thesis also focuses on construction of suffix trees, with usage of Ukkonen's algorithm. Apart of implementation of this structure this thesis deals with comparing other commonly used algorithms with suffix trees in term of time complexity. A result of this thesis is application with graphical interface, that shows usage of suffix trees in solving various problematics and shows comparison of this structure to other algorithms.
Genomic Data Mining Techniques
Jaša, Petr ; Křivka, Zbyněk (referee) ; Burgetová, Ivana (advisor)
First of all, this thesis sets itself a goal to introduce some common technics for datamining in genomics and as a next step to implement own algorithm like algorithm BLAST. In the concrete, this work is pointed to sequences of DNA. The DNA sequence contains in itself genetic information, which is template for living organism. For explanation this information can be used number of technics. This paper describes algorithm Fasta and algorithms from BLAST family. With these algorithms, it is possible to gain a lot of important information even about such DNA sequences, where only primary structure is known. Principle of these algorithms is based on alignments of one query sequence, which we want to obtain some information from, with many sequences stored in database. According to result alignment, it is possible to determine many features of the query sequence.

National Repository of Grey Literature : 47 records found   previous11 - 20nextend  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.