{"id":3394,"date":"2019-09-03T18:45:00","date_gmt":"2019-09-03T17:45:00","guid":{"rendered":"http:\/\/www.sitola.cz\/wordpress\/?page_id=3394"},"modified":"2020-09-19T18:33:46","modified_gmt":"2020-09-19T17:33:46","slug":"spring-2019-programme","status":"publish","type":"page","link":"https:\/\/www.sitola.cz\/wordpress\/seminar\/spring-2019-programme\/","title":{"rendered":"Spring 2019 Program"},"content":{"rendered":"<p>This is the programme of the Sitola seminar in spring 2019. Presentations for the current semester are available <a href=\"https:\/\/www.sitola.cz\/wordpress\/seminar\">here<\/a>.<\/p>\n<ul>\n<li><strong>20.2.2019<\/strong><br \/>\nRNDr. Petr Ro\u010dkai, Ph.D.<br \/>\n<strong>Software verification vs security vulnerabilities<\/strong><br \/>\nAbstract: Applications of formal methods (especially automated verification methods) to realistic software is an emerging field with an active research community. Programs written in C are especially interesting since the C language is still widely used in system-level programs, while also being susceptible to many serious programming mistakes. Additionally, in many cases, such mistakes are hard to uncover using traditional methods like testing. Formal methods attack the problem from a different angle, using powerful automated reasoning to discover hard-to-find bugs. It is perhaps not surprising that a substantial overlap exists between security vulnerabilities and the classes of bugs that can be exposed using such tools. In this talk, we will explore the state of the art in software verification from a security perspective.\n<\/li>\n<p><\/p>\n<li><strong>27.2.2019<\/strong><br \/>\ndoc. RNDr. Ale\u0161 Hor\u00e1k, Ph.D.<br \/>\n<strong>Anonymous authorship and propaganda detection in texts<\/strong><br \/>\nAbstract: The joint project of researchers from FSS, FI and PrF MU named &#8222;Manipulative Techniques of Propaganda at the Time of the Internet&#8220; responds to the current issue of spreading political propaganda of foreign actors through new media and social networks in the Czech Republic.<br \/>\nOne of the outputs of the project will be an analytical software for the detection of manipulative techniques in the text. The employed methods lean on previous experience with developing a system for recognizing anonymous authorship.  This discipline focuses on the tasks of authenticating documents in court cases and searching for authors of anonymous illegal documents in the Internet environment.  With support from the Ministry of the Interior, we have developed the Authorship Recognition Tool (ART) to determine the authorship of documents using the author stylistic analysis. ART solves the problems of verifying and assigning authorship and document clustering by the (presumed) author.\n<\/li>\n<p><\/p>\n<li><strong>6.3.2019<\/strong><br \/>\nMgr. David St\u0159el\u00e1k<br \/>\n<strong>Performance analysis and autotuning setup of the cuFFT library<\/strong><br \/>\nAbstract: Fast Fourier transform (FFT) has many applications. It is often one of the most computationally demanding kernels, so a lot of attention has been invested in tuning its performance on various hardware devices. However, FFT libraries have usually many possible settings, and it is not always easy to deduce which settings should be used for optimal performance. In practice, we can often slightly modify the FFT settings, for example, we can pad or crop input data.  Surprisingly, a majority of state-of-the-art papers focus to answer the question of how to implement FFT under given settings but do not pay much attention to the question which settings result in the fastest computation.<br \/>\nWe target a popular implementation of FFT for GPU accelerators, the cuFFT library. We analyze the behavior and the performance of the cuFFT library concerning input sizes and plan settings. We also present a new tool, cuFFTAdvisor, which proposes and using autotuning finds the best configuration of the library for given constraints of input size and plan settings. We experimentally show that our tool can propose different settings of the transformation, resulting in an average 6\u00d7 speedup using fast heuristics and 6.9\u00d7 speedup using autotuning.\n<\/li>\n<p><\/p>\n<li><strong>13.3.2019<\/strong><br \/>\nRNDr. Michal Proch\u00e1zka, Ph.D.<br \/>\n<strong>ELIXIR AAI: Building large pan-European authentication and authorization infrastructure<\/strong><br \/>\nAbstract: Several years ago, ELIXIR CZ (represented by Institute of Computer Science and its Centre CERIT-SC) together with ELIXIR FI (represented by CSC) proposed to build and operate an authentication and authorization infrastructure (AAI) for the large pan-European research infrastructure ELIXIR. The ELIXIR AAI is already running in production for two years and is one of the most advanced AAI in the academic area. Its evolution propagated back to the designs and schemas for general AAI, and it even aims to become inspirational for the EOSC AAI to glue together research infrastructures. The experience gained during the development and operation of ELIXIR AAI will be used for the evolution towards the Life Science AAI that will serve for all the European LS infrastructures. The concepts and achievements are also published in an extensive F1000 paper and materialized in the AARC Blueprint architecture. The presentation will describe the way how we started with our identity and access management system Perun and got to a complete AAI.\n<\/li>\n<p><\/p>\n<li><strong>20.3.2019<\/strong><br \/>\nMgr. Tom\u00e1\u0161 Sap\u00e1k<br \/>\n<strong>Delivering Single Sign-on at MUNI with Docker and Puppet<\/strong><br \/>\nAbstract: Single Sign-on at MUNI is a service, that provides user with secure authentication to wide variety Masaryk University and international web services. Service itself consists of a few interconnected software components (web server, application server, database, directory service, caching service) accessed by several thousand unique users each day. Maintaining complex system with security and high availability requirements brings a few challenges &#8211; accountability, system state definition, frequent automatized patching, OS upgrades, handling software dependencies and documentation accuracy. This presentation will show the audience, how we solved these issues by moving from traditionally installed applications to system running on top of docker containers continuously delivered by Puppet.<\/li>\n<p><\/p>\n<li><strong>27.3.2019<\/strong><br \/>\n<strong>Future Sitola<\/strong><\/li>\n<p><\/p>\n<li><strong>3.4.2019<\/strong><br \/>\nMgr. Filip M\u00fcnz, PhD.<br \/>\n<strong>Planning and evaluation of experiments<\/strong> (40 minuts for presentation)<br \/>\nAbstract: The standard analysis of variance is usually applied to categorical data; however, the method is principally an analog to subtraction of a parametric model that also attempts to &#8222;explain out&#8220; the most of observed variance. In the case of highly-dimensional data, the process can be extended by the method of principal components that unfortunately often blurs our understanding of the model for the sake of reducing the amount of unexplained variability. Another tradeoff to consider is the bias vs. variance decomposition linked to the number of model parameters. The importance of model validation can be demonstrated in this case.<br \/>\n<a href=\"https:\/\/nbviewer.jupyter.org\/url\/physics.muni.cz\/~munz\/text\/ufkl\/ExperimentEval.ipynb\">Slides with source codes<\/a><br \/>\n<a href=\"\nhttp:\/\/www.video.muni.cz\/verejne_pod.cgi?cat=Sitola%20semin%C3%A1%C5%99\">Video from the presentation<\/a>\n<\/li>\n<p><\/p>\n<li><strong>10.4.2019<\/strong><br \/>\nRNDr. Michal Zima<br \/>\n<strong>Mass mining of cryptocurrencies<\/strong><br \/>\nAbstract: Cryptocurrencies were popularised a lot through their process of \u201cmining.\u201d There are various approaches to mining with different pros and cons. Different cryptocurrencies choose different ones. Some even cooperate and share their miners. This approach (called \u201cmerged mining\u201d) seems to be increasingly popular in use but is not exploiting its full potential yet.<br \/>\nIn my talk, I will initiate you into the mysteries of cryptocurrency mining and present the state of the art of merged mining, both its advantages and issues, my recent work in this area and opportunities that this approach provides, mainly in enhancing security of involved cryptocurrencies.\n<\/li>\n<p><\/p>\n<li><strong>17.4.2019<\/strong><br \/>\nMgr. Lud\u011bk Matyska<br \/>\n<strong>Quantum computers of today<\/strong><br \/>\nAbstract: The technological advancement and implementations in recent years allowed researchers and companies to commercially offer devices supposedly capable of quantum computation as either cloud services or physical computational units.  We assess these commercially available devices from several companies (IBM, D-wave Systems, etc.) by looking at their physical implementations, their performance and capacity, universality, and how much can the customer trust something exploiting the laws of quantum mechanics is actually happening inside.<br \/>\nThe second part of the talk is then a closer look at the Q Experience, a cloud service offering access to the universal quantum computer, as a quick introduction into a very intuitive graphical way of programming a quantum computer.\n<\/li>\n<p><\/p>\n<li><strong>24.4.2019<\/strong><br \/>\nUVT seminar (no presentation)\n<\/li>\n<p><\/p>\n<li><strong>15.5.2018<\/strong><br \/>\nCESNET seminar (no presentation)\n<\/li>\n<p><\/p>\n<li><strong>22.5.2019<\/strong><br \/>\nMgr. et Mgr. Jaroslav O\u013eha<br \/>\n<strong>Autotuning in complex systems and its applications<\/strong><br \/>\nAbstract: Many problems arise when the computational load of a single scientific simulation is distributed among multiple processors and accelerators &#8211; chief among them being hardware heterogeneity and performance portability.<br \/>\nThere are two successful approaches that tackle these problems dynamically: task-based runtime systems and autotuning. While task-based runtime systems treat various parts of the application code as separate tasks and schedule them across the distributed hardware resources, autotuning tries to optimize parts of the code for better performance.<br \/>\nSince these approaches are clearly complementary, we hypothesise that their combination could result in significant performance gain in heterogeneous distributed systems. We intend to test our hypothesis by implementing an autotuning task-based system, and applying it in a real-life image-processing pipeline in cryogenic electron microscopy.\n<\/li>\n<p><\/p>\n<li><strong>Examination period 24.5. \u2013 4.7.2019<\/strong><br \/>\nMeetings devoted to state exam training are scheduled mostly. State exam training are in Czech mostly. <strong>More days can be added if needed by students.<\/strong><\/p>\n<li><strong>5.6.2019<br \/>\nState exam training<\/strong><br \/>\nSven Relovsk\u00fd: <a href=\"https:\/\/is.muni.cz\/auth\/th\/dz52p\/\">Delegated firewall management based on user identities<\/a><br \/>\nVedouc\u00ed: Tom\u00e1\u0161 Rebok<br \/>\nOponent: Sl\u00e1vek Licehammer<\/p>\n<p>Richard Eli\u00e1\u0161: <a href=\"https:\/\/is.muni.cz\/th\/fb6xe\">Rate limiting and traffic shaping<\/a><br \/>\nVeduci: V\u00e1clav P\u0159enosil<br \/>\nOponent: Zden\u011bk Mat\u011bj\n<\/li>\n<p><\/p>\n<li><strong>12.6.2019<br \/>\nState exam training<\/strong><br \/>\nStanislav Mur\u00edn: <a href=\"https:\/\/is.muni.cz\/auth\/th\/loorp\/\">Scheduling of mobile robots using constraint programming<\/a><br \/>\nVedouc\u00ed: Hana Rudov\u00e1<br \/>\nOponent: Ale\u0161 Hor\u00e1k<\/p>\n<p>Luk\u00e1\u0161 Kotol: <a href=\"https:\/\/is.muni.cz\/auth\/th\/him75\/\">Autentiza\u010dn\u00ed a autoriza\u010dn\u00ed infrastruktura pro videokonferen\u010dn\u00ed prost\u0159ed\u00ed<\/a><br \/>\nVedouc\u00ed: Milo\u0161 Li\u0161ka<br \/>\nOponent: Jan R\u016f\u017ei\u010dka\n<\/li>\n<p><\/p>\n<li><strong>19.6.2019<br \/>\nState exam training<\/strong><br \/>\nAneta Morav\u010d\u00edkov\u00e1: <a href=\"https:\/\/is.muni.cz\/auth\/th\/mwrcg\/\">Webov\u00e1 platforma pre Svobodn\u00e9 slovn\u00edky.cz<\/a><br \/>\nVedouc\u00ed: Michal Zima<br \/>\nOponent: Ivan Ne\u010das<\/p>\n<p>Stanislav Sot\u00e1k: <a href=\"https:\/\/is.muni.cz\/auth\/th\/zxrg9\">Implementace Software Defined Network v prost\u0159ed\u00ed mal\u00e9 firmy<\/a><br \/>\nVedouc\u00ed: Eva Hladk\u00e1<br \/>\nOponent: Tom\u00e1\u0161 Rebok<\/p>\n<p>Michal Kl\u00edma: <a href=\"https:\/\/is.muni.cz\/auth\/th\/evim5\/\">Videokonferen\u010dn\u00ed n\u00e1stroj pro tlumo\u010den\u00ed do znakov\u00e9 \u0159e\u010di<\/a><br \/>\nVedouc\u00ed: Eva Hladk\u00e1<br \/>\nOponent: Milo\u0161 Li\u0161ka\n<\/li>\n<p><\/p>\n<li><strong>26.6.2019<\/strong><br \/>\nBc. D\u00e1vid Horov<br \/>\n<strong>Free time in Brno: new smart city application<\/strong> (15 minutes presentation, in Czech)<br \/>\nAbstract: Existing public data available about the Brno city were analyzed. New potential applications using the available public data were considered. A proper presentation of the data related to the theme &#8222;Free time in Brno&#8220; is proposed to follow the concept of smart city. A web application using the selected data is designed and implemented. The current version of the application will be demonstrated. The aim of the presentation is to obtain feedback about its potential extension.<br \/>\n<strong>Discussion about the next SitSem in September<\/strong>\n<\/li>\n<p><\/p>\n<\/ul>\n<p>Contact: <a href=\"http:\/\/www.fi.muni.cz\/~hanka\">Hana Rudov\u00e1<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>This is the programme of the Sitola seminar in spring 2019. Presentations for the current semester are available here. 20.2.2019 RNDr. Petr Ro\u010dkai, Ph.D. Software verification vs security vulnerabilities Abstract: Applications of formal methods (especially automated verification methods) to realistic software is an emerging field with an active research community. Programs written in C are [&hellip;]<\/p>\n","protected":false},"author":42,"featured_media":0,"parent":2896,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"_links":{"self":[{"href":"https:\/\/www.sitola.cz\/wordpress\/wp-json\/wp\/v2\/pages\/3394"}],"collection":[{"href":"https:\/\/www.sitola.cz\/wordpress\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.sitola.cz\/wordpress\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.sitola.cz\/wordpress\/wp-json\/wp\/v2\/users\/42"}],"replies":[{"embeddable":true,"href":"https:\/\/www.sitola.cz\/wordpress\/wp-json\/wp\/v2\/comments?post=3394"}],"version-history":[{"count":2,"href":"https:\/\/www.sitola.cz\/wordpress\/wp-json\/wp\/v2\/pages\/3394\/revisions"}],"predecessor-version":[{"id":3496,"href":"https:\/\/www.sitola.cz\/wordpress\/wp-json\/wp\/v2\/pages\/3394\/revisions\/3496"}],"up":[{"embeddable":true,"href":"https:\/\/www.sitola.cz\/wordpress\/wp-json\/wp\/v2\/pages\/2896"}],"wp:attachment":[{"href":"https:\/\/www.sitola.cz\/wordpress\/wp-json\/wp\/v2\/media?parent=3394"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}