News and events archive

Informatics Colloquium 10.12. 2019, 14:00 lecture hall D2 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.

Where there’s a will there's a way: Blind software programmer Vojtěch Polášek graduated with honors and kick-started his full-time career in Red Hat Vojta was born visually impaired. At the age of 11 he had an accident and through following several years lost his sight almost completely. Against all odds, he graduated with honours at the Faculty of Informatics, Masaryk University, got the Dean's award for his Bachelor and Diploma theses. His diploma thesis has even been nominated by the faculty to prestigious Czech and Slovak IT SPY competition evaluating IT diploma theses and was currently selected among 8 best finalists. Recently, Vojta has joined Red Hat and kick-started his career in the Security Compliance team. He's basically living the same kind of life as everyone else. All thanks to his positivity, courage, and enthusiasm. He tries not to ever look back on his blindness and show society and other disabled people that being blind doesn't have to be an obstacle.  In collaboration with Red Hat we had the opportunity to interview him to learn more. Let's start with a warm-up question: When you were a child, what did you want to be when you grow up? [Vojta]: An astronaut, of course! (chuckles). Once upon a time, when I was about 5 years old, my father brought home our first computer and from that moment I knew that I'll devote my career to computers and I haven't stopped hanging around them ever since. Besides, I have  been playing the piano for a long time. During my studies in high school I was also bouncing around ideas to study psychology but eventually computers won. However, I wasn't sure which specific area  I want to focus on so I started experimenting with hacking and that was the moment I decided to go down the ‘security road’. So how did you actually get to the programming? [Vojta]: The first thing I did was my own website. There wasn't such a thing as Wordpress or other content management systems available back then so I started with HTML. The problem is that creating a website goes hand in hand with web design, which was obviously something I was not able to deal with so I started with programming from simple Timer to games for visually impaired people. https://github.com/vojtapolasek/united_guards. When I started university, there wasn't much time left for my own initiatives and experiments as I had to devote most of the time to various projects which were part of my studies. How did your student life differ from other students? [Vojta]: I studied at the Faculty of Informatics, Masaryk University https://www.fi.muni.cz/. As far as my disability is concerned, Masaryk University belongs to the absolute top for students with special needs, especially thanks to the Teiresias support center, https://www.teiresias.muni.cz/ : Their goal is to provide maximum accessibility to all accredited degree programs at the university for students with various types of disabilities. Thanks to them I could study the same program as other ‘normal’ students which is amazing. Teiresias has its own building and classrooms with their own equipment. My studies were different primarily due to length. A good example was math: known as one of the most difficult subjects at FI and it usually consists of seminars and lectures including writing on the whiteboard which is obviously something I am not able to do. So I got an individual study plan, individual lector, modified materials in electronic form and extra lessons. Consequently, what takes ‘normal students’ one semester, I studied for two but in the end, I was able to pass the  exam like anyone else. Was there any subject which you simply couldn't study? [Vojta]: Not really, but if I chose for instance graphic design that would be obviously... nonsense. Anyway, most of the time it‘s more about the will, attitude, and negotiation.  A great example is the Cisco networking course I applied for. The course is optional, but very interesting and not many students apply for it. I was told this course is not really suitable for me but I didn't get discouraged easily: I asked for reasons why not. And then? We found a way eventually! However, the only serious problem I experienced was the lack of lecturers for individual studies. That's amazing! Let‘s stick with your student life for a while: We heard that you received Dean‘s award for both the bachelor degree and also for a diploma thesis. That's pretty impressive! Can you briefly introduce us to the topic of your diploma thesis? [Vojta]: The Deans award? To be honest, that was a surprise even for me. My advisor Milan Brož proposed a nomination for the Dean's award during the defense of the diploma thesis. In simple words, I was dealing with key derivation functions that transform a password into a cryptographic key because ordinary passwords are not always suitable for encryption software. I was analyzing a relatively new function called Argon2 which was designed to make to the process of cracking harder and slower because password cracking has evolved and gotten way faster thanks to the usage of graphic cards and specialized HW. Simply put, this function should force hackers to be able to crack passwords only as fast as common users so they don't have any ‘advantage’ over them. My job was basically to simulate an attack and compare Argon2 with PBKDF2. The attack was devised through CPUs and GPUs using high-performance hardware provided by MetaCentrum VO and I was testing how long  it takes to crack the function. The result of this test was a price model for an attacker using either physical hardware or on-demand allocation of computing resources in the cloud. It turned out that it can easily reach millions or even billions of dollars. What was the most interesting finding from your thesis? [Vojta]: Well, it was quite intriguing that from a long-term perspective it does not really pay to rent space in the cloud in comparison with buying computers directly for hackers. You have also mentioned your advisor Milan Brož who is working for Red Hat and is a kind of ambassador for MUNI. Can you tell us about him in the role of adviser? How was it? [Vojta]: Milan's approach was fantastic. He was absolutely honest with me. He was like: ‘It's your thesis, not mine.’ or ‘It's you who will defend it, not me.’ In my opinion, an advisor should be someone who is providing guidance and advice rather than pushing and urging students. Cooperation with him was based on reciprocity: as long as I was proactive Milan behave the same way and he was very open to my ideas and initiatives. I am aware that a large part of the success of the thesis belongs to him. It was honestly pleasure being led by Milan. What are you currently doing in Red Hat? What is your role? [Vojta]: Roles in our team are not fixed so it‘s hard to predict my future role. Currently I am part of Security compliance team working on OpenSCAP which is upstream tool for maintaining security compliance  for enterprise systems and I'm responsible for creating content for this tool. This role involves an interesting mix between programming and scripting and also a little bit of system administration which I really enjoy. Was there any obstacle you had to face at work? [Vojta]: Coffee machines are tricky! These modern devices have touch screens but that‘s not that big deal indeed. It‘s not that hard to find the way in a building. One just has to learn where meeting rooms are and then it's easy. There are only tiny obstacles like technical issues for example with some software, like Jira. I have mentioned already during my interview that problems like this might occur. It‘s a problem though but luckily I don't need to use it that much. So overall it‘s good. And what about your plans for the future? Do you have any? [Vojta]: One thing is for sure: I would like to stay in the IT field. Ideally in Security and hopefully in Red Hat. And outside of my career life, I would like to start a family at some point, but it's all in the stars.

Informatics Colloquium 3.12. 2019, 14:00 lecture hall D2 prof. Jianxin 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.)

Martin Grohe is a German mathematician and computer scientist. His research interest is in theoretical computer science interpreted broadly, including logic, algorithms and complexity, graph theory, theoretical aspects of machine learning, and database theory. He is a Professor for Theoretical Computer Science at the RWTH Aachen, where he holds the Chair in Logic and the Theory of Discrete Systems. He received his PhD in Mathematics at Freiburg University in 1994 and then spent a year as a visiting scholar at Stanford and the University of California at Santa Cruz. Before joining the Department of Computer Science of RWTH Aachen in 2012, he held positions at the University of Illinois at Chicago, the University of Edinburgh, and the Humboldt University at Berlin. Grohe won the Heinz Maier–Leibnitz Prize awarded by the German Research Foundation in 1999. He was elected as an ACM Fellow in 2018 for "contributions to logic in computer science, database theory, algorithms, and computational complexity". Abstract Symmetry is a fundamental concept in mathematics, the sciences, and beyond. Understanding symmetries is often crucial for understanding structures. In computer science, we are mainly interested in the symmetries of combinatorial structures. Computing the symmetries of such a structure is essentially the same as deciding whether two structures are the same ("isomorphic"). Algorithmically, this is a difficult task that has received a lot of attention since the early days of computing. It is a major open problem in theoretical computer science to determine the precise computational complexity of this "Graph Isomorphism Problem". One of the earliest applications of isomorphism testing was in chemistry, more precisely chemical information systems. Today, applications of isomorphism testing and symmetry detection are ubiquitous in computing. Prominent examples appear in optimisation, malware detection, and machine learning. However, in many of these applications, we only need to decide if two structures are sufficiently similar, rather than exactly the same. It turns out that determining how similar two structures are is an even harder computational problem than deciding whether they are isomorphic. My talk will be an introduction to algorithmic aspects of symmetry and similarity, ranging from the fundamental complexity theoretic "Graph Isomorphism Problem" to applications in optimisation and machine learning. When? 27 November 2019 4:30 PM Where? Governor's Palace, Moravské náměstí 1a, Baroque Hall

