|
|
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 (www.tcpdf.org)
|
|
|
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
|
|
|
Nízkoúrovňový funkcionální programovací jazyk
Kratochvíl, Miroslav ; Bednárek, David (advisor) ; Hric, Jan (referee)
The goal of this thesis is to explore the current possibilities of implementation of compilers of low-level functional languages. It is expected to evaluate theoretical possibilities of functional programming languages, possible limitations that arise from the absence of run-time code support in low-level environment, and to implement a language compiler that demonstrates some chosen properties. Powered by TCPDF (www.tcpdf.org)
|
|
|
Collegiate Chapter of Stará Boleslav: economic conditions in the early modern period
Kratochvíl, Miroslav ; Kostlán, Antonín (advisor) ; Maur, Eduard (referee)
In my diploma thesis is analyzed economic security of the collegiate chapter house in Stará Boleslav (near Prague). After an outline of the issue in the Middle Ages, the study concentrates on an evaluation of the profitability and economic impact of the estates of the Stará Boleslav chapter in the early modern period; also other possibilities of economic security are analysed here (including financial effect resulting from the Baroque pilgrimage). In some respects, the comparison is made here between Stará Boleslav collegiate chapter and some similar Czech church institutions. The topic is examined primarily on the basis of unpublished sources (land registers, population censuses etc.; list of the most important of them is included in appendix), taking into account also printed sources and secondary literature.
|
|
| |
guest ::
RSS feed.