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.

5. 11. 2019

RNDr. Zdeněk Matěj, Ph.D., FI MU

Fast digital technology for nuclear facilities

Abstract: With the development of digital technologies, there are many possibilities for their application in practice. Combination of fast algorithms together with sufficiently powerful HW based mainly on programmable gate arrays (FPGA) extend existing detection possibilities in the field of nuclear experiments This talk will describe the development of digital devices that primarily help in the field of nuclear experiments and also serve for research in the field of IV. generation of nuclear reactors.

12. 11. 2019

Mgr. et Mgr. Martin Derka, M.Sc., Ph.D., Senior Software and Research Engineer, Quantstamp, Inc., USA

Reflections on Proof-of-Work Blockchain Security and Smart Contract Design

Abstract: In this talk, we will present the elementary design blocks of Proof-of-Work blockchains with a focus on smart contracts and their security. We will discuss recent pitfalls, security incidents, possible smart contract attack vectors, and measures that should be taken to protect against those. The Ethereum network will be used as a practical example, but the discussed topics will be generally applicable to any blockchain-based on Proof-of-Work. The talk will build on experiences acquired in practice but will outline possible research questions of both applied and theoretical nature, and the future direction of the field.

19. 11. 2019

prof. RNDr. Daniel Kráľ, Ph.D., DSc., FI MU

Matroid algorithms and integer programming

Abstract: While integer programming is computationally hard in general, efficient algorithms exist for various special instances. For example, there exists a fixed parameter algorithm for integer programs where the constraint matrix has bounded dual tree-depth and bounded entries. In this talk, we present a matroid based algorithm for finding an equivalent instance of an integer program where the constraint matrix has small dual tree-depth.

The talk will start with a brief introduction to matroids and algorithmic problems concerning matroids. We will particularly focus on width parameters for matroids and algorithms for matroids with small width. One of the results that we will present asserts that the branch-depth of the matroid formed by columns of a matrix is equal to the minimum tree-depth of a row-equivalent matrix, and we will discuss algorithmic corollaries of this result in particular in relation to integer programming.

The talk will be self-contained. The results presented in this talk are based on joint work with Timothy Chan, Jacob Cooper, Martin Koutecky and Kristyna Pekarkova.

26. 11. 2019

prof. Kang Zhang, Department of Computer Science, University of Texas at Dallas, Dallas, USA

Aesthetic Computing and Computational Aesthetics

Abstract: In this talk, we will introduce the recently emerging interdisciplinary research topics of computational aesthetics and aesthetic computing, and discuss their difference and complementary roles. As a case study, the theories and practices of abstract painting and their existing and potential applications in information visualization will be presented in the context of aesthetic computing. We discuss the three dimensions of painting, i.e. form, color, and texture, various visual cognition principles, and finally aesthetic compositions used in abstract painting. Our objective is to bridge visual art with information visualization, so that the latter could learn from the former in creating more aesthetic visualizations and thus making the viewers visualizing process a pleasant experience. In the context of computational aesthetics, we provide a classification scheme on the complexity of intelligence in generative art with example of generation approaches. Based on Birkhoff’s work on aesthetic measure, we review several recent attempts in computational approaches to aesthetic measurement and complexity measurement for art works.

Short biography: Kang Zhang is Professor and Director of Visual Computing Lab, Department of Computer Science, and Professor of Arts and Technology, at the University of Texas at Dallas. He received his B.Eng. in Computer Engineering from University of Electronic Science and Technology of China in 1982, Ph.D. from the University of Brighton, UK, in 1990, and Executive MBA from the University of Texas at Dallas in 2011. Prior to joining UT-Dallas in January 2000, he held academic positions in the UK, Australia, and China. Dr. Zhang's current research interests include generative art, visual languages, aesthetic computing, information visualization, and software engineering; and has published 7 books, over 80 journal papers, and 160 conference papers in these areas.

3. 12. 2019

prof. Jeff Yan, Department of Computer and Information Science, Linköping University, Sweden

Differential Imaging Forensics

Abstract: Given a single photo, is it possible to deduce who was the cameraman? To resolve this problem, I teamed up with Aurélien Bourquard (MIT) for a collaboration, codenamed Project C(razy). Along the way, we have invented some new forensics, which we call Differential Imaging Forensics (DIF). The DIF paradigm has practical applications in crime investigation and surveillance; it also informs intelligence operations. We also identified some unanticipated applications (e.g. deepfake detection), as well as many future research opportunities. (The only prerequisite assumed for this talk, if any, perhaps is a curious mind. No technical prerequisite is required.)

10. 12. 2019

doc. RNDr. Tomáš Brázdil, Ph.D., FI MU

Pushing the limits in automated NMR structure determination

Abstract: Nuclear Magnetic Resonance (NMR) spectroscopy is a technique for determining the structural and dynamic properties of molecules. NMR relies on properties of certain atomic nuclei that, when placed in a strong magnetic field, resonate at characteristic frequencies. NMR spectroscopy generates complex data whose analysis is a laborious task and the road to NMR structure is generally a long one. The chief barrier is that existing methodologies require a significant amount of spectrometer time (several weeks), and effort by a trained expert (up to several months). So fully automatic methods for NMR structure determination are in demand.

In my talk, I will concentrate on the problem of assigning given resonant frequencies (chemical shifts) from NMR spectra to the nuclei of a protein. Our attempts at solving this demanding problem comprise both machine learning as well as elementary graph theoretic methods. I will start with the machine learning problem of predicting an amino acid type based on a given set of chemical shifts. Consequently, I will show how such a prediction can be incorporated into an algorithm for complete assignment of chemical shifts to atoms in a protein using, among other methods, simple graph algorithms. I will also present open problems and deficiencies of our current method which is still under development.

17. 12. 2019

Marek-Martin Matyska, Senior Game Designer at Geewa, Praha

Game Development & Why should University Care

Abstract: Introduction to Game Development and its massive growth, what kind of problems we are encountering, and why it can be an opportunity for Universities and Students alike.