National Repository of Grey Literature 16 records found  1 - 10next  jump to record: Search took 0.01 seconds. 
Frege IDE with JetBrains MPS
Satmári, István ; Parízek, Pavel (advisor) ; Kratochvíl, Miroslav (referee)
Frege is an open-source project which brings the popular functional programming language Haskell to the Java ecosystem. JetBrains MPS is an open-source language workbench which allows users to design a new language and build an integrated development environment with a projectional (structured) editor for the created language. In this work we analyzed Frege grammar and created an IDE based on MPS that assists developers with writing code in the Frege language. Our environment includes a set of intuitive editors for editing Frege syntax, provides a simple type checking and implements code generators for the Frege language. Aim of the Frege IDE is its usability. Additionally, the thesis compares projectional editors with the more common plain-text IDEs, such as Eclipse, and evaluates whether they offer any advantage for editing purely functional programming languages.
Adversarial examples generation for deep neural networks
Procházka, Štěpán ; Neruda, Roman (advisor) ; Kratochvíl, Miroslav (referee)
Machine learning models exhibit vulnerability to adversarial examples i.e., artificially created inputs that become misinterpreted. The goal of this work is to explore black-box adversarial attacks on deep networks performing image classification. The role of surrogate machine learning models for adversarial attacks is studied, and a special version of a genetic algorithm for generating adversarial examples is proposed. The efficiency of attacks is validated by a multitude of experiments with the Fashion MNIST data set. The experimental results verify the usability of our approach with surprisingly good performance in several cases, such as non-targeted attack on residual networks.
Pattern recognition for in-game spell systems
Mikuš, Pavel ; Kratochvíl, Miroslav (advisor) ; Šefl, Vít (referee)
Magic is a popular element in current computer games. Although most games spoil the sensation of magic as of something extraordinarily subtle by allowing the player to cast spells by simply hitting key combinations, several games require the player to finish a more complicated action before casting a spell: Drawing a complicated glyph that represents the spell is one of such actions. This thesis aims to provide a repurposable library that would allow simple implementation of structured glyph-drawing-based in-game spell systems. The thesis studies several relevant approaches to pattern recognition, describes a neural-network based method for recognition of various shapes and shape combinations, develops a system for describing the parameters and results of the used algorithm in terms of predefined spell shapes and their recognized combinations, and implements this approach in a library and an accompanying simple demonstrational game. The library and its parameters are benchmarked and systematically optimized.
A Minimalistic Directory Service
Hrubý, Ondřej ; Mareš, Martin (advisor) ; Kratochvíl, Miroslav (referee)
We present a light, simple and secure network protocol for accessing di- rectory services called Feather-weight Directory Access Protocol (FDAP). It is inspired by Lightweight Directory Access Protocol (LDAP), but the con- cept of a directory service is built from scratch. This decision is supported by analysis of shortcomings of LDAP which has seen widespread use in the past. We provide specifications both of an FDAP service and the protocol, exam- ples of well-tested server implementation, client library and an application as a proof of concept.
Plánovač síťového provozu pro diferencované služby
Bali, Michal ; Kratochvíl, Miroslav (advisor) ; Matěna, Vladimír (referee)
Service differentiation, the ability of the QoS-providing mechanisms to sa- tisfy different requirements of different network traffic types, is an important part of the Internet service delivery. Usual methods of improving differen- tiated service QoS require centralized traffic scheduling, which on the other hand can not react to disturbances in transit network of typical ISPs. In this thesis we describe, implement and benchmark a traffic scheduler that is simple enough to be placed at the exact bottleneck of the network where it precisely reacts to network problems; at the same time it supports a multi-flow multi-priority stochastical traffic scheduling that guarantees a level of fairness and service differentiation. The design is built on previous research in the area - it combines the ideas of CoDel with SFQ. We implement the resulting traffic scheduler, called Multilevel Stochasti- cally Fair CoDel (MSFC), in the ns-3 network simulator. Benchmarks on a simulated ISP-like network show improvements in QoS of the differentiated services in comparison with other non-centralized classless traffic schedulers.
Modern approach to user interfaces for e-mail
Hruška, Marcel ; Kratochvíl, Miroslav (advisor) ; Škoda, Dominik (referee)
Webmails are indisposable interfaces for working with the e-mail on the current Internet, mostly because of the simplicity of their deployment in bro- wsers and easy integration with many provider-specific features. The most important features that are partially or fully missing in current open-source webmail implementations include directory-less mail organization by tags, navigation driven by a high-performance fulltext search, and integration of time-management capabilities. This thesis describes a new open-source alter- native to advanced commercial webmails that possesses these features. The software integrates full-text search capabilities of the ElasticSearch database with current e-mail processing infrastructure on UNIX systems to create a back-end server application, which is used by a Javascript-based browser front-end. The performance of the solution is tested on a large e-mail dataset. 1
Využití simulovaného žíhání pro optimalizaci molekulárních otisků ve virtuálním screeningu
Filandr, Adam ; Hoksza, David (advisor) ; Kratochvíl, Miroslav (referee)
Ligand based virtual screening can be realised with various molecular rep- resentations. Fragment-feature representation represents the molecules as a set of fragments, where each fragment receives a set of descriptors. First goal of this thesis is to find suitable similarity function for such represen- tation. This representation can also be improved by assigning a weight for each descriptor, which gives it a priority in a given similarity function. The second goal of this thesis is to examine simulated annealing as an algorithm used to find the weights. We experimentally analysed the influence of various fragment types, descriptor types, similarity functions, correlated descriptors, fragment noise and parameters of simulated annealing. Because the experi- ments are computationally demanding, we also created a tool for large scale computations. 1
Výkonná simulace destrukce prostředí ve hrách
Dobranský, Marek ; Kratochvíl, Miroslav (advisor) ; Vinárek, Jiří (referee)
Destructible environments have become a popular feature of computer games. Currently used game engines employ different approaches to imple- ment such environment. This thesis studies several such approaches and implements some key ideas from available research in a new, combined ap- proach. We use tessellations and boolean operations on triangular meshes to modify rigid-body objects that represent game environment, and create a simple application to demonstrate the approach in a real-time environment. We conclude that the proposed method is mainly suitable for computer games that feature low-polygon meshes. 1
λ-calculus as a Tool for Metaprogramming in C++
Šefl, Vít ; Hric, Jan (advisor) ; Kratochvíl, Miroslav (referee)
The template system of C++ is expressive enough to allow the programmer to write programs which are evaluated during compile time. This can be exploited for example in generic programming. However, these programs are very often hard to write, read and maintain. We introduce a simple translation from lambda calculus into C++ templates and show how it can be used to simplify C++ metaprograms. This variation of lambda calculus is then extended with Hindley-Milner type system and various other features (Haskell-like syntax, user-defined data types, tools for interaction with existing C++ template code and so on). We then build a compiler capable of transforming programs written in this language into C++ template metaprograms. Powered by TCPDF (
Design and implementation of a language for code-golf challenge
Kliber, Filip ; Parízek, Pavel (advisor) ; Kratochvíl, Miroslav (referee)
Code-golf is one of types of programming competitions. Primary objective of such competition is to provide a solution to relatively simple programming task, such that the length of the source code is minimal in terms of bytes. The goal of my thesis is to design and implement a programming language that is suited for code-golf challenges. The language is designed with respect to beginners in the code-golf domain. It preserves readability and intelligibility, and it is based on popular programming languages, but still provides facilities for concise writing of algorithmical solutions for code-golf tasks. The work also contains implementation of a standard library as support for runtime environment of the language. 1

National Repository of Grey Literature : 16 records found   1 - 10next  jump to record:
See also: similar author names
1 Kratochvíl, M.
2 Kratochvíl, Marek
15 Kratochvíl, Martin
3 Kratochvíl, Matouš
9 Kratochvíl, Matěj
1 Kratochvíl, Maxim
12 Kratochvíl, Michal
1 Kratochvíl, Milan
1 Kratochvíl, Miloslav
Interested in being notified about new results for this query?
Subscribe to the RSS feed.