|
|
Suitable methods of data prepration for mutistream compression
Jelínek, Jan ; Žemlička, Michal (advisor) ; Falt, Zbyněk (referee)
This work focuses on compression algorithm called multistream compression. We have tried to improve this algorithm to be competitive with other commonly used compression algorithms. We have also tried to combine it with well-known transformations like BWT or MTF to efficiently handle text files. Another part of the research was compose characters into bigger parts and transform the result by multistream compression. We have tried blocks of constant length like bigrams and blocks of variable length like syllables or words. Last experiments was with small changes of MSC algorithm and compare them with the original algorithm.
|
|
|
Kind ParserConstructor for Java
Kuziel, Peter ; Žemlička, Michal (advisor) ; Bednárek, David (referee)
The work introduces an implementation of parser constructor, based on kind grammars. Kind grammars allow using simple left recursion in syntactic rules, which makes it easier to work with certain constructions such as arithmetic expressions, that are formulated less comprehensibly when using traditional approach with LL(k) grammars.
|
|
|
Implementation of the Integrated Development Platform (IDP)
Dvořák, Petr ; Richta, Karel (advisor) ; Žemlička, Michal (referee)
The aim of the thesis was to design and develop a unified application for installation and integration of the software management tools into a single comprehensive and functional unit. The application should also allow export of the project metadata via the RESTful API. The goals of the thesis were fulfilled relatively well. A set of installation scripts was created, as well as a functional web application built using the JavaEE platform. The application can be deployed in a small company after performing minor modifications. Less common deployment scenarios for CGI based applications on Apache Tomcat were also examined. Minor enhancements in the open-source project NetBeans were implemented as well. Also, a branded version of Bugzilla was created and deployed in an existing small software company.
|
|
|
Compression of dictionary
Kuřík, Stanislav ; Lánský, Jan (advisor) ; Žemlička, Michal (referee)
This thesis deals with improving the existing dictionary compression method TD3. This method is based on encoding of the trie data structure, which is pre x tree serving as a storage of an associative array in which strings are used as keys. TD3 encodes each node using Elias Gamma and Delta codes. First enhancement over TD3 is replacing Elias codes with static and adaptive Hu man coding. Next improvements present a di erent way the node information are coded. The new TD4 method was benchmarked on a huge corpus and this thesis comprises among others an evaluation of the measured results.
|
|
|
Collecting XML data and meta-data from the Internet
Sochna, Jan ; Bednárek, David (advisor) ; Žemlička, Michal (referee)
The Diploma Thesis is targeted to design and implement the system for collecting XML-family data from the Internet. The aim of the task is to automate the data collection process and download full structures of XML documents. A comparison of four existing data collection systems took place at the beginning to choose one of the systems as a base of the solution. The open source web crawler Apache Nutch was identified as the most suitable. Then necessary extensions and modifications of the crawler were designed and implemented in order to make the crawler efficient in downloading XML-family documents. Downloaded XML-family data were analyzed and evaluated using the Analyzer application, which was enhanced within this Diploma Thesis in order to process the data. The main outcome of Diploma Thesis is an exploitable system collecting the XML-family documents from the Internet. Implemented modification and extensions of the system lead to elimination of "useless" documents download, improving the ratio targeted XML-family documents.
|
|
|
Virtualisation of Surveillance Systems
Koňas, Jakub ; Kopecký, Michal (advisor) ; Žemlička, Michal (referee)
Title: Virtualisation of Surveillance Systems Author: Jakub Koňas Department: Department of Software Engineering Supervisor: RNDr. Michal Kopecký, Ph. D. Supervisor's e-mail address: Michal.Kopecky@mff.cuni.cz Abstract: This thesis studies the procedures in the field of security, building and lifesafety management focused at rising necessity of securing buildings in geografically large areas. The opening chapters of the thesis explain the principles of facility management relevant to security and present current progress in the field. It creates new comprehensive source of information based on the experience of security specialist that Czech languge lacks. The following chapters define new terms in the field of security - large area (LA) and securing the LA (SLA) - and specify the essential qualities of SLA systems. Subsequent part of the thesis discusses possible architecture of the SLA system and proposes own solution based on ideas of service architecture and OPC. The thesis contains partial implementation of the crutial element of the framework - the virtual device. The final chapters demonstrates needed qualities of the framework using its sample application. Keywords: surveillance system, security, large area, virtual device, framework
|
|
|
Digital photography and Czech Internet
Budínková, Barbora ; Štanclová, Jana (advisor) ; Žemlička, Michal (referee)
This bachelor thesis is devoted to the area of the Internet photo labs. Nowadays these applications constitute one of the ways of mediating the transfer of digital photographs from the author to print. As digital photographs gain more and more popularity, the role of the Internet photo labs gains more importance. The aim of this thesis is an analysis of the photo labs that are currently available on the Czech Internet. This analysis will focus on the user's possibilities and on several aspects of the technical execution of the relevant web pages. An application which will try to improve current possibilities will be created according to this analysis.
|
|
|
Internal IS for travel agency
Selement, Pavel ; Hoksza, David (advisor) ; Žemlička, Michal (referee)
The task of the work is to design and implement an information system for a travel agency. The system is supposed to assist at business of a small travel agency. Editing of capacities, booking and selling, voucher printing and sale statistics are all problems to deal with. Application is designed only for inside use in a travel agency and for its contract partners, it's not intended as a booking software for clients. There are some accountant information and cost items in system because of this focus. Coffers control can be managed thru the application interface and user management is of course also part of this application. The system allows mass import of data due to a lot of data which have to be inserted into it.
|
|
|
Run-time syntax extensions
Šašek, Pavel ; Žemlička, Michal (advisor) ; Bednárek, David (referee)
Extensible languages are more and more popular now and bring many advantages. Such languages contain a relatively small base which a programmer can learn easily and are better adjustable for a particular problem { the code is then more legible, easier to debug and maintain. This work deals with the possibility of syntax extensions during the input text analysis, the input text can contain instructions for such extensions. An extension can be either permanent (valid to the input text end) or local (valid just temporarily). The work brings an implementation of an extensible parser based on kind grammars which supports permanent and local extensions.
|
|
|
Efficient shortest path search in the public transportation networks
Martínek, Vladislav ; Žemlička, Michal (advisor) ; Kopecký, Michal (referee)
The search for the shortest path is one of the most studied graph problems with interesting applications in various elds. One such eld is human mass transportation, where the path length depends on the time tables of the tra c relations, which implements the path. Goal of this study is to nd efficient algorithm for the shortest path search in human mass transportation network and implement it in the library, which will be also useable on portable devices. The possibilities of time tables preprocessing and use of heuristics on search acceleration will be explored during implementation.
|
guest ::
RSS feed.