|
|
Self-organizing linear lists
Kulman, Igor ; Koubková, Alena (advisor) ; Babka, Martin (referee)
Self-organizing linear lists Self-organizing linear lists are data structures for fast search, provided that certain elements stored in them are searched more frequently than others, while the probability of access to individual elements is generally not known in advance. Efficient search is achieved using different permutation rules that keep changing the list structure so that the more frequently searched elements are closer to the beginning. This thesis gives an overview of known algorithms for solving this problem (with the theoretical results about their complexity, if they are known), and experimental study of their behavior (using its own or freely available implementations and software for generating input data, testing algorithms and processing the results of experiments).
|
|
|
Journey - Mountain to circumvention
Hůlová, Martina ; Kornatovský, Jiří (advisor) ; Hůla, Zdenek (referee)
This thesis presents my personal view of the art and the world around us. Primary issue is the understanding of life and art as a journey and an infinite search. Based on this perspective, the specific topics like art, forms and means of expression, symbolism, concept of a journey, time and work of different artists are being surveyed both generally and specifically. Through the survey of those topics, connections and coherences are being found. This thesis also consists of an analysis of my own art work (painting) and my didactic praxis together with a subject of didactics. The elements of contemplation penetrate the entire thesis.
|
|
| |
|
|
Bidirectional heuristic search
Hřebejk, Tomáš ; Vyskočil, Tomáš (advisor) ; Zajíček, Ondřej (referee)
The purpose of this bachelor thesis is to summarize the most important results on bidirectional heuristic search and to bring some new thoughts. Two algorithms are described which attempt to improve the best algorithms in this field. The algorithms were experimentally compared with a unidirectional algorithm. According to the result of the comparison, we can state that bidirectional heuristic algorithms can be much faster than unidirectional heuristic algorithms. The text also describes how to solve some problems by shortest-path algorithms and how to make a good heuristic. A program which can solve a generalized puzzle was created as a demonstration.
|
|
|
Algorithms for Parallel Searching in XML Datasets
Kruliš, Martin
This thesis will address the problems of indexing XML datasets and finding effective searching methods for indexed data. Defining data structures and algorithms that take highly parallel approach to the searching problem is considered to be main objective, therefore the implementation may benefit from the power of multicore CPUs. Prototype of such implementation will be presented with the thesis. Internal query model will be developed as a common layer. Multiple front-ends representing different query languages will be able to operate on the top of this model, thus the engine will not be dependent on any particular language. Sample front-end for a subset of XPath will be implemented along with the prototype.
|
|
|
Automatically Updated Web Portal
Staněk, Petr ; Škoda, Petr (referee) ; Smrž, Pavel (advisor)
This bachelor's thesis is dedicated to the design and implementation of an automatically updated web portal that tries to resolve the shortcomings of the portals filled with other people's content. Furthermore, it presents a comparison of the existing scientific portals, it discusses the problems of extraction, saving and searching for information. General mechanisms are demonstrated on the European research projects portal, which removes the shortcomings of CORDIS, the official information portal for European research and development. The thesis takes the existing product as a prototype and its aim is to improve the quality of the extraction and extend the system to detect any potential problems and notified an administrator of them. This was achieved by increasing the robustness and speed of the extractor, by registering all the important events associated with the extraction and, on the other side, the implementation of the separate administrator section of the web portal, which informs the administrator about problems and offers the problem-solving devices.
|
|
|
Detection of Homologous Enzymes
Gajdoš, Pavel ; Burgetová, Ivana (referee) ; Martínek, Tomáš (advisor)
Tato práce se zabývá vyhledáváním homologních enzymů v proteinových databázích, jejímž cílem je navrhnout nástroj poskytující takové vyhledávání. Čtenář se seznámí se základní teorií týkající se proteinů, enzymů, homologie, ale také s existujícími nástroji pro vyhledávání homologních proteinů a enzymů. Dále je popsáno ohodnocení nalezených existujících nástrojů pro vyhledávání homologních enzymů. Pro potřeby vyhodnocení byla vytvořena datová sada spolu s algoritmem pro vyhodnocení vyýsledků jednotlivých nástrojů. Další částí práce je návrh a implementace nové metody pro vyhledávání homologních enzymů společně s jejím vyhodnocením. Jsou popsány dva algoritmy (One-by-One a MSA) pro vyhledávání homologních enzymů, jejichž porovnání ukazuje, že MSA algoritmus je zanedbatelně lepší z hlediska přesnosti než One-by-One algoritmus zatímco z hlediska rychlosti vítězí One-by-One algoritmus.
|
|
|
Web Base Video Player with Slides and Transcript
Koriťák, Jan ; Černocký, Jan (referee) ; Szőke, Igor (advisor)
Content of this thesis is dedicated to problematics of design and implementation of a web base video player with slides as a JavaScript plugin. As the outcome of this thesis is supposed to replace an already existing player , the first chapter is dedicated to it's throughout analysis . Following chapters are the dedicated to desing , implementation and testing of the player , using information acquired in the phase of analysis .
|
|
|
Indikator position behind the wall
Pecha, Václav ; Marcoň, Petr (referee) ; Szabó, Zoltán (advisor)
The work sums up the basic measurement principles for different kinds of searching devises. It deals with measurement using resonance. The feature of resonance and measurement techniques are described to set the location of the radiating circuite. The work contains the design of a locator of position behind a wall itself as well as the concrete switch connection, schema and description of receiver and emitter in the circuit.
|
|
|
How Can We Google More Effectively?
Kolesárová, Lucia ; Shapiro, Irina (referee) ; Macháček, Mikuláš (advisor)
Current Google provides almost all type of information in a similar way - list of web pages. But Each information needs a different manner of mediation. A different way of visualisation. Therefore I decided to create Google of tomorrow. I am focused on a new way of spreading information and communication. I created new tools which help to achieve this vision. These tools operate in augmented reality. My diploma is mainly work of design fiction and information design. I use extrapolation to create possible future scenarios. Future abilities of Google tools are extrapolated from its current technologies.
|
guest ::
