|
|
Models for network flow identification
Smejkalová, Veronika ; Kůdela, Jakub (referee) ; Pavlas, Martin (advisor)
The bachelor thesis is focused on development of a mathematical model of network flow in waste managment. The theoretical part of thesis deals with graph theory, network flow and optimization. The next chapter introduces the mathematical model. The model was compiled with the use of Information systems of waste management. The data are very often burdened by error. The task of the model is revelation of those errors to make the data useful. This thesis also includes suggestions for further development.
|
|
|
Analysis of Captured DNS Traffic
Hmeľár, Jozef ; Kekely, Lukáš (referee) ; Kováčik, Michal (advisor)
This thesis is focused on the analysis of captured DNS traffic. Introduction of this thesis is focused of basic desciption of computer networks , DNS and description of network flows. Then, the work focused on analysis Netflow format, IPFIX and PCAP, the analysis and implementation of tool for analyzing DNS traffic in C++ programming language. The conclusion is devoted to the results of the implemented tools.
|
|
|
Traffic assignment optimization models
Holešovský, Jan ; Mrázková, Eva (referee) ; Popela, Pavel (advisor)
Optimalizace toku v síti je klasickou aplikací matematického programování. Tyto modely mají, mimo jiné, široké uplatnění také v logistice, kde se tak snažíme docílit optimálního rozdělení dopravy, např. vzhledem k maximalizaci zisku, či minimalizaci nákladů. Toto pojetí ovšem často problém idealizuje, poněvadž předpokládá existenci jediného rozhodovatele. Takový přístup je možný ve striktně organizovaných sítích jako např. v logistických sítích přepravních společností, železničních sítích či armádním zásobování. Úloha ''Traffic Assignment Problem'' (TAP) se zaměřuje na dopady teorie her na optimalizaci toku, tj. zkoumá vliv více rozhodovatelů na celkové využití sítě. V práci se zaobíráme úlohou TAP s působením náhodných vlivů, k čemuž využíváme metod stochastické a vícestupňové optimalizace. Dále zkoumáme možnosti zlepšení stávajícího využití sítě za rozhodnutí autoritativního rozhodovatele, kterému je umožněn zásah do samotné struktury sítě, k čemuž využíváme víceúrovňové programování.
|
|
|
Selected optimization models in logistics
Málek, Martin ; Pavlas, Martin (referee) ; Popela, Pavel (advisor)
The bachelor thesis focuses on optimization models in logistics, which are solved by linear programming. Theoretical part introduces basic terms of graph theory, optimization, linear programming and network flows. Practical part contains mathematical models, their implementation, and obtained results. Furthermore, real-world application is solved at the end.
|
|
|
Network flows and their software support
Zdražil, Jan ; Sekničková, Jana (advisor) ; Chlapek, Dušan (referee)
This thesis deals with the maximum flow problem in network. First part describes and explains basic terms of graph theory, which gives theoretical base for following text. Next part is dedicated to algorithms that may be used to solve a maximum flow problem. Each described algorithm contains a brief history, general notation and a practical example. The next very important part of the thesis is in specific computer science applications such as computer vision and web mining. As an essential part of the thesis is developed software in programming language Java, which allows user to compare the implemented algorithms and to solve large network flows problems.
|
guest ::
