National Repository of Grey Literature 74 records found  previous11 - 20nextend  jump to record: Search took 0.00 seconds. 
Refaktorizace editoru stromů TrEd
Fabian, Peter ; Žabokrtský, Zdeněk (advisor) ; Kruliš, Martin (referee)
Title: Refactoring tree editor TrEd Author: Peter Fabian Department: Institute of Formal and Applied Linguistics Supervisor: doc. Ing. Zdenek Zabokrtsky, Ph.D., Institute of Formal and Applied Linguistics Abstract: The main goal of the thesis was to refactor tree editor TrEd, improve its modularity, maintainability and make its further development less difficult. Static and dynamic analysis of TrEd have been performed in order to help us find acrid spots in the source code. More than 230 subroutines and data structures have been moved between packages, 50 new packages and a test suite with more than 1,300 tests have been created. A new coding style have been chosen for further development and most severe violations of this standard have been fixed. After the changes done on the source code, it have been analyzed again and the results have been compared with the previous state. Keywords: Tree Editor TrEd, Perl, code refactoring, code analysis
A tool for validating electronic signatures on PDF documents
Selement, Pavel ; Peterka, Jiří (advisor) ; Kruliš, Martin (referee)
The subject of this graduation thesis is to study internal electronic signatures in PDF documents. The thesis introduces general principles of electronic signatures, deals with the internal structure of PDF documents including the connection of electronic signatures and describes the process of verifying an electronic signature. An integral part of this thesis is an implementation of an application, which performs verification of electronic signatures in a PDF document. The aim of this application is to verify the digital signature embedded in a PDF document according to the current legislation of the Czech Republic, while allowing users to change extensively the rules for evaluating the validity of the signature. Powered by TCPDF (www.tcpdf.org)
Algorithms for Parallel Searching in XML Datasets
Kruliš, Martin ; Yaghob, Jakub (advisor) ; Mareš, Martin (referee)
This thesis will address the problems of indexing XML datasets and finding effective searching methods for indexed data. Defining data structures and algorithms that take highly parallel approach to the searching problem is considered to be main objective, therefore the implementation may benefit from the power of multicore CPUs. Prototype of such implementation will be presented with the thesis. Internal query model will be developed as a common layer. Multiple front-ends representing different query languages will be able to operate on the top of this model, thus the engine will not be dependent on any particular language. Sample front-end for a subset of XPath will be implemented along with the prototype.
A Testing Tool for Network Applications
Schlindenbuch, Hynek ; Kruliš, Martin (advisor) ; Ježek, Pavel (referee)
The use of network communication in applications increases their complexity and can lead to new security vulnerabilities. Existing tools do not completely satisfy the needs of network application testing. The purpose of this thesis is to create a new tool that would make it easier to test network applications. The main focus is on the overall extensibility of the solution, primarily the ability to add new protocols. The created tool is capable to operate in client, server or proxy mode for supported network protocols and to control their communication manually or using a script. Support for other protocols can be added through plugins. The tool also includes a library for implementing application layer protocols over TCP and UPD, which was used to create plugins for HTTP and WebSocket. Powered by TCPDF (www.tcpdf.org)
Fashionspace Portal
Flídr, Jindřich ; Holan, Tomáš (advisor) ; Kruliš, Martin (referee)
Title: Fashionspace Portal Author: Jindřich Flídr Department: Department of Software and Computer Science Education Supervisor: RNDr. Tomáš Holan, Ph.D. Abstract: The aim of this thesis is to design architecture and implement web application "Fashionspace". This application allows user to create virtual fashion shows based on videos in an interactive environment. The client application is implemented using the Adobe Flash platform and communicates with the CMS Drupal using services. The application is integrated with many technologies, such as online user communication using the XMPP protocol or HD video streaming. The architecture of this application is modular and is built on the principles of MVC. Keywords: web technologies, RIA, Adobe Flex, CMS Drupal, video streaming
Bezpečnostní auditor WWW stránek
Steinhauser, Antonín ; Novotný, Miroslav (advisor) ; Kruliš, Martin (referee)
This work solves the problematics of web pages security primarily from the side of dynamic web application programmers. It describes single mistakes, that programmers perpetrate and declares, how is possible prevent these mistakes and what unpleasant possibilities of abuse these mistakes offer to potential attackers. The main part of the work is the program, which machinely searches majority of those errors. It functions in two phases - in the rst phase it explores a domain or alternatively de ned set of pages and detects potentially vulnerable locations and in the second phase it sends attack queries to these locations and by analysis of its replies detects security vulnerabilities.
Application of User Ratings Prediction Methods for The Film Recommendations
Major, Martin ; Kruliš, Martin (advisor) ; Eckhardt, Alan (referee)
The aim of this work is to explore recommender systems for prediction user's future film ratings according to their previous ratings. Author will describe available algorithms and compare their results with his own algorithm. The goal is to find algorithm with the highest prediction accuracy and find the most important parameters for a good predictions.
Searching in GPS maps
Hykl, Martin ; Pangrác, Ondřej (advisor) ; Kruliš, Martin (referee)
This work is about routing in maps. There are few topics here: How to prepare a graph from a map, what algorithms can we use, can we really find a useful route for user, and many more. At the end of this work there are descriptions of a few experiments which I used to prove correctness of some ideas how to make routing algorithms faster and better. You can also find a manual to SnailMap 2.3b there.
Employing Parallel Architectures in Similarity Search
Kruliš, Martin ; Yaghob, Jakub (advisor) ; Platoš, Jan (referee) ; Pllana, Sabri (referee)
This work examines the possibilities of employing highly parallel architectures in database systems, which are based on the similarity search paradigm. The main objective of our research is utilizing the computational power of current GPU devices for similarity search in the databases of images. Despite leaping progress made in the past few years, the similarity search problems remain very expensive from a compu- tational point of view, which limits the scope of their applicability. GPU devices have a tremendous computational power at their disposal; however, the usability of this power for particular problems is often complicated due to the specific properties of this architecture. Therefore, the existing algorithms and data structures require extensive modifications if they are to be adapted for the GPUs. We have addressed all the aspects of this domain, such as efficient utilization of the GPU hardware for generic computations, parallelization of similarity search process, and acceleration of image indexing techniques. In most cases, employing the GPU devices brought a speedup of two orders of magnitude with respect to single-core CPUs and approximately one order of magnitude with respect to multiprocessor NUMA servers. This thesis summarizes our experience and discoveries from several years of research,...
Security and Trust in the DEECo Component Model
Štumpf, Ondřej ; Bureš, Tomáš (advisor) ; Kruliš, Martin (referee)
DEECo represents an example of a Cyber-Physical System (CPS) consisting of potentially vast number of components able to share data with each other. So far, access to data was not restricted, thus enabling components to exploit sensitive data owned by other components. The goal of this work is to analyze security threats in distributed environments such as DEECo and propose a security solution which would provide both physical security of component data and introduce an access control mechanism. However, while confidentiality may be critical to certain applications, data integrity is crucial to almost every one. This work therefore also proposes a trust model, which prevents components operating with defective or malicious data. Both proposed models are realized in jDEECo, a Java implementation of DEECo.

National Repository of Grey Literature : 74 records found   previous11 - 20nextend  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.