|
|
Distance measurement between nodes in IP networks
Šimák, Jan ; Novotný, Vít (referee) ; Komosný, Dan (advisor)
This thesis deals with delay prediction issue between nodes on the Internet. Accurate delay prediction helps with choosing of the nearest internet neighbor and contributes to effective usage of network sources. Unnecessary network load is decreased due to algorithms of delay prediction (no need for many latency measuring). The thesis focuses theoretically on the three main algorithms using coordinate systems - GNP, Vivaldi, Lighthouses. Last one is at the same time the main subject of the thesis too. Algorithm Lighthouses is explored in detail theoretically and in practise too. In order to verify the accurate of delay prediction of Lighthouses algorithm the simulation application was developed. The application is able to compute node coordinates of synthetic network using Lighthouses algorithm. Description of simulation application and evaluation of simalution results are part of practice part of this thesis.
|
|
|
Solution of inverse problem for a flow around an airfoil
Šimák, Jan ; Feistauer, Miloslav (advisor) ; Felcman, Jiří (referee) ; Sváček, Petr (referee)
Title: Solution of inverse problem for a flow around an airfoil Author: Mgr. Jan Šimák Department: Department of Numerical Mathematics Supervisor: prof. RNDr. Miloslav Feistauer, DrSc., dr. h. c., Department of Numerical Mathematics Abstract: The method described in this thesis deals with a solution of an inverse problem for a flow around an airfoil. It can be used to design an airfoil shape according to a specified velocity or pressure distribution along the chord line. The method is based on searching for a fixed point of an operator, which combines an approximate inverse and direct operator. The approximate inverse operator, derived on the basis of the thin airfoil theory, assigns a corresponding shape to the specified distribution. The resulting shape is then constructed using the mean camber line and thickness function. The direct operator determines the pressure or velocity distribution on the airfoil surface. We can apply a fast, simplified model of potential flow solved using the Fredholm integral equation, or a slower but more accurate model of RANS equations with a k-omega turbulence model. The method is intended for a subsonic flow.
|
|
|
Solution of inverse problem for a flow around an airfoil
Šimák, Jan ; Feistauer, Miloslav (advisor) ; Felcman, Jiří (referee) ; Sváček, Petr (referee)
Title: Solution of inverse problem for a flow around an airfoil Author: Mgr. Jan Šimák Department: Department of Numerical Mathematics Supervisor: prof. RNDr. Miloslav Feistauer, DrSc., dr. h. c., Department of Numerical Mathematics Abstract: The method described in this thesis deals with a solution of an inverse problem for a flow around an airfoil. It can be used to design an airfoil shape according to a specified velocity or pressure distribution along the chord line. The method is based on searching for a fixed point of an operator, which combines an approximate inverse and direct operator. The approximate inverse operator, derived on the basis of the thin airfoil theory, assigns a corresponding shape to the specified distribution. The resulting shape is then constructed using the mean camber line and thickness function. The direct operator determines the pressure or velocity distribution on the airfoil surface. We can apply a fast, simplified model of potential flow solved using the Fredholm integral equation, or a slower but more accurate model of RANS equations with a k-omega turbulence model. The method is intended for a subsonic flow.
|
|
|
Distance measurement between nodes in IP networks
Šimák, Jan ; Novotný, Vít (referee) ; Komosný, Dan (advisor)
This thesis deals with delay prediction issue between nodes on the Internet. Accurate delay prediction helps with choosing of the nearest internet neighbor and contributes to effective usage of network sources. Unnecessary network load is decreased due to algorithms of delay prediction (no need for many latency measuring). The thesis focuses theoretically on the three main algorithms using coordinate systems - GNP, Vivaldi, Lighthouses. Last one is at the same time the main subject of the thesis too. Algorithm Lighthouses is explored in detail theoretically and in practise too. In order to verify the accurate of delay prediction of Lighthouses algorithm the simulation application was developed. The application is able to compute node coordinates of synthetic network using Lighthouses algorithm. Description of simulation application and evaluation of simalution results are part of practice part of this thesis.
|
|
| |
guest ::
RSS feed.