|
|
Single-Phase Induction Motor Calculation
Schlesinger, Petr ; Vítek, Ondřej (referee) ; Hájek, Vítězslav (advisor)
This master’s thesis’s target is to introduce the basic findings about single-phase asynchronous motors, their derivation from three-phase motors and the basics of a computation process and a concept of a single-phase asynchronous squirrel cage motor. The inbeing of this concept and the computation is created by classical processes for three-phase motors with a low voltage, 50 Hz.
|
|
|
Text summarization
Majliš, Martin ; Pecina, Pavel (advisor) ; Schlesinger, Pavel (referee)
The present work explains the basic principles of automatic summarization, evaluation and fundamental concepts, which are used in this eld. It also includes a description of a system for automatic text summarization and evaluation - CSummaK (Czech Summarization Kit). As part of this system are basic algorithms for creating sentence extract summaries (Cenroid, Lead, Position, Random, Relevance Measure, etc.) their evaluation (Precision, Recall, FMeasure, etc.), whose description is also part of this work. This system was used for production of automatic extracts from news articles. Another system was developed for obtaining reference extracts, which allows users to create on-line extracts from news articles. In this work is also evaluated quality of single algorithms, their combination with of di erent parameters, together with discussion of the possibilities of practical application.
|
|
|
Legal regulation of phytosanitary care
Schlesinger, Petr ; Damohorský, Milan (advisor) ; Žákovská, Karolina (referee)
62 Sedmá kapitola: Závěr Základním cílem předkládané diplomové práce je popis a rozbor platné právní úpravy rostlinolékařské péče v České republice a v komunitárním právu. Rostlinolékařská péče zahrnuje v současnosti tři základní oblasti, které jsou upraveny právem. Jedná se o opatření proti šíření a zavlékání škodlivých organismů, oblast přípravků na ochranu rostlin a oblast mechanizačních prostředků. Cílem současné rostlinolékařské péče je péče o zdraví rostlin. Tento pojem sám o sobě implikuje nejenom opatření proti šíření a zavlékání škodlivých organismů, nýbrž - a fakticky převážně - prevenci. Historický exkurz vývoje právní úpravy rostlinolékařské péče ukázal na příkladech, že se nejstarší právní úprava rostlinolékařské péče v českém i komunitárním právu týkala pouze izolovaných škodlivých organismů a boje proti nim. V československém a později českém právním řádu byla rostlinolékařská péče až do roku 1996 součástí zákonů o rostlinné výrobě. Až etapa samostatných zákonů o rostlinolékařské péči se stala výrazem změny pojetí rostlinolékařské péče jako snahy o uchování zdraví rostlin. Zákon č. 147/1996 Sb. i současný rostlinolékařský zákon č. 326/2004 Sb. nejenže upravují všechny tři hlavní oblasti rostlinolékařské péče, nýbrž nahlížejí na rostlinolékařskou péči jako na obor, jehož význam není jen v...
|
|
|
Graph-based dependency parsing
Wimberský, Antonín ; Pecina, Pavel (advisor) ; Schlesinger, Pavel (referee)
In the present work we study practical solution of dependency parsing's problem with help of graph algorithm for finding maximal spanning tree in oriented graph (multigraph). Advantage of this approach is very easily parsing of non-projective constructions. We represent the parsing sentence as an oriented multigraph, which vertices constitutes words of our sentence and edges symbolize (potential) relation between single pairs of words. Evaluation of edges we get from training data, it can be count for example as probability of relation between given two words, possibly in combination with other more advanced methods. Resulting maximal spanning tree gives then the dependency tree of our sentence.
|
|
|
Environment for Master Orienteering Ranking Analysis
Kovářová, Lenka ; Forst, Libor (advisor) ; Schlesinger, Pavel (referee)
I accomplished analyse of potential formula schemes for veteran competitors ranking evaluation and I suggested their parameterisation. Next, I created an environment for the evaluation of veteran ranking that enables the competitors ranking calculation in accordance with the variables formulae that supports the proposed parameterisation and I, therefore, collected the results of orienteering races that were held in the last 4 years to get some data for the ranking evaluation. To display the calculated ranking I constructed a website. I computed the ranking of veteran orienteering competitors by use of selected formulae and then I suggested a modification of the Spearman correlation coefficient to prove the accuracy of each formula.
|
|
|
Question and Answer Classifier for closed domain Interactive Question Answering
Dinh, Le Thanh ; Lopatková, Markéta (advisor) ; Schlesinger, Pavel (referee)
Nowadays natural language processing has made big progress thanks to the application of statistical approaches and to the large amount of data available to train the systems. These progresses are pushed by the several evaluation campaigns. Thanks to them systems are compared and progress measured. These evaluations are mostly based on data sets artificially developed by the organizers of such evaluation campaigns. In our work we show that though useful these data sets are biased and there is the need of developing data generated in a more natural setting by real users. We consider as case studies the classification of questions. In particular we look at the classification of questions types needed in Question Answering systems, and the classification of follow up questions into topic continuation and topic shift needed in Interactive Question Answering. We evaluate classifiers first on TREC data and than on a corpus of real user's data. In both cases the performance of the classifiers drops significantly showing the need of working on more users centered systems. The results also show that the classifiers could be better fine tuned taking into account the new challenges real users data launch to NLP systems. We leave this for future research.
|
|
|
Methods of multiword expression extraction from text
Przywara, Česlav ; Pecina, Pavel (advisor) ; Schlesinger, Pavel (referee)
The goal of this thesis is an effective implementation of the methods of multiword expression extraction from text, so that designed program would be capable of processing large textual corpora containing up to billions of words. Additional function of the program is context tracing of extracted N-grams. For thesis purposes the program implementation is specially adjusted for collocation extraction from The Prague Dependency Treebank, but the program is designed in such manner that allows an easy future extensibility.
|
|
|
Document Keyword Extraction
Klíč, Radoslav ; Pecina, Pavel (advisor) ; Schlesinger, Pavel (referee)
In the present work, the problem of keyword extraction is studied. The work contains a brief introduction to the problem and description of some approaches to its solution. As a part of the work, some of the approaches are implemented and their e ciency is evaluated on a basis of a collection of documents. Two software tools are created. The rst one's purpose is keyword extraction. The other one is a web-based interface for the rst tool with one more function. It can be used for manual assigning of keywords to texts.
|
|
| |
|
|
Methods of multiword expression extraction from text
Przywara, Česlav ; Schlesinger, Pavel (referee) ; Pecina, Pavel (advisor)
The goal of this thesis is an effective implementation of the methods of multiword expression extraction from text, so that designed program would be capable of processing large textual corpora containing up to billions of words. Additional function of the program is context tracing of extracted N-grams. For thesis purposes the program implementation is specially adjusted for collocation extraction from The Prague Dependency Treebank, but the program is designed in such manner that allows an easy future extensibility.
|
guest ::
RSS feed.