|
|
Fingerprints Generator
Chaloupka, Radek ; Orság, Filip (referee) ; Drahanský, Martin (advisor)
Algorithms for fingerprints recognition are already known for long time and there is also an effort for their best optimization. This master's thesis is dealing with an opposite approach, where the fingerprints are not being recognized, but are generated on the minutiae position basis. Such algorithm is then free of the minutiae detection from image and enhancements of fingerprints. Results of this work are the synthetic images generated according to few given parameters, especially minutiae.
|
|
|
Evolution of link layer loop prevention protocols
Březina, Jiří ; Frolka, Jakub (referee) ; Slavíček, Karel (advisor)
This bachelor thesis deals with the possibility of eliminating and creation loops on theData Link layer of the OSI model. At first, it was necessary to determine what arethe loops and how they are formed. Then the solution of the problem with loops waspresented as the Spanning Tree protocol, where did the protocol come from, protocoloperation, his advantages and disadvantages. In next section were discussed other vari-ants of original STP, as well as his alternatives, like for example the TRILL or the SPBprotocol. The practical part of this work is based on the theoretical and shows howSpanning Tree protocols work in practice on real devices. This part is mainly focusedto testing the speed of convergence each of protocols and also their extensions. In theend is mentioned a laboratory task, which is part of the appendices and forms the mainbenefit of the whole thesis, because future students at school subject “network architec-ture” can try to configure protocols that was mentioned above and better understandhow these protocols work.
|
|
|
The Shortest Graph's Pahts Finding
Jágr, Petr ; Ohlídal, Miloš (referee) ; Jaroš, Jiří (advisor)
The aim of this thesis is finding, comparing and implementation of algorithms for finding the shortest paths between each of pairs of nodes in a graph. For this task I use modifications of existing algorithms to achive the lowest time consumption of the computation. Modifications are established on Dijkstra's and Floyd-Warshall's algorithm. We also familiarize with Bellman-Ford algorithm.
|
|
|
AutoRapper - Automatic Alignment of Speech with a Rhythm
Poliak, Sebastián ; Glembek, Ondřej (referee) ; Černocký, Jan (advisor)
Tato práce popisuje návrh a implementaci aplikace, která automaticky převádí vstupní řeč na rap. Tento proces je založen na zarovnání řeči s rytmem, které je dosaženo pomocí rozpoznávání fonémù, slabikování a časové modifikáce řeči. Další funkce, jako je hudební podklad a vokální efekt jsou přidány za účelem přiblížení se ke skutečnému rapu. Výsledná aplikace je dostupná jako webová služba pro uživatele.
|
|
|
Fingerprint biometry
Smékal, Ondřej ; Drahanský, Martin (referee) ; Fedra, Petr (advisor)
Algorithms designed for identification and verification persons by fingerprints recognition are spread and used as in forensics aplications as in private sector for a long time. The aim of this thesis is to make us aquainted with various aplicated mathematic models of fingerprint processing in digital way. Second task is the presentation algorithmic solution of chosen subject identification procedure by force of Fingerprint matching. Algorithm is solid in the development environment platform Matlab.
|
|
|
Evolution of link layer loop prevention protocols
Březina, Jiří ; Frolka, Jakub (referee) ; Slavíček, Karel (advisor)
This bachelor thesis deals with the possibility of eliminating and creation loops on theData Link layer of the OSI model. At first, it was necessary to determine what arethe loops and how they are formed. Then the solution of the problem with loops waspresented as the Spanning Tree protocol, where did the protocol come from, protocoloperation, his advantages and disadvantages. In next section were discussed other vari-ants of original STP, as well as his alternatives, like for example the TRILL or the SPBprotocol. The practical part of this work is based on the theoretical and shows howSpanning Tree protocols work in practice on real devices. This part is mainly focusedto testing the speed of convergence each of protocols and also their extensions. In theend is mentioned a laboratory task, which is part of the appendices and forms the mainbenefit of the whole thesis, because future students at school subject “network architec-ture” can try to configure protocols that was mentioned above and better understandhow these protocols work.
|
|
|
The Shortest Graph's Pahts Finding
Jágr, Petr ; Ohlídal, Miloš (referee) ; Jaroš, Jiří (advisor)
The aim of this thesis is finding, comparing and implementation of algorithms for finding the shortest paths between each of pairs of nodes in a graph. For this task I use modifications of existing algorithms to achive the lowest time consumption of the computation. Modifications are established on Dijkstra's and Floyd-Warshall's algorithm. We also familiarize with Bellman-Ford algorithm.
|
|
|
Fingerprints Generator
Chaloupka, Radek ; Orság, Filip (referee) ; Drahanský, Martin (advisor)
Algorithms for fingerprints recognition are already known for long time and there is also an effort for their best optimization. This master's thesis is dealing with an opposite approach, where the fingerprints are not being recognized, but are generated on the minutiae position basis. Such algorithm is then free of the minutiae detection from image and enhancements of fingerprints. Results of this work are the synthetic images generated according to few given parameters, especially minutiae.
|
|
|
AutoRapper - Automatic Alignment of Speech with a Rhythm
Poliak, Sebastián ; Glembek, Ondřej (referee) ; Černocký, Jan (advisor)
Tato práce popisuje návrh a implementaci aplikace, která automaticky převádí vstupní řeč na rap. Tento proces je založen na zarovnání řeči s rytmem, které je dosaženo pomocí rozpoznávání fonémù, slabikování a časové modifikáce řeči. Další funkce, jako je hudební podklad a vokální efekt jsou přidány za účelem přiblížení se ke skutečnému rapu. Výsledná aplikace je dostupná jako webová služba pro uživatele.
|
|
|
Fingerprint biometry
Smékal, Ondřej ; Drahanský, Martin (referee) ; Fedra, Petr (advisor)
Algorithms designed for identification and verification persons by fingerprints recognition are spread and used as in forensics aplications as in private sector for a long time. The aim of this thesis is to make us aquainted with various aplicated mathematic models of fingerprint processing in digital way. Second task is the presentation algorithmic solution of chosen subject identification procedure by force of Fingerprint matching. Algorithm is solid in the development environment platform Matlab.
|
guest ::
