|
|
Visual experince as example and pattern in relation to the expansion and influence into human life
Nohejl, Jiří ; Czumalo, Vladimír (advisor) ; Vojtěchovský, Miroslav (referee)
The main theme of this dissertation is to define an image as a visual experience. The human interaction is described by the author himself as a perception of the image, which serves as an information unit that could be presented as a possibility, example and pattern for the individual. There is an emphasis on the process of perception itself and on the way of interaction of an individual emphasizing the context of social learning and imitation in this text. The analysis of the principles of this interaction leading into introduction of the partial interactive models covering these processes is formed by the essential plane. The structure of the thesis is divided into ten main chapters in which the author tries to introduce a category of perception, a definition of the image and imitation as a tool of cultural transmission, presentation of the units of this transmission, the process of the interaction itself and analogous example of the fundamental role that a person in this interaction holds. There are also three analogies of these roles, which refer to the anthropological universal interaction describing the man as a gatherer and hunter. Their main purpose is to illustrate the form of a human experience better. Finally, there are reflections on the topic above. The possibilities and results, which...
|
|
|
Comparison of Tree Edit Distance Algorithms
Ivkin, Egor ; Nečaský, Martin (advisor) ; Lokoč, Jakub (referee)
The aim of this thesis is the comparison of the Tree Edit Distance methods, in the context of detecting structural similarity between two XML Schema documents. The methods search the minimum number of edit operations leading from one tree to another. We have analysed and implemented a wide range of the existing tree edit distance approaches. It is important to understand that the distance computed by the algorithms is affected by the set of used edit operations, therefore the strength in detecting XML Schema similarity differs in each approach. The first part of this work contains the description of the used approaches and necessary notations. The second part provides implementation details and analysis of the described methods, which consists of theoretical comparison and empirical evaluation on real and synthetic xml data. The resulting implementation is available in the form of Java SE application.
|
|
|
Generic Reverse Compilation to Recognize Specific Behavior
Ďurfina, Lukáš ; Šaloun, Petr (referee) ; Zahradnický,, Tomáš (referee) ; Kolář, Dušan (advisor)
Práce je zaměřena na rozpoznávání specifického chování pomocí generického zpětného překladu. Generický zpětný překlad je proces, který transformuje spustitelné soubory z různých architektur a formátů objektových souborů na stejný jazyk na vysoké úrovni. Tento proces se vztahuje k nástroji Lissom Decompiler. Pro účely rozpoznání chování práce zavádí Language for Decompilation -- LfD. LfD představuje jednoduchý imperativní jazyk, který je vhodný pro srovnávaní. Konkrétní chování je dáno známým spustitelným souborem (např. malware) a rozpoznání se provádí jako najítí poměru podobnosti s jiným neznámým spustitelným souborem. Tento poměr podobnosti je vypočítán nástrojem LfDComparator, který zpracovává dva vstupy v LfD a rozhoduje o jejich podobnosti.
|
|
|
The use of numerical representations in processing of nucleotide sequences
Košíček, Adam ; Maděránková, Denisa (referee) ; Kubicová, Vladimíra (advisor)
Conversion of DNA sequences for appropriate representation is important task before initiation of analyzes and further processing. The main goal of this work was to get familiar with types of numerical and graphical representations and their application for DNA analyzes. In consideration of great volume of methods and procedures, only a few were chosen for this work. Some methods can not be classified only as numerical or graphical representations, because of option allowing them to be converted into both of these representations. These methods were classified as graphical representations. Phylogenetic trees were programmed for chosen methods to compare its precision. Outcome of this work is summing up the results.
|
|
| |
|
|
Semantic Similarity Methods in Folksonomies
Kadlec, Jan ; Otrusina, Lubomír (referee) ; Schmidt, Marek (advisor)
Bakalářská práce byla vypracována na studijním pobytu na "Aalborg University" v Dánsku, a byla zpracována v angličtině. Folksonomie jsou nový, uživateli řízený přístup ke klasifikaci a důležitá čast Web 2.0. Jsou také jediným přístupem, který je schopen udržet krok s dnešní rychlostí expanze webu, tím že předá uživatelům odpovědnost za klasifikaci. Pokud folksonomie obsahují dostatečné množství dat, dají se k mnohému využít. Tato práce se zaměřuje na metody sémantické podobnosti ve folksonomiích. Cílem této práce bylo odzkoušet mnohé metody na vzorku tří datových sad - delicious.com, Last.fm a medworm.com. Toto bylo vykonáno za pomocí kotvících dat z WordNetu, Open Directory Project a zdravotně orientované ontologie. Výsledky přinesené touto prací indikují, že metody sémantické podobnosti mohou být použity k úspěšnému měření podobností v mnohých doménách.
|
|
|
MediaDiff - Diff for Static Images
Brothánek, Jan ; Mlích, Jozef (referee) ; Chmelař, Petr (advisor)
This bachelor's thesis focuses on comparison of digital documents, especially static images. This paper presents algorithms, which are usable for general data comparison and also specific algorithms major in image data comparison. We introduce possibilities of document comparison which are now available for users. On the basis of this current situation, a prototype of new modular application MediaDiff for various documents comparison is designed and implemented. We describe in detail each stage of the application development, problems which had arisen and their solutions. The possibilities of future development of the application are discussed.
|
|
|
Program Similarity Recognition Based on Behaviour Analysis
Otočka, Dávid ; Vojnar, Tomáš (referee) ; Peringer, Petr (advisor)
The goal of this master thesis was to design an algorithm that will be able to measure the difference between two programs based on their behavioral description. For the algorithm needs, the Levenshtein distance method between two strings and NCD method, were used. Both methods have their implementation approach and test result described. This term also discusses various methods of program analysis in virtual machine environment, as well as explanation of some basic concepts regarding malware analysis.
|
|
|
Image Retrieval Based on Color Histograms
Sailer, Zbyněk ; Hradiš, Michal (referee) ; Beran, Vítězslav (advisor)
This thesis deals with description of existing methods of image retrieval. It contains set of methods for image description, coding of global and local descriptor (SIFT, etc.) and describes method of effective searching in multidimensional space (LSH). It continues with proposal and testing of three global descriptors using color histograms, histogram of gradients and the combination of both. The last part deals with similar image retrieval using proposed descriptors and the indexing method LSH and compares the results with the existing method. Product of this work is an experimental application which demonstrates the proposed solution.
|
|
|
Clustering of Biological Sequences
Kubiš, Radim ; Burgetová, Ivana (referee) ; Martínek, Tomáš (advisor)
One of the main reasons for protein clustering is prediction of structure, function and evolution. Many of current tools have disadvantage of high computational complexity due to all-to-all sequence alignment. If any tool works faster, it does not reach accuracy as other tools. Further disadvantage is processing on higher rate of similarity but homologous proteins can be similar with less identity. The process of clustering often ends when reach the condition which does not reflect sufficient quality of clusters. Master's thesis describes the design and implementation of new tool for clustering of protein sequences. New tool should not be computationally demanding but it should preserve required accuracy and produce better clusters. The thesis also describes testing of designed tool, evaluation of results and possibilities of its further development.
|
guest ::
