|
| |
|
|
‘‘Pilsen – a Hidden Potential of Rivers and Quays‘‘
Mareš, Martin ; Prudík, David (referee) ; Františák, Luboš (advisor)
Student Martin Mareš will be dealing with a phenomenon of quays in the city of Pilsen. The chosen place is situated in the wider range of the city centre touching the Radbůza river. The key to bring a life into this area doesn’t have to be just the quay of the river itself. The specific object of the diploma project will be specified or adjusted after agreement with the head of diploma project.
|
|
|
Analysis Tool for the Network Traffic Content
Mareš, Martin ; Ryšavý, Ondřej (referee) ; Veselý, Vladimír (advisor)
This paper is about designing and implementing a tool for analysis of the network traffic content. Work is part of the SEC6NET project at FIT - Brno University of Technology. The paper describes specific requirement for such a tool and existing solutions. The main part is devoted to design and implementation of new tool - Netfox Detective. Several problems are handled: data persistence, performance, extensibility, etc. The last part of work describes possibilities and features of the Netfox Detective. The work emphasises extensibility and future development of a created tool.
|
|
| |
|
|
Graphical Tool for Packet Generation
Mareš, Martin ; Bartoš, Václav (referee) ; Puš, Viktor (advisor)
This bachelor's thesis is about network packet generators. The first part is devoted to communication theory in computer networks from the perspective of TCP/IP architecture. The second part describes the results of search for currently available tools. The third part is devoted to design and implementation of own tool with graphical user interface for packets generation. The tool is designed object-oriented with an emphasis on ease of future expansion. The application concept includes also tools for generating dynamically changing series of packets to simulate network flows. The designed tool is implemented using the programming language C++ and the Qt framework. The last part contains an evaluation of results and comparison with the already available solutions.
|
|
|
Heuristics for paths in maps
Kudláčková, Lada ; Mareš, Martin (advisor) ; Kratochvíl, Miroslav (referee)
The content of the thesis is a description of heuristic procedures, which are used to find the shortest paths in the graphs and verify their effec- tiveness on the actual data. It deals with heuristics for Dijkstra's algorithm, especially the A* algorithm, which uses a lower distance-to-target estimate. Heuristics are implemented and tested on the road network of the Czech Re- public. 1
|
|
|
Vulnerabilities of web applications
Žák, Vojtěch ; Mareš, Martin (advisor) ; Parízek, Pavel (referee)
Se stále dostupnějším připojením k internetu roste i počet webových aplikací a jejich uživatelů. S tímto nárůstem - jak už to bývá se vším - se zvětšuje i počet lidí, kteří se snaží nedostatky v těchto aplikacích zneužít. V této práci si ukážeme, jak nejčastější zranitelnosti webových aplikací fungují, a jak se jich jako vývojáři můžeme vyvarovat. Zaměříme se i na to, jak odhalit zranitelnosti aplikací jako uživatelé, a jak provést útoky zneužívající tyto zranitelnosti. Součástí této bakalářské práce je také projekt Vulnerability Presentation Server (Vul- pes), který vznikal ve spolupráci se společností CZ.NIC. Jedná se o soubor webových aplikací, ve kterých jsou za účelem jejich demonstrace záměrně ponechány zranitelnosti zmíněné v tomto textu. 1
|
|
|
Visualizing OSPF topology
Turinský, Pavel ; Mareš, Martin (advisor) ; Forst, Libor (referee)
Network administrators need to be aware of the state of their network. While link- state routing protocols like OSPF have the required information, there was no easy way to present it to the administrator. To solve this problem, we developed Birdvisu, a program to visualise the topology as seen by the BIRD Internet Routing Daemon. Our approach allows the topology to be easily annotated with other data, providing an extensible way of analysing the topology. While not fully featured yet, Birdvisu helped discover several misconfigurations in a community-run network connecting about 1600 people. 1
|
|
|
Schoof's algorithm for Weierstrass curves
Zvoníček, Václav ; Drápal, Aleš (advisor) ; Mareš, Martin (referee)
Schoof's algorithm is the starting point for the most efficient methods for determining the number of rational points on an elliptic curve defined over a finite field. The goal of this thesis is to introduce the subject of elliptic curves, with the emphasis on Weierstrass curves over a finite field, to describe Schoof's algorithm and its time complexity, and, finally, to implement it in C++ with the support of NTL. The implementation provides a user with a reasonably fast utility for determining the order of Weierstrass curves over finite fields of size up to 128 bits. 1
|
|
|
Editor lezeckých tras
Sláma, Tomáš ; Mareš, Martin (advisor) ; Mirbauer, Martin (referee)
With the rising popularity of sport climbing and bouldering, there are increasing incentives to take it to the online space. This thesis does so in a way suitable for regular climbing gyms. A workflow for creating 3D hold and wall models and the accompanying editor has been developed, so that routes can be copied from the real world to the virtual one and be interacted with using software in a more immersive way. 1
|
guest ::
RSS feed.