No description available.

The theme of this thesis is syntax analysis of the source texts based on TeX. The work contains the summary of basic terms from the theory of formal languages, there is also explained the function of the translator in all the analytical phases of the translation and finally it contains the introduction of the Lua scripting language and the ConTeXt typesetting system. The aim of the thesis is implementation of the syntax analyser for the source texts in ConTEXt format. The implementation is accompanied by the description of the solution developement of the lexical analysis, syntax analysis, creating syntax diagrams and context-free grammar.

This thesis provides a description of Distributed Application Facility (DAF), including its components, in Recursive InterNetwork Architecture (RINA). The DAF is equivalent to an application layer of today’s network model. It also documents implementation of the DAF for the OMNeT++ simulation framework. The aim of this thesis is to extend the functionality of simulation library and to provide clear application programming interface.

This thesis is focus on problematics of nodes localization in Internet. There are describe methods for prediction latency by using artificial coordinates systems and by using direct measurement. This thesis is primarily focus on method names King, which is estimates latency between arbitrary end hosts by using recursive DNS queries in system for translate domain name.

Dissertation thesis deals with possibilities of incremental compiler construction. It represents the compiler construction possibilities for languages with a fixed set of lexical units and for languages with a variable set of lexical units, too. The methodology design for the incremental compiler construction is based on the known algorithms for standard compiler construction and derived for both groups of languages. The part focused on incremental compiling of common programming languages is based on a published methodology of incremental parser construction. The method uses syntax-directed translation scheme. The part focused on incremental compiling of languages with a variable set of lexical units is engaged in incremental compiler construction for on of the typical representantives, typographic system TeX. Unline the frontal compilation it is necessary to adapt the semantic actions to the incremental environment and bring additional information for their links to the appropriate location in the grammar rules. The thesis discusses the problem of the storage of information about current lexical units categories during the repeated compilation and it offers solutions. The thesis also describes the application of proposed methodology in the web application that is used for teaching the course Theory of programming languages at the Faculty of Business and Economics, Mendel University in Brno.

I develop a novel method for computing globally accurate solutions to recur- sive macro-epidemic models featuring aggregate uncertainty and a potentially large number of state variables. Compared to the previous literature which either restricts attention to perfect-foresight economies amendable to sequence- space representation or focuses on highly simplified, low dimensional models that could can be analyzed using standard dynamic programming and linear projection techniques, I develop a deep learning-based algorithm that can han- dle rich environments featuring both aggregate uncertainty and large numbers of state variables. In addition to solving for particular model equilibria, I show how the deep learning method could be extended to solve for a whole set of models, indexed by the parameters of government policy. By pre-computing the whole equilibrium set, my deep learning method greatly simplifies compu- tation of optimal policies, since it bypasses the need to re-solve the model for many different values of policy parameters. 1

Master’s thesis is focused on the adaptive controllers. The first theoretic part mainly describes the parametric identification, which belongs to the most important part of the adaptive controller’s structure. Classical identification methods (the recursive least squares methods) are firstly mentioned and afterwards the identification methods based on the neural network (the Marquardt-Levenberg algorithm and the new identification algorithm NIA inspired by the neural networks) are described. At the conclusion of the theoretic part there are mentioned the algorithm of the adaptive controller’s tuning which uses the identification parameters (the modified Z-N method) and the tested types of adaptive controllers. Particular results, which were found out by verifying of the adaptive controllers on the simulation and real models, are contained in second, the practical, part of the thesis. Finally, achieved results are compared with the classical discrete PID controller and with the adaptive controller of the B&R company.

The aim of this work is to introduce a new type of fuzzy system AnYa. This system, unlike the classical fuzzy systems Takagi-Sugeno and Mamdani, uses a type of antecendent based on real data distribution. As part of the work there will be mentioned system programmed and its functionality will be verified on testing data.

The aim of this work is to introduce a new type of fuzzy system AnYa. This system, unlike the classical fuzzy systems Takagi-Sugeno and Mamdani, uses a type of antecendent based on real data distribution. As part of the work there will be mentioned system programmed and its functionality will be verified on testing data.

Internet roku 2015 se potýká s problémy, které jsou důsledky špatného designu pojmenovávání a adresování v TCP/IP a jež mají přeneseny vliv i na škálovatelnost směrování. Problémy jako růst páteřních směrovacích tabulek, neefektivní multihoming sítí či mobilita zařízení a mnohé další zadávají k otázce, jestli není třeba architekturu Internetu pozměnit. V teoretické části je kvantifikován dopad problémů, možná řešení a zejména je formálně definována teorie kompilujicí poznatky významných publikací zabývajících se problematikou pojmenování, adresování a směrování v počítačových sítí. Tato práce se zabývá dvěma konkrétními technologiemi, jež mají ambicí Internet měnit - Locator/Id Separation Protocol a Recursive InterNetwork Architecture. Výstupem práce jsou vylepšení funkcionality obou výše zmíněných technologií. Za účelem praktického ověření dopadů našeho výzkumu jsou vyvinutý a popsány nové simulační modely pro OMNeT++, které jsou věrné úrovni detailu popisu ze specifikací.