This thesis deals with detection of the natural frequencies in the material structures using algorithms working in real-time. It is used for detection of material damage. Is described physic of material, issue of discrete signals and their spectrums and methods for the calculation of the spectral components of the signal. These metods are implemented to Matlab programming environment. Methods are tested with simulated data and real signal.

The main topic of this thesis is the practical use of OpenCL at AVG company. AVG is looking for ways to decrease hardware requirement of their security product and also to decrease computation time of some algorithms. Using OpenCL is one way to achieve this requirement. Significant part of this thesis deals with optimization strategies for AMD and NVIDIA graphics cards as they are most common cards among users. Practical part of the thesis describes parallelization of two algorithms, their analysis and implementation. After that, the obtained results are presented and cases in which the use of OpenCL is beneficial are identified. As a part of implementation, library containing various utility functions which can aid programmers to implement OpenCL based code was developed.

This thesis deals with factors influencing the average speed on Czech roads. Curvature and inclination of the slopes were selected among the main factors influencing the average speed. Until now, these factors have been considered at discrete intervals, not as continuous functions. The function for calculating the curvature is based on ČSN 73 6101, where the equation with all variables is directly defined. The functional relationship for the movement of vehicles in sloping terrain was created from data from scientific articles. Therefore, an algorithm was implemented in this thesis, which can automatically evaluate the average speed on the road network. Python was used to implement this algorithm. Furthermore, there is a testing section for travel times, which is validated using route planners and also supported by extensive field research. Testing took place in GIS using network analysis methods. Testing has shown that the inclusion of curvature and inclination will significantly improve the calculation of travel times. key words: network analyst, curvature, gis, algorithm

This thesis deals with shortest paths problem in graphs. Shortest paths problem is the basic issue of graph theory with many pracitcal applications. We can divide this problem into two following generalizations: single-source shortest path problem and all-pairs shortest paths problem. This text introduces principles and algorithms for generalizations. We describe both classical and new more efficient methods. It contains information about how some of these algorithms were implemented and offers an experimental comparison of these algorithms.

Data profiling is the process of analyzing data and producing an output with statistical summaries. The size of data rapidly increases and it is more difficult to process all data in a reasonable time. All data can not be stored in RAM memory, so it is not possible to run exact single-pass algorithms without using slower computer storage. The diploma thesis focuses on the implementation, comparison, and selection of suitable algorithms for data profiling of large input data. Usage of approximate algorithms brings a possibility to limit mem- ory for computation, do the whole process in RAM memory and the duration of data profiling should be reduced. The tool can compute frequency analysis, cardinality, quantiles, histograms, and other single-column statistics in a short time with a relative error lower than one percent.

This work concerns new borders, heuristics, algoritms and mathematic models of pallet loading problem (PLP). We try to describe these computational methods and find out if we can use them in real. We maximalize number of boxes placed on rectangular pallets in a particular warehouse by using chosen heuristics. Every box has a rectangular form with the same lenght and width and is fully placed on the pallet. We can rotate with the box by 90% degree until it is fixed as we want and its side lies parallelly with side of the pallet. All instances are setted in model (X, Y, a, b), where X is lenght, Y width of the pallet, a lenght and b width of the box.

This thesis deals with image filter design using coevolutionary algorithms. It contains a description of evolutionary algorithms, focusing on genetic programming, cartesian genetic programming and coevolution, the reader can learn about image filters too. The next chapters contain the design of image filters and noise detectors using cooperative coevolution, and the implementation and testing of the proposed filter. In the last chapter the proposed filter is compared to other filters created using evolutionary algorithms but without coevolution.

This thesis deals with the description of the state of resource-constrained project scheduling problem. It defines the formal problem and its complexity. It also describes variants of this problem. Algorithms for solving RCPSP are presented. Heuristic genetic algorithm GARTH is analyzed in depth. The implementation of prototypes solving RCPSP using GARTH is outlined. Several improvements to the original algorithm are designed and evaluated.

This work is intended on identification with basic problems from the graphs theory area. There are the basic conceptions as well more complicated problems described. The one part of this work is specialized in working of individual types of graphs. It starts with single linked list through double linked list after as much as trees which represented the simplest graphs textures. The other part of this work devotes to the whole graph and describes more complicated problems and their resolution from the theory graphs area. Among these problems belongs to searching in graphs help by Depth First Search and Breadth First Search methods. Then searching the shortest way help by the specific algorithms as are: Dijkstra´s algorithm, Floyd-Warshall´s algorithm and Bellman-Ford´s algorithm. The last part is devoted to problems with searching minimal frames of graphs with usage Kruskal´s algorithm, Jarnik´s algorithm and Boruvka´s algorithm methods.

The Master Thesis deals with logistic module innovation of information system ERP. The principle of innovation is based on implementation of heuristic algorithms which solve Travel Salesman Problems (TSP). The software MATLAB is used for analysis and tests of these algorithms. The goal of Master Thesis is the comparison of selections algorithm, which are suitable for economic purposes (accuracy of solution, speed of calculation and memory demands).