National Repository of Grey Literature 52 records found  previous11 - 20nextend  jump to record: Search took 0.01 seconds. 
Optimization of warehouse locations by evolutionary algorithms
Nagy, Marek ; Neruda, Roman (advisor) ; Kratochvíl, Miroslav (referee)
In this thesis, we propose an algorithm to solve the warehouse location-routing prob- lem. The task represents a difficult combinatorial optimization problem that is of great practical importance in logistic applications. It is a combination of multiple well-known problems that cannot be solved separately and therefore we approach this as a new prob- lem completely. We introduce Evolutionary Algorithms and their basic concepts as well as define our specific problem more specifically and we use a branch of Evolutionary Algorithms to optimize the placement of warehouses on a given map. Since our main goal is to optimize delivery time, we also run experiments in order to determine how the algorithm performs compared to Evolutionary Algorithm optimizing distance. We also do not take into consideration cost of warehouse itself nor cost of storing and cost of the trucks since goal of this thesis is to optimize delivery time. 1
Remixing OSM maps using recurrent neural networks
Sedlák, Filip ; Kratochvíl, Miroslav (advisor) ; Kruliš, Martin (referee)
Generation of random realistic maps is a highly desirable content creation method for entertainment industry. Neural networks provide powerful com- putational capabilities proven useful in many fields. This thesis describes an algorithm that adapts real-world data to train Recurrent Neural Networks (RNNs) inspired by the pixel RNNs. An algorithm is constructed to gener- ate a map of altitudes, roads, rivers and buildings. The results are tested and evaluated on multiple selected real-world regions. It shows the ability of RNNs to learn and create random realistic maps. Algorithm generates real- istic altitude maps reflecting user input and training dataset. The creation of roads and rivers was met with weaker results. The creation of buildings was met with unsatisfactory results. 1
Additive Pairs in Quantitative Type Theory
Svoboda, Tomáš ; Šefl, Vít (advisor) ; Kratochvíl, Miroslav (referee)
Both dependent types and linear types have their desirable properties. Department types can express functional dependencies of inputs and outputs, while linear types offer control over the use of computational resources. Combining these two systems have been difficult because of their different interpretations of context presence of variables. Quantitative Type Theory (QTT) combines dependent types and linear types by using a semiring to track the kind of use of every resource. We extend QTT with the additive pair and additive unit types, express the complete QTT rules in bidirectional form, and then present our interpreter of a simple language based on QTT. 1
Remixing OSM maps using recurrent neural networks
Sedlák, Filip ; Kratochvíl, Miroslav (advisor) ; Kruliš, Martin (referee)
Generation of random realistic maps is a highly desirable content creation method for entertainment industry. Neural networks provide powerful com- putational capabilities proven useful in many fields. This thesis describes an algorithm that adapts real-world data to train Recurrent Neural Networks (RNNs) inspired by the pixel RNNs. An algorithm is constructed to gener- ate a map of altitudes, roads, rivers and buildings. The results are tested and evaluated on multiple selected real-world regions. It shows the ability of RNNs to learn and create random realistic maps. Algorithm generates real- istic altitude maps reflecting user input and training dataset. The creation of roads and rivers was met with weaker results. The creation of buildings was met with unsatisfactory results. 1
Scalable dynamic graph-based vehicular routing
Polický, Adam ; Kratochvíl, Miroslav (advisor) ; Švancara, Jiří (referee)
Algorithms for finding shortest paths in large graphs form an essential part of many modern navigation and routing systems. In vehicular navigation, the problem is compli- cated by dynamic nature of the network caused by road closures and changes in traffic, preventing application of many common speed-up techniques. The aim of this thesis is to design an algorithm for finding paths in large graphs that gains efficiency and scalability by minimizing the number of visited graph objects in storage. This was achieved by itera- tively simplifying the graph into a multi-layered approximative structure, and developing a modification of Dijkstra's algorithm that allow efficient navigation in the structure. The results show that the proposed method examines 4× less graph objects than A* and 14× less than Dijkstra, achieving better performance at the cost of slightly longer discovered paths. Additionally, the layered structure is able to accommodate changes in the base graph, allowing the algorithm to work on a changing network without costly recomputations. 1
Applications of graph theory in protein function prediction
Kalábová, Nikola ; Hartman, David (advisor) ; Kratochvíl, Miroslav (referee)
The rapid development of the whole-genome sequencing methods and their reducing cost resulted in a huge number of sequenced genomes. Developing reliable methods for in- silico annotation of the expeditiously growing number of sequenced genomes is the next challenge of modern biology. We described a graph-theoretical approach for function prediction from the protein-protein interaction networks and outlined its strengths and weaknesses. We illustrate the principles of this approach on selected algorithms based on different ideas and provide their comparison and evaluation. 1
Tokenization-aware Diff and Patch
Antoniewicz, Arkadiusz Martin ; Kratochvíl, Miroslav (advisor) ; Horký, Vojtěch (referee)
File comparison algorithms and utilities 'diff', 'patch' and 'diff3' are widely used in programming for the purpose of code comparison, and in many version control systems. Despite the usefulness, the differences and patches produced by the tools are strictly line-oriented, which complicates processing of differently formatted data, such as free flowing text, markup, and various other formats where line breaks are not crucial. This thesis de- scribes and implements a customizable version of these tools, which allows the user to specify an arbitrary tokenization of the input, thus allowing easy diffing, patching and change-merging of content not supported by the tradi- tional diff. Additionally, the thesis describes a newly appearing challenge of managing the whitespace in the patches, and demonstrates the functional- ity on a practical use-case that can not be performed with the current diff utilities. 1
Interactive environment for flow-cytometry data analysis
Molnárová, Soňa ; Kratochvíl, Miroslav (advisor) ; Pacovský, Jan (referee)
Pr·toková cytometrie je metoda pro měření chemických vlastností jed- notlivých buněk v roztoku, s aplikacemi v biologickém a klinickém výzkumu. Nedávny pokrok technologií pr·tokové cytometrie umožňuje mimořádně snadně vyrobit větší soubory dat, které popisují další zajímavé jevy, které vytváří nové výzvy pro zpracování dat a softwaru pro analýzu. Tato práce popisuje a implementuje prototyp softwaru, který zjednodušuje zpracování dat im- plementací interaktivního pipeline editoru pro analýzu, který je navržen tak, aby efektivně zpracovával obrovské soubory dat. Funkcionalita soft- waru je demonstrována implementací nejnovějšího algoritmu analýzy dat a porovnáním efektivity zdroj· s typickým nástrojem pro analýzu v pro- gramu R. Budoucí využití softwaru biology a lékaři je usnadněno poskytnutím jednoduchého rozhraní pro přidávání nových algoritm·, čímž se rozšiřuje funkčnost. 1
High-performance exploration and querying of selected multi-dimensional spaces in life sciences
Kratochvíl, Miroslav ; Bednárek, David (advisor) ; Glaab, Enrico (referee) ; Svozil, Daniel (referee)
This thesis studies, implements and experiments with specific application-oriented approaches for exploring and querying multi-dimensional datasets. The first part of the thesis scrutinizes indexing of the complex space of chemical compounds, and details a design of high-performance retrieval system for small molecules. The resulting system is then utilized within a wider context of federated search in heterogeneous data and metadata related to the chemical datasets. In the second part, the thesis focuses on fast visualization and exploration of many-dimensional data that originate from single- cell cytometry. Self-organizing maps are used to derive fast methods for analysis of the datasets, and used as a base for a novel data visualization algorithm. Finally, a similar approach is utilized for highly interactive exploration of multimedia datasets. The main contributions of the thesis comprise the advancement in optimization and methods for querying the chemical data implemented in the Sachem database cartridge, the federated, SPARQL-based interface to Sachem that provides the heterogeneous search support, dimensionality reduction algorithm EmbedSOM, design and implementation of the specific EmbedSOM-backed analysis tool for flow and mass cytometry, and design and implementation of the multimedia...
Development of MMORPG games in a decentralized environment
Polák, Marek ; Gemrot, Jakub (advisor) ; Kratochvíl, Miroslav (referee)
This thesis examines methods which could be used for developing MMORPG games so that there is no single entity that could arbitrarily control game mechanics, virtual assets or other game aspects. The theoretical part systematically analyzes the usual aspects of MMORPG games, then the principles of decentralized cryptocurrencies are presented, and one of them, Ethereum, is analyzed in more detail. Based on this theoretical knowledge, methods are proposed on how to use Ethereum to implement the identified aspects of MMORPG games, and the restrictions which must be imposed on these aspects are recognized. The practical part then introduces a specific implementation of MMORPG game on Ethereum, which demonstrates the above methods. In conclusion, the chosen approach is compared to the games with a common client-server architecture, especially in terms of complexity and gaming costs. 1

National Repository of Grey Literature : 52 records found   previous11 - 20nextend  jump to record:
See also: similar author names
20 KRATOCHVÍL, Martin
14 KRATOCHVÍL, Michal
1 Kratochvíl, M.
2 Kratochvíl, Marek
20 Kratochvíl, Martin
2 Kratochvíl, Martin Dominik
4 Kratochvíl, Matouš
12 Kratochvíl, Matěj
1 Kratochvíl, Maxim
14 Kratochvíl, Michal
1 Kratochvíl, Milan
1 Kratochvíl, Miloslav
1 Kratochvíl, Miloš
Interested in being notified about new results for this query?
Subscribe to the RSS feed.