National Repository of Grey Literature 27 records found  beginprevious18 - 27  jump to record: Search took 0.01 seconds. 
Hybrid databases
Hušek, Radek ; Mareš, Martin (advisor) ; Lokoč, Jakub (referee)
This thesis presents design and implementation of a data structure, which tries to combine advantages of both databases and regular data structures. Main advantages of databases we try to retain are data persistence through storing data on a hard disk and working with data using transactions which allows us parallel access without danger of inconsistency. From data structures we borrow the implementation as a library of functions and the aim on simplicity and storing data in memory. Our implementation is built around the concept of (software) transactional memory; all data are stored on hard drive as log of operations. 1
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)
Code
Belica, Michal ; Janoušek, Vladimír (referee) ; Martinek, David (advisor)
This bachelor's thesis describes implementation of plugin of Code
Graphical Presentation of the Chosen Perfect Hash Algorithm
Kubica, Jakub ; Puš, Viktor (referee) ; Kaštil, Jan (advisor)
The main subject of this document is basic application in Java, which presents perfect hash algorithms, in particular algorithm CHM and FCH. Further this works is focused on design od intuitive graphic user interface and clarigying some terms in the field of hashing.
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.

National Repository of Grey Literature : 27 records found   beginprevious18 - 27  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.