This thesis deals with the application of Markov chains for the production of concrete products. The theoretical part is focused on clarifying the concepts of risk management and describes the procedures for dealing with classical Markov chains. There are presented basics of fuzzy logic and finally there is explained the procedure using fuzzy logic in calculating of classical Markov chains in the subsection entitled Fuzzy Markov chains. The practical part describes production process, namely concrete pavements. On this production process is applied knowledge from the theoretical part and there is a comparison and evaluation of two methods of Marcov chains calculation (classic and fuzzy approach).

The task of this project is to build application for managing of multimedia data in enclosed wireless networks and to present this data to the user. In model case it can be for example city guide - on position given by GPS are presented information about surrounding scene. Application must be capable of downloading data into Pocket PC - PDA and present them to the user as user friendly application.

The thesis deals with artificial neural networks theory. Subsequently, fuzzy sets are being described and fuzzy logic is explained. The hybrid neuro-fuzzy system stemming from ANFIS system is designed on the basis of artificial neural networks, fuzzy sets and fuzzy logic. The upper-mentioned systems' functionality has been demonstrated on an inverted pendulum controlling problem. The three controllers have been designed for the controlling needs - the first one is on the basis of artificial neural networks, the second is a fuzzy one, and the third is based on ANFIS system.  The thesis is aimed at comparing the described systems, which the controllers have been designed on the basis of, and evaluating the hybrid neuro-fuzzy system ANFIS contribution in comparison with particular theory solutions. Finally, some experiments with the systems are demonstrated and findings are assessed.

This work describes graphplan, satplan and real-time adaptive A* planning algorithms. Through implementation of these algorithms, functionality and assumed attributes (real-time calculation, parallelism) are tested. These tests take place in nontrivial domains. Graphplan and satplan algorithms were tested in block-world, tire-world and bulldozer domains. Results of these tests were compared and displayed in graphs. Real-time adaptive A* algorithm was tested in tire-world domain. Results of these tests were compared with classic A* algorithm. Advantages and disadvantages of these algorithms are also described in this work.

Rough sets and neural networks both offer good theoretical background for data processing and analysis. However, both of them suffer from few issues. This thesis will investigate methods by which these two concepts are merged, and few such solutions will be implemented and compared with conventional algorithm to study the benefits of this approach.

This master thesis is dealing with development and application of a model that employs fuzzy logic. The model is used to support a decision of a selected Czech company that plans to invest abroad and establish a subsidiary. Selected indicators determine an investment risk in all countries considered for the investment. The model was implemented in parallel in two systems: MS Excel and MATLAB®.

