|
|
Indexing Linked Data
Conicov, Andrei ; Nečaský, Martin (advisor) ; Skopal, Tomáš (referee)
The fast evolution of the World Wide Web has offered the possibility to publish a huge amount of linked documents. Each such document represents a valuable piece of information. Linked Data is the term used to describe a method of exposing and connecting such documents. Even if this method is still in an experimental phase, it is already hard to process all existing data sources and the most obvious solution is to try and index them. The study addresses questions on how to design an index that will be capable to operate with millions of such entries. It analyses the existing projects and describes an index that may fulfill the requirements. The prototype implementation and the provided test results offer additional information about the index structure and effectiveness.
|
|
|
Modification of Pivot Tables method for persistent metric indexing
Moško, Juraj ; Skopal, Tomáš (advisor) ; Hoksza, David (referee)
The pivot tables is one of the most effective metric access method optimized for a number of distance computations in similarity search. In this work the new modification of the pivot tables method was proposed that is besides distance computations optimized also for a number of I/O operations. Proposed Clustered pivot tables method is indexing clusters of similar objects that were created by another metric access method - the M-tree. The indexing of clustered objects has a positive effect for searching within indexed database. Whereas the clusters are paged in second memory, page containing such cluster, which do not satisfy particular query, is not accessed in second memory at all. Non-relevant objects, that are out of the query range, are not loaded into memory, what has the effect of decreasing number of I/O operations and total volume of transferred data. The correctness of proposed approach was experimentally proved and experimental results of proposed method was compared to selected metric access methods.
|
|
|
Turn - over positioning table
Mareček, Vojtěch ; Dokoupil, Vladimír (referee) ; Foller, Bronislav (advisor)
This diploma thesis deals with projection and general design of rotary indexing table for dedicated machine tools. The major attention is given to substitution of hydraulic drive table by table driven by servomotor, namely double axis its positions in vertical and horizontal directions. The total configuration of rotary table is solved as a construction kit, user can used any servomotor and additive gearbox. The work is concentrated to the optimization of table construction for this new designed conception. The positioning and fixing of table plate is solved by couple of Hirth couplings with central hydraulic motor. The computational part of work includes calculations of dynamic of rotary motion of the table and hydraulic system. All important screw connection, gear wheels and Hirth couplings were verified by calculations. Also working lifetime of bearings and strength deformation of major constructional sections of rotary table verification were controlled. Inherent part of work is security analysis, economics analysis, patent search and analysis of construction identity. Presented work contains three-dimensional model, drawing documentation of both variants of configurations and production drawing of major section parts of rotary table.
|
|
|
Search in Semantically-Enriched Texts
Dostál, Jiří ; Dytrych, Jaroslav (referee) ; Smrž, Pavel (advisor)
This thesis deals with searches within large-scale text data, which are enriched by semantic information, especially the highlighting of named entities. The thesis begins by analysing methods used for the indexing of partly structured text data and the methods used for searching. The main body of the thesis consists of the description and implementation of a query engine, which analyses queries and requirements on range and structure. This query is later converted into an MG4J search engine format and applies restrictions on the results. These results have been tested on time response, as well as on a number of results, which are then compared to older results obtained from English Wikipedia.
|
|
| |
|
|
Recognition and Search in SKype Calls
Tomášek, Pavel ; Plchot, Oldřich (referee) ; Černocký, Jan (advisor)
The project aims at a system for recognition of Skype calls. One of the necessary project focuses is finding out a high-quality Skype recorder. Signal preprocessing (segmentation of speech/silence) and speech recognition follows. Another project interest is in choosing a presentation software, which meets the project needs. Essential part of this work is also indexing and search implementation. This project is a proof-of-concept and shows one of the ways of speech recognition utilization.
|
|
|
Searching in Speech Data
Fapšo, Michal ; Černocký, Jan (referee) ; Szőke, Igor (advisor)
This thesis describes a designed and implemented system for efficient storage, indexing and search in collections of spoken documents that takes advantage of automatic speech recognition. As the quality of current speech recognizers is not sufficient for a great deal of applications, it is necessary to index the ambiguous output of the recognition, i.\,e. the acyclic graphs of word hypotheses -- recognition lattices. Then, it is not possible to directly apply the standard methods known from text--based systems. This paper discusses an optimized indexing system for efficient search in the complex and large data structures which are the output of the recognizer.
|
|
|
Multimodal Database Search
Krejčíř, Tomáš ; Stryka, Lukáš (referee) ; Chmelař, Petr (advisor)
The field that deals with storing and effective searching of multimedia documents is called Information retrieval. This paper describes solution of effective searching in collections of shots. Multimedia documents are presented as vectors in high-dimensional space, because in such collection of documents it is easier to define semantics as well as the mechanisms of searching. The work aims at problems of similarity searching based on metric space, which uses distance functions, such as Euclidean, Chebyshev or Mahalanobis, for comparing global features and cosine or binary rating for comparing local features. Experiments on the TRECVid dataset compare implemented distance functions. Best distance function for global features appears to be Mahalanobis and for local features cosine rating.
|
|
|
Face Identification
Částek, Petr ; Jaša, Petr (referee) ; Chmelař, Petr (advisor)
This document is trying to introduce the reader with issues of identifying the face connected with miscellaneous scanning technologies and enviroments. Inside this document there are mentioned some possibilities of creation unique print of a face so that there would be denied unwanted effects of enviroment and the identification of persons would be possible.
|
|
|
Duplicate Text Identification
Pekař, Tomáš ; Kouřil, Jan (referee) ; Smrž, Pavel (advisor)
The aim of this work is to design and implement a system for duplicate text identification. The application should be able to index documents and also searching documents at index. In our work we deal with preprocessing documents, their fragmentation and indexing. Furthermore we analyze methods for duplicate text identification, that are also linked with strategies for selecting substrings. The thesis includes a description of the basic data structures that can be used to index n-grams.
|
guest ::
