|
|
Turn-based strategy
Poljak, Štěpán ; Zavoral, Filip (advisor) ; Plch, Tomáš (referee)
The aim of this thesis is the design and implementation of a network turn-based strategy for two and more players where every single player governs his towns, armies, resources and units, fights against other players and develops his heroes. Game contains 2D graphic interface and provides a possibility to play over local network based on client-server architecture. Program also contains artificial intelligence for computer player. Thesis also contains comparison with similar existing projects, description of possible aprroaches to solution of artificial intelligence in area of decision making and analysis of implementation problems, especially in area of network communication and artificial intelligence.
|
|
|
C++ Runtime for HelenOS
Jindrák, Jaroslav ; Děcký, Martin (advisor) ; Zavoral, Filip (referee)
In order for an operating system to support running programs written in any given programming language, it needs to provide a runtime environment for that language. The structure of the runtime varies depending on the language, but it generally consists of a tool allowing the program to run, which can be an interpreter or a runtime library, and a standard library providing functions and types used by the program. In this thesis we evaluate which parts of the C++ runtime are the most needed to support existing programs written in C++ and implement them for the HelenOS operating system. We then port an already existing open-source program written in C++ to verify the correctness of both our research and our implementation.
|
|
|
Map routing
Hrubý, Kryštof ; Zavoral, Filip (advisor) ; Šmelko, Adam (referee)
Web route planning applications have become common tools for cyclists. Although there is a relatively large number of such applications, they do not give a user enough options to choose a route according to his or her own preferences. Therefore, the aim of this thesis is to find a way to use known routing algorithms to create more individualized routes. To maintain the demands on the speed of route search, it is advisable to use heuristic algorithms that preprocess a routing graph. Furthermore, it is necessary to preprocess the routing graph for each combination of preferences in order to quickly find an optimal route with respect to entered preferences. As a proof of concept, a web application was created that uses one of the suitable heuristic algorithms (Contraction Hierarchies) to find optimal routes. The application also provides an interactive map editor and map search. The evaluation of the application showed that the proposed concept is functional, i.e., it is possible to find the required route according to the specified preferences in an acceptable time frame. 1
|
|
|
Collective Entity Matching Solution for ClueMaker Application
Jaroschy, Petr ; Zavoral, Filip (advisor) ; Nečaský, Martin (referee)
ClueMaker (CM) is a Java desktop application used for data visualisation (via graph) by subjects like insurance companies (to unravel fraud activity), Czech organisation Hlí- dač Státu (to identify connections between subjects) or many others. This application currently uses a naive way to merge entities from different data sources (matching one field by exact string match). Goal of this thesis is to analyse, create and integrate a solution to CM, which would allow for merging entities based on entity similarity, and integrate such solution into the GUI of CM. Such solution should allow the user to merge two graph entities, show user the potentially same or very similar entities and allow for a global scan of the graph for potential merges. Furthermore, this solution should make use of data relationships within CM in addition to the attributes of entities. 1
|
|
|
Client-side execution of PHP applications compiled to .NET
Husák, Tomáš ; Zavoral, Filip (advisor) ; Peška, Ladislav (referee)
Peachpie is a modern compiler enabling the compilation of PHP scripts into .NET. Blazor is a new part of the ASP.NET platform offering the usage of C# on a client side due to a new web standard, WebAssembly. This thesis explores a new approach of execution based on the integration between Peachpie and Blazor. PHP scripts can be referenced from Blazor and evaluated, but there are many steps to make it work. We analyzed these steps and designed a solution for inserting these scripts to Razor pages, navigating, and evaluating them. It results in a library containing helper classes to enable PHP programmers to move the PHP execution to a client side with the advantages of the Blazor environment. However, the difference of used technologies limits usage possibilities, which are shown by two benchmarks. 1
|
|
|
IntelliSense Implementation of a Dynamic Language
Míšek, Jakub ; Zavoral, Filip (advisor)
In the context of computer programming, the importance of computer assistance is being understood by many developer communities. Developers are e.g. using the same well known expressions or searching method signatures in library documentations. Code sense or IntelliSense methods make most of these actions unnecessary because they serve the available useful information directly to the programmer in a completely automated way. Recently, with the increased focus of the industry on dynamic languages a problem emerges - the complete knowledge on the source code is postponed until the runtime, since there may be ambiguous semantics in the code fragment. As a part of the Phalanger project the methods for syntax and semantic analysis of the dynamic code were designed, especially targeted for the PHP programming language. These methods produce a list of valid possibilities which can be then used on a specified position in the source code; such as declarations, variables and function parameters. This collected information can be also used to a fine-grained syntax highlighting.
|
|
|
Balancing Keyword-Based Data and Queries in Distributed Storage Systems
Wirth, Martin ; Parízek, Pavel (advisor) ; Zavoral, Filip (referee)
Research in the area of load balancing in distributed systems has not yet come with an optimal load balancing technique. Existing approaches work primarily with replication and sharding. This thesis overviews existing knowledge in this area with focus on shard- ing, and provides an experiment comparing a state-of-the-art load balancing technique called Weighed-Move with a random baseline and an existing domain-specific balancing implementation. As a significant part of the project, we engineered a generic and scal- able load balancer that may be used in any distributed system and deployed it into an existing ad system called Sklik. The major challenges appeared to be tackling various problems related to data consistency, performance and synchronization, together with solving compatibility issues with the rest of the still-evolving ad system. Our experiment shows that the domain-specific load balancing implementation produces data distribution that enables better performance, but Weighed-Move proved to have a great potential and its results are expected to be enhanced by further work on our implementation. 1
|
|
|
Multifilter-based Image Viewer
Hanák, Drahomír ; Zavoral, Filip (advisor) ; Kliber, Filip (referee)
The aim of this work is to design and implement a photo viewer program that can save user-defined metadata directly in photo files. That way, metadata will not be lost in case files are renamed or moved. Other goal of this work is to design a query language which can be used to search photos based on both the user defined metadata and existing file metadata. Created program should have a customizable user interface for viewing query results, editing user defined metadata and query editor which has a code-completion (IntelliSense) support. 1
|
|
|
Static data flow analysis for Java programs
Mečiar, Martin ; Zavoral, Filip (advisor) ; Kofroň, Jan (referee)
This thesis proposes a methodology for an acquisition of dependencies between outputs and inputs in Java programs by using static program analysis on bytecode of Java programs. JaBSSA methodology designed by the author is presented in the thesis. The methodology is based on a construction of context-sensitive call graph of the analyzed program and subsequent construction of directed data flow graph, where nodes containing particular metadata represent inputs and outputs of the analyzed program and edges represent data flows amongst them present in the analyzed program. The program on added CD contains JaBSSA's implemen- tation, which serves as a proof of the proposed concept. Java program examples together with test suite generating results of JaBSSA's implementation upon pre- pared Java program examples are part of the program. These generated results are used for demonstration of capabilities and flaws of the proposed concept. 1
|
|
|
Optimization of Stock Locations in Warehouses
Douša, Daniel ; Zavoral, Filip (advisor) ; Syrovátková, Jana (referee)
Warehouses contain different sections with locations that are suitable for different products divided by their size, weight, and especially turnover. The aim of the thesis is to design a model of distribution and automated reallocation of individual products within the warehouse from their receipt from suppliers to delivery to customers. It is necessary to incorporate behaviour towards new products without historical sales data, holding minimum and maximum stocks at individual locations, and adding or shifting products. The main goal of the whole work is to find an algorithm for inventory storage calculation so that the customer can get his order as quickly as possible. There are also secondary goals. These include, for example, the amount of inventory needed and the number of transfers. The solution found, even in the case of worse evaluation according to the main requirement, can be a better solution due to better evaluated side targets.
|
guest ::
