|
|
Solver of Mathematical Equations for Android
Janičko, Adam ; Herout, Adam (referee) ; Zachariáš, Michal (advisor)
This thesis aims at creating equation solver application for Android platform. The thesis includes graphical user interface (GUI), save and edit options for equations, the actual equation solving and widget for quickly evaluating already stored equations. When creating equations, user is able to use selected mathematical functions, constants and custom variables that user can define right before evaluation. The equation in the standard infix notation inappropriate for further processing is transferred to the prefix notation using modified Shunting Yard algorithm. Final expression is put together once. That means the evaluation is faster, when the values of user-defined variables changes.
|
|
|
Generator of IPv6 Tables
Lorenc, Marián ; Bartoš, Václav (referee) ; Matoušek, Jiří (advisor)
The increasing number of IPv6 prefixes in routing tables require creation of efficient lookup algorithms, which are adapted to the length of prefixes. To create and to test these algorithm,s it is necessary to have extensive tables, which currently do not exist. This thesis is about design and implementation of generator of such tables. Many series of analysis were performed before the implementation. These series were about observing properties of real and generated IPv6 sets of prefixes. The final application was implemented in the way that it corresponds as much as possible to real sets. The correctness of the generator was tested by comparing the bit values of generated and real IPv6 sets.
|
|
|
Visualization of Longest Prefix Match Algorithms
Fomiczew, Jiří ; Matoušek, Jiří (referee) ; Kováčik, Michal (advisor)
This thesis describes the design and implementation of program for vizualization of algorithms for longest pre fix match (LPM), which is one of the most important tasks for packet classi cation and routing in TCP/IP networks. It describes necessary theory and details about selected algorithms - Trie, Tree Bitmap and CPE. Furthermore, it describes the design and implementation of program for vizualization of the search process of these algorithms with emphasis on the potential use for educational purposes. Finally, it describes the possibilities for future development and expansion of the program.
|
|
|
Suffix Trees Construction and Their Use in Bioinformatics
Hlaváček, Pavel ; Čermák, Martin (referee) ; Martínek, Tomáš (advisor)
This work discusses problems of suffix trees implementation and their use in bioinformatics. There are given different sorts of algorithms for building suffix trees in this work. In the first place, it deals with the on-line method implementation for building suffix trees, proposed by E. Ukkonen and approximate string matching. That is made by application of dynamic programming principles, adapted for using suffix trees. Both of these methods are described by pseudocode and implemented in a work supplement.
|
|
|
Measurement of Backbone Routing Parameters
Celárek, Ondřej ; Kořenek, Jan (referee) ; Matoušek, Jiří (advisor)
This thesis deals with issue of routing between Autonomous Systems. For routing between autonomous systems is used Border Gateway Protocol (BGP). The routers in Autonomous Systems modify their routing tables based on BGP messages. Routing tables are used for forwarding information on Internet. Issue of this thesis is analysis of change routing tables for eventually optimizing of routing architecture. First part of thesis is focused on theory of routers, routing ang BGP. Second part of this thesis focuses on implementation and execution experiments with routing tables. In this part are also described reached results.
|
|
|
Longest Prefix Match Algorithms
Kováčik, Michal ; Tobola, Jiří (referee) ; Kořenek, Jan (advisor)
This thesis focuses on algorithms for longest prefix match (LPM), which is the key operation in packet classification and routing in TCP/IP networks. A space for analysis of commonly used algorithms with emphasis on their speed and memory efficiency is dedicated along with necessary theory. Focus is then oriented on IPv6 networks, their typical prefix sets and comparison of suitable algorithms. Afterwards, the optimization for selected algorithm is suggested and implemented in programming language Python.
|
|
|
Competition Between Analytic Future Forms and Future Forms Created by Prefix
Pröschl, Vojtěch ; Adam, Robert (advisor) ; Sojka, Pavel (referee)
This thesis examines two types of forms of imperfect verbs which are used in the czech language to express the future. It is an analytical form and form with a formative prefix. The thesis first introduces the reader to the basic issues of the topic and then also to the current findings in this area. In the next part is examined the occurrence of the mentioned forms in the vocabulary of the czech language. The aim of this thesis is to fill the gaps in the previous mentions of the issue with the help of aformentioned research.
|
|
|
Evaluative prefixes archi-, super-, hyper-, extra- in present-day French
Šindelářová, Jana ; Štichauer, Jaroslav (advisor) ; Duběda, Tomáš (referee)
This work is concerned with using of evaluative prefixes of types archi-, extra-, hyper- and super- in french. The theoretical part concentrates on connecting of these prefixes with different types of words, like nouns, adjectives, adverbs and verbs. We are concerned above all with adjectives, where these prefixes are used when forming an absolute superlative. Further ways of forming an absolute superlative are specified here for comparison with the use of these prefixes. Furthermore, this work examines the use of these lexemes as single standing words. The practical part targets concrete examples of prefix connections archi-, extra-, hyper-, super- with adjectives used by native speakers. The target is to investigate according to which rule these prefixes are connected with adjectives, which one is the most and the least used and if there is any diference in using these prefixes among men and women. Key words: Morphology, word formation, word composition, prefix, evaluative prefix, prefixoid, suffix, noun, adjective, verb, adverb.
|
|
|
Interlingvistical Homonymity in Verbs - Comparison of Czech and Serbian
Červenková, Anděla ; Jirásek, Karel (advisor) ; Vlainić, Sandra (referee)
The subject of this bachelor's thesis is verbal Czech/Serbian homonymity. The thesis focuses on verbal prefixes and their ability to change verb meaning in connection to interlanguage homonymity. The first part provides readers with a theoretical background needed for understanding this topic, namely lexicology and its domains. Further, emphasis is put on homonymity (and its genesis), polysemy and word formation. My research focuses particularly on prefixes in both languages and the comparison between their individual meanings. The same method is applied to the comparing of verbs that are prefixed by given prefixes. The meanings are entered into the Czech/Serbian dictionary which contains 101 homonym pairs and three homonym triplets.
|
|
|
Playful teaching methods for morphemic analysis of words in the first grade of primary schools
LÍSKOVCOVÁ, Lucie
This diploma thesis deals with playful methods of word-construction teaching at lower primary schools. The practical part of the thesis deals with terms connected to this subject and terms student come across at lower primary schools. The following terms will be defined: prefix, root, suffix, ending, related words, base word, base. A part of the theoretical part consists of a summary of this subject meant for Grades 3 - 5 in textbooks by different publishers. The practical part contains a number of playful exercises and activities that that may be used even in acquiring these learning topics.
|
guest ::
