|
Driver Fatigue Monitor
Hošek, Roman ; Číka, Petr (referee) ; Beneš, Radek (advisor)
This diploma thesis deals with the options of image processing on mobile platforms, especially on Android operating system, and their use in a driver drowsiness detection system. The introductory part analyses the influence of drowsiness on drivers, focusing chiefly on the microsleep, and describes the already existing driver drowsiness detection systems. The thesis proceeds by the description of possibilities of image processing on mobile platforms with the emphasis on Android operating system together with the OpenCV library, known from the desktop interface. This is followed by comparison of various options of library implementation on a mobile platform. The chapter on image processing describes the algorithms for the detection of objects in the image, usable for detection of face, eyes and their posture. The practical part implements the selected methods for the Android operating system. A referential application was created to provide an explanatory demonstration of these methods on a real device. The individual methods are compared on the basis of time consumption, error rate and other factors.
|
|
Geolocation in Internet using latency measurements
Harth, Petr ; Balej, Jiří (referee) ; Komosný, Dan (advisor)
This diploma thesis is concerned with practical realization of CBG (Constraint-based Geolocation) algorithm, which is one of the IP (Internet Protocol) geolocation technique. IP geolocation determines the localization of a computer workstation location on the basis of on its IP address. The factors causing delays in data transfer are discussed first, followed by discussion of the issue of measuring these delays. The detailed explanation of IP geolocation follows where its contexts as well as the active geolocation techniques (techniques based on delay measurement mentioned above) are described. After that a brief description of PlanetLab experimental network, which was used for geolocation techniques measuring, is presented followed by a section explaining the creation of reference points and targets, which are another necessary prerequisite for practical realization of the method. Then the practical realization is explained in the form of CBGfinder program and its verification on the basis of artificial input data along with an actual example of IP geolocation of a point in the Internet are provided. Last but not least the measurement results of CBG algorithm are introduced, based on the analysis of Bestline parameters of one of the PlanetLab nodes measured in the period of one month, followed by a discussion of the inaccuracy of geological position and the computation speed. The cumulative distribution function as well as the kernel density estimation are also described. Final part of the thesis consists of discussion on measured results compared to results of other geological techniques results implemented by colleagues of the author of this diploma thesis. The results are compared on the basis of average inaccuracy of geological position estimations and its median, computation time, cumulative distribution function and kernel density estimation are also taken into regard.
|
|
Comparing chess strategies
Kacz, Kristián ; Babilon, Robert (referee) ; Cibulka, Josef (advisor)
The aim of this work is to provide an overview of approaches in computer chess. It designs and implements a chess engine for multiplayer network chess program ChessNet. Within the engine implements several search algorithms like Negamax, Alpha-beta, Negascout and points to their weaknesses. Adds a possibility to the ChessNet environment to compare chess engines. Compares implemented algorithms in terms of time complexity. Shows several factors wich we have to take into consideration during the design of evaluation function of game states. Implements some such functions and compares them in terms of success against each other.
|
|
On-line algorithms for bipartite graph coloring
Chludil, Josef ; Gavenčiak, Tomáš (referee) ; Pangrác, Ondřej (advisor)
Instance of the on-line graph coloring problem is a graph together with a permutation of its vertices (viewed as a linear ordering of the vertex set). The goal is to color the graph with vertices taken in the given order using the information of the subgraph induced by previous vertices. The most natural algorithm is the First Fit algorithm using in each step the first possible color. Unfortunately optimum number of colors can be linear dependent on number of vertices of graph even for bipartite graphs. On the other hand, there is an algorithm with logarithmic approximation factor for this class of graphs.
|
|
Equalization Methods in Digital Communication Systems
Deyneka, Alexander ; Šilhavý, Pavel (referee) ; Číž, Radim (advisor)
Tato práce je psaná v angličtině a je zaměřená na problematiku ekvalizace v digitálních komunikačních systémech. Teoretická část zahrnuje stručné pozorování různých způsobů návrhu ekvalizérů. Praktická část se zabývá implementací nejčastěji používaných ekvalizérů a s jejich adaptačními algoritmy. Cílem praktické části je porovnat jejich charakteristiky a odhalit činitele, které ovlivňují kvalitu ekvalizace. V rámci problematiky ekvalizace jsou prozkoumány tři typy ekvalizérů. Lineární ekvalizér, ekvalizér se zpětnou vazbou a ML (Maximum likelihood) ekvalizér. Každý ekvalizér byl testován na modelu, který simuloval reálnou přenosovou soustavu s komplexním zkreslením, která je složena z útlumu, mezisymbolové interference a aditivního šumu. Na základě implenentace byli určeny charakteristiky ekvalizérů a stanoveno že optimální výkon má ML ekvalizér. Adaptační algoritmy hrají významnou roli ve výkonnosti všech zmíněných ekvalizérů. V práci je nastudována skupina stochastických algoritmů jako algoritmus nejmenších čtverců(LMS), Normalizovaný LMS, Variable step-size LMS a algoritmus RLS jako zástupce deterministického přístupu. Bylo zjištěno, že RLS konverguje mnohem rychleji, než algoritmy založené na LMS. Byly nastudovány činitele, které ovlivnili výkon popisovaných algoritmů. Jedním z důležitých činitelů, který ovlivňuje rychlost konvergence a stabilitu algoritmů LMS je parametr velikosti kroku. Dalším velmi důležitým faktorem je výběr trénovací sekvence. Bylo zjištěno, že velkou nevýhodou algoritmů založených na LMS v porovnání s RLS algoritmy je, že kvalita ekvalizace je velmi závislá na spektrální výkonové hustotě a a trénovací sekvenci.
|
|
Remote Client Security
Friedberg, Jiří ; Karásek, Jan (referee) ; Malina, Lukáš (advisor)
This master’s thesis is devoted to safe operating remote station. The security of data and electronic services is very important nowadays because the number of attacks to computer networks is increasing. The security of network services and information can be provided in several different ways which can be combined. The basic security mechanisms are authentication and data encryption. Both these methods are included to the implementation of operating remote station which is the main part of this work. The user of the resulting application will have a choice from several methods of authentication and data encryption. Whole traffic is encryption from the transfer of view of remote desktop to the transfer of files. Safety factor depends only up to the user consequently on that what type of authentication and encryption the user choose. The thesis also deals with analysis of implemented safely functions. Brings the results of analysis of effect of encryption algorithms to data connection of remote desktop.
|
|
Permanent Magnet Synchronous Motor Parameters Identification
Dušek, Martin ; Veselý, Ivo (referee) ; Blaha, Petr (advisor)
This work deals with the on-line identification of permanent magnet synchronous motor parameters. There is discussed the use of four different identification algorithms based on the least squares method and MRAS. The functionality of the algorithms is verified in Matlab - Simulink environment. Simulation results are compared in terms of rate and accuracy of identification, resistance to noise and other factors.
|
| |
|
Teoretické studium fotosystemu II, chlorozomů a flavoproteinu WrbA
PALENČÁR, Peter
The power of the current computer clusters allows us to study relatively large biomolecular systems by theoretical computational methods, such as widely used classical molecular dynamics (MD) simulations, at atomic level on the time scale of tens of nanoseconds. The limiting factor for classical MD simulations on most of the physiologically relevant systems is the lack of available force field (FF) parameters. Three biomolecular systems were studied in this thesis, namely membrane protein photosystem II (PSII), green bacteria antennas called chlorosomes and flavoprotein WrbA from E. coli, and all of them contain molecules or molecular fragments for which no FF parameters are available. Therefore, development of new FF parameters for all non-protein molecules was performed by applying quantum-mechanics (QM) methods. Once all FF parameters were available, MD simulations were applied. The computational studies were based on the conditions from wet experiments performed earlier by our research group. For the first time, proposed light-induced conformational changes of the reaction center (RC) of PSII and subsequent changes in arrangement of PSII RC pigments, were confirmed and described at atomic level by series of MD simulations over 20 ns. Optical spectra calculated on equilibrated MD model of PSII RC were in better agreement with experimental analogues when compared with earlier calculations on static model of PSII RC taken from crystal structure. Successful application of classical mechanics, QM and advanced optical spectra calculations on PSII represents one of a few existing computational studies on similar membrane pigment-protein systems. In the case of chlorosomes, equilibrated molecular lamellar models were constructed and critical structural parameters were elucidated by series of MD simulations over 30 ns. The presented models are the first lamellar models of chlorosomes at such scale so far. The equilibrated MD models of flavoprotein WrbA based on recent crystal structure provides starting point for further theoretical studies aimed to elucidate structural details of proposed ping-pong mechanism.
|
|
Modeling of flow on synchronous generator
Chlup, Jaroslav ; Skalka, Miroslav (referee) ; Janda, Marcel (advisor)
This project deals with simulation´s possibilities of air flow in electric machines. A finite element method is the final element technique. Aim of this project is conversion universal formula for calculation friction dissipation factor. For its location is necessary to create 27 simulations according to the 2. plan order. Usage programme MATLAB for processing results obtain requisite algorithm for calculation friction dissipation factor.
|
guest ::
