Once a week during the academic year, an invited speaker (from abroad, as well as from the Czech Republic) talks about his or her scientific work. Colloquium takes place at the Faculty of Informatics and is open to the scientific community. Lecture dates can be found in the programme. Tuesday 14.00 - 15.00, D2, FI MU, Botanická 68a

Colloquia programme with abstracts for the Autumn 2019 semester

24. 9. 2019
RNDr. David Šafránek, Ph.D., FI MU
Computer-Aided Systems Biology
Abstract: In this lecture, we will introduce a novel paradigm for solving problems in biology. First, we will describe the framework of systems biology. Second, we will present an original approach to systems biology implemented on fundamental principles developed in computer science. Part of the talk will be dedicated to the comprehensive modelling platform we are developing in our research.
1. 10. 2019
Bartosz Walczak, Department of Theoretical Computer Science, Jagiellonian University, Kraków, Poland
Old and new challenges in coloring graphs with geometric representations
Abstract: A central problem in graph theory is to compute or estimate the chromatic number of a graph, i.e., the minimum number of colors to be put on the vertices so that no two neighbors receive the same color. Being very hard in general, it has been considered for various restricted classes of graphs, in which the chromatic number remains in a tighter connection to the structure of the graph. This includes, in particular, classes of graphs defined on families of geometric objects: intersection graphs, disjointness graphs, visibility graphs, etc., motivated by various practical applications. In recent years, this area of research has seen remarkable progress which has led to many classical problems being solved and various new problems being raised. I will introduce the audience to these old and new problems, present some of the recent developments, and discuss connections to other areas, such as graph drawing and approximation algorithms.
8. 10. 2019 (in D1 auditorium)
prof. Donald E. Knuth, professor emeritus, Stanford University, USA, and first honorary doctor of Faculty of Informatics, Masaryk University (since 1996)
Computer Programming as Art – Views and responses to any related question and comments
Abstract: Come with prepared questions about Computer Programming for "unprepared" professor Knuth (session inspired by Feynman's "All Questions Answered" talks).
15. 10. 2019
Mgr. Marek Sýs, Ph.D., FI MU
doc. RNDr. Petr Švenda, Ph.D., FI MU
prof. RNDr. Václav Matyáš, M.Sc., Ph.D., FI MU
Revisiting statistical tests for random data analysis
Abstract: Random data play important role in many areas e.g. gaming, simulation, cryptography, etc. The quality of the data is critical for several areas hence analysis of used generators (true or pseudo random) is crucial there. Multiple incompatible test suites exist, with the tests that analyse different but similar patterns. We created a framework to comfortably run all tests from the commonly used statistical testing batteries (NIST STS, Dieharder, TestU01 and BoolTest). Using this tool, we analyzed the output of 66 cryptographic functions and evaluated the power/uniqueness of individual tests in the domain of cryptographic data. Surprisingly, a subset of only 14 tests would be enough to detect all the biases detected by the whole set -- yet no standard battery contained them all. In the talk, we will discuss the results we obtained in more details. Also, we will introduce our BoolTest battery that outperforms standard batteries when partial bits on fixed positions in data blocks are correlated.
22. 10. 2019
Ing. Martin Střelec, Ph.D., NTIS ZČU Plzeň
Ing. Ondřej Mamula, MBA, CIIRC ČVUT Praha
Secure integration of demand side flexibility to power systems
Abstract: The electricity power domain is facing unprecedented system changes initiated by increasing penetration of novel technologies (e.g. massive installation of renewables, energy storages at various levels) and market arrangements (e.g. market integration, new market entities), which increases the volatility in power system, which needs to be properly managed in order to keep system reliability. On the other hand, traditional resources for power network stabilization are decreasing due change of energy mix. Demand side flexibility stands for a promising mechanism for enhancement of power network stabilization.

The contribution will introduce power system flexibility, where main focus will be put on the demand side. The talk will cover description of whole value chain of secure flexibility integration in the context of the SecureFlex project. Different aspects will be presented ranging from the flexibility harvesting on demand side to market product creation with emphasis on cost optimization and maintaining network security and power quality.

29. 10. 2019
doc. Mgr. Hana Rudová, Ph.D., FI MU
Scheduling of Mobile Robots
Abstrakt: Flexible manufacturing systems consist of several automatic machines, material handling devices such as automated guided vehicles (AGVs) or mobile robots, and a central control computer. Mobile robots, as well as AGVs, can move around their working space to transport components among machines. Mobile robots can also execute various value-added tasks without human intervention, thanks to their manipulation arms. The main novelty of our work is that we allow the scheduling of such robot processing, which makes the problem more complex and computationally expensive.

Our work encapsulates robot processing into a job shop scheduling problem with transportation resources. The talk will introduce this scheduling problem as well as various solution approaches for the general audience. We will discuss the exact and heuristic approaches we have proposed to solve this problem. The integer programming model was aimed to model the problem precisely. Heuristic approaches are represented by a hybrid genetic algorithm and adaptive large neighborhood search. Finally, we will present the latest constraint programming approach performing very well, even in contrast to heuristic approaches.