|
|
Optimization of Run Configurations of k-Wave Jobs
Sasák, Tomáš ; Jaroš, Marta (referee) ; Jaroš, Jiří (advisor)
This thesis focuses on scheduling, i.e. correct approximation of configurations used to run k-Wave simulations on supercomputers from the IT4Innovations infrastructure. Especially, for clusters Salomon and Anselm. A single work is composed of a set which contains many simulations. Every simulation is executed by some code from the k-Wave toolbox. To calculate the simulation, it is necesarry to select a suitable configuration, which means the amount of supercomputer resources (number of nodes, i.e. cores), and the duration of the rental. Creation of an ideal configuration is complicated and is even harder for an inexperienced user. The approximation is made based on the empiric data, obtained from multiple executions of different sets of simulations on given clusters. This data is stored and used by a set of approximators, which performs the actual approximation by methods of interpolation and regression. The text describes the implementation of the final scheduler. By experimenting, the most efficient methods for this problem has found out to be Akima spline, PCHIP interpolation and cubic spline. The main contribution of this work is creation of a tool which can find suitable configuration for k-Wave simulation without knowing the code or having lots of experience with its usage.
|
|
|
Deep Neural Network Optimization
Bažík, Martin ; Wiglasz, Michal (referee) ; Sekanina, Lukáš (advisor)
The goal of this thesis was to design, implement and analyze various optimizations of deep neural networks, in order to improve the observed parameters. The optimizations are based on modification of the data representation used by neural network operations and searching for the best combination of its hyper-parameters. The convolutional neural networks used for these optimizations were built on LeNet-5 architecture and trained on MNIST, CIFAR-10, and SVHN datasets. The neural networks and their optimizations were implemented within Tiny-dnn library using C++ programming language.
|
|
|
Interpolation with NURBS curves
Škvarenina, Ľubomír ; Rajmic, Pavel (referee) ; Zátyik, Ján (advisor)
Diploma thesis deals with image interpolation. The aim of this work is to study theoretically and then describe the nature of the various methods of image interpolation and some of them implemented in the program MATLAB. The introductory part of this work theoretically closer to important terms that are closely related to this topic of digital image processing sufficient to understand the principle. In the following of the thesis will be discussed all of today's commonly used method of image interpolation. Will hear all about the method of image interpolation using nearest neightbor interpolation and image help of polynimals such as (bi)linear, (bi)quadratic and (bi)kubic method. Then work theoretically analyzes the theory of individual species curves and splines. More specifically, coming to their most frequently used variants of B-spline curves and ther generalizations called NURBS, with addressing the problem of interpolating these curves. The final chapter consists of the results achieved in the program MATLAB.
|
|
|
Optimization of Run Configurations of k-Wave Jobs
Sasák, Tomáš ; Jaroš, Marta (referee) ; Jaroš, Jiří (advisor)
This thesis focuses on scheduling, i.e. correct approximation of configurations used to run k-Wave simulations on supercomputers from the IT4Innovations infrastructure. Especially, for clusters Salomon and Anselm. A single work is composed of a set which contains many simulations. Every simulation is executed by some code from the k-Wave toolbox. To calculate the simulation, it is necesarry to select a suitable configuration, which means the amount of supercomputer resources (number of nodes, i.e. cores), and the duration of the rental. Creation of an ideal configuration is complicated and is even harder for an inexperienced user. The approximation is made based on the empiric data, obtained from multiple executions of different sets of simulations on given clusters. This data is stored and used by a set of approximators, which performs the actual approximation by methods of interpolation and regression. The text describes the implementation of the final scheduler. By experimenting, the most efficient methods for this problem has found out to be Akima spline, PCHIP interpolation and cubic spline. The main contribution of this work is creation of a tool which can find suitable configuration for k-Wave simulation without knowing the code or having lots of experience with its usage.
|
|
|
Deep Neural Network Optimization
Bažík, Martin ; Wiglasz, Michal (referee) ; Sekanina, Lukáš (advisor)
The goal of this thesis was to design, implement and analyze various optimizations of deep neural networks, in order to improve the observed parameters. The optimizations are based on modification of the data representation used by neural network operations and searching for the best combination of its hyper-parameters. The convolutional neural networks used for these optimizations were built on LeNet-5 architecture and trained on MNIST, CIFAR-10, and SVHN datasets. The neural networks and their optimizations were implemented within Tiny-dnn library using C++ programming language.
|
|
|
Interpolation with NURBS curves
Škvarenina, Ľubomír ; Rajmic, Pavel (referee) ; Zátyik, Ján (advisor)
Diploma thesis deals with image interpolation. The aim of this work is to study theoretically and then describe the nature of the various methods of image interpolation and some of them implemented in the program MATLAB. The introductory part of this work theoretically closer to important terms that are closely related to this topic of digital image processing sufficient to understand the principle. In the following of the thesis will be discussed all of today's commonly used method of image interpolation. Will hear all about the method of image interpolation using nearest neightbor interpolation and image help of polynimals such as (bi)linear, (bi)quadratic and (bi)kubic method. Then work theoretically analyzes the theory of individual species curves and splines. More specifically, coming to their most frequently used variants of B-spline curves and ther generalizations called NURBS, with addressing the problem of interpolating these curves. The final chapter consists of the results achieved in the program MATLAB.
|
guest ::
