National Repository of Grey Literature 45 records found  previous11 - 20nextend  jump to record: Search took 0.02 seconds. 
The Use of Artificial Intelligence on Stock Market
Kováčik, Juraj ; Volko, Martin (referee) ; Dostál, Petr (advisor)
This master thesis describes the creation and optimization of artificial neural networks which are subsequently utilized to predict the development of time series.
Non-Supervised Sentiment Analysis
Karabelly, Jozef ; Landini, Federico Nicolás (referee) ; Fajčík, Martin (advisor)
Cieľom tejto práce je odprezentovať prehľad aktuálneho výskumu v oblasti analýzy sentimentu bez priameho učiteľa a identifikovať potenciálne smery výskumu. Okrem toho práca predstavuje novú účelovú funkciu na predtrénovanie, ktorá nevyžaduje priamy supervíziu. Rozšírenie modelu predstavenou účelovou funkciou, pridanie vrstvy neurónovej siete a následné samotné natrénovanie ukazujú sľubné výsledky. Rozšírený model naznačil schopnosť zakódovať abstraktné reprezentácie celkového sentimentu, emócií a sarkazmu. Pre účely použitia predstavenej účelovej funkcie bol nazbieraný vlastný dataset. Na základe experimentov vykonaných s rozšíreným modelom sú odprezentované možné smery výskumu a budúce vylepšenia.
Neural Network for Autocomplete in the Browser
Kubík, Ján Jakub ; Zemčík, Pavel (referee) ; Kolář, Martin (advisor)
The goal of this thesis is to create and train a neural network and use it in a web browser for English text sequence prediction during writing of text by the user. The intention is to simplify the writing of frequent phrases. The problem is solved by employing a recurrent neural network that is able to predict output text based on the text input. Trained neural network is then used in a Google Chrome extension. By normalized ouput of the neural network, text choosing by sampling decoding algorithm and connecting, the extension is able to generate English word sequences, which are shown to the user as suggested text. The neural network is optimized by selecting the right loss function, and a suitable number of recurrent layers, neurons in the layers, and training epochs. The thesis contributes to enhancing the everyday user experience of writing on the Internet by using a neural network for English word sequence autocomplete in the browser.
Face Recognition with Acceleration on the Neural Compute Stick
Horník, Matej ; Orság, Filip (referee) ; Goldmann, Tomáš (advisor)
This bachelor thesis deals with current techniques for recognizing people by face. Convolutional neural networks are currently used for face recognition. In this work, convolutional neural networks will be described and also the architectures of convolutional networks used for face recognition will be compared. The goal will be to create a built-in system that will consist of a camera, a computing unit and a Neural Compute Stick accelerator. The system will recognize people by face with a freely available algorithm.
Automation of Verification Using Artificial Neural Networks
Fajčík, Martin ; Husár, Adam (referee) ; Zachariášová, Marcela (advisor)
The goal of this thesis is to analyze and to find solutions of optimization problems derived from automation of functional verification of hardware using artificial neural networks. Verification of any integrated circuit (so called Design Under Verification, DUV) using technique called coverage-driven verification and universal verification methodology (UVM) is carried out by sending stimuli inputs into DUV. The verification environment continuously monitors percentual coverage of DUV functionality given by the specification. In current context, coverage stands for measurable property of DUV, like count of verified arithemtic operations or count of executed lines of code. Based on the final coverage, it is possible to determine whether the coverage of DUV is high enough to declare DUV as verified. Otherwise, the input stimuli set needs to change in order to achieve higher coverage. Current trend is to generate this set by technique called constrained-random stimulus generation. We will practice this technique by using pseudorandom program generator (PNG). In this paper, we propose multiple solutions for following two optimization problems. First problem is ongoing modification of PNG constraints in such a way that the DUV can be verified by generated stimuli as quickly as possible. Second one is the problem of seeking the smallest set of stimuli such that this set verifies DUV. The qualities of the proposed solutions are verified on 32-bit application-specific instruction set processors (ASIPs) called Codasip uRISC and Codix Cobalt.
Identification and characterization of malicious behavior in behavioral graphs
Varga, Adam ; Burget, Radim (referee) ; Hajný, Jan (advisor)
Za posledné roky je zaznamenaný nárast prác zahrňujúcich komplexnú detekciu malvéru. Pre potreby zachytenia správania je často vhodné pouziť formát grafov. To je prípad antivírusového programu Avast, ktorého behaviorálny štít deteguje škodlivé správanie a ukladá ich vo forme grafov. Keďže sa jedná o proprietárne riešenie a Avast antivirus pracuje s vlastnou sadou charakterizovaného správania bolo nutné navrhnúť vlastnú metódu detekcie, ktorá bude postavená nad týmito grafmi správania. Táto práca analyzuje grafy správania škodlivého softvéru zachytené behavioralnym štítom antivírusového programu Avast pre proces hlbšej detekcie škodlivého softvéru. Detekcia škodlivého správania sa začína analýzou a abstrakciou vzorcov z grafu správania. Izolované vzory môžu efektívnejšie identifikovať dynamicky sa meniaci malware. Grafy správania sú uložené v databáze grafov Neo4j a každý deň sú zachytené tisíce z nich. Cieľom tejto práce bolo navrhnúť algoritmus na identifikáciu správania škodlivého softvéru s dôrazom na rýchlosť skenovania a jasnosť identifikovaných vzorcov správania. Identifikácia škodlivého správania spočíva v nájdení najdôležitejších vlastností natrénovaných klasifikátorov a následnej extrakcie podgrafu pozostávajúceho iba z týchto dôležitých vlastností uzlov a vzťahov medzi nimi. Následne je navrhnuté pravidlo pre hodnotenie extrahovaného podgrafu. Diplomová práca prebehla v spolupráci so spoločnosťou Avast Software s.r.o.
Automatic Delivery Note Transcription
Necpál, Dávid ; Kišš, Martin (referee) ; Hradiš, Michal (advisor)
This bachelor thesis aims to create a system for automatic transcription of delivery notes - documents with a fixed structure. The solution is divided into two parts. The first part is table lines detection and subsequent detection and extraction of cells, that contain required data. The second part is handwritten numeric characters recognition in the images of the cutted cells. The resulting system can detect cells with the required data with 100 % accuracy with well-scanned delivery notes, while the success rate of numerical character recognition is more than 95 % for individual characters and more than 92 % for entire character sequences. The benefit of this work is a system for automatic transcription of delivery notes, which provides faster and easier otherwise lengthy rewriting of the contents of delivery notes to the information system in the retail. By using this system, the employee saves more than 50 % of the time on each delivery note.
Convolutional Networks for Historic Text Recognition
Vešelíny, Peter ; Kolář, Martin (referee) ; Kišš, Martin (advisor)
This thesis deals with text line recognition of historical documents. Historical texts dating back to the 17th - 19th centuries are written in fraktur typeface. The character recognition problem is solved using neural network architecture called sequence-to-sequence . This architecture is based on encoder-decoder model and contains attention mechanism. In this thesis a dataset, from texts originated from German archiv called Deutsches Textarchiv , was created. This archive contains 3 897 different German books that have available transcripts and corresponding images of pages. The created dataset was used to train and experiment with the proposed neural network. During the experiments, several convolutional models, hyperparameters and the effects of positional embedding were investigated. The final tool can recognize characters with accuracy 99,63 %. The contribution of this work is the~mentioned dataset and neural network, which can be used to recognize historical documents.
Automatic classification of pronunciation of the letter „R“
Hrušovský, Enrik ; Vičar, Tomáš (referee) ; Harabiš, Vratislav (advisor)
This diploma thesis deals with automatic clasification of vowel R. Purpose of this thesis is to made program for detection of pronounciation of speech defects at vowel R in children. In thesis are processed parts as speech creation, speech therapy, dyslalia and subsequently speech signal processing and analysis methods. In the last part is designed software for automatic detection of pronounciation of vowel R. For recognition of pronounciation is used algorithm MFCC for extracting features. This features are subsequently classified by neural network to the group of correct or incorrect pronounciation and is evaluated classification success.
Object Detection in the Laser Scans Using Convolutional Neural Networks
Zelenák, Michal ; Kodym, Oldřich (referee) ; Veľas, Martin (advisor)
This work is focused on road segmentation in laser scans, using a convolutional neural network. To achieve this goal, which will find application in the field of road maintenance, convolutional neural networks have been used for their flexibility and speed. The work brings implementation and modifications of the existing method, which solves the problem by using a fully connected convolutional neural network. Used modifications include, for example using of various parameters for the loss function, the use of a different number of classes in the network model and dataset. The effect of the modification was experimentally verified and the accuracy of 96.12%, and the value for F-measure 95.02% were achieved.

National Repository of Grey Literature : 45 records found   previous11 - 20nextend  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.