The thesis describes the development of selected wage indicators in regions of the Czech Republic in the period 2002-2014 and predicts the future development of these indicators for the next three years. Subsequently thesis classifies individual regions into clusters based on similarity in terms of wage indicators and selected labour indicators and then compares these clusters within two years - 2002 and 2014. Foundations are taken from the website of the Ministry of Labour and Social Affairs and Public database of Czech Statistical Office. The thesis is divided into theoretical and practical part and contains eight chapters. The theoretical part explains terms of remuneration of workers, describes the selected indicators, regions and used methods. In the practical part is applied time series analysis, principal component analysis and cluster analysis. The results of the analyses are summarized in the conclusion of the thesis.

This thesis describes searching for high-risk clusters of portals in the Ingress game by using data mining techniques. The work contains background for descibed problematics and methods and experiments used to search for theese information.

The initial part of my work is dedicated to overall introduction into the transmission systems and its categories. Further the work is focused on dividing of security codes which are used for transmission systems. In the next chapter is analyzed the problems of error origin, mathematical transcription of errors, categorizing of errors which can generate during transmission. The following chapter deals with description of convolutional codes describing security against errors, principle of serial consecution interpretation on parallastic consecution and visa versa. Here is outlined problems of convolutional codes input. In the next part are mentioned three convolution codes which are used for security against burst errors. In the next chapter is mentioned problems of message interleaving and description of used methods, how they originate and detailed description, how the errors are eliminated with the help of long segment interleaving. In the next chapter are described techniques which are used for clustered errors suppression. The last chapter is dedicated to the practical part of my thesis. There are detail descriptions and simulation techniques how the security of non-secure section is developed, transmission on line, burst errors induction on transmitted secure data and consecutive amendment or clustered errors division in transceiver. For the simulation there were utilized three convolutional codes for clustered errors amendment and two interleaving techniques.

This thesis describes searching for high-risk clusters of portals in the Ingress game by using data mining techniques. The work contains background for descibed problematics and methods and experiments used to search for theese information.

This thesis is meant to present the methods of cluster analysis, their use for detecting network traffic anomalies. It deals with various types of cyber attacks particularly DoS (DDoS) attacks. It contains a list of well-known DoS attacks. Also includes a program in Python, using the k-means method for detection of anomalous traffic.

This thesis is focused on design and implementation of procedural generator of galaxy for games or simulations. Second goal is implementation of demonstration application which is showing possible usage of generator. Generator is able to create galaxy by predefined types or by user created map.

This work involves in anti-error coding systems with interleaving. At first is given summary of high-frequency use error correction codes. Below there are described two basic techniques of interleaving and their confrontation. The next text is focusing on survey and characteristics of codes which conform to submission. After selection of optimal system is verified its function in MATLAB environment. Final step is creation of functional application in C++ environment. This application serves to transmission of error correction BMP pictures.

This master thesis deals with the problems of memory reduction in the stateful network traffic processing. Its goal is to explore new possibilities of memory reduction during network processing. As an introduction this thesis provides motivation and reasons for need to search new method for the memory reduction. In the following part there are theoretical analyses of NetFlow technology and two basic methods which can in principle reduce memory demands of stateful processing. Later on, there is described the design and implementation of solution which contains the application of these two methods to NetFlow architecture. The final part of this work summarizes the main properties of this solution during interaction with real data.