|
|
Rough Sets on State Spaces of Automata
Staněk, David
This paper discussed a subclass of finite automata, which have ordering on the state sets created by a transition (or next-state) function. Hence, there do not exist cycles of more than one element. We discuss a relation of equality of upper closure on the systems of all subsets of state systems of quasi-automata, which creates an equivalence.
|
|
|
Basics of Pedestrians Detection in Image by Machine Learning
Lučanský, Peter ; Klečka, Jan (oponent) ; Horák, Karel (vedoucí práce)
This thesis deals with cutting-edge computer vision task the detection of persons/pedestrians in images by using machine learning methods with its possible utilization, history of progress and explanations of functionalities. It also includes testing the today's best method available on various circumstances and comparing aspects that has impact on its performance. At the beginning the matter is fundamentally explained and then are in details described up to date achievements in the subject of matter. In the following part are described available datasets that may be used for training with pointed out their pros and cons. In the last section is in details explained how to use the chosen method. Lastly is executed its training on various situations and comparison of the results is made.
|
|
|
Basics of Pedestrians Detection in Image by Machine Learning
Lučanský, Peter ; Klečka, Jan (oponent) ; Horák, Karel (vedoucí práce)
This thesis deals with cutting-edge computer vision task the detection of persons/pedestrians in images by using machine learning methods with its possible utilization, history of progress and explanations of functionalities. It also includes testing the today's best method available on various circumstances and comparing aspects that has impact on its performance. At the beginning the matter is fundamentally explained and then are in details described up to date achievements in the subject of matter. In the following part are described available datasets that may be used for training with pointed out their pros and cons. In the last section is in details explained how to use the chosen method. Lastly is executed its training on various situations and comparison of the results is made.
|
|
|
Rough Sets on State Spaces of Automata
Staněk, David
This paper discussed a subclass of finite automata, which have ordering on the state sets created by a transition (or next-state) function. Hence, there do not exist cycles of more than one element. We discuss a relation of equality of upper closure on the systems of all subsets of state systems of quasi-automata, which creates an equivalence.
|
|
|
Business valuation of Zabka Polska, SA
Dratva, Martin ; Sieber, Patrik (vedoucí práce) ; Šenkyřík, Ivo (oponent)
Předmětem diplomové práce je ocenění společnosti Zabka Polska, SA. Tato společnost se zabývá provozem maloobchodních prodejen typu convenience v Polsku. Cílem této práce je odhadnout tržní hodnotu Společnosti k 31.12.2010. Hlavní oceňovací metodou je výnosová metoda založená na diskontovaných peněžních tocích ve variantě DCF Equity. Jako podporné metody jsem použil metodu tržního porovnání s použitím veřejně obchodovaných společností a historických srovnatelných transakcí. Diplomová práce má podobnou strukturu jak znalecký posudek a je rozdělena do šesti na sebe navazujících častí.
|
|
| |
host ::
RSS.