Laboratory seminars on Wednesday, 14:30-15:30, A505, FI MU, Botanická 68

Format of standard lectures: 30 minutes presentation + 15 minutes for questions, slides in English, presentation in English or Czech based on audience

Programme in autumn 2017 including state exam training

Programme for Spring 2018

  • 21.2.2018
    RNDr. Tomáš Rebok, Ph.D.
    ElasticSearch, Hadoop/Spark and Friends: Which data processing framework to use?
    Abstract: Over the past years, several frameworks such as ElasticSearch and Apache Hadoop/Spark have been introduced to ease the task of big data processing and analysis. During the talk, we will overview the basic characteristics, features and issues of the most widely-used massive data processing frameworks available, and outline the suitable use-cases they could be used for. The talk will also introduce the data processing platforms being developed in several projects running at ÚVT MU, which one can also use for their data processing tasks.

  • 28.2.2018
    Panel about the (near) future of Sitola
    Panelists: Jiří Filipovič, Jan Fousek, Aleš Křenek, Miloš Liška, Janka Pazúriková, Tomáš Raček, Tomáš Rebok, Lukáš Ručka, Michal Zima

  • 7.3.2018
    Mgr. Michal Zima
    Exchanging cryptocurrencies in decentralised settings
    Abstract: One of the many challenges that there are in the cryptocurrency ecosystem is decentralised exchange of cryptocurrencies. Inclusiveness, security, privacy—those are just examples of properties that a platform for decentralised exchanging of them migth offer. In the talk, we will go through the specifics of this challenge and cover how we approach them in Coincer, our implementation of such a platform, offering lessons on decentralising its components.

  • 14.3.2018
    prof. Ing. Pavel Zezula, CSc.
    Similarity searching for database applications
    Abstract: Though searching is already the most frequently used application of information technology today, similarity approach to searching is increasingly playing more and more important role in construction of new search engines. In the last twenty years, the technology has matured and many centralized, distributed, and even peer-to-peer architectures have been proposed. However, the use of similarity searching in numerous potential applications is still a challenge. In the talk, four research directions in developing similarity search applications at Masaryk University DISA laboratory are to be discussed. First, we concentrate on accelerating large-scale face recognition applications and continue with generic image annotation task for retrieval purposes. In the second half, we focus on data stream processing applications and finish the talk with the ambition topic of content-based retrieval in human motion-capture data. Applications will be illustrated by online prototype implementations.

  • 21.3.2018

  • 28.3.2018
    RNDr. David Šafránek, Ph.D.
    Parameter synthesis by formal methods
    Abstract: We will present a method for parameter synthesis in parametrised dynamical systems from temporal specifications. The method works with a dynamical system represented in terms of a finite-state transition system with parametrised transition relation. Technically, the method is based on model checking algorithms adapted to such kind of transition systems. Depending on a particular class of systems, the underlying algorithms can gain advantages from efficient symbolic representations of sets of parameter valuations. We will show several examples of such systems and respective representations. To demonstrate the method, we will describe applications to models representing dynamics of biological systems with complex non-linear behaviour. Additionally, we will briefly discuss an extension of the parameter synthesis method that allows to address the problem of bifurcation analysis (dramatic changes of systems behaviour with respect to small changes in parameter values).

  • 4.4.2018
    Vinh Quang Dang, Ph.D.
    Enhanced scheduling for real-time traffic control
    Abstract: Traffic signal control in road networks is a practical problem which has been widely paid attention. In this talk, I will discuss an approach for the traffic signal control problem which is modeled as a scheduling problem. The proposed approach is based on a forward dynamic programming search. The goal is to construct a traffic control sequence for each intersection and minimize the total cumulative delay of all vehicles in a traffic network. We use SUMO simulator to demonstrate the performance of the proposed approach on a grid network in comparison with the Surtrac system.

  • 11.4.2018
    Mgr. Jiří Marek

  • 18.4.2018
    RNDr. Tomáš Raček

  • 25.4.2018
    RNDr. Pavel Troubil, Ph.D.

  • 2.5.2018
    Mgr. Lukáš Ručka

  • 16.5.2018
    Dies Academicus (no presentation)

Past seminars

Contact: Hana Rudová

(c) 2018 SITOLA, Administration