| |
|
Geolocation in Internet using latency measurements
Harth, Petr ; Balej, Jiří (referee) ; Komosný, Dan (advisor)
This diploma thesis is concerned with practical realization of CBG (Constraint-based Geolocation) algorithm, which is one of the IP (Internet Protocol) geolocation technique. IP geolocation determines the localization of a computer workstation location on the basis of on its IP address. The factors causing delays in data transfer are discussed first, followed by discussion of the issue of measuring these delays. The detailed explanation of IP geolocation follows where its contexts as well as the active geolocation techniques (techniques based on delay measurement mentioned above) are described. After that a brief description of PlanetLab experimental network, which was used for geolocation techniques measuring, is presented followed by a section explaining the creation of reference points and targets, which are another necessary prerequisite for practical realization of the method. Then the practical realization is explained in the form of CBGfinder program and its verification on the basis of artificial input data along with an actual example of IP geolocation of a point in the Internet are provided. Last but not least the measurement results of CBG algorithm are introduced, based on the analysis of Bestline parameters of one of the PlanetLab nodes measured in the period of one month, followed by a discussion of the inaccuracy of geological position and the computation speed. The cumulative distribution function as well as the kernel density estimation are also described. Final part of the thesis consists of discussion on measured results compared to results of other geological techniques results implemented by colleagues of the author of this diploma thesis. The results are compared on the basis of average inaccuracy of geological position estimations and its median, computation time, cumulative distribution function and kernel density estimation are also taken into regard.
|
|
Optimalization of Freight Railway Transport
Baše, Tomáš ; Fábry, Jan (advisor) ; Tichý, Filip (referee)
1 Introduction 2 Optimization models used in the rail transport 2.1 Distributional models 2.1.1 Transportation Problem 2.1.2 General Transportation Problem 2.1.3 Travelling Salesman Problem 2.2 Introduction to the Blocking Problem 2.2.1 Describtion of the Blocking Problem 2.2.2 Network Design Model 2.2.3 Objective Function 2.2.4 Column Generation 2.2.5 Branch and Price Algorithm 2.2.6 Evaluation of Model 3 Conclusion 4 List of the Literature
|
| |
|
Social media management of czech foundations and endowment funds
Kvitová, Klára ; Šlechtová, Věnceslava (advisor) ; Šťovíčková Jantulová, Magdaléna (referee)
The diploma thesis presents a picture of how the Czech foundations and endowment funds communicate on social networks and which social networks they use. The first part which is based on the relevant literature is devoted to the theoretical framework of social networks in overall public relations discipline. The latest findings from the world's research of this topic are included. The aim is to analyze the content of the message that is published by the organizations through the social networks and to define the target groups to which the communication is directed. The research part is devoted to a detailed content analysis of the posts of six foundations and four endowment funds on social networking site Facebook during six months. The communication is put into context with other social networks and other online channels that are used to communicate. The thesis can work as a theoretical background for a deeper insight into the problem. It also gives practical examples and insight useful in everyday work of nonprofit organizations.
|
|
Control of lift model
Žůrek, Martin ; Bradáč, Zdeněk (referee) ; Štohl, Radek (advisor)
My graduation theses is focused on project of algorithm proceedings laboratorial model of a lift and visualization in computer program Factory Talk View Studio. In introduction is written about industrial comunication network AS-Interface and in practise used algorithm proceedings of a lift. In following capitol is described system and several parts of laboratorial model of a lift. Not least is solved also comunication among floors of a lift, cabin and master AS-Interface and project of functional block in computer program RSLogix 5000. General purpose of master’s theses is project algorithm proceedings of a lift which use double-sided collecting proceedings. In last chapter is noticed project of visualization, which control a lift.
|
|
New IHL Framework for Cyber Warfare
Knopová, Eva ; Faix, Martin (advisor) ; Balaš, Vladimír (referee)
NEW IHL FRAMEWORK FOR CYBER WARFARE - ABSTRACT Regarding the increasing number of revealed cyber-attacks aimed at public facilities including the governmental ones by who seems to be other state actors, this thesis aims to reveal the major importance of cyber warfare, point out the fatal vacuum regarding the IHL framework currently in force and suggests its completion by a new IHL convention, which would regulate cyberwarfare in International Armed Conflicts. In order to provide a well-structured and pertinent arguments to support its main points, the thesis uses methods of qualitative analysis of the current IHL sources including international treaties, customary law and work of the main institutions of international justice along with work of judicial scholars and cyber experts. The work contains five main chapters. The first chapter presents the underlining principles of Laws of Wars, including its theory, history and development; and focuses on one of its three main regimes - the International Humanitarian Law. The second part is dedicated to the topic of cyber warfare, defines its scope as computer network attacks, explains their classification system, analyses their effects and provides examples of such attacks. The third chapter focuses on the issue of the current legal vacuum in relation to cyber...
|
|
Optical Motion Capturing
Zátopek, Martin ; Pelikán, Josef (advisor) ; Štěpán, Vladimír (referee)
Main thema of the thesis lies in optical motion capture algorithms and their usage with cheap webcameras. Multiple cameras connected to a single computer are taken into account, while using Video4Linux on the Linux operating system for reading image data. Two camera calibration algorithms are inspected in detail: Direct Linear Transformation and Tsai calibration. Practical part of the work deals with design and implementation of an optical motion capture system, using Reg Willson's implementation [5] of Tsai calibration. Documentation for the system contains description of calibration scene, semiautomatical procedure of retrieving calibration data, synchronization and storing data from multiple devices available on a local network. Final reconstruction of marker's 3D coordinates uses standard translational format TRC.
|
|
Accelerated Neural Networks on GPU
Tomko, Martin ; Zachariášová, Marcela (referee) ; Krčma, Martin (advisor)
This thesis deals with the implementation of an application for artificial neural networks simulation and acceleration using a graphics processing unit. The computation and training of feedforward neural networks using the Backpropagation algorithm are the main focus of this thesis, but the application also supports other network types, and it makes it possible to extend the application with different training algorithms. Next, the application allows us to create neural networks with structural anomalies, and thus, to test the neural network's fault tolerance. The application is implemented in the C++ language, using OpenCL to manage GPU computation. The Backpropagation acceleration results were compared with the free open source library FANN.
|
|
Procedurální generování měst
Beneš, Jan ; Wilkie, Alexander (advisor) ; Křivánek, Jaroslav (referee)
This thesis proposes a novel method for procedural generation of urban street networks. A simple traffic simulation, based on observations made about the social-geographic nature of cities, that is able to drive the temporal evolution of city road networks by creating new major roads, as well as a modified generation algorithm for minor roads, are described. The presented method is highly automated.
|
guest ::
