|
|
Towards Static Analysis of Languages with Dynamic Features
Hauzar, David ; Plášil, František (advisor) ; Sinz, Carsten (referee) ; Holík, Lukáš (referee)
Dynamic features of programming languages such as dynamic type system, dynamic method calls, dynamic code execution, and dynamic data structures provide the flexibility which can accelerate the development, but on the other hand they reduce the information that is checked at compile time and thus make programs more error-prone and less efficient. While the problem of lacking compile time checks can be partially addressed by techniques of static analysis, dynamic features pose major challenges for these techniques sacrificing their precision, soundness, and scalability. To tackle this problem, we propose a framework for static analysis that automatically resolves these features and thus allows defining sound and precise static analyses similarly as the analyzed program would not use these functions. To build the framework, we propose a novel heap analysis that models associative arrays and dynamic (prototype) objects. Next, we propose value analysis providing additional information necessary to resolve dynamic features. Finally, we propose a technique that automatically and generically combines value analysis and a heap analysis modeling associative arrays and prototype objects. Powered by TCPDF (www.tcpdf.org)
|
|
|
Rozpoznávání pozic deskové hry go z fotografií
Musil, Tomáš ; Baudiš, Petr (advisor) ; Hauzar, David (referee)
It is customary to keep a written game record of professional or high-rank amateur tournament games of Go. Even informal games are worth recording for subsequent analysis. Writing the game record by hand distracts the player from the game and it is not very reliable. Video or photographic record lacks the flexibility of abstract notation. In this thesis we discuss several ways of automatically extracting Go game records from photographs. We propose our own method based on Hough transform and RANSAC paradigm. We implement a reliable and easy to use system that allows players to take a game record effortlessly. Powered by TCPDF (www.tcpdf.org)
|
|
|
3D akční hra v podivném městě
Havránek, Štěpán ; Balyo, Tomáš (advisor) ; Hauzar, David (referee)
This thesis deals with a conception and implementation of a real-time 3D action game. This game is placed in a bizzare surrounding that is not a subset of an ordinary real three- dimensional linear space. The work presents the whole game implementation process. It goes through various sets of techniques, algorithms and data structures used or considered during the development. It also describes different ways of solving specified problems and the choices between them. Moreover there are artificial beings situated in the town inside the surrounding. The player's goal is to capture the whole city. There is also an opponent, who systematically plans his tasks and tries to possess the city as well.
|
|
|
A study of applying copulas in data mining
Ščavnický, Martin ; Holeňa, Martin (advisor) ; Hauzar, David (referee)
Title: A study of applying copulas in data mining Author: Martin Ščavnický Department: Department of Theoretical Computer Science and Mathe- matical Logic Supervisor: RNDr. Ing. Martin Holeňa CSc., Department of Theoretical Computer Science and Mathematical Logic Abstract: Copulas are functions that describe the relationship between a multivariate distribution function and its marginals. They provide a way to model multivariate distribution functions, and are extensively used in finance and studied in data mining. In practice, there are many different copula families and no standard way for choosing the right one. In our work, we compare suitability of different copula families in data mining. We fit classification data using 8 copula families and compare them using 3 mea- sures of fit. We also use a classification algorithm based on copulas and compare its accuracy for different copula families. The results indicate that elliptical copulas fit our data better, but hierarchical Archimedean copulas give comparable accuracy in the classification. We also propose and test a modified method for modelling data using hierarchical Archimedean copu- las, which fits some datasets with negative dependence between attributes better. Based on this modified method, we propose a visualization of depen- dence in data and observe...
|
|
|
Web Reader and Library of Articles
Juraszek, Adam ; Svoboda, Martin (advisor) ; Hauzar, David (referee)
Title: Web Reader and Article Library Author: Adam Juraszek Department: Department of Software Engineering Supervisor: RNDr. Martin Svoboda, Department of Software Engineering Abstract: The aim of this thesis is to design and implement a reader web appli- cation, which can watch article sources on the Internet using RSS and Atom feeds. The difference from similar applications is in integration of other services and options: watching websites that do not provide news feeds, backing up web pages, saving articles into user-managed library and a source recommendation system. The application is programmed in Java and consists of three parts: the server part developed on Google AppEngine, the client part using GWT framework and an optional cross-browser extension. The Web reader is designed to work with large amounts of data and can be easily extended. The thesis also contains an analysis of the characteristics of available readers and various recommendation systems. Keywords: web application, RSS reader, AppEngine, GWT 1
|
|
|
Verification of Textual Use-Cases
Vinárek, Jiří ; Šimko, Viliam (advisor) ; Hauzar, David (referee)
The aim of this thesis is to create a tool for formal verification of systems specified using textual use- cases. The tool should allow for automated verification of temporal invariants specified in temporal logic (CTL and LTL formulae). The textual specification is transformed to a formal model that is verified using the NuSMV symbolic model-checker. Potential errors are shown to the user in the form of an HTML report. Using this feedback, the user is able to iteratively develop valid textual use-case specifications. The tool's architecture should be focused on reusability of its components and extensibility. Powered by TCPDF (www.tcpdf.org)
|
|
|
Systém pro správu úkolů a testů
Konopásek, Jan ; Holubová, Irena (advisor) ; Hauzar, David (referee)
The goal of this thesis is to implement a software system facilitating management of homework assignments and automated generation of tests. From the teachers' point of view, homework management means creation of problems, their assignment to students, and correction and rating of solutions. For students, it means handing in solutions to assigned problems and solution rating overview. The focus of this thesis is the description of implementation and utilization of the Assignment Manager web application. Apart from the goals described above, the application also enables the management of user groups, sharing of problems among student groups within the scope of a single course, and using external "plug-ins" for automated correction of solutions. Furthermore, it is capable of automated generation of tests from saved sets of test questions. The application was field-tested during a single semester and it was extended based on the teachers' and students' suggestions. The thesis includes a discussion of the differences between the original assumptions serving as the basis for the application's implementation and the demands of live deployment.
|
|
|
Information System for Retail Grocery Shops
Le, Marek ; Kopecký, Michal (advisor) ; Hauzar, David (referee)
This thesis discuss topic of Grocery shop management software. Primary function is Point of Sale software which is extended by back-office solution including inventory management, management reports, reports required by law etc. Poznámka: SIS píše chybu při nahrávání tohoto souboru, vyžaduje více slov, ale zároveň požaduje abstrakt, což chápu jako kopii abstraktu z odevzdané bakalářské práce. Proto nechávám abstrakt v přesné podobě, jak je uveden v bakalářské práci. Použil jsme doporučený konvertor. Detail chyby: Vybraný soubor BPBC_2010_1__0_229690_0_89245.pdf se nepodařilo uložit Soubor PDF není prohledávatelný. Soubor obsahuje málo slov anebo obsahuje pouze obrázky (problém vzniká nejčastěji při skenování dokumentu bez OCR konverze).
|
|
|
Accelerating evolutionary algorithms by decision trees and their generalizations
Klíma, Jan ; Holeňa, Martin (advisor) ; Hauzar, David (referee)
Evolutionary algorithms are one of the most successful methods for solving non-traditional optimization problems. As they employ only function values of the objective function, evolutionary algorithms converge much more slowly than optimization methods for smooth functions. This property of evolutionary algorithms is particularly disadvantageous in the context of costly and time-consuming empirical way of obtaining values of the objective function. However, evolutionary algorithms can be substantially speeded up by employing a sufficiently accurate regression model of the empirical objective function. This thesis provides a survey of utilizability of regression trees and their ensembles as a surrogate model to accelerate convergence of evolutionary optimization.
|
|
|
Rummy Card Game Platform
Smolík, Jiří ; Malohlava, Michal (advisor) ; Hauzar, David (referee)
Rummy ("Žolíky" in czech) is one of the most commonly played card games. It is popular due to its simplicity and variability in rules. A lot of Rummy game platforms exist in the world, but they do not allow for unlimited playing for free and lack any advanced communication means among players. This work designs and implements a desktop game platform for Rummy. The main reason for creating it was the absence of a similar non-commercial application which would not focus on hazard but rather on "letting go", communication and fun. The proposed platform provides advanced features to communicate and play, either for fun or to win tournaments. It also supports playing games with users` own rules and against their own computer opponents.
|
guest ::
