|
|
Warehouse modeling using graphical user interface
Rajnoha, Martin ; Mašek, Jan (referee) ; Burget, Radim (advisor)
Master’s thesis proposes a new algorithm which enables efficient conversion of graphical representation of warehouse into graph theory representation and consequently accelerates estimation for route costs. The proposed algorithm computes route distances between any places in warehouse based on Breadth first search, image processing „skeletonization“ and Dijkstra algorithm. Using the proposed algorithm it is possible to search routes in a warehouse effectively and fast using precomputed routing table. Searching time is less then milisecond using routing table and even size of warehouse doesn’t affect it significantly instead of using Dijkstra algorithm.
|
|
|
Indexing of Big Text Data and Searching in the Indexed Data
Kozák, David ; Smrž, Pavel (referee) ; Dytrych, Jaroslav (advisor)
Tématem této práce je sémantické vyhledávání ve velkých textových datech. Cílem je navrhnout a implementovat vyhledávač, který se bude efektivně dotazovat nad sémanticky obohacenými dokumenty a prezentovat výsledky uživatelsky přívětivým způsobem. V práci jsou nejdříve analyzovány současné sémantické vyhledávače, spolu s jejich silnými a slabými stránkami. Poté je přednesen návrh nového vyhledávače s vlastním dotazovacím jazykem. Tento systém se skládá z komponent pro indexaci a dotazování se nad dokumenty, management serveru, překladače pro dotazovací jazyk a dvou klientských aplikací, webové a konzolové. Vyhledávač byl úspěšně navržen, implementován i nasazen a je veřejně dostupný na Internetu. Výsledky práce umožňují široké veřejnosti využívat sémantického vyhledávání.
|
|
|
Recursive Web Search in KDE
Hefka, Lukáš ; Burgetová, Ivana (referee) ; Burget, Radek (advisor)
The bachelor thesis deals with problems related to web sites browsing from the KDE desktop environment. Part of this thesis is to introduce the application interface of this environment, suggestion description and application amplementation. The thesis supports range of restrictions both for searching area and searching itself. Application goes through the internet with the help of recursion and hypertext links. In conclusion there are descriobed application advatages in comparison with other alternative.
|
|
| |
|
|
Semi-Automatic Word Normalization in Parish Records
Hříbek, David ; Zbořil, František (referee) ; Rozman, Jaroslav (advisor)
This work deals with the extension of DEMoS web application for the management of parish records by the possibility of normalization (assignment of a normalized form of writing to individual words) of names, surnames, occupations, domiciles and other types of words occurring in parish records. In the solution, a duplicate record detection process was used, which allowed sorting of the records from parish records into clusters of similar words. As a result of the clustering, it was possible to share normalized word variants within these clusters. Thus, DEMoS suggests normalized variants for words entered by users, used not only for the same words, but also for similar words. In this work, automatic testing of word clustering was proposed. In total, 640 different combinations of clustering parameters were tested for each word type. Subsequently, the best clustering parameters were selected for each word type. By normalizing words, DEMoS application significantly increases the efficiency of searching in parish records. Records are also easier to read.
|
|
| |
|
|
Indexing of Big Text Data and Searching in the Indexed Data
Kozák, David ; Smrž, Pavel (referee) ; Dytrych, Jaroslav (advisor)
Tématem této práce je sémantické vyhledávání ve velkých textových datech. Cílem je navrhnout a implementovat vyhledávač, který se bude efektivně dotazovat nad sémanticky obohacenými dokumenty a prezentovat výsledky uživatelsky přívětivým způsobem. V práci jsou nejdříve analyzovány současné sémantické vyhledávače, spolu s jejich silnými a slabými stránkami. Poté je přednesen návrh nového vyhledávače s vlastním dotazovacím jazykem. Tento systém se skládá z komponent pro indexaci a dotazování se nad dokumenty, management serveru, překladače pro dotazovací jazyk a dvou klientských aplikací, webové a konzolové. Vyhledávač byl úspěšně navržen, implementován i nasazen a je veřejně dostupný na Internetu. Výsledky práce umožňují široké veřejnosti využívat sémantického vyhledávání.
|
|
|
An intelligent search aggregator and trip planner for accommodation web sites
Deckert, František ; Faltín, Tomáš (advisor) ; Parízek, Pavel (referee)
There are a lot of different accommodation aggregators available. However, none of them offer the possibilities of more advanced adjustments. Instead, all searches are done for one place and two specific range dates only. My work aims to bring the advanced types of search into the accommodation world. It gives users the possibility of splitting any stay at one place between multiple accommodations' stays. It is also able to plan a trip around multiple cities with a flexible time range based on user specified sorting criteria. 1
|
|
|
Content-Based Searching for Similar CT Scans
Hošek, Pavel ; Klíma, Ondřej (referee) ; Španěl, Michal (advisor)
The work deals with the design and implementation of tool for Content-Based Searching for similar CT scans. This work also deals with comparision of individual methods for searching for similar CT scans. Third-party libraries are used to extract individual descriptors. Furthermore, this work presents results of the implemented searching tool and also presents results of the comparision of individual methods for Content-Based Searching for similar CT scans and suggests possible improvements.
|
|
|
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.
|
guest ::