<p>Jezik nad E je proizvoljan skup reci nad E, tj. proizvoljan podskup slobodnog monoida E*. Jezici nad datom azbukom formiraju al&shy; gebre jezika, sa operacijama unije, konkatenacije (dopisivanja red), Kleene-jeve iteracije i sa 0, {A} kao konstantama. Regularni jezici nad E su elementi podalgebre algebre jezika nad E generisane konačnim jezicima. Ispostavlja se da algebre jezika generi&scaron;u isti varijetet (i stoga zadovoljavaju iste iden&shy;titete) kao i algebre binarnih relacija snabdevene operacijama unije, kompozi&shy;cije, refleksivno-tranzitivnog zatvorenja i praznom relacijom i dijagonalom kao konstantama. Reč je o varijetetu Kleenejevih algebri, i slobodne algebre tog varijeteta su ba&scaron; algebre regularnih jezika. Na početku disertacije, izloženi su neki aspekti algebarske teorije automata i formalnih jezika, teorije binarnih relacija i univerzalne algebre, relevantni za ispitivanje identiteta na algebrama jezika. Zatim je dat klasični rezultat (Redko, 1964.) da varijetet Kleenejevih algebri nema konačnu bazu identiteta. Ovde je prikazan dokaz Conwaya iz 1971., budući da on sadrži neke ideje koje su se pokazale korisne za dalji rad. Glave 3 i 4 sadrže originalne rezultate usmerene na profinjenje Redkovog rezultata. Pokazano je da uzroci beskonačnosti baze identiteta za Kleenejeve algebre leže u interakciji operacija konkatenacije i iteracije jezika (odnosno, kompozicije i refleksivno-tranzitivnog zatvorenja relacija). Drugim recima, klasa redukata algebri jezika bez operacije unije nema konačnu bazu identiteta. To daje odgovor na problem D. A. Bredikhina iz 1993. godine. S druge strane, pro&scaron;irenjem tipa Kleenejevih algebri involutivnom operacijom inverza jezika, odnosno relacija, takođe se dolazi do beskonačno baziranih varijeteta, čime se re&scaron;ava problem B. Jonssona iz 1988. godine. Analogno, komutativni jezici nad E su proizvoljni podskupovi slobodnog komutativnog monoida E&reg;. U Glavi 5 je dokazano da se jednakosna teorija algebri komutativnih jezika poklapa sa jednakosnom teorijom algebre (regu&shy;larnih) jezika nad jednoelementnim alfabetom, &scaron;to daje odgovor na problem koji je jo&scaron; 1969. formulisao A. Salomaa u svojoj monografiji&nbsp; Theory of Au&shy;tomata.Na taj način, iz poznatih rezultata o jednakosnoj aksiomatizaciji komutativnih jezika se dobija jedna baza za algebre jezika nad jednoelement&shy;nim alfabetom, kao i veoma kratak dokaz poznate činjenice (takođe Redko, 1964.) da algebre komutativnih jezika nemaju konačnu bazu identiteta. Na kraju disertacije, identiteti Kleenejevih algebri se posmatraju u kon&shy;tekstu dinamičkih algebri. Reč je o algebarskoj verziji dinamičkih logika, koje su konstruisane sedamdesetih godina kao matematički model rada računara, kada se na njima izvr&scaron;ava program pisan u nekom imperativnom program&shy; skom jeziku. Na primer, problemi verifikacije i ekvivalentnosti programa se lako izražavaju preko identiteta dinamičkih algebri, tako da razne njihove jednakosne osobine odgovaraju pojmovima iz teorijskog računarstva. Takođe, interesatno je da je jednakosna teorija Kleenejevih algebri &rsquo;&rsquo; kodirana&rdquo; u konačno baziranoj jednakosnoj teoriji dinamičih algebri. Polazeći od poznatih rezul&shy;tata za dvosortne dinamičke algebre (pri čemu je jedna komponenta algebra istog tipa kao i Kleenejeve algebre, dok je druga Booleova algebra), neki od tih rezultata su transformisani i pro&scaron;ireni za Jonssonove dinamičke algebre (jednosortne modele dinamičkih logika). Na primer, ako se Kleenejeva algebra K može predstaviti kao konačan direktan proizvod slobodnih algebri varijeteta Kleenejevih algebri generisanih Kleenejevim relacionim algebrama, tada vari&shy;jetet K-dinamičkih algebri ima odlučivu jednakosnu teoriju. Odavde se izvodi da svaki varijetet Kleenejevih algebri generisan Kleenejevim relacionim algeb&shy;rama takođe ima odlučivu jednakosnu teoriju.</p> / <p>A language over &pound; is an arbitrary set of words, i.e. any subset of the free monoid &pound;*. All languages over a given alphabet form the algebra of languages, which is equipped with the operations of union, concate&shy;nation, Kleene iteration and 0, {A } as constants. Regular languages over &pound; are the elements of the subalgebra of the algebra of languages over &pound; generated by finite languages. It turns out that algebras of languages generate exactly the same variety as algebras of binary relations, endowed with union, rela&shy;tion composition, formation of the refelxive-transitive closure and the empty relation and the diagonal as constants. The variety in question is the vari&shy;ety of Kleene algebras, and the algebras of regular languages are just its free algebras. The present dissertation starts with several aspects of algebraic theory of automata and formal languages, theory of binary relations and universal alge&shy;bra, which are related to problems concerning identities of language algebras. This material is followed by the classical result (Redko, 1964) claiming that the variety of Kleene algebras have no finite equational base. We present the proof of Conway from 1971, since it contains some ideas which can be used for generalizations in different directions. Chapters 3 and 4 contain original results which refine the one of Redko. It is shown that the cause of nonfinite axiomatizability of Kleene algebras lies in the superposition of the concatenation and the iteration of languages, that is, composition of relations and reflexive-transitive closure. In other words, the class of -(--free reducts of algebras of languages has no finite equational base, which answers in the negative a problem of D. A. Bredikhin from 1993. On the other hand, by extending the type of Kleene algebras by the involutive operation of inverse of&nbsp; languages (converse of relations), we also obtain a nonfinitely based variety, which solves a problem of B. Jonsson from 1988. Analogously, commutative languages over E are defined as subsets of the free commutative monoid &pound;&reg;. It is proved in Chapter 5 that equational the&shy; ories of algebras of commutative languages and, respectively, of the algebra of (regular) languages over the one-element alphabet, coincide. This result settles a thirty year old problem of A. Salomaa, formulated back in his wellknown monograph&nbsp; Theory of Automata.Thus, we obtain an equational base for the algebra of one-letter languages, and, on the other hand, a very short proof of another Redko&rsquo;s result from 1964, according to which there is no finite equational base for algebras of commutative languages. Finally, identities of Kleene algebras are considered in the context of dy&shy;namic algebras, which are just algebraic counterparts of dynamic logics. They were discovered in the seventies as a result of the quest for an appropriate logic for reasoning about computer programs written in an imperative pro&shy; gramming language. For example, problems concerning program verification and equivalence can be easily translated into identities of dynamic algebras, so that many of their equational properties correspond to notions from computer science. It is also interesting that the whole equational theory of Kleene alge&shy; bras is &rsquo;&rsquo;encoded&rdquo; in the finitely based equational theory of dynamic algebras.<br />Starting with known results on two-sorted dynamic algebras (where one com&shy; ponent is an algebra of the same signature as Kleene algebras, while the other is a Boolean algebra), some of those results are transformed and extended for Jonsson dynamic algebras (that is, one-sorted models of dynamic logics). For example, if a Kleene algebra K can be represented as a finite direct product of free algebras of varieties of Kleene algebras generated by Kleene relation algebras, then the variety of K-dynamic algebras has a decidable equational theory. The latter yields that all varieties of Kleene algebras generated by Kleene relation algebras have decidable equational theories, too.</p>

The diploma thesis deals with flow prediction using artificial intelligence to control the storage function of the reservoir. It focuses on the control of storage function using combination of dispatching graphs and flow prediction. The work is divided into a methodological part and an application part. The methodological part contain describes how the acquisition of historical data, a description of the work of dispatching graphs and forecasting models. The application part contains flow forecasts and outflow control. A prediction model is based on the fuzzy method, and it is used to predict inflows. The calibration and validation of the prediction model is also described. Results of prediction model were evaluated. In next step the results of control method were evaluated and compared with result of dispatching graphs. The results of controlled method were satisfactory.

Modern-day terrorist attacks present a considerable danger for commercial aircrafts. This thesis analyzes potential methods of such attacks with a critical analysis of the most dangerous type: an attack from the outside of the aircraft via a fragmentation missile warhead. Such missiles cause damage to the airframe of the aircraft through fragments created by the explosion. In this thesis, analytical geometry is used to determine the area of the aircraft affected by the fragmentation. The aircraft’s geometry and the fragments’ dispersion are calculated by analytical functions, and the effect of the damage is analyzed. A shooting experiment was also carried out, in which fragments were shot at a reinforced skin panel that was manufactured according to the real design of commercial aircraft. The results of the experiment revealed that only directly hit sections of the structure are damaged. Data obtained by the experiment was then used for the creation and improvement of the model used in the simulation by means of the finite element method. This model is used for the numerical calculation of the damage sustained. Further included in the thesis is an analysis of the change in the load-bearing capacity after such an attack. The relationship between the size of the damage and its effect on the load-bearing capacity of the component as well as the entire structure is defined. First, the effect of component damage is analyzed via the FMEA/FMECA methods. This analysis is then extended using fuzzy logic. Fuzzy logic analysis is based on the determination of the size of the damaged component area and the component’s importance on the structure’s carry loads. Application of the defined approach is described for several parts of an aircraft’s life cycle, including development, operation after the terrorist attack, and assessment of causes after a crash caused by a fragmentation missile warhead.

This master's thesis describes artificial intelligence algorithms based on the book Artificial Inteligence: A Modern Approach by S. Russel and P. Norvig and implementation of the algorithms in the Squeak Smalltalk programming language with object oriented approach. Algorithms are based on pseudocode in the book and existing implementations in Lisp, Python and Java language. Main concepts are intelligent agents, agent simulation environments, state space search, game playing, planning, uncertainty and learning.