|
|
Design and realization of MIDI controller keyboard
Dvořáček, Štěpán ; Hrbáček, Radek (referee) ; Krejsa, Jiří (advisor)
This thesis deals with the realization of a specific MIDI controller being able to control a computer simulation of the Hammond organ. Theoretical part consists of a brief introduction to working with audio and MIDI on the computer. Next chapter describes Hammond organ and GSI Vb3 simulation resulting in a selection of the key control elements. Mechanical and electronic solution is described in the following chapters. A functional keyboard controller, which can be utilized in a recording studio or in a live performance was accomplished as a result of this thesis.
|
|
|
Coevolution in Evolutionary Circuit Design
Veřmiřovský, Jakub ; Hrbáček, Radek (referee) ; Drahošová, Michaela (advisor)
This thesis deals with evolutionary design of the digital circuits performed by a cartesian genetic programing and optimization by a coevolution. Algorithm coevolves fitness predictors that are optimized for a population of candidate digital circuits. The thesis presents theoretical basis, especially genetic programming, coevolution in genetic programming, design of the digital circuits, and deals with possibilities of the utilization of the coevolution in the combinational circuit design. On the basis of this proposal, the application designing and optimizing logical circuits is implemented. Application functionality is verified in the five test tasks. The comparison between Cartesian genetic programming with and without coevolution is considered. Then logical circuits evolved using cartesian genetic programming with and without coevolution is compared with conventional design methods. Evolution using coevolution has reduced the number of evaluation of circuits during evolution in comparison with standard cartesian genetic programming without coevolution and in some cases is found solution with better parameters (i.e. less logical gates or less delay).
|
|
|
Exploitng sparse signal representations in capturing and recovery of nuclear magnetic resonance data
Hrbáček, Radek ; Zátyik, Ján (referee) ; Rajmic, Pavel (advisor)
This thesis deals with the nuclear magnetic resonance field, especially spectroscopy and spectroscopy imaging, sparse signal representation and low-rank approximation approaches. Spectroscopy imaging methods are becoming very popular in clinical praxis, however, long measurement times and low resolution prevent them from their spreading. The goal of this thesis is to improve state of the art methods by using sparse signal representation and low-rank approximation approaches. The compressed sensing technique is demonstrated on the examples of magnetic resonance imaging speedup and hyperspectral imaging data saving. Then, a new spectroscopy imaging scheme based on compressed sensing is proposed. The thesis deals also with the in vivo spectrum quantitation problem by designing the MRSMP algorithm specifically for this purpose.
|
|
|
Sorting Networks Design Using Coevolutionary CGP
Fábry, Marko ; Hrbáček, Radek (referee) ; Drahošová, Michaela (advisor)
This paper deals with sorting networks design using Cartesian Genetic Programming and coevolution. Sorting networks are abstract models capable of sorting lists of numbers. Advantage of sorting networks is that they are easily implemented in hardware, but their design is very complex. One of the unconventional and effective ways to design sorting networks is Cartesian Genetic Programming (CGP). CGP is one of evolutionary algorithms that are inspired by Darwinian theory of evolution. Efficiency of the CGP algorithm can be increased by using coevolution. Coevolution is an approach that works with multiple populations, which are influencing one another and constantly evolving, thus prevent the local optima deadlock. In this work it is shown, that with the use of coevolution, it is possible to achieve nearly twice the acceleration compared to evolutionary design.
|
|
|
Efficient Implementation of High Performance Algorithms on Intel Xeon Phi
Šimek, Dominik ; Hrbáček, Radek (referee) ; Jaroš, Jiří (advisor)
This thesis is dedicated to the implementation of high performance algorithms on the Intel Xeon Phi coprocessor. The Xeon phi was introduced by Intel as a new MIC (Many Integrated Core) architecture in 2012. The theoretical part of the thesis is focused on the architecture of the coprocessor (with peak performance of 2 tFLOPS for a single precision data) and on the procedure of algorithms implementation and optimization. The theoretical knowledge is then applied to a practical examples with demonstration of the implementation and the optimization of algorithms and work with the coprocessor. In the practical part of the thesis, simple benchmarks such as a vector matrix multiplication and a matrix multiplication are explained and implemented. In the first benchmark 6.5% of theoretical coprocessor performance was achieved, in the second it was much more. In following chapter a more complex benchmark - simulation of a particles system (N-Body), that reached more than 35% of coprocessor performance (725 gFLOPS), is discussed. The following section is dedicated to some interesting problems such as optimization of a MATLAB module k-Wave (propagation of the ultrasound waves), extraction of I-vector (speech processing), cross-compilation of existing libraries, modules and programs. In the conclusion of the thesis the usage the potential of the Intel Xeon Phi is evaluated.
|
|
|
System for Supercomputer Automation Operation
Strečanský, Peter ; Hrbáček, Radek (referee) ; Jaroš, Jiří (advisor)
The main goal of this thesis is to extend already existing software FabSim by a module, which allows automated supercomputer operation, especially with OpenPBS scheduler. This module was implemented with Python programming language, using Fabric module as its backbone. The scripts, which are executed with OpenPBS are stored as the templates. These templates are dynamically modified to suit users needs. This solution provides a complex set of methods, which allows full--featured operation of supercomputers, integration with git and data management on clusters. The module saves time and makes working with supercomputers much easier.
|
|
|
Compressive sampling and simulation of one-pixel camera
Hrbáček, Radek ; Špiřík, Jan (referee) ; Rajmic, Pavel (advisor)
The Nyquist theorem is the main pillar of the traditional digital signal processing approach. It states that the sampling rate must be at least twice the maximum frequency present in the signal to guarantee perfect signal reconstruction from the sequence of its samples. In practice, we often compress the signal right after the sampling process to reduce the data size. The compressive sampling approach is not limited to the frequency domain, it provides a new look at the signal by using an arbitrary basis. If we find a basis in which the signal is sparse, it is possible to take a small number of samples and reconstruct the signal successfully. One-pixel camera is one of real applications, it's formed by digital micromirror array reflexing the light into single sensor. Mathematical methods are then used to reconstruct the signal. This thesis deals with the simulation of the camera.
|
|
|
Parallelisation of Ultrasound Simulations Using Local Fourier Decomposition
Dohnal, Matěj ; Hrbáček, Radek (referee) ; Jaroš, Jiří (advisor)
This document introduces a brand new method of the 1D, 2D and 3D decomposition with the use of local Fourier basis, its implementation and comparison with the currently used global 1D domain decomposition. The new method was designed, implemented and tested primarily for future use in the simulation software called The k-Wave toolbox, but it can be applied in many other spectral methods. Compared to the global 1D domain decomposition, the Local Fourier decomposition is up to 3 times faster and more efficient thanks to lower inter-process communication, however it is a little inaccurate. The final part of the thesis discusses the limitations of the new method and also introduces best practices to use 3D Local Fourier decomposition to achieve both more speed and accuracy.
|
|
|
Implementation of Grammatical Evolution System
Svoboda, Jan ; Hrbáček, Radek (referee) ; Sekanina, Lukáš (advisor)
Gramatická evoluce je relavitně nový přístup ke genetickému programování, který dokáže automatizovaně řešit různé problémy vytvářením programů v libovolném programovacím jazyce. Tato práce shrnuje prinicipy a algoritmy gramatické evoluce a poskytuje přehled o existujících systémech. Byla vytvořena nová knihovna Gram, která nabízí vysoký výkon a dodržuje dobré programátorské zvyklosti, jakými jsou modulárnost a automatické testování. Porovnání tohoto systému s nejvýkonnějším dostupným řešením ukázalo zlepšení v době výpočtu překračující 30 %. Gram byl také úspěšně použit pro automatizaci testy řízeného vývoje, techniky běžně používané při vytváření softwaru s automatizovanými testy. Tato práce a doplňující softwarový projekt tedy poskytují solidní základ pro další výzkum a umožňují využití gramatické evoluce v nových oblastech.
|
|
|
Parallelisation of Ultrasound Simulations on Intel Xeon Phi Accelerator
Vrbenský, Andrej ; Hrbáček, Radek (referee) ; Jaroš, Jiří (advisor)
Nowadays, the simulation of ultrasound acoustic waves has a wide range of practical usage. As one of them we can name the simulation in realistic tissue media, which is successfully used in medicine. There are several software applications dedicated to perform such simulations. k-Wave is one of them. The computational difficulty of the simulation itself is very high, and this leaves a space to explore new speed-up methods. In this master's thesis, we proposed a way to speed-up the simulation based on parallelization using Intel Xeon Phi accelerator. The accelerator contains large amount of cores and an extra-wide vector unit, and therefore, is ideal for purpose of parallelization and vectorization. The implementation is using OpenMP version 4.0, which brings some new options such as explicit vectorization. Results were measured during extensive experiments.
|
guest ::