Sir Timothy Gowers of the University of Cambridge and Daniel Kráľ, a computer scientist and mathematician at the Faculty of Informatics MU, are seeking to change the current system of publishing scientific results. The traditional route of publishing scientific results in printed journals is funded by subscribers, most of which comprise university libraries. One may access online versions of articles via the web portals of publishers, however, to do so, it is first necessary to purchase a subscription. These considerable subscription fees, which are typically in the range of hundreds of dollars for a single issue of a journal published by a large commercial publisher, generate significant profits for commercial publishers, usually in the range between 20% and 40% of their revenue. Moreover, this model of publishing restricts the access of articles only to those who subscribe to the journal, impeding the free access of information to the wider scientific community. In 2012, Gowers founded the boycott initiative Elsevier, which resulted in a discussion on open access publishing: a model of publishing scientific results in such a way that they are available to the entire scientific community free of charge. However, open access publishing can be done in various ways: the most well-known are the Green and Golden Routes. The Green Route means that authors can store a version of their article in a public repository (in computer science, mathematics and physics, it is standard to use the arXiv repository - https://arxiv.org/).  This version is freely accessible but the published manuscript itself is not. The Green Route is not considered to comply with open access requirements by some funding bodies. The Golden Route means that authors will pay an additional publication fee for making their article freely available in an online version of the journal. These fees, which are in the order of thousands of dollars per article, form another source of income for traditional publishing houses. In 2018, Science Europe, an association of European science foundations, announced the so-called Plan S initiative, that would see most results required to be published in an open-access way. However, the Golden Route would impose additional costs for research institutions in the form of publication fees, while the funding spent on publication fees could be better used for scientific work. It is worth noting that editors and reviewers usually provide their services free of charge to commercial publishers. The Diamond Route of open access publishing is an alternative to the Golden Route promoted by a part of the scientific community, to the displeasure of some commercial publishers.The Diamond Route means that journals do not charge any fees from neither the authors nor the readers, or their fees are merely symbolic (in the order of tens of dollars) in order to cover the necessary costs. In June 2018, Professor Daniel Kráľ from the Faculty of Informatics of Masaryk University, together with Professor Timothy Gowers from Cambridge University founded a new journal, Advances in Combinatorics. The journal should serve as a Diamond Route open-access alternative for top quality research journals in combinatorics (such as Combinatorica), which are currently published by commercial publishers. The first issue of Advances in Combinatorics has just appeared - https://www.advancesincombinatorics.com/articles. The quality of published manuscripts is very high - many deal with well-known and long-standing open problems. The editorial team led by Professors Gowers and Kráľ is looking forward to other similarly high-quality contributions that will appear in the next issue of the journal in the near future. Advances in Combinatorics functions as an overlay journal. All articles submitted to an overlay journal undergo a rigorous review process, and the final version of the accepted publication is stored in a freely accessible repository with a link from the journal website. In the case of Advances in Combinatorics, this repository is arXiv. All journal articles are also assigned DOI, a globally used identifier for digital objects (such as electronic versions of manuscripts). The cost of running the journal, which is in the order of tens of dollars per article, is covered by Queen's University Library. This Canadian university is a long time supporter of open access publishing. The vision of the editors is that other high quality journals could be inspired by the Diamond Route open-access publishing model of Advances in Combinatorics and its sister journal Discrete Analysis. Expanding publishing in the form of a Diamond Route open-access would save high costs related to scientific publishing, with the saved funding directed to scientific work instead.  We are proud that one of  our professors at the Faculty of Informatics of Masaryk University is one of the two managing editors of the journal.

Informatics Colloquium 26.11. 2019, 14:00 lecture hall D2 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.

Informatics Colloquium 19.11. 2019, 14:00 lecture hall D2 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.

Informatics Colloquium 12.11. 2019, 14:00 lecture hall D2 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.

The Czech national team has achieved the best position in the European final cyber competition (https://ecsc.eu), held this year in Bucharest from 8. until 11 October 2019. The Czech team consisted of the finalists of the 3rd High School Cyber ​​Security Competition (www.kybersoutez.cz), who were selected at KYPO Summer School from 13 to 15. August in the Cyber ​​Polygon MU. Students of the Faculty of Informatics and members of the CSIRT-MU security team prepared for talented high school students cybersecurity games and practical workshops that helped them acquire the skills needed for the European finals. "The Summer School has received positive responses from the participants. The students appreciated that the tasks were practical and exciting and that there were not dull lectures", added school organizer Jan Vykopal. A summer school would not be possible without financial support of FI MU industrial partners, Flowmon, Red Hat, as well as Avast.

4/11 Update: Unfortunately, Andreas Thom is unable to come due to a very serious family emergency and so the lecture is cancelled. However, he will have pleasure to listen to his talk only in one of the future terms. Abstract of Andeas Thom lecture (German mathematician and a professor of Geometry at TU Dresden): I will discuss the concept of stability in mathematics. If a set of equations is almost satisfied, is it true that a true solution to the equations exists nearby? For example, if two permutations of X commute on most of the points of X, are there permutations of X that agree with the given permutations on most of the points and do commute? If a function on a Banach space is almost linear, is it close to a linear map? These type of questions and some positive answers were first discussed by Stanislaw Ulam in 1940 und the name of „stability“ and come up naturally in a variety of situations ranging from functional analysis, group theory, to computer science. I will explain the background and discuss some recent progress in a variety of circumstances. When? 6 November 2019, 4:30 PM Where? Mendel Museum's Augustinian Abbey Refectory at Mendel Square

Informatics Colloquium 5.11. 2019, 14:00 lecture hall D2 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.

Informatics Colloquium 29.10. 2019, 14:00 lecture hall D2 doc. Mgr. Hana Rudová, Ph.D., FI MU Scheduling of Mobile Robots Abstract: 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.

Informatics Colloquium 22.10. 2019, 14:00 lecture hall D2 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.

The workshop will take place on 23.10.2019 in KYPO. The presentations will be in Czech, but there will be an opportunity to discuss the possibilities of involving students in the activities of several laboratories: Laboratory for Parallel and Distributed Systems (ParaDiSe) Laboratory of Formal Methods, Logic and Algorithms (Formela) Laboratory of Discrete Methods and Algorithms (DIMEA) Systems Biology Laboratory (SYBILA)

Informatics Colloquium 15.10. 2019, 14:00 lecture hall D1 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.

We cordially invite you to meet two legends of Computer Science, professors Donald Ervin Knuth and Dana Stewart Scott, in Brno. Both are holders of ACM Turing prize (1974 resp. 1976), both were professors of the Computer Science at Stanford in late sixties, and both will come to Brno, a place linked to Kurt Gödel or Gregor Johann Mendel, at the same time! Events: Oct 8th, 14:00, Faculty of Informatics, Masaryk University, lecture hall D1. Q&A session by Donald Knuth: Computer Programming as Art – Views and responses to any related question and comments Oct 9th, 12:30, Faculty of Informatics, Masaryk University, lecture hall D3+D1. Q&A session by Donald Knuth: Boundless Interests – Computer programming is an art form, like the creation of poetry or music Oct 9th, 16:30, Masaryk University's Mendel Museum, Augustinian Abbey Refectory at Mendel's Square, Brno.Lecture by Dana Stewart Scott: Enumeration Operators, Probability, Type Theory Oct 11th, 19:00, Brno, Jesuit Church of the Assumption of the Virgin Mary. Multimedia performance of oratorium Fantasia Apocalyptica. Free admission is for all events, given room capacity. Take your seats well in advance, please.    Do not miss this extraordinary possibility to see and talk to legends of Computer Science!

The Czech première of Knuth's musical opus, with personal presence of the author, first doctor honoris causa of FI MU Donald E. Knuth. Organist Jan Rotrekl will play on new Hermann Mathis pipe organ. Jesuit Church of the Assumption of the Virgin Mary, Brno Facebook event

Lecture by Dana Stewart Scott: Enumeration Operators, Probability, Type Theory. Lecture by the holder of Turing prize ("Nobel Prize for Computer Science") as part of Masaryk University's lecture series in Mathematics, Physics, & Computer Science. Masaryk University's Mendel Museum, Augustinian Abbey Refectory at Mendel's Square Facebook event

Come to the meeting with the first FI MU doctor honoris causa Donald Knuth under the title "Q&A session by Donald Knuth: Boundless Interests – Computer programming is an art form, like the creation of poetry or music". Come with prepared questions not only about Computer Programming for "unprepared" professor Knuth (really All Questions Answered, including music ;-). The meeting will be held at the Faculty of Informatics MU, lecture halls D3+D1.  Facebook event: https://www.facebook.com/events/2244384885670196/

Informatics Colloquium 8.10. 2019, 14:00 lecture hall D1 prof. Donald E. Knuth, professor emeritus, Stanford University, USA, and first honorary doctor of FI MU Computer Programming as Art – Views and responses to any related question and comments Abstrakt: Come with prepared questions about Computer Programming for "unprepared" professor Knuth (session inspired by Feynman's "All Questions Answered" talks).

Informatics Colloquium 1.10. 2019, 14:00 lecture hall D2 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.

Informatics Colloquium 24.9. 2019, 14:00 lecture hall D2 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.

Tereza Nečasová FI Ph.D. student, led by David Svoboda, won the third prize in the Joseph Fourier Award in Computer Sciences for her work: Statistical methods for comparison of real and synthetic biomedical image data. She received the award from the Nobel Prize winner for chemistry, 1987, Jean-Marie Lehn. More about Award at https://atos.net/cs/ceska-republika/cena-josepha-fouriera-2018# Foto: Eva Kořínková

Are you a student, a budding scientist or setting up your own business? Do you have a great project in mind and are you able to present it in English within 3 minutes? Sign up for the Falling Walls Lab international competition, win 1,000 € in prize money and proceed to the world finale in Berlin. The application deadline for the Falling Walls Lab Czech Republic is 30 June 2019. You can learn more information about the event at https://www.falling-walls.com/lab/apply or at https://www.facebook.com/FallingWallsLabCR/

Even this year you can look forward to the Schrödinger Grill. Barbecue traditionally starts at the FI MU atrium at 6 pm. What to expect? Pleasant informal discussions with friends and teachers, games, guitars, singing and grilling. Volunteers willing to help with the event are welcome an hour earlier. The event organizer: http://zverinec.fi.muni.cz/gril

The final round of this year's 20th anniversary of the competition of university students in scientific activities (SVOČ) in mathematics and informatics will take place in Brno on June 2—4, 2019. The Faculty of Informatics and the Institute of Mathematics and Statistics of Masaryk University organize the event. The competition itself will take place on Monday, June 3, in the buildings of the Faculty of Informatics. The show of works will take place in sections from morning till early afternoon, and the announcement of the results will follow during the evening banquet. The whole schedule of the event: https://svoc2019.fi.muni.cz/#schedule

Masaryk University Rector's Award for long-time research excellence, Economics, and Informatics: Václav Přenosil, Faculty of Informatics, Masaryk University - FI MU, Department of Computer Systems and Communications. Václav Přenosil researches several areas, for example diagnostics of digital systems and spectrometric equipment for the area mixed fields of ionizing radiation. During his successful career led many research and development projects, such as three projects of The Technological Agency of the Czech Republic whose results are published in quality magazines and are protected by two patents. Professor Přenosil has also successfully led many projects for several ministries in the Czech Republic, where he has been involved in, for example, research in the field of driver micro-sleep, predictive interactive simulators or in the area of ​​driver attention. He also developed with his team an excellent digital spectrometric system for processing fields of neutron radiation and gamma, with which it can be more accurately calculated, for example, the lifetime of energy reactor pressure vessels. Václav Přenosil is also a long-time member of several scientific councils, works in a number of expert committees and cooperates with top international scientific institutions.

Informatics Colloquium 21. 5. 2019, 14:00 lecture hall D2 prof. RNDr. Jiří Zlatuška, CSc., FI MU Seeing the invisible (black holes) Abstract: Black holes used to be just an astrophysicsl curiosity representing extremal conditions following from General Ralativity. Until recently, no direct observation would seem feasible. Advanced use of computing allowed spectacular changes in this, resulting especially in the first image of black hole in the center of M87 using a technique resulting in computer-synthesized telescope stretching accross the diameter of the Earth as well as synthesizing a real image of black hole, not just a result of its simulation. In the talk a quite detailed and popular explanation will be provided how this remarkable scientific outcome has been obtained.

Abstract: Introduction to the Seznam.cz fulltext search architecture. The talk covers all basic web search engine blocks: crawling, indexing, query reformulation, and relevance. Explanation of inner parts of the user interface such as: auto completer, suggested searches. Real statistics from Seznam's traffic. As a bonus: Latest Bio: Vladimír Kadlec is currently the head of research team at Seznam.cz. He earned his doctoral degree from FI MU in 2008. All of his research has been related to natural language processing and information retrieval. At Seznam.cz, he designs and improves algorithms for the fulltext search engine. Vladimir loves (almost) all sports from snowboarding to cycling. 9.5.2019, 10:00 Faculty of Informatics MU, lecture room D1 Botanická 68a

Informatics Colloquium 14. 5. 2019, 14:00 lecture hall D2 doc. RNDr. Aleš Horák, Ph.D., prof. PhDr. Karel Pala, CSc., FI MU Karel Pepper, the robot Abstract: In the talk, we will introduce the new social robot by Softbank Robotics denoted as Pepper. We will present the robot hardware capabilities as well as first examples of natural human-machine dialogs in Czech, which are being developed by the team at FI MU. The robot is designed for social interactions with people and it is equipped with an extensive API set to detect faces, mood, or age and to react to their values. We will also sketch our plans to use the robot in both students works and in research with applications oriented to human-machine cooperation.

Informatics Colloquium 30. 4. 2019, 14:00 lecture hall D2 Mgr. Alžběta Krausová, LL.M., Ústav státu a práva AV ČR Legal and Ethical Aspects of Developing AI and Its Applications Abstract: AI is a groundbreaking technology that raises a number of serious questions from both ethical and legal point of view. The lecture will introduce the main ethical concerns related to AI development as well as the EU guidelines on how to design intelligent applications in compliance with ethical requirements. Moreover, since ethical approach is conditioned by compliance with laws, the lecture shall also introduce the main legal requirements on AI systems and potential related legal problems including liability for AI, data processing and intellectual property protection. The lecture aims to provide an overall overview of complex legal problems with individual examples in order to highlight what needs to be taken in account while designing, developing, and running smart applications.

Informatics Colloquium 7. 5. 2019, 14:00 posluchárna D2 prof. RNDr. Roman Barták, Ph.D., MFF UK Multi-Agent Path Finding on Real Robots Abstract: Multi-agent path finding (MAPF) deals with the problem of finding a collision-free path for a set of agents (robots). An abstract model with a graph describing the environment and agents moving between the nodes of the graph has been proposed. This model is widely accepted by the MAPF community, and the majority of MAPF algorithms rely on this model. In this talk, we argue that the model may not be appropriate when the plans are to be executed on real robots. We provide some empirical evidence that abstract plans deviate from real plans executed on robots and we compare several variants of abstract models. The talk motivates further research on the abstraction of problems concerning the applicability of solutions in practice.

What our international student Iman Mehmandoust says about his studies at #fimuni? “When I was in Afghanistan, I dreamed about having a successful challenging career in IT community. I tried to think out of the box and find opportunities to study abroad. Finally, I found Service Science Management Engineering, Master study programme at the Faculty of Informatics, Masaryk University, which perfectly fits my Bachelor education and working experience. Getting to be enrolled in this master programme was not easy. There were almost 1000 candidates who applied to study in the Czech Republic. My application was one of the 3 applications that were finally accepted. Now I am in the 4th semester of my studies and my dreams are coming true. At the same time, I am working for a big international IT company here. Being an international student at the Faculty of Informatics means to take a responsible approach, on the other side, it is a perfect life in a beautiful city, with amazing teachers and colleagues and in Brno IT community so-called another Silicon Valley. Every day I'm meeting different people from all around the world, travelling to near capitals and other near towns, learning a few Czech words, eating some typical Czech food and getting closer insight to local culture, history of Brno and Masaryk University, celebrating 100th anniversary this year.” More about our study programmes in English here: https://www.fi.muni.cz/admission/index.html.en

He was drawn to computers since young age. Supporting his passion, his parents bought him the Baltík educational programming environment by Bohumír Soukup. Now, he is one of the Brno Ph.D. talents. The Ph.D. student Vít Novotný develops a next-gen search engine in the MIR research group at the Faculty of Informatics, MU. He tackles problems that Google can’t answer. His project is supposed to help researchers all around the globe. Traditional Search Engines Such as Google and Seznam Ignore Mathematics Researchers in STEM (Science, Technology, Engineering, Mathematics) fields require access to articles full of mathematics. “Traditional search engines are sufficient for ordinary text documents, but they fall short for mathematics. They only allow the user to search using text keywords, not mathematical formulae. If you search for a scientific article using text keywords, and the article does not contain the keywords, then you may not find the article at all,” explains Vít. Mathematical search engines started to appear at the beginning of the 21st century. The Faculty of Informatics participated at the EuDML European project and developed the MIaS mathematical search engine in 2011. However, MIaS does not take advantage of the latest techniques of machine learning and artificial intelligence. Machine Learning and Artificial Intelligence Can Improve Both Mathematical and Text Search Today’s mathematical search engines can search for text keywords and mathematical formulae. However, text and mathematics are represented separately. Using the latest techniques of machine learning and artificial intelligence, hybrid search engines that allow the user to search for mathematics using text keywords and to search for text using mathematical formulae can be developed. We Tested Trains of Thought on the Little Red Riding Hood “We also experiment with representing document by curves. The curves follows the trains of thought in a text document as they change from one paragraph to the next. In our experiments, we used three version of the classic story of the Little Red Riding Hood: the original version from the 17th century, the Grimm version from the 19th century, and the Hoodwinked film from 2005. While the first two versions only differ in their endings, the film only shares the major characters and locations with the classic tale. The keywords were similar in all three versions, but the trains of thought in the film differed significantly from the first two versions,” explains Vít. This novel approach should make it possible to detect plagiarism and to search for semantically similar documents. Brno Ph.D. Talent Award Provides New Opportunities Due to his success in the Brno Ph.D. Award competition, Vít will be awarded 300 thousand Czech crowns over the period of three years. Beside financial support, the South-moravian center for international mobility (JCMM) also organizes seminars for the Brno Ph.D. talents and provides networking opportunities. By creating conditions comparable to top western research institutions, JCMM aims to keep talented young minds in Brno. And what are Vít’s interests besides research? He produces electronic music, sings in an ensemble and co-organizes Animefest, the oldest anime convention in the Czech Republic.

The Academic Senate of the Faculty of Informatics announces the election of a candidate for the post of dean FI MU for the term of office beginning on 1 September 2019 and ending on 31 August 2023. Proposals of candidates for the Dean's office must be delivered on Friday 17 May, 2019 at the latest to 11:00. Election rules and information about submitting proposals for candidates are published in https://is.muni.cz/auth/do/fi/as/35535693/volba_dekana_2019_2/volba-dekana-2019-vyhlaseni-en.pdf

Informatics Colloquium 23. 4. 2019, 14:00 lecture hall D2 RNDr. Vojtěch Řehák, Ph.D., FI MU What is the best timeout? Abstract: We all have some experience with deadlines, and we know how hard it is to deliver results in time, especially when some obstacles with an uncertain solving time may occur. In this talk, we deal with formalisms suitable for modeling and analysis of such systems, i.e., reflecting both timeouts and actions taking stochastic continuous time. We show how this kind of stochastic timed systems can be modeled and what properties can be computed for such models. On surprisingly small examples we also demonstrate some fundamental limits of such models. Then we will consider that some parts of the model are unknown and we take them as parameters that we would like to synthesize automatically. Finally, we will present results allowing for the synthesis of (epsilon)-optimal timeouts in such systems.

Informatics Colloquium 16. 4. 2019, 14:00 lecture hall D2 Dr. rer. nat. RNDr. Mgr. Bc. Jan Křetínský, Ph.D., Department of Informatics, Technical University of Munich, FI MU Machine learning in verification Abstract: On the one hand, formal verification methods provide hard guarantees on analysis results, but do not scale well and are often hard to use. On the other hand, machine learning comes with weak or no guarantees, but scales well and can provide more understandable solutions. In this talk, we show several examples how these approaches can be combined and the best of the two worlds achieved. We demonstrate this on controller synthesis and controller representation in the setting of Markov decision processes and games.

Informatics Colloquium 2. 4. 2019, 14:00 lecture hall D2 prof. Mgr. Michal Koucký, Ph.D., MFF UK Approximating edit distance within constant factor in sub-quadratic time Abstract: Edit distance is a measure of similarity of two strings based on the minimum number of character insertions, deletions, and substitutions required to transform one string into the other. It has numerous applications in various fields. The edit distance can be computed exactly using a dynamic programming algorithm that runs in quadratic time. Andoni, Krauthgamer and Onak (2010) gave a nearly linear time algorithm that approximates edit distance within approximation factor poly(\log n). In this talk I will present an algorithm with running time O(n^{2-2/7}) that approximates the edit distance within a constant factor.

Informatics Colloquium 9. 4. 2019, 14:00 lecture hall D2 Prof. Dr. rer. nat. habil. Timo Ropinski, Faculty of Engineering, Computer Science and Psychology, Ulm University Interactive Visualization Techniques for Molecular Structures Abstract: Within this talk I will cover our work in the area of molecular visualization, and will present techniques which have been developed with the goal to improve the spatial comprehension of complex molecular structures. First, coverage-based opacity estimation is discussed as a technique to achieve Depth of Field (DoF) effects when visualizing molecular structures. The proposed algorithm is an object-based approach which eliminates many of the shortcomings of state-of-the-art image-based DoF algorithms. Based on observations derived from a physically-correct reference renderer, coverage-based opacity estimation exploits semi-transparency to simulate the blur inherent to DoF effects. Second, I will discuss the integration of diffuse illumination effects into molecular visualization. While current molecular visualization techniques utilize ambient occlusion as a global illumination approximation in order to improve spatial comprehension, interreflections are also known to improve the spatial comprehension of complex geometric structures. To realize these interreflections in real-time, an analytic approach is exploited for capturing interreflections of molecular structures. By exploiting the knowledge of the underlying space filling representations, the required parameters can be reduced and symbolic regression can be applied to obtain an analytical expression for interreflections. I will discuss how to obtain the data required for the symbolic regression analysis, and how to exploit the analytic solution to enhance interactive molecular visualizations. Finally, I will show how this approach can be extended to other molecular representations.

The 13th year of an entertaining competition event with an unconventional program will take place on Saturday 13 April at the Faculty of Informatics and in the Brno parks. 2 to 4 member teams of high school students can take part in the InterSoB to test their rational thinking, teamwork, and communication. There will also be some sporting tasks. Registration deadline: April 8th. https://intersob.math.muni.cz/ https://www.youtube.com/watch?time_continue=3&v=ZeuF0a-bnBM

When choosing his studies abroad, he had been deciding between Prague and Brno. Fairly quickly, he decided for Brno, the capital of IT in the Czech Republic, as he says. International environment, many IT companies and start-ups, opportunity to meet with the community of foreign students and IT gurus in the city, where everything is as a stone's throw away from you. It was a clear choice for Arcadii. He also appreciates university services for incoming students, networking and inclusion to the local community at Masaryk University. Arcadii is a student of the Software Systems and Services Management (SSME), Master degree study programme at the Faculty of Informatics MU taught in English. “Study programme SSME exceeded all my expectations. It is a very well designed multidisciplinary study programme oriented on real problems and projects in companies. It is not just about computer science - what is actually really exciting. It includes marketing, economics, management, teamwork, and soft skills. During the program, we walk the whole path of creating an IT service - from an idea to a final product. It consists of creating a vision, planning, positioning in a market and collaborating with other companies on it. We all work on interim projects in companies. I did mine in Kiwi.com. I strongly recommend these studies to everyone,” says Arcadii. Interested to study SSME? Applications deadline is April 30, 2019. Find out more: https://www.fi.muni.cz/admission/mgr/software-systems-and-services-management-eng.html Note: SSME graduates reach the highest salaries compared to other study programmes at the faculty and also in the Czech IT job market in general. An average fresh SSME graduate salary is 70 000 CZK.

Informatics Colloquium 19. 3. 2019, 14:00 lecture hall D2 RNDr. Radek Ošlejšek, Ph.D., FI MU Semantic data modeling – conceptual view Abstract: In this talk, I will explain the principles of semantic modeling. I will briefly compare popular data models, such as rational vs. NoSQL databases. Then, I will focus on graph ontologies. I will describe their features, the problem of abstraction, information levels (e.g., upper vs. domain ontologies), and other aspects that are important for semantic modeling. The discussion will be supported by practical examples that emerged in our research of the semantic modeling of image content. Examples from the cybersecurity domain will, in turn, demonstrate the abilities and limitations of ontologies for detection and mitigation of cyber threats. Possible utilization of ontologies for formal knowledge modeling in hands-on cybersecurity training will be presented as well.

More information in Czech, in French.

Informatics Colloquium 12. 3. 2019, 14:00 lecture hall D2 Ing. Tomáš Mikolov, Ph.D., Facebook AI Research Recent progress in AI research Abstract: The last decade did bring us many new and improved applications of machine learning. To name a few, we have seen dramatic improvements in web search, user post classification, statistical machine translation, speech recognition, and image classification. But how far are we from the grand goal, which is the development of truly general AI? In this talk, I will present some of the ideas that I find promising for the development of artificial intelligence. These include a discussion about artificial life, dynamical systems, complex adaptive systems, and mathematical models of evolution.

Informatics Colloquium 26. 2. 2019, 14:00 lecture hall D2 RNDr. Kateřina Schindlerová, CSc., Faculty of Computer Science, University of Vienna Causality in Time Series: A Short Introduction and Current Challenge Abstract: We explain the concept of quantitative causality by various approaches and focus on Granger causality. Causality among a higher number of processes by means of graphical Granger causality will be presented and its applications shown. Current questions and open problems will be sketched from the point of view of heterogeneous and big data.

The International Timetabling Competition 2019 is a scientific competition to solve real-world timetabling problems from universities around the world. Among the organizers is a team from the Faculty of Informatics, led by doc. Hana Rudová. Data from real university timetables that serve as the starting point of the competition are drawn from the UniTime system. There are usually teams of scientists and students in the competitions, but individuals can also be found among the winners. Interestingly, participants are gradually getting new data sets from the organizers with increasing value points. The winner can also be the one who will join later and solve some of the problems. A UniTime-based validator will immediately evaluate the quality of the submitted solution. Since the start of the competition in the summer of 2018, the number of participants has been increasing. New people are still registering, some of them only to access the competition problems. The competition will take place throughout the year until November 2019. The unique UniTime system for university timetabling was created through joint research between Purdue University, Masaryk University, and Charles University. It is a publicly available open source solution that is universally applicable to schools and faculties of various types as well as entire universities. "When we started cooperation with Purdue University on a timetabling system that takes into account student registrations in 2001, we were among the pioneers," says Hana Rudová. From modest beginnings, it has come to the point where the UniTime system is helpful to dozens of institutions for timetabling courses, exams, and events throughout the year.

Prof. Petr Hliněný invites you to one week's workshop in Telč. The workshop focuses on various problems of graph crossing numbers, and more generally with geometric graphs. Date: May 6 - 10 2019

It is a revival of a regular research seminar in the area of discrete algorithms, formal methods and related fields of computer science. The seminar will take place on Monday at 2 pm biweekly during the term. Further information including the list of speakers for the next term can be found on the following webpage. https://www.fi.muni.cz/dfseminar/index.html.en Prof. Dan Král' a deputy of an organizer's team is looking forward to meeting many of you at the seminar talks.

Last year, an excellent scientist and holder of two ERC grants Daniel Kral moved to the Faculty of Informatics. After his arrival at the faculty, he became the head of the laboratory of discrete methods and algorithms DIMEA. Now, the DIMEA laboratory cordially invites to a two-day meeting of Central European scientists and researchers from the field of discrete mathematics and theoretical informatics DIMEA Days. The program will start on Wednesday, June 12 and conclude on Thursday, June 13 Registration ends March 31. Venue: Moravian Museum, Dietrichstein palace, Zelný trh 8, Brno More information: https://www.fi.muni.cz/research/dimea/days19.html.en

Come to taste the atmosphere at the Faculty of Informatics. See the labs to find out what discoveries are coming into the world. Look for top-notch technology, meet with industry experts you can collaborate with during your studies. And also ask current students. You will learn about new study programmes, entrance exams, and how to get to the FI without them. Informatics is not just programming. You can also study graphics, soft skills, help doctors to transmit live operations, guard banking systems or work with nuclear scientists. Program: 9.30, 10.30, 11.30 IQ testing - Mensa ČR 12.30–13.00 Registration 13.00–13.50 Presentation about terms and conditions for study at FI and discussion 14:30–15:30 Introduction to Master study programmes 14.00–16.30 organized excursion to the building of the Faculty of Informatics We are looking forward to seeing you at FI.

Masaryk University Rector’s Award for Outstanding Teachers - more information can be found here. Other information only in Czech.

It scans documents, marks them and sorts them according to given parameters. When asked, it searches the stored data and invoices - simply tell the machine to do so, and it will find the required information. Welcome to the office of the future. A team of IT experts from the Department of Machine Learning and Data Processing at FI MU is also tackling the task of extracting information from scanned documents which would push today's copying and printing machine closer towards so-called document management systems. https://is.muni.cz/do/fi/napsali_o_fi/rok_2018/2018-02-Informatici-udelaji-skenery-chytrejsi.-Naucili-je-zpracovat-obsah-skenovanych-faktur.Interface.pdf find the interview also in MU newsletter Interface: https://www.ctt.muni.cz/media/3101855/interface_02_18_web.pdf

If you are interested in mathematics, see the lecture of professor Rober Bryant from Duke University. The talk is supposed to be understandable to a wide range of scientists and students. 12 December 2018, 5:00 PM Refectory of Augustinian Abbey at Mendel Square - Mendel Museum About the lecture Much of classical mathematics involves finding a configuration or shape that provides an optimum solution to a problem. For example, it has long been known (though a rigorous proof took quite a while to find) that the surface of least area enclosing a given volume is a round sphere. There are many other ways to measure surfaces, though, and finding 'the' surface that optimizes a given 'measurement' (subject to some given constraints) remains a challenging problem that has motivated some of the deepest recent work in the mathematics of geometric shapes. In this talk, I will explain some of the classic ways to measure shapes of surfaces and relate this to classical problems involving surface area (soap films and bubbles) and total curvature as well to as recent progress by myself and others on these important optimization problems.

Let's celebrate the 85th birthday of Josef Gruska. He was interested in quantum computing in a time when it was considered science fiction. His book Quantum Computing was a first one that described the area. He was inducted in the TV doc series the Gallery of the national elite. Professor Josef Gruska and his work have international importance. He is a pioneer in computer science and an extraordinary human. He has been contributing to the development of theoretical informatics. We cordially invite you to see the presentation of Josef Gruska's work in KYPO, 12/12 - 13/12, 4 - 5:30 PM You can see posters, movies, etc. Moreover his collection of original Indian and Japanese drawings.

Kahin Akram Hassan, Linköping University, Sweden 17. 12. 2018, 13:00, A217 FI MU Visual representations ought to be more than aesthetically pleasing and complex — They have to fulfill a function so that target users can easily understand and use them. Conducting quantitative as well as qualitative evaluations with the user in mind, are important for obtaining concrete evidence of the effectiveness of such visual representations. In this talk, I will present the importance of evaluation in Visualization and my research. Bio: Kahin obtained his bachelor's and master’s degree in media technology and engineering at Linköping University, Sweden and is now a Ph.D. student in Information Visualization at the same department. He mainly focuses on user-centered evaluations of visual representations for temporal multivariate data. For more info please contact doc. Kozlíková (barunka.k@gmail.com).

Informatics Colloquium 11. 12. 2018, 14:00 lecture hall D2 prof. Guido Sanguinetti, Ph.D., School of Informatics, University of Edinburgh A computer scientist in epigenetic-land: some statistical challenges in functional genomic data modelling Abstract: New data gathering technologies such as ChIP-seq and BS-seq are allowing scientists to probe the epigenetic regulation of gene expression at unprecedented resolution. Yet the analysis of such data brings several non-trivial computational challenges. Here, I focus on how we can exploit the spatial correlation information to develop more powerful statistical models. I will briefly describe how we developed non-parametric statistical testing techniques for ChIP and BS-seq data, and discuss how spatial information can be used to extract more informative features from such data.

InterLoS* is the 5hour internet team competition. Teams solve ciphers and logical or programming tasks with various difficulties. When? Sunday 9/12/2018, 3 - 8 PM Registration till 8/12/2018 - https://interlos.fi.muni.cz *The Czech for elk is los :-)

Informatics Colloquium 4. 12. 2018, 14:00 lecture hall D2 prof. Ing. Adam Herout, Ph.D., FIT VUT Fully Automatic Traffic Surveillance Abstract: Traffic surveillance cameras can produce a lot of specific data. We are processing the data with the aim to fully automatically obtain as much useful data as possible: camera calibration, make&model fine-grained recognition, speed measurement, and other things. Some things work, some things might in the future.

We cordially invite you to see the legendary performance from May 1969 S úsměvem idiota (a nikdy jinak) (With a smile of an idiot (and never otherwise). It will take place on 21st of November at 7 PM, lecture hall D1 https://is.muni.cz/imgx/z/h/x/m-4analwgmw-c_of5nwvp/vodnansky-a4-page-001.jpg https://www.youtube.com/watch?v=lRBaN-QTpM4

Informatics Colloquium 27. 11. 2018, 14:00 lecture hall D2 doc. Mgr. Radek Pelánek, Ph.D., FI MU Adaptive learning: research, development, and connections Abstract: The goal of adaptive learning is to make learning more efficient and interesting by making it personalized for a particular student. In this talk, I will discuss the experience with the development of practically used adaptive learning systems and the research carried out by Adaptive Learning group at FI. I will also highlight connections of adaptive learning to other research areas, focusing specifically on topics studied at FI: machine learning, program analysis, similarity search, natural language processing, human-computer interaction, games, ...

Informatics Colloquium 20. 11. 2018, 14:00 lecture hall D2 doc. RNDr. Tomáš Brázdil, Ph.D., FI MU Verification of Markov Decision Processes using Learning Algorithms Abstract: I will present an application of machine-learning algorithms in the verification of Markov decision processes (MDPs). The primary goal of these techniques is to improve performance by avoiding an exhaustive exploration of the state space. I will concentrate on computation of maximum reachability probabilities in MDPs and present two methods based on a heuristic-driven partial exploration of the model. First, bounded real-time dynamic programming that yields precise lower and upper bounds on the maximum reachability probability. Second, Monte Carlo tree search, a method celebrated in various machine-learning settings, that combines exact computation using search trees with sampling methods. I will demonstrate usefulness of these methods in verification of resource access control protocols.

Informatics Colloquium 13. 11. 2018, 14:00 lecture hall D2 doc. Mgr. Hana Rudová, Ph.D., FI MU University course timetabling and International Timetabling Competition 2019 Abstract: University course timetabling belongs to classical problems which have been studied for many years by many researchers. This talk will outline existing research and emphasize new research directions and challenges in this area. It is clear that the organization of international competitions has the high impact on the timetabling research. We intend to discuss the organization of the new International Timetabling Competition (ITC 2019, https://www.itc2019.org) with the aim to motivate further research on complex university course timetabling problems coming from practice. Our goal is the creation of rich real-world data sets. Thanks to the UniTime timetabling system, we can collect a strong set of data with diverse characteristics which we will discuss in the talk. The key novelty lies in the combination of student sectioning together with standard time and room assignment of events in courses.

Let us invite you to the talk of our special guest Prof. Helwig Hauser from the University of Bergen, which will be held on the 8th of November (Thursday) at 3 PM in the D2 room. From One to Many in Visualization A lot of interesting development has been happening in visualization research in the past 25 years. Certain topics, like medical visualization, flow visualization, tabular data visualization, and network visualization have attracted continued interest over many years and every year fascinating new findings are presented. We focus on the important work of optimizing our solutions and maturing the field. Every now and then, however, we also see promising chances for radical innovation, for new pioneering research in visualization. In this talk, we take a look at one of these chances, i.e., to transition from the visualization of individual datasets to visually studying large sets of datasets, for example from medical cohort studies or from numerical ensemble simulations. It seems that relevant new visualization challenges arise, when hundreds or thousands of datasets are studied simultaneously—in particular, when these are sets of multi-aspect spatiotemporal datasets. This talk brings up some of the related major questions (for example: how to map to the 2D/3D visualization space), together with examples of related work, and hopefully inspires some bright minds to conduct more visualization research on this topic of increasing relevance. Helwig Hauser's Short Bio Helwig Hauser graduated in 1995 from Vienna University of Technology in Austria and in 1998 he finished his PhD project on the visualization of complex dynamical systems (flow visualization). In 2003, he got his Habilitation at TU Wien, entitled ''Generalizing Focus+Context Visualization''—in 2006 this work was awarded with the Heinz-Zemanek Award by OCG. Already in 2004, his work on the interactive visual analysis of simulation data won the IEEE Visualization Contest in Austin. In 2013, Helwig Hauser then received the Dirk Bartz Prize for Visual Computing in Medicine from Eurographics (medical ultrasound data visualization). With >190 refereed publications and >7500 citations (h-index ≈ 50), he is an active and respected member of the international visualization research community. Recently, he chaired/hosted several important visualization conferences, including EuroVis 2011, PacificVis 2012, IEEE InfoVis 2013 & 2014, and VCBM 2016 in Bergen, and he has been serving as associate editor for three of the central journals (including IEEE TVCG, CGF, and C&G). After first working for TU Wien as assistant and later as assistant professor (1994–), he changed to the new VRVis Research Center in 2000 (having been one of the founding team, also). There, he led the basic research group on interactive visualization (until 2003) before he became the scientific director of VRVis (–2007). Since then, he is professor in visualization at the University of Bergen in Norway, where he built up a new research group on visualization.

Informatics Colloquium 6. 11. 2018, 14:00 lecture hall D2 Assoc. Prof. Dr. Standa Živný, Department of Computer Science, University of Oxford Power of algorithms for homomorphisms and generalisations seen from both sides Abstract: The topic of this talk is the computational complexity of and the power of algorithms for the homomorphism problem between two relational structures, also known as the constraint satisfaction problem (CSP). We briefly discuss the known algorithmic and complexity classifications for CSPs parametrised by the source or target structures. We then discuss in more detail a classification of general-valued CSPs parametrised by the source structures. This part of the talk is based on joint work (published in FOCS 2018) with Clement Carbonnel and Miguel Romero.

Informatics Colloquium 30. 10. 2018, 14:00 ledture hall D2 Digitalizace průmyslové výroby Abstract: Digitalizace zásadním způsobem mění svět kolem nás. Mění chování zákazníků, kteří stále častěji požadují výrobky uzpůsobené jejich individuálním požadavkům za nákladových podmínek hromadné výroby. Tím vytváří nové výzvy pro firmy - jejich výroba musí být rychlejší, efektivnější, flexibilnější, dosahovat vysoké úrovně kvality a samozřejmě vysoké úrovně bezpečnosti. Řešení těchto výzev pak přinášejí opět právě digitální technologie, které transformují způsob, jakým jsou výrobky navrhovány, jak jsou vyráběny i jak se dále vyvíjejí. Například tzv. digitální dvojčata, tedy digitální modely výrobků, výrobního zařízení, výrobního procesu i celého výrobního provozu umožňují výrobek i způsob jeho výroby simulovat v softwarovém prostředí. Je tak možné odhalit chyby a vyladit všechny parametry ještě předtím, než je výroba vůbec spuštěna. Zásadní průlom přináší také rozšíření využití aditivní výroby, neboli 3D tisku. Ten umožňuje tvar výrobku lépe uzpůsobit jeho požadovaným vlastnostem a současně zásadním způsobem snížit množství použitého matriálu. Postupující digitalizace rovněž dopadá i na pracoviště. Mění se organizace práce nebo potřebné kompetence zaměstnanců, což se nezbytně promítá do nutných změn ve vzdělávání. Nejen těmto tématům se bude ve své přednášce a následné diskusi s vámi věnovat generální ředitel skupiny Siemens v České republice Ing. Eduard Palíšek, Ph.D., MBA.

Informatics Colloquium 23. 10. 2018, 14:00 ledture hall D2 RNDr. Radim Ošťádal, NBÚ Praha Abstract: Cílem prezentace je základní pochopení činnosti a spolupráce organizací zabývajících se kybernetickou bezpečností v České republice. Hlubší pohled je poskytnut na vládní CERT tým, na jím poskytované služby a na jeho spolupráci s dalšími organizacemi. Na závěr se posluchač seznámí s různými typy kybernetických cvičení.

Informatics Colloquium 16. 10. 2018, 14:00 lecture hall D2 prof. RNDr. Jiří Zlatuška, CSc., FI MU Abstract: Zpracování informací a informační systémy umožňují hromadné zpracování „objektivních dat“ pro potřeby řízení i hodnocení. Má to za následek výraznou změnu kultury institucí a firem z hlediska faktorů, které se pro ně stávají určujícím parametrem řízení. Obecný trend tímto směrem je dlouhodobější, týká se řady oblastí činností a vede k nárůstu byrokratizace spojené s „objektivitou“ takových přístupů, stejně jako k náhradě odborníků v oboru či oblasti generickými managery usměrňujícími práci odborníků tak, aby se vešla do obecných přihrádek těchto managerů. Z hlediska informatiky jako disciplíny, která tyto postupy nástroji, které vytváří, umožňuje, usnadňuje a podporuje, je vhodné mít na zřeteli širší kontext těchto změn i jeho rizika - ať již při vlastním použivání těchto přístupů, tak při výchově studentů, kteří takové nástroje budou v budoucnosti vytvářet a používat.

About the lecture Population protocols are a mathematical model of distributed computation introduced by Angluin et al. in 2004. The original purpose of Angluin et al. was the theoretical study of systems consisting of identical, cheap mobile devices with tiny computational resources, like sensor networks. However, since its introduction, the model has also been used to analyze the behavior of chemical systems and of people in social networks. Population protocols help us to pose and study many fundamental questions about distributed systems: What can be computed by agents wishing to remain anonymous? Are leader processes necessary for optimal speed? Can macroscopic "phase transitions" be "programmed" at a microscopic level? Is it possible to check automatically that a protocol works correctly? Is it possible to automatically synthesize a protocol for a given task? In the talk, I will introduce the population protocol model with the help of several examples. More precisely, I will present the problem of the Black Ninjas in the Dark, and the different solutions given to it by their Senseis. I will also show animated simulations of some protocols. The lecture will be held at Mendel Museum, Refectory of Augustinian Abbey (Mendlovo nám. 1a, Brno) About speaker Javier Esparza is a full professor at Faculty of Computer Science, Technische Universität München, Germany. The Chair held by Prof. Esparza develops methods, algorithms, and tools to locate and eliminate errors in software systems or verify their correctness.

Informatics Colloquium 9. 10. 2018, 14:00 lecture hall D2 doc. RNDr. Lubomír Popelínský, Ph.D., FI MU Abstract: It is five years when the first monography on Anomaly analysis have been published. We will review new research as well as application direction that newly appeared from that time e.g. anomaly explanation, class-based outliers, graph and sequence outliers, and outliers in text among others.

About the lecture The most famous open problem in theoretical computer science, known as the P vs. NP problem challenges us to prove that for some natural search problems, no efficient algorithm is possible. At the moment, we have no idea how to prove such a statement. In order to make meaningful progress, we can restrict the class of algorithms we consider and show that, within these restrictions, no efficient algorithm exists. In this talk, I consider a natural restriction to symmetric algorithms. I explain how symmetries arise naturally in computational problems and why algorithms that respect these symmetries have inherent limitations. Many of our most powerful algorithmic techniques are symmetry-preserving, while others are not. Exploring these limits offers a rich research agenda combining logic, algebra and combinatorics with algorithms. The lecture will be held at Mendel Museum, Refectory of Augustinian Abbey (Mendlovo nám. 1a, Brno) About the speaker Anuj Dawar is the Professor of Logic and Algorithms at the University of Cambridge. He is a Fellow of the Alan Turing Institute in London.

Informatics Colloquium 2. 10. 2018, 14:00 lecture hall D2 prof. RNDr. Daniel Kráľ, Ph.D., DSc., FI MU Abstract: The theory of combinatorial limits provides analytic tools to study large discrete structures. Such tools have found applications in various areas of computer science and mathematics. In particular, analytic representations of large graphs nourished progress on many difficult problems in extremal graph theory. We will present an introduction to this rapidly developing area of combinatorics and illustrate the range of its applications on several specific problems concerning graphs and permutations. We conclude with some of the future research directions related to the presented concepts.

We cordiallly invite all to the lecture of David Pavlik, Chief Information Officer Kiwi.com. David graduated at Faculty of Informatics, MU in 2001. He then worked in variety of roles, e.g. in Microsoft, Amazon, Netflix, SpaceX. He will talk about how to be successful in your career and how important is what he learned at Faculty of Informatics. Title: Learning of first principles matters Abstract: To be really successful in your career not only you need to understand the business context, but you need to understand the fundamentals of the domain you are working in. In this lecture, we are going to walk you through multiple examples of how college education was successfully applied in various disciplines at world’s most successful companies. We will talk about the application of building your own grammar, discuss how deep knowledge of statistics can increase the revenue of your business or save lives, and why you should understand programming language principles. The objective of this lecture is to set the context for why it does matter to spend the next few years in college. Faculty of Informatics, Masaryk University, Botanicka 68a, Brno lecture hall D3, September 20th, 2018, 18:00 About the speaker: David graduated at Faculty of Informatics, MU in 2001. He then worked in variety of roles, ranging from Service Delivery Lead at Microsoft, Technical Program Manager at Amazon.com, Engineering Manager at Netflix or various software roles at SpaceX. Most recently he is back to Brno and enjoying working as Chief Information Officer with an amazing team of Kiwi.com. The lecture will be given in English.

Informatics Colloquium 22. 5. 2018, 14:00 lecture hall D2 Mouzhi Ge, Ph.D., FI MU Recommender System Research in E-Commerce Abstract: Over the last decade, recommender systems have been widely applied in e-commerce, for example, video recommendations in Youtube, book recommendation on Amazon, and movie recommendation on Netflix. Recommender systems are developed to help users find relevant products that may interest them. The goal of recommender systems is to reduce the information overload and provide personalized recommendations for users. In this talk, I will discuss the state-of-the-art research of recommender system in E-Commerce, which includes rationale and algorithms inside the recommender black box, important features and evaluations in recommender systems. Finally, a real-world food recommender system project in E-Commerce will be described and demonstrated to show how to construct and evaluate the recommender system in practice, as well as possible challenges that are related to the food recommender systems.

Informatics Colloquium 24. 4. 2018, 14:00 lecture hall D2 Kateřina Falk, Ph.D., Helmholtz Zentrum Dresden-Rossendorf, Drážďany, Německo Astrophysics and fusion research with high power lasers The most powerful laser systems in the world and their uses Abstract: The talk will be about speaker research on dense plasmas using some of the most powerful lasers in the world. At the first an outline of the field will be given, including an introduction of some of the best laser laboratories and about applications in laboratory astrophysics and fusion technology. Thanks to the development of high power and high energy lasers, scientists are now able to generate extreme states of matter, accelerate particles and simulate many astrophysical phenomena including the interiors of planets, supernova explosions, gigantic astrophysical jets or even create antimatter. By dynamically compressing matter, lasers can create exotic phase transitions like the diamond rain inside Neptune or formation of rare structures like londsdaleite, which is harder than diamond. One of the most important applications of this research is an efficient generation of clean energy using thermonuclear fusion, the same reactions that power all stars including our Sun.

Informatics Colloquium 17. 4. 2018, 14:00 lecture hall D2 doc. Fotios Liarokapis, Ph.D., FI MU Virtual Reality Assessment for Examining Functional Neurological Symptoms Abstract: Functional neurological symptoms (FNS) are somatic symptoms that still remain poorly understood. Their diagnosis is made by exclusion of organic cause and therefore does not provide any specific cues for the subsequent treatment. Virtual reality (VR) seems to be mature enough to be experimentally tested as a potential therapeutic intervention for the functional neurological disorders. Biofeedback is the process of gaining greater awareness of many physiological functions primarily using instruments that provide information on the activity of those same systems, with a goal of being able to manipulate them at will. Some of the processes that can be controlled include brainwaves, muscle tone, skin conductance, heart rate and pain perception. This presentation will evaluate immersive virtual reality as a potential therapeutic tool for a treatment of functional neurological symptoms. The first part will examine the effects of immersive virtual reality intervention on changes in autonomic arousal in FNS (in both healthy subjects and patients) by introducing emotional stress. The effect of immersion manipulation on changes in emotional reactivity to stress inducing stimuli is assessed by measuring skin conductance and heart rate variability. The second part will examine how biofeedback affects immersive virtual reality intervention on effective connectivity patterns in patients with FNS.

Informatics Colloquium 10. 4. 2018, 14:00 lecture hall D2 Ing. Leonard Walletzký, Ph.D., FI MU Can Cities be truly Smart? Findings from the Smart Service research group Abstract: Two years ago the Smart Service research group was established at the Faculty of Informatics. During this short period of time, its members have become relevant part of the research community, focusing on new challenges in ICT applications (IoT, Smart Cities, Industry 4) within Service Science. The presentation will outline some of our main findings on the field of Smart City, focused on the comparison of academic approaches with industrial practice.

Informatics colloquium 3. 4. 2018, 14:00 lecture hall D2 doc. JUDr. Radim Polčák, Ph.D., PrF MU Abstract: In my note, I would like to discuss some legal issues related to development and use of autonomous robots. One of obvious problems is liability. Robots do not have legal personalities, so it is questionable who and for what should be liable when a robot causes harm (physical or other - e.g. through discriminatory decisions). In real life, this issue translates mostly to compliance and modelling insurance schemes that technically define basic parameters of respective markets. In addition, I would like to briefly discuss legal barriers to use of different types of data for development or operations of robots. In that regards, we need complex legal solutions (not necessarily legislation - e.g. contractual data trusts) to overcome complicated and differentiated legal obstacles that prevent pooling and use of data from different jurisdictions within the EU and offshore.

Informatics colloquium 27. 3. 2018, 14:00 lecture hall D2 Ing. Vlad Popovici, M.Sc., Ph.D., PřF MU Abstract: High throughput genomic revolution started almost twenty years ago with the first in-house printed DNA chips. Since then, various technologies evolved, allowing the interrogation of the whole (human) genome, proteome, metabolome, etc., all producing large amounts of data. Bioinformatics tools and methods evolved to account for all these data modalities with the current bottleneck being the integration of these perspectives into a more comprehensive picture. In parallel and completely independent of bioinformatics, digital pathology also witnessed significant advances fuelled mostly by technological developments: slide scanners and computational infrastructure. However, both “classical” bioinformatics and digital pathology/bioimaging are often used to investigate the same biological phenomenon. It is, therefore, natural to attempt to combine these two seemingly incompatible fields with the hope of unveiling new connections between them. In this talk we will look at three examples of jointly mining the transcriptome and the histopathology images in the context of breast and colon cancers. We will also discuss the computational challenges one faces when working with these data.

Informatics colloquium 20. 3. 2018, 14:00 lecture hall D2 RNDr. Vladimír Ulman, Ph.D., FI MU Abstract: The present biomedical research increasingly relies on automated processing and analysis of large amount of image data. Two fundamental tasks in this area are automated cell segmentation and tracking. The task of cell segmentation is to split the image into several disjoint regions, each accurately outlining every single cell. The task of cell tracking is to link together the regions that represent the same cell in a time-lapse image sequence. This allows for time-resolved quantitative description of events and changes in displayed cell behaviour. Needless to say, the accuracy of the two tasks influences accuracy of the consequent biological analysis. This talk will be focused on ways to evaluate performance quality of segmentation and tracking algorithms. In particular, I will review the evaluation protocol implemented in the Cell Tracking Challenge, an international benchmarking initiative that FI MU is part of, and identify current challenges in the field. Last but not least, I will give an outlook on a artificial image synthesis, which I see as a prospective way to foster the future development in the field.

Informatics colloquium 13. 3. 2018, 14:00 lecture hall D2 Atreyee Sinha, Ph.D., Computing & Information Sciences Department, Edgewood College, Madison, USA Abstract: Image classification is one of the most important Computer Vision problems being addressed by researchers around the world today. Classification is the task of labelling images with different predefined category labels. These category labels may be based on some low-level features such as color, texture or shape, but more often, they are based on high-level features such as semantic description, activity or objects present. In this talk, I will present the different techniques and recent advances in image classification and retrieval with particular examples from different applications.

Informatics colloquium 6. 3. 2018, 14:00 lecture hall D2 RNDr. Robert Ganian, Ph.D., Algorithms and Complexity Group, TU Wien Backdoors to Tractability for Constraint Satisfaction Abstract: Constraint Satisfaction (CSP) is one of the most studied NP-complete problems, with numerous applications in both theory and practice and featuring its own dedicated conference. A significant amount of research has targeted the identification of classes of CSP instances which are polynomially tractable; this has led to celebrated results such as Schaefer's Dichotomy Theorem and Bulatov's recent proof of the Feder-Vardi Dichotomy Conjecture. Such classes of instances are often called "islands of tractability". In this talk, we will present techniques and recent developments on solving CSP instances that lie outside of an island of tractability. In particular, we will use the notion of "backdoors" to capture the distance of an instance from an island of tractability and show how these backdoors can be exploited to obtain algorithms for CSP with good runtime guarantees.

Informatics colloquium 27. 2. 2018, 14:00 lecture hall D2 asst. prof. Dimitris Sacharidis, Ph.D., Institute of Information Systems Engineering, TU Wien Managing and Analyzing Big Geo-Social Data Abstract: The widespread adoption of online social networks and location-aware mobile devices has resulted in a continuously increasing amount of published user-generated, geo-tagged content. Typical examples include tweets, check-ins, photo/video uploads, route posts (e.g., taxi rides, running trails). This big geo-social data essentially captures people's everyday interactions between the physical and digital world, and presents immense opportunities for creating added value to domains such as location-based services, smart cities, tourism. In this talk, we will present methods for efficiently handling and effectively analyzing large amounts of such data.

Informatics colloquium 20. 2. 2018, 14:00 lecture hall D2 ao. Univ.-Prof. Dipl.-Ing. Dr. Renate Motschnig, Faculty of Computer Science, University of Vienna Transforming Communication in Leadership and Teamwork – Why should computer scientists care? Abstract: Numerous sources report that the major reason for ICT-project failure are people- rather than technical issues. Thus, in order to improve project success, the most evident thing to do seems to care about the human factor in ICT projects. This influential “soft”, “fuzzy”, and “complex” factor, however, has tended to be overlooked, such that a number of research gaps at the interface between software engineering and human sciences became apparent and need to be filled. In this talk, my objective is to raise awareness of the salience of communication issues in ICT projects and illustrate, what can be done (or what computer scientists, in particular, can do) scientifically and practically, to fill the research/practice gaps and concurrently improve communication, leadership, and teamwork in ICT projects.

Do not miss the unique opportunity to hear prof. Král, leading world-wide expert in the field of discrete mathematics and algorithms. Daniel Král' is a professor of matematics and informatics at University of Warwick. For his work he received many important awards such as European Prize in Combinatorics 2011 or Philip Leverhulme Prize in Mathematics and Statistics in 2014. He is also one of two Czech scientists who received ERC grant more than once. Lecture "Models of large networks" will be given in English. The lecture will take place on Friday, February 16, 2018 at 11 am in the D3 lecture hall.

Masaryk University Rector's Award 2018

Informatics colloquium 19. 12. 2017, 14:00 lecture hall D2 prof. Stefan Bruckner, Faculty of Mathematics and Natural Sciences, University of Bergen Navigating the Space of Visualizations Anstract: Considering the vast amounts of data involved in many scientific disciplines and industrial applications, it is essential to provide effective and efficient means for forming a mental model of the underlying phenomenon. The term "visualization" refers to the process of extracting meaningful information from data and constructing a visual representation of this information. While the concept of using images to communicate complex phenomena of course predates the development of digital technology by millennia, over the past decades the field of visualization has firmly established itself as an important and constantly expanding discipline within computer science. Computer-based Visualization seeks to provide interactive graphical data representations, taking advantage of the extraordinary capability of the human brain to process visual information. Advanced visualization methods now play an an important role in the exploration, analysis, and presentation of data in many fields such as medicine, biology, geology, or engineering. This development, however, has also lead to the fact that there is now a vast number of often very specialized techniques to visualize different types of data tailored towards specific tasks. For non-experts it becomes non-trivial to choose appropriate methods that will provide the optimal answers to their questions. In this talk, I will discuss previous and ongoing research on how we can explore and navigate the space of visualizations itself. By consider the interplay between data, visualization algorithms, their parameters, perception, and cognition as a complex phenomenon that deserves study in its own right, we are making progress in providing goal-oriented interfaces for visual analysis. For instance, we can make the modification of input parameters of visualization algorithms more intuitive by normalizing their perceived effects over the entire value range, and provide visual guidance about their influence. Furthermore, by incorporating additional knowledge into the visualization process, we can infer information about the goals of a user, and develop smarter systems that automatically suggest appropriate visualization techniques. This line of investigation leads us along the path towards a new type of visual data science, where automated data analysis approaches such as deep learning are tightly coupled with interactive visualization techniques to exploit their complementary advantages for knowledge discovery in data-driven science. Short biography: Stefan Bruckner is professor in visualization at the Department of Informatics of the University of Bergen, Norway. Prior to his appointment in Bergen, he was an assistant professor at the TU Wien, Austria where he also received his habilitation (2012) and PhD (2008). His research focuses on interactive visualization and he has made important contributions to several areas such as illustrative methods, parameter space exploration, feature detection, and knowledge-based interfaces. Prof. Bruckner has successfully led several research projects including industry collaborations with partners such as AGFA HealthCare and GE Healthcare. His results were published in the premier venues for visualization research and have to date received 8 best paper awards and honorable mentions at international events. He won the Karl-Heinz-Höhne Award for Medical Visualization and received the prestigious Eurographics Young Researcher Award. As an active member of the international scientific community, Prof. Bruckner regularly serves on the program committees of the leading conferences in visualization and computer graphics. He was program co-chair of EuroVis, PacificVis, VCBM, and the Eurographics Medical Prize, and currently serves on the editorial board of Computers & Graphics. He is a member of the IEEE Computer Society, ACM SIGGRAPH, and Eurographics.

Informatics colloquium 12. 12. 2017, 14:00 lecture hall D2 RNDr. Petr Švenda, Ph.D., FI MU Troubles with RSA cryptographic keypair generation Abstract: The talk will cover our recent work [1] which resulted in the discovery of an algorithmic flaw in the construction of primes for RSA key generation in a widely-used library of a major manufacturer of cryptographic hardware. The primes generated by the library suffer from an entropy loss so severe, that practical factorization of commonly used key lengths up to 2048 bits is possible. Our method based on an extension of Coppersmith’s factorization attack requires no additional information except for the value of the public modulus and does not depend on a weak or a faulty random number generator. The library in question is found in NIST FIPS 140-2 and CC EAL 5+ certified devices used for a wide range of real-world applications, including citizens identity cards, Trusted Platform Modules, secure email, and tokens for authentication or software signing. The findings directly resulted in the revocation of millions of certificates in Estonia, Slovakia, Spain and other countries and major security update rolled by Microsoft, Google, HP, Lenovo, and others. The talk will discuss how the vulnerability was found, what was the root cause for its existence, our experience from the responsible disclosure process and the options how to systematically prevent such a large-scale failure in the future. [1] Matus Nemec, Marek Sys, Petr Svenda, Dusan Klinec and Vashek Matyas: The Return of Coppersmith's Attack: Practical Factorization of Widely Used RSA Moduli, 24th ACM Conference on Computer and Communications Security (CCS'2017), 2017.

Informatics colloquium 5. 12. 2017, 14:00 lecture hall D2 doc. RNDr. Tomáš Brázdil, Ph.D., FI MU Mastering games with deep learning Abstract: The main theme of the talk is how much a deep learning agent could learn by playing games against itself. I will start with a historical overview of TD-Gammon, a famous algorithm for playing backgammon at expert level. In the main part I will concentrate on the very recent algorithms for playing Go above master level. I will give an overview of fundamental methods, namely deep reinforcement learning and Monte Carlo tree search. Finally, I will comment on new directions in the area, especially the Starcraft II challenge in which the current algorithms still fail to deliver convincing results.

Informatics colloquium 28. 11. 2017, 14:00 lecture hall D2 Univ.-Prof. Dr. Uwe Zdun, Faculty of Computer Science, University of Vienna Software Architectures and Techniques for Compliance Monitoring and Enforcement Abstract: IT compliance means in general complying to regulations that apply to an IT system. There are many other rules and constraints in a software system that have characteristics similar to IT compliance rules stemming from regulations, including security policies, business rules, QoS rules, deployment rules, and even architecture conformance rules. In this talk, we discuss software architectures and techniques for automated compliance monitoring and enforcement. Goals are to enhance the automation in compliance controls and make compliance controls easier to implement, reuse, and change - and thus less costly. We will discuss different categories of compliance checking techniques, like those that check at design time, runtime, or after runtime, and those that are primarily focussed on structures or behaviors. Further we discuss the need and techniques for involving domain experts more closely, as well as semi-automatic guidance for control definition, monitoring, and enforcement.

Informatics colloquium 21. 11. 2017, 14:00 lecture hall D2 RNDr. Martin Maška, Ph.D., FI MU Segmentation and Tracking of Spiky Cells Abstract: To monitor their surroundings and to promote their movement, motile cells protrude spikes. Although modern fluorescence microscopy allows us to observe spiky cells at unprecedented spatio-temporal resolutions, a fully 3D image analysis approach to automatically quantifying the behavior of spikes is still lacking. In this talk, we briefly explain crucial aspects of such a quantitative task and present our recent advances in the field, demonstrating how convolutional neural networks combined with realistic computer-generated image data help to increase segmentation and tracking performance beyond that of traditional image analysis approaches without machine learning.

Juraj Hromkovic, professor of Information Technology and Eduation at the Department of Computer Science at ETH Zurich since January 2004. Teaching mathematics and computer science as research instruments Abstract: We view mathematics as a language that was and is developed in order to describe what is describable in an unambiguous way (everybody mastering this language interprets each sentence in the same way) and in order to have a language in which the correctness of each argumentation is verifiable. Together with experiments mathematics became the main research instrument for discovering our world. In this talk we present the history of the development of mathematics and computer science in a concise way and recognize that the main contributions of science are not in discovering facts, but in introducing new concepts that increase the power of our research instruments. Finally, we discuss why and how we have to change our education in mathematics and science that is still living in a more than 100 years old world of technical revolution. The main idea is based on moving from teaching long time optimized and finalized products of scientific work as facts, relationships and methods to teaching the processes of the development of research instruments and of making discoveries. The main goal is to force the intellectual growth of young people, to motivate them to strive to understand and to be creative. Place: Mendelovo muzeum, Mendlovo náměstí 907/1A, Brno

The habilitation lecture Mgr. Pavel Rychlý, Ph. D. will be held on Tuesday November 3, 2015 from 10:45 in the conference room B517. Lecture title: Why we need even bigger text corpora. Abstract: The first text corpus suitable for a linguistic research was British National Corpus containing around 100 million words. Current costs of creating such corpus is only a fraction of costs at that time. There are corpora containing ones or tens of billions of words for the most-spoken languages. Many text processing tools are not able to process such amount of data effectively, that rise the question: do we really need such big corpora? In the presentation, we are going to show which applications need them. The habilitation lecture RNDr. Jan Bouda, Ph. D. will be held on Tuesday November 10, 2015 from 10:00 in the lecture room A318. Lecture title: Theoretical computer science in quantum world Abstract: Our world is controlled by the laws of quantum physics. Traditional theoretical computer science is based on classical physics, and does not describe our world in full generality. Are the results of theoretical computer science valid in the real world, or just in the Turing machine? Do information theory, computational complexity, automata, and formal languages have any real world relevance? In this talk I will try to persuade the audience that despite the highly restrictive computation and information model traditional theoretical computer science uses, many results are still valid and it is not necessary to completely abandon the research in traditional theoretical computer science The habilitation lecture Fotios Liarokapis, PhD will be held on Tuesday December 1, 2015 from 14:00 in the lecture room D2. Lecture title:Interactive Augmented Reality Environments. Abstract:Augmented reality is considered to be as one of the most promising technologies for the coming years. This talk will present augmented reality technologies for both indoor and outdoor environments. A number of novel augmented reality interfaces will be demonstrated illustrating how these technologies can be used effectively for different application domains such as archaeology, education and navigation.

Up to four post-doc positions in computer science are available at the Faculty of Informatics, Masaryk University, Brno. The positions are initially limited to one year but can be extended to two years based on a successful evaluation after the first 8 months. The gross salary will be 2,000 EUR per month. Anticipated starting date is September 1, 2011 (can be negotiated) and preference will be given to those who can start by Autumn 2011. Applicants should have (by the starting date) a PhD in computer science or a closely related discipline and ideally will have a strong background in one of the research activities carried out at the Faculty of Informatics, namely formal methods, computer graphics and image processing, data management, large scale distributed systems and networks, security and cryptography, embedded systems, enterprise systems and services and natural language processing, for details see: here The willingness to contribute to the teaching programme of the Faculty of Informatics by means of a specialized course is welcome. The applicants should enjoy working in a team and have good communication skills. Fluency in English is required. In order to encourage mobility, the candidate cannot be considered eligible for this position if by the starting date, he or she has already worked or studied at Masaryk University for a total of 6 months or more, during the last 3 years. Candidates who did not graduate from a university in the Czech Republic will be strongly preferred. The positions are open until filled. Interested candidates are invited to apply to: Dana Komárková R&D Office Faculty of Informatics Botanicka 68a 602 00 Brno Czech Republic E-mail: research@fi.muni.cz The application should contain CV, list of publications, cover letter with statement of research interests and names and contact information of three researchers who are familiar with the applicant's work and who could provide recommendation letters if needed. Electronic submissions are highly encouraged.

Deadline for submission of proposals for students´ development and research projects is on 17th January 2010.

Masaryk University Rector opens the competition of Student Project Grant at MU in the following project categories: A. Specific research grant projects B. Student scientific conference

Masaryk University Rector opens the competition of Student Project Grant at MU n the following project categories: A. Specific research grant projects B. Student scientific conference Projects start is 1 January 2010.  

IBM Shared University Research Award 2008 was awarded to prof. Pavel Zezula for innovating project Web-scale Similarity Search in Multimedia Data. More information is in press report MU and here - some media responses.

Program of the meeting: Habilitation procedure 10,00 - RNDr. Tomáš Pitner, Ph.D. - Web-Based Services For Technology-Enhanced Learning, title of habilitation lecture "Web 2.0 Concepts, Applications, and Open Problems 11.00 - RNDr.. Petr Sojka, Ph.D. - From Pixels to Minds and Back; title of habilitation lecture "From the Minds Pixels and Back." 12.00 - 12.15 break 12.15 - RNDr. Eva Hladká, Ph.D. - Multimedia Data Distribution and Processing; title of habilitation lecture "Active element for data distribution" 13.15 - RNDr. Aleš Horák, Ph.D. - Computer Processing of Czech and Syntax Semantics; title of habilitation lecture "Computer processing of the Czech syntax and semantics " Professorship procedure 14.15 - doc. RNDr. Luděk Matyska, CSc. - title of lecture "Usable Distributed Systems". All are invited.

The Newton International Fellowship scheme will select the very best early stage post-doctoral researchers from all over the world, and offer support for two years at UK research institutions. The Fellowships cover the broad range of natural and social sciences, engineering and the humanities. They provide grants of £24,000 per annum to cover subsistence and £8,000 to cover research expenses, plus a one-off relocation allowance of £2,000. As part of the scheme, all Newton Fellows who remain in research will be granted a 10 year follow-up funding package worth £6,000 per annum. Application deadline is August 4, 2008. More information at: www.newtonfellowships.org