|
|
String Constraint Solving Through Parikh Images
Bartoš, Petr ; Havlena, Vojtěch (referee) ; Holík, Lukáš (advisor)
Tato bakalářská práce si klade za cíl implementovat alternativní způsob řešení řetězcových omezení pomocí takzvaného flattening algoritmu, který pomocí Parikhových obrazů a parametrických plochých automatů transformuje řetězcová omezení na lineární vzorce. Takto vyjádřené omezení je možné řešit pomocí výkonných SMT solverů a předchází problémům spjatým s tradičně používanými metodami založených na automatech, jako je například exploze stavového prostoru. Práce popisuje teoretické znalosti potřebné k pochopení algoritmu pro řešení a představuje další state of the art způsoby řešení. Výsledky implementace jsou poté porovnány s ostatnímy solvery na klasických soutěžních benchmarcích. Provedené experimenty ukazují smíšené výsledky – ač navržené řešení nedosahuje podobné rychlosti jako state-of-the-art solvery, přesnost podaproximačního přístupu je relativně příznivá.
|
|
|
Record Linkage in Genealogical Data
Šorm, Jan ; Rozman, Jaroslav (referee) ; Zbořil, František (advisor)
The main aim of this thesis is to study genealogical data, to find out possible problems in their merging and to implement methods for this data merging. In this thesis, it will be studied the problem of classifying similar names into common classes. This problem will be studied mainly because people's names and surnames play the most important role in every registry entry. In this thesis, it will be analyzed several metrics for calculating the distance between two strings. In addition, several experiments will be done for these metrics to classify names into classes with as few errors as possible. Based on these results, experiments for record linkage will be performed.
|
|
|
Record Linkage in Genealogical Data
Šorm, Jan ; Rozman, Jaroslav (referee) ; Zbořil, František (advisor)
The main aim of this thesis is to study genealogical data, to find out possible problems in their merging and to implement methods for this data merging. In this thesis, it will be studied the problem of classifying similar names into common classes. This problem will be studied mainly because people's names and surnames play the most important role in every registry entry. In this thesis, it will be analyzed several metrics for calculating the distance between two strings. In addition, several experiments will be done for these metrics to classify names into classes with as few errors as possible. Based on these results, experiments for record linkage will be performed.
|
|
|
String Analysis for Code Contracts
Dort, Vlastimil ; Parízek, Pavel (advisor) ; Kofroň, Jan (referee)
Using contracts such as method preconditions, postconditions, and class invariants in code is an approach to preventing bugs in object-oriented programs. In the .NET Framework, this is possible due to the framework of Code Contracts, which includes Clousot, a tool for static program analysis based on abstract interpretation. Although string is a fundamental type in .NET programs, Clousot does not have a usable support for analysis of string values. In this thesis, we explore the specifics of string manipulation in the C# language and in the .NET Framework, and show how they can be covered by static analysis. Our approach is to use the methods of the String class and a subset of regular expressions to specify string properties in code, and to use abstract interpretation with non-relational abstract domains to reason about those properties. We chose a small number of already published abstract domains for strings, which vary in their complexity and ability to represent different properties. We adapted those domains to our setting, including definitions of abstract semantics for the supported string methods. We implemented the abstract domains in Clousot in a way that cooperates with numerical analysis and allows adding more string abstract domains in the future. Powered by TCPDF (www.tcpdf.org)
|
|
|
Retail in Kazakhstan
Shaibakov, Timur ; Filipová, Alena (advisor) ; Zeman, Jiří (referee)
This thesis is devoted to retail in Kazakhstan. Main objective of this work is to make an overview of retail market in republic of Kazakhstan and analyze its specifics, history and current situation. Also, thesis includes description of shopping centers market in Kazakhstan and prediction of future trends in retail in context of entrance into Custom Union with Russia and Belorussia.
|
|
| |
|
|
Markovian processes and solving them in MS Excel
Löw, Alexandr ; Kořenář, Václav (advisor) ; Šindelářová, Irena (referee)
Markovian processes are stochastic processes modeling the behavior of units that is not deterministic. We know only the probability with which these units are transferred between states. Analysis of these processes is largely based on matrix multiplication, which can be, especially for larger number of states, difficult and time consuming while manually calculated. Therefore, these calculations are performed using computers. The aim of this work is to develop an application which will be realizing these calculations in MS Excel and presenting results in clear form. This application analyzes both the absorbing as well as regular markovian chains and is primarily intended for use in the teaching of stochastic models.
|
|
|
Applications of internet in tourist trade
Daniš, Michal ; Jakubíková, Dagmar (advisor) ; Blinka, Roman (referee)
Bakalářská práce se věnuje cestovnímu ruchu a internetu jako jednomu z nástrojů, který je aplikován v marketingu cestovního ruchu. Teoretická část obsahuje definice cestovního ruchu, příčiny jeho vzniku a postavení v národním hospodářství, historii a vývoj internetu. Praktická část mapuje aplikaci internetu při prodeji služeb hotelových řetězců, leteckých společností, autobusové a vlakové dopravy, při prodeji služeb cestovních kanceláří a agentur, ale i v individuální dopravě a turistice.
|
guest ::
