|
|
Data structures for rendering non-polygonal geometry
Kuckir, Ivan ; Křivánek, Jaroslav (advisor) ; Vorba, Jiří (referee)
In modern 3D graphics, scenes made of triangles are usually used, combined with methods based on ray tracing. Hierarchical data structures, called accelerating trees, are often used to speed up the search for intersection between ray and the scene. When testing the best current methods with non-polygonal geometry (line segments), we have found out that those structures cannot build an effective tree in many cases. The aim of this work is to formulate the problem mathematically. Thanks to this, the whole subject becomes more transparent and we can see the shortcomings of current methods, which have not yet been pointed out. At the result, we develop an algorithm which generalizes all current methods, which is not dependent on geometry and directly shows the space for improvement.
|
|
|
Persistent data structures in C
Hájek, Jakub ; Kopecký, Michal (advisor) ; Falt, Zbyněk (referee)
Persistent data structures in C Abstract: This work describes the design and implementation of persistent data structures framework for C programming language. It discusses effective imple- mentation of persistent structures and providing transparent manipulation of data. This work defines services which should be provided by persistent layer and tries to define some general persistent layer interface for good extensibility. In the end it analyses performance issues of various data storages and tries to specify class of applications, which could use persistent data structures framework. Keywords: persistent tree structures, C, data structures
|
|
|
Scalable link-time optimization
Láska, Ladislav ; Hubička, Jan (advisor) ; Mareš, Martin (referee)
Both major open-source compilers, GCC and LLVM, have a mature link-time optimization framework usable on most current programs. They are however not free from many performance issues, which prevent them to perform certain analyses and optimizations. We analyze bottlenecks and identify multiple places for improvement, focusing on improving interprocedural points-to analysis. For this purpose, we design a new data structure derived from Bloom filters and use it to significantly improve performance and memory consumption of link-time optimization. Powered by TCPDF (www.tcpdf.org)
|
|
| |
|
|
Desktop Search for Linux
Prívozník, Michal ; Schmidt, Marek (referee) ; Smrž, Pavel (advisor)
This work deals with indexing, difeerent types of indexing structures their advantages and disadvantages. It provides the basis for a search engine with support of morphology or difeerent file formats. Provides insight to the basic ideas, which answer is aim of the master's thesis.
|
|
|
System for Support of Dynamic Data Structures Learning
Trávníček, Jiří ; Grulich, Lukáš (referee) ; Křena, Bohuslav (advisor)
The main objective of this work is to design and implement an application that can be used as an aid for the education of programming essentials. Particularly, the attention focuses on the domain of dynamic data structures. The target application will be implemented with the use of web technologies so that it can be run in an ordinary WWW browser. First of all, a brief introduction recapitulates the data structures to be covered. Then the work summarizes the usable technologies available within the web browsers with the focus on the particular technology (which is DHTML) that will become the target platform. The most significant part of this work then discusses the design of the final application. This rather theoretical part is then followed by the description of the practical implementation. A short user manual is also included.
|
|
|
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.
|
|
|
Control and data structures in programming languages
Janeček, Jan ; Smrž, Jaroslav (referee) ; Dvořák, Jiří (advisor)
The essence of this work is to give basic information about the algorithm development and general pieces of knowledge of the structures in programming languages. These pieces of knowledge are specified for selected programming languages, to comparison is performed and application examples based on specific patterns for corresponding language are presented.
|
|
|
Design of Data Structures using RDFS/OWL
Horáková, Linda ; Dudáš, Marek (advisor) ; Mynarz, Jindřich (referee)
The main aim of the bachelor thesis is to explore possibilities and advantages of publishing statistical data on Semantic Web according to Linked Data Principles. In theoretical part readers are familiarized with basic features of Semantic Web, principles and options of publishing Linked Data. The thesis is mainly focused on an analysis of existing vocabularies used for description of statistical data, especially in the field of public spending. The outcome of the analysis is the statement that general vocabularies are more suitable for description of statistical data, because they provide wider possibilities than proprietary ontologies. The result of the analysis was verified by the draft concept of data structure describing the field of public spending, which is based on general Data Cube Vocabulary. The practical part of the thesis also contains construction of SPARQL query which can be used for automatic transformation of current data to the shape that is suitable to the new data structure.
|
|
|
Market analysis of corporate performance management tools
Jalůvková, Klára ; Pour, Jan (advisor) ; Grof, Martin (referee)
The thesis concentrates in analysis of enterprise management tools, that are known as Corporate Perfmormance Tools (hereinafter CPM) and its implementation. Tools from the market leaders will be analysed. Market research from Gartner Inc. will be used as a guide in defining the desired group. The main objective of this elaborate is putting together a set of recommendations of how to implement a CPM solution. Determine critical success factors. A particular target, that helps in defining the implementation phases is a comparison of tools from the CPM market leaders. The targets of the thesis will be reached by description of the theoretical concept and analysis of selected tools, comparison of tools portfolios of selected enterprises from the point of view of the concept complexity and comparison of the theoretical background, technical solution and degree of outer and inner integration. Desciption of the theoretical concept and CPM tools portfolio analysis serves as starting point for determination of correct implementation process. Recommended implementation process and identification of critical success factors are the contribution of the author to this topic. The elaborate is divided into theoretical and analytical parts. The theoretical part consists of introduction, data acquisition methodology and description of the CPM theoretical concept. The analytical part is divided into two main chapters - that is: Market analysis and Implementaion of CPM solutions. The thesis is finished by conclusions summary and suggestions for the topic development.
|
guest ::
