|
|
Mobile application for canteens
Mareš, Martin ; Kofroň, Jan (advisor) ; Matěna, Vladimír (referee)
This thesis focuses on the design and development of a mobile application for Android platform. This application can be used for browsing and ordering meals at public canteens. Unlike other similar projects, this application is extensible by plugins. This approach gives the user the ability to browse meals from different canteens in the environment of one application. This application also supports multiple user profiles and works in off-line mode. This thesis also includes a few plugins as an example and plugin development documentation for the easy extension of new plugins. 1
|
|
|
An implicit representation of sets
Lieskovský, Matej ; Mareš, Martin (advisor) ; Majerech, Vladan (referee)
The 2003 paper by Gianni Franceschini and Roberto Grossi titled "Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees" suggests a data structure that supports Insert, Find and Delete operations in O(log n) worst-case time while also being implicit and cache-oblivious. We explain the general idea of the original data structure, identify flaws and gaps in its description, and describe a reimagined version of one of the two major components of the data structure. 1
|
|
|
Generator of nanotubes
Macková, Kateřina ; Mareš, Martin (advisor) ; Král, Karel (referee)
The clay mineral called halloysite with crystalline structure is widely used in the world of physics due to its effective properties. The main goal of this thesis is to create a program that creates various tubular nanostructures of this material according to input crystal cell and other parameters. After the creation, whole halloysite structure can be used for other physical research.
|
|
|
Expander codes
Calábková, Markéta ; Mareš, Martin (advisor) ; Hušek, Radek (referee)
Wherever information is transmitted we can find error-correcting codes. LDPC (low density parity check) codes are one of frequently used classes of codes and expander codes are promising members of this class. In this work, we explain what expander code are. We also show that expander codes simulta- neously have both asymptotically optimal parameters and linear-time encoding and decoding. Unfortunately, our constructions grant us codes, which are too big for regular use, for example for packet transmission. However, we believe that with better construction of expander graphs we will be able to construct short codes with significant practical applications. 1
|
|
|
HelenOS routing and porting of BIRD
Gálfy, Stanislav ; Děcký, Martin (advisor) ; Mareš, Martin (referee)
Capability to route can be considered as one of the key features of a modern multipurpose operating system, which HelenOS aims to be. The goal of this master thesis is to explore current HelenOS routing capabilities, enhance them and empower HelenOS with BIRD. HelenOS will become a routing operating system with awareness of its surroundings. It will be capable of dynamic adaptation to changes in the network and their propagation.
|
|
|
Comparison of Top trees implementations
Setnička, Jiří ; Majerech, Vladan (advisor) ; Mareš, Martin (referee)
Comparison of Top trees implementations - Abstract Jiří Setnička Definition and description of Top trees and introduction of problems solvable by them including problem of edge 2-connectivity. Definition and description of Topology trees used as one of the drivers for Top trees. After the initial descriptions the two top trees implementations are introduced: one based on self adjusting trees, second based on topology trees. Comparison of these implementations is done by two experiments. Measurements are discussed in conclusion - results corresponds with initial estimates but with different multiplicative constant than expected. 1
|
|
|
HelenOS routing and porting of BIRD
Gálfy, Stanislav ; Děcký, Martin (advisor) ; Mareš, Martin (referee)
Capability to route can be considered one of key features of modern multipurpose operating system, which HelenOS aims to be. Goal of this master thesis is to explore current HelenOS routing capabilities, enhance them and empower HelenOS with BIRD. Thanks to BIRD, HelenOS will become a routing operating system, that is aware of its surroundings and is capable of dynamic adaptation to changes in network, it is part of.
|
|
|
Web site inspector
Mansurov, Alexandr ; Mareš, Martin (advisor) ; Veselý, Pavel (referee)
Our goal is to develop a tool for automatic website checking. We created an ex- tensible system that checks the validity of links as well as HTML and CSS syntax. For that, we integrated existing tools and libraries into one application using plu- gins. Our tool looks for links in HTML and sitemaps. Also, robots.txt including crawl-delay implementation and sitemap discovery is supported. The course of inspection can be affected by configuration rules. Plugin categorization allows for customization of inspection. Not only we verify the validity of standard hypertext links but also links through other HTML tags (images, frames, cascading styles, scripts). In addition, canonical addresses and redirection, duplicates in content or usage of non-semantic tags or attributes are detected. The developed application is extensible for other types of checks. 1
|
|
|
Urban transport planner
Pokorný, Tomáš ; Mareš, Martin (advisor) ; Pangrác, Ondřej (referee)
Travelling in the city is a part of everyday life for many people. It is sometimes difficult to choose the right combination of walking and public transport especially in unfamiliar parts of the city. We processed publicly available data and made a search engine for multimodal paths. The search engine was designed to be able to personalise results according to user needs and could be used as a web application or a shared library.
|
|
|
A decentralized file synchronization tool
Štědronský, Filip ; Mareš, Martin (advisor) ; Hušek, Radek (referee)
We explore the problem of file synchronization, with the goal of improving on the efficiency, scalability, robustness, flexibility and security of current file synchronization tools. We solve several important subproblems that may help this, especially in the areas of filesystem change detection (both online and offline) and peer-to-peer synchronization of file metadata. We show techniques to make scanning a file system for changes faster and more reliable. We extend the Linux kernel's 'fanotify' filesystem change notification API to report more events, especially renames. We present several original solutions to the set reconciliation problem and its variants and apply them to metadata synchronization. 1
|
guest ::
RSS feed.