{"id":3610,"date":"2024-04-26T10:47:55","date_gmt":"2024-04-26T08:47:55","guid":{"rendered":"https:\/\/excel.fit.vutbr.cz\/?page_id=3610"},"modified":"2024-04-29T10:29:21","modified_gmt":"2024-04-29T08:29:21","slug":"nejlepsi-prace-historie","status":"publish","type":"page","link":"https:\/\/excel.fit.vutbr.cz\/2024\/nejlepsi-prace-historie\/","title":{"rendered":"Nejlep\u0161\u00ed pr\u00e1ce z historie Excel@FIT"},"content":{"rendered":"\r\n<link rel=\"stylesheet\" media=\"all\" type=\"text\/css\" href=\"\/submissions\/css\/proceedings.css?v20240426\">  \r\n<div class=\"row\">\r\n<div class=\"text-center\" style=\"padding:10px;background:#eee;margin-bottom:20px;\">\r\n<a href=\"sbornik\">Zobrazit sborn\u00edk Excel@FIT 2024<\/a>\r\n<\/div>\t\r\n<\/div>\r\n\r\n\t<div class=\"row\" id=\"submissions\">\r\n\t\t<h2>2023<\/h2>\r\n\r\n\t\t<div class=\"thumbnail topic20\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">23<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal23\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2023\/023\/23_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>Search and Explore: Symbiotic Policy Synthesis in POMDPs<\/h4>\r\n\t\t\t\t<h5>Filip Mac\u00e1k<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2023\/023\/23.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2023\/023\/23_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n\t\t\t<\/div>\t\t\t\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal23\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">23<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">Search and Explore: Symbiotic Policy Synthesis in POMDPs<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>Filip Mac\u00e1k<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>POMDP, FSC, Policy synthesis<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Testov\u00e1n\u00ed, anal\u00fdza a verifikace syst\u00e9m\u016f<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2023\/023\/23_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2023\/023\/23.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2023\/023\/23_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\t\t\r\n\t\t<div class=\"thumbnail topic08\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">21<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal21\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2023\/021\/21_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>Information Fusion for Classification of Network Devices<\/h4>\r\n\t\t\t\t<h5>Ond\u0159ej Sedl\u00e1\u010dek<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2023\/021\/21.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2023\/021\/21_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n\t\t\t<\/div>\t\t\t\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal21\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">21<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">Information Fusion for Classification of Network Devices<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>Ond\u0159ej Sedl\u00e1\u010dek<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Network Monitoring, Information Fusion, Interpretable Classification, Dempster-Shafer Theory<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Hardware a po\u010d\u00edta\u010dov\u00e9 s\u00edt\u011b<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2023\/021\/21_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2023\/021\/21.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2023\/021\/21_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\r\n\t\t<div class=\"thumbnail topic22\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">31<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal31\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2023\/031\/31_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>Multi-Target Multi-Camera Tracking<\/h4>\r\n\t\t\t\t<h5>Dominik Kroupa<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2023\/031\/31.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2023\/031\/31_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><a href=\"https:\/\/youtu.be\/_ya5YV5ei68\"><img src=\"\/submissions\/images\/video-icon.png\" width=\"32\" height=\"32\" alt=\"Video\"><\/a><\/p>\r\n\t\t\t<\/div>\t\t\t\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal31\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">31<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">Multi-Target Multi-Camera Tracking<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>Dominik Kroupa<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>object detection, object tracking, object re-identification, multi-target multi-camera tracking<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Zpracov\u00e1n\u00ed obrazu, zvuku a videa<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2023\/031\/31_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2023\/031\/31.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2023\/031\/31_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><a href=\"https:\/\/youtu.be\/_ya5YV5ei68\"><img src=\"\/submissions\/images\/video-icon.png\" width=\"48\" height=\"48\" alt=\"Video\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\r\n\t\t<div class=\"thumbnail topic17\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">16<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal16\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2023\/016\/16_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>Leveraging Pretrained Models for Automatic Speech Recognition in Psychotherapy Sessions<\/h4>\r\n\t\t\t\t<h5>Alexander Polok<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2023\/016\/16.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2023\/016\/16_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n\t\t\t<\/div>\t\t\t\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal16\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">16<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">Leveraging Pretrained Models for Automatic Speech Recognition in Psychotherapy Sessions<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>Alexander Polok<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>automatic speech recognition , language modeling, self-supervised learning, end-to-end models, psychotherapy session analysis<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Strojov\u00e9 u\u010den\u00ed a neuronov\u00e9 s\u00edt\u011b<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2023\/016\/16_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2023\/016\/16.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2023\/016\/16_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div><div class=\"clearfix\"><\/div>\r\n\r\n\r\n\t\t<h2>2022<\/h2>\r\n\r\n\t\t<div class=\"thumbnail topic14\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">32<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal32\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2022\/032\/32_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>Photometric Stereo Processing for Microscopy<\/h4>\r\n\t\t\t\t<h5>Samuel Repka<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/032\/32.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/032\/32_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n\t\t\t<\/div>\r\n\t\t\t\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal32\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">32<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">Photometric Stereo Processing for Microscopy<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>Samuel Repka<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Photometric stereo, Scanning electron microscope, 4-segment BSE detector<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Zpracov\u00e1n\u00ed dat (obraz, zvuk, text apod.)<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>While scanning electron microscopes (SEM) provide an extraordinary spectrum of information about the specimens, they do not answer a few fundamental questions. How high? How deep? This paper aims to explore possibilities of topography reconstruction of microscopic samples, as well as to attempt to solve the task using tools already available on conventional scanning electron microscopes. The proposed solution uses images from a four-segment backscattered electrons detector as an input to the photometric stereo algorithm. This algorithm exploits the fact, that the brightness of the image point is dependent on the inclination of the sample surface. Reflectance maps are used to estimate the inclination in each pixel, creating a map of normal vectors. The map is then used for topography reconstruction. A novel technique for reflectance map estimation is proposed. This method is applied to tin samples to remove the sample\u2019s atomic number effects. Solution evaluation was not yet performed. The fact that all data are acquired simultaneously allows for fast reconstruction. Usage of already available and widespread tools eliminate a need for specialized equipment such as Atomic Force Microscopes.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2022\/032\/32_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2022\/032\/32.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/032\/32_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\r\n\t\t<div class=\"thumbnail topic11\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">18<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal18\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2022\/018\/18_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>Efficient Complementation of Elevator B\u00fcchi Automata<\/h4>\r\n\t\t\t\t<h5>Barbora \u0160mahl\u00edkov\u00e1<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/018\/18.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/018\/18_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n\t\t\t<\/div>\r\n\t\t\t\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal18\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">18<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">Efficient Complementation of Elevator B\u00fcchi Automata<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>Barbora \u0160mahl\u00edkov\u00e1<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>B\u00fcchi Automata, Elevator Automata, B\u00fcchi Complementation<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Testov\u00e1n\u00ed, anal\u00fdza a verifikace<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>B\u00fcchi automata complementation is an important operation for decision procedures of some logics, proving termination of programs, or model checking of temporal properties. Due to the high space complexity of B\u00fcchi automata complementation, it is necessary to look for some optimizations reducing the size of generated state space for good performance in practice. In this paper, we identify elevator automata, a class of B\u00fcchi automata, which often occurs in practice. Thanks to their specific structure, we are able to reduce the bound on the maximum rank of states in each strongly connected component, which is one of the main causes of a state space blow-up in rank-based complementation. We compare these techniques, implemented as an extension of the tool Ranker, with other state-of-the-art tools and show that with these optimizations, rank-based complementation is competitive to other complementation approaches and can give better results on a large set of benchmarks.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2022\/018\/18_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2022\/018\/18.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/018\/18_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\r\n\t\t<div class=\"thumbnail topic04 topic10\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">2<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal2\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2022\/002\/2_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>Approximation of Sound Propagation by Neural Networks<\/h4>\r\n\t\t\t\t<h5>Son Hai Nguyen<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/002\/2.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/002\/2_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n\t\t\t<\/div>\r\n\t\t\t\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal2\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">2<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">Approximation of Sound Propagation by Neural Networks<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>Son Hai Nguyen<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>neural solver, Helmholtz equation, graph neural network, transcranial ultrasound, PDE<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Modelov\u00e1n\u00ed a simulace<\/span> <span class=\"label label-default\">Robotika a um\u011bl\u00e1 inteligence<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>Neural solvers have been increasingly explored with the aim of replacing computationally expensive conventional numerical methods for solving PDEs. This work focuses on solving the time-independent Helmholtz equation for transcranial ultrasound therapy. Most of the popular methods for modeling physics systems are based on U-net. However, convolutional neural networks require the data to be sampled on a regular grid. In order to try to lift this restriction, we propose an iterative solver based on graph neural networks. Unlike Physics-informed neural networks, our model needs to be trained only once, and only a forward pass is required to obtain a new solution given input parameters. The model is trained using supervised learning, where the reference results are computed using the traditional solver k-Wave. Our results show the model\u2019s unroll stability despite being trained with only 8 unroll iterations. Despite the model being trained on the data with a single source, it can predict wavefields with multiple sources and generalize to much larger computational domains. Our model can produce a prediction for sub-pixel points with higher accuracy than linear interpolation.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2022\/002\/2_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2022\/002\/2.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/002\/2_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\r\n\t\t<div class=\"thumbnail topic02\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">25<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal25\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2022\/025\/25_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>Identifikace proteinov\u00fdch tunel\u016f s vyu\u017eit\u00edm molekul\u00e1rn\u00edch dynamik<\/h4>\r\n\t\t\t\t<h5>Petr Kohout<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/025\/25.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/025\/25_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n\t\t\t<\/div>\r\n\t\t\t\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal25\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">25<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">Identifikace proteinov\u00fdch tunel\u016f s vyu\u017eit\u00edm molekul\u00e1rn\u00edch dynamik<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>Petr Kohout<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>bioinformatika, proteinove\u0301 inz\u030ceny\u0301rstv\u0131\u0301, molekula\u0301rn\u0131\u0301 dynamika, tunely, dokova\u0301n\u0131\u0301<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Bioinformatika<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>Tato pra\u0301ce se zaby\u0301va\u0301 analy\u0301zou proteinovy\u0301ch struktur. C\u00edlem je vytvo\u0159it Caver Web 2.0 - novou verzi webov\u00e9 aplikace, kter\u00e1 za\u010dlen\u00ed dal\u0161\u00ed v\u011bdeck\u00e9 n\u00e1stroje a u\u017eivatel\u016fm umo\u017en\u00ed proj\u00edt komplikovan\u00fd pracovn\u00ed protokol za poskytnut\u00ed relevantn\u00edch v\u00fdsledk\u016f bez nutnosti hlub\u0161\u00ed znalosti integrovan\u00fdch n\u00e1stroj\u016f. Vs\u030ce bude zprostr\u030cedkova\u0301no prostr\u030cednictv\u0131\u0301m jednoduche\u0301ho a interaktivn\u0131\u0301ho uz\u030civatelske\u0301ho rozhran\u0131\u0301. Aplikace rozs\u030cir\u030cuje pu\u030avodn\u0131\u0301 aplikaci Caver Web 1.0 o nove\u0301 vlastnosti. Caver Web 1.0 je webovy\u0301 server vhodny\u0301 pro identifikaci proteinovy\u0301ch tunelu\u030a a kana\u0301lu\u030a, pro ktere\u0301 umoz\u030cn\u030cuje spustit analy\u0301zy transportu ligandu\u030a. Program se vyznac\u030cuje intuitivn\u0131\u0301m a uz\u030civatelsky pr\u030c\u0131\u0301ve\u030ctivy\u0301m rozhran\u0131\u0301m s minimem poz\u030cadovany\u0301ch vstupu\u030a od uz\u030civatele. Server je vhodny\u0301 i pro vy\u0301zkumn\u0131\u0301ky bez pokroc\u030cily\u0301ch bioinformaticky\u0301ch nebo technicky\u0301ch znalost\u0131\u0301. Jeho souc\u030casna\u0301 verze je ve ve\u030cdecke\u0301 komunite\u030c dobr\u030ce zavedena\u0301 a velmi vyuz\u030c\u0131\u0301vana\u0301 (35 000 dokonc\u030ceny\u0301ch vy\u0301poc\u030ctu\u030a be\u030chem dvou let provozu). Nejvy\u0301znamne\u030cjs\u030c\u0131\u0301m omezen\u0131\u0301m souc\u030casne\u0301 verze je moz\u030cnost analyzovat pouze statickou strukturu, coz\u030c c\u030casto poskytuje neu\u0301plny\u0301 biologicky\u0301 obraz. Proto jsme se rozhodli na\u0301stroj rozs\u030c\u0131\u0301r\u030cit o vy\u0301poc\u030cet molekula\u0301rn\u0131\u0301ch dynamik, ktere\u0301 poskytnou uceleny\u0301 obraz na prome\u030cny proteinovy\u0301ch struktur. Touto funkc\u0131\u0301 se Caver Web 2.0 stane prvn\u0131\u0301m webovy\u0301m na\u0301strojem, ktery\u0301 bude poskytovat analy\u0301zu tunelu\u030a bez nutnosti ruc\u030cn\u0131\u0301ch vy\u0301poc\u030ctu\u030a molekula\u0301rn\u0131\u0301ch dynamik. Graficke\u0301 uz\u030civatelske\u0301 rozhran\u0131\u0301 bude navrz\u030ceno specia\u0301lne\u030c pro ve\u030cdeckou komunitu s podporou jednoduche\u0301ho exportu. Na\u0301stroj bude zdarma k dispozici cele\u0301 ve\u030cdecke\u0301 komunite\u030c.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2022\/025\/25_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2022\/025\/25.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/025\/25_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div><div class=\"clearfix\"><\/div>\r\n\r\n\r\n\t\t<h2>2021<\/h2>\r\n\r\n\t\t<div class=\"thumbnail topic09\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">1<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal1\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2021\/001\/1_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>Warehouse Manager: N\u00e1stroj pro pokro\u010dilou simulaci a optimalizaci skladov\u00fdch operac\u00ed<\/h4>\r\n\t\t\t\t<h5>Filip Ko\u010dica<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2021\/001\/1.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><\/p>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal1\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">1<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">Warehouse Manager: N\u00e1stroj pro pokro\u010dilou simulaci a optimalizaci skladov\u00fdch operac\u00ed<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>Filip Ko\u010dica<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>sklad, optimalizace, simulace, gener\u00e1tor, objedn\u00e1vka, produkt, pickov\u00e1n\u00ed, evoluce<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Robotika a um\u011bl\u00e1 inteligence<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>Tato pr\u00e1ce \u0159e\u0161\u00ed problematiku alokace produkt\u016f do lokac\u00ed ve skladu za pomoci modern\u00edch meta-heuristick\u00fdch p\u0159\u00edstup\u016f v kombinaci s realistickou simulac\u00ed skladu. Pr\u00e1ce poskytuje grafick\u00fd n\u00e1stroj umo\u017e\u0148uj\u00edc\u00ed sestaven\u00ed modelu skladu, generov\u00e1n\u00ed syntetick\u00fdch z\u00e1kaznick\u00fdch objedn\u00e1vek, optimalizaci alokace produkt\u016f za pomoci kombinace state of the art technik, simul\u00e1tor vytvo\u0159en\u00e9ho modelu skladu a nakonec n\u00e1stroj pro hled\u00e1n\u00ed nejkrat\u0161\u00ed cesty objedn\u00e1vky skrze sklad. Pr\u00e1ce tak\u00e9 uv\u00e1d\u00ed porovn\u00e1n\u00ed r\u016fzn\u00fdch p\u0159\u00edstup\u016f a experimenty s vytvo\u0159en\u00fdmi n\u00e1stroji. Poda\u0159ilo se optimalizovat propustnost experiment\u00e1ln\u00edho skladu na t\u00e9m\u011b\u0159 dvojn\u00e1sobek (~57%). P\u0159\u00ednosem t\u00e9to pr\u00e1ce je mo\u017enost vytvo\u0159en\u00ed modelu pl\u00e1novan\u00e9ho \u010di ji\u017e existuj\u00edc\u00edho skladu a jeho simulace i optimalizace, co\u017e m\u016f\u017ee zna\u010dn\u011b zv\u00fd\u0161it propustnost skladu a pomoci detekovat a odstranit vyt\u00ed\u017een\u00e1 m\u00edsta. To m\u016f\u017ee v\u00e9st k u\u0161et\u0159en\u00ed zdroj\u016f \u010di pom\u00e1hat v pl\u00e1nov\u00e1n\u00ed. D\u00e1le tato pr\u00e1ce p\u0159in\u00e1\u0161\u00ed nov\u00fd zp\u016fsob optimalizace skladu a nov\u00e9 optimaliza\u010dn\u00ed krit\u00e9rium.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2021\/001\/1_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2021\/001\/1.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\r\n\t\t<div class=\"thumbnail topic13\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">44<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal44\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2021\/044\/44_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>Innovating Sports Shooting With Computer Vision<\/h4>\r\n\t\t\t\t<h5>Jana Gregorov\u00e1<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2021\/044\/44.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><\/p>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal44\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">44<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">Innovating Sports Shooting With Computer Vision<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>Jana Gregorov\u00e1<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Automatic Score Evaluation for Bullseye Shooting, Computer Vision in Sports Shooting, Background Subtraction, Template Matching, Image Stabilization, Cross-correlation of Two 2D Arrays<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Zpracov\u00e1n\u00ed dat (obraz, zvuk, text apod.)<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>Bullseye shooting is a shooting sports discipline where the shooter is standing in one place and shooting at a static paper target.  The shooter\u2019s goal is to land as many hits in the centre of the target as possible. The distance between the shooter and the target usually ranges from 10 m to 300 m. That way, while shooting, the shooter is unable to see where exactly their hits land unless some kind of auxiliary equipment is used. To calculate the score, all shooting needs to be stopped as the shooter walks right into the field to see their target up close. For a new round, the shooter either has to change the target for a new one or cover target hits up with cover up patches. The goal of this work is to find a solution to calculate shooter\u2019s score automatically. One of the possible approaches to this problem is taking a video of the target and processing it, so that new hits in the target can be detected and their score calculated. The resulting image will then be shown to the shooter on a screen near them.  The result of this paper is a commercial distribution-ready solution both for individual shooters and commercial shooting ranges. The solution consists of a camera setup and an application which displays the video from camera and evaluates the shooter\u2019s score using computer vision. The solution brings significant improvements in terms of shooter\u2019s comfort and bullseye shooting training effectiveness. It is an innovative equipment not only for skilled shooters, but also for beginner shooters.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2021\/044\/44_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2021\/044\/44.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\r\n\t\t<div class=\"thumbnail topic03 topic07\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">29<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal29\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2021\/029\/29_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>Modeling of Enhanced Interior Gateway Routing Protocol<\/h4>\r\n\t\t\t\t<h5>Jan Zav\u0159el<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2021\/029\/29.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><\/p>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal29\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">29<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">Modeling of Enhanced Interior Gateway Routing Protocol<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>Jan Zav\u0159el<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>EIGRP, Simulation, Routing, OMNeT++<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Modelov\u00e1n\u00ed a simulace<\/span> <span class=\"label label-default\">Po\u010d\u00edta\u010dov\u00e9 s\u00edt\u011b<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>This paper deals with the implementation and the evaluation of a simulation model of a modern dynamic routing protocol designed by Cisco Systems, Inc. called Enhanced Interior Gateway Routing Protocol (EIGRP) in a discrete simulator OMNeT++ implemented in C++. The resulting simulation model can be used to conduct various experiments which allow network designers and alike to explore the protocol's behavior in different situations inside a safe discrete environment. In order to produce a trustworthy simulation course, the protocol model must be as accurate as possible to the real implementation and thoroughly tested. This paper provides a basic overview of both protocol EIGRP and simulator OMNeT++. It also discusses the state of the model before and after the integration into a newer version of the INET framework, showcases improvements, and outlines the testing methodology.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2021\/029\/29_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2021\/029\/29.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\r\n\t\t<div class=\"thumbnail topic10\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">49<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal49\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2021\/049\/49_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>PAYNT: Towards Powerful Automated Synthesis of Probabilistic Programs<\/h4>\r\n\t\t\t\t<h5>\u0160imon Stupinsk\u00fd<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2021\/049\/49.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><\/p>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal49\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">49<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">PAYNT: Towards Powerful Automated Synthesis of Probabilistic Programs<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>\u0160imon Stupinsk\u00fd<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>automated synthesis, probabilistic programs, Markov models, model checking<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Testov\u00e1n\u00ed, anal\u00fdza a verifikace<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>Probabilistic programs play a key role in various engineering domains, including computer networks, embedded systems, power management policies, or software product lines. This paper presents PAYNT, a tool for the automatic synthesis of probabilistic programs satisfying the given specification. It supports the synthesis of finite-state probabilistic programs representing a finite family of candidate programs. PAYNT provides a novel integrated approach for probabilistic synthesis developed on the principles of abstraction refinement (AR) and counterexample-guided inductive synthesis (CEGIS) methods. PAYNT is able to efficiently synthesise the topology of the program as well as continuous parameters affecting the transition probabilities \u2013 this is a unique feature. Existing tools for topology synthesis implement only naive approaches and thus typically do not scale to practically relevant synthesis problems. Tools leveraging search-based techniques can handle both synthesis problems, but they do not ensure the complete exploration of the design space. For challenging synthesis problems, PAYNT is able to significantly decreases the run-time from days to minutes while ensuring the completeness of the synthesis process. We demonstrate the usefulness and performance of PAYNT on a wide range of benchmarks from different application domains. Our tool paper presenting PAYNT has been recently accepted at CAV\u201921, an A* conference.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2021\/049\/49_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2021\/049\/49.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\r\n\r\n\t\t<h2>2020<\/h2>\r\n\r\n\t\t<div class=\"thumbnail topic10\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">20<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal20\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2020\/020\/20_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>Detekce paraleln\u00edch chyb ve v\u00edceprocesov\u00fdch programech<\/h4>\r\n\t\t\t\t<h5>Monika Mu\u017eikovsk\u00e1<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2020\/020\/20.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2020\/020\/20_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal20\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">20<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">Detekce paraleln\u00edch chyb ve v\u00edceprocesov\u00fdch programech<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>Monika Mu\u017eikovsk\u00e1<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>ANaConDA, Dynamick\u00e1 anal\u00fdza, Paraleln\u00ed chyby, V\u00edceprocesov\u00e9 programy<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Testov\u00e1n\u00ed, anal\u00fdza a verifikace<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>Dynamick\u00e1 anal\u00fdza se s \u00fasp\u011bchem vyu\u017e\u00edv\u00e1 pro detekci chyb ve v\u00edcevl\u00e1knov\u00fdch programech. Algoritmy, kter\u00e9 byly za t\u00edmto \u00fa\u010delem navr\u017eeny, jsou ale \u010dasto vyu\u017eiteln\u00e9 i pro v\u00edceprocesov\u00e9 programy. \u017d\u00e1dn\u00fd ze zn\u00e1m\u00fdch n\u00e1stroj\u016f pro dynamickou anal\u00fdzu ale monitorov\u00e1n\u00ed proces\u016f nepodporuje. C\u00edlem t\u00e9to pr\u00e1ce bylo roz\u0161\u00ed\u0159it n\u00e1stroj ANaConDA o anal\u00fdzu a monitorov\u00e1n\u00ed v\u00edceprocesov\u00fdch program\u016f. V\u00fdsledkem je implementace roz\u0161\u00ed\u0159en\u00ed, kter\u00e9 za v\u00fdvoj\u00e1\u0159e analyz\u00e1tor\u016f \u0159e\u0161\u00ed probl\u00e9my spojen\u00e9 s odd\u011blen\u00fdmi adresov\u00fdmi prostory a synchronizac\u00ed pomoc\u00ed semafor\u016f. Roz\u0161\u00ed\u0159en\u00ed bylo vyu\u017eito pro \u00fapravu analyz\u00e1toru AtomRace pro detekci \u010dasov\u011b z\u00e1visl\u00fdch chyb nad daty ve v\u00edceprocesov\u00fdch programech a pou\u017eito na experimenty se studentsk\u00fdmi projekty z p\u0159edm\u011btu Opera\u010dn\u00ed syst\u00e9my. V\u00fdsledky experiment\u016f uk\u00e1zaly, \u017ee se n\u00e1stroj ANaConDA m\u016f\u017ee st\u00e1t v\u00edtan\u00fdm pomocn\u00edkem p\u0159i implementaci nejen v\u00edceprocesov\u00fdch projekt\u016f.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2020\/020\/20_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2020\/020\/20.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2020\/020\/20_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\r\n\t\t<div class=\"thumbnail topic09\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">26<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal26\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2020\/026\/26_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>Evolu\u010dn\u00ed n\u00e1vrh konvolu\u010dn\u00edch neuronov\u00fdch s\u00edt\u00ed<\/h4>\r\n\t\t\t\t<h5>Michal Pi\u0148os<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2020\/026\/26.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2020\/026\/26_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal26\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">26<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">Evolu\u010dn\u00ed n\u00e1vrh konvolu\u010dn\u00edch neuronov\u00fdch s\u00edt\u00ed<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>Michal Pi\u0148os<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Neuroevoluce, Neuronov\u00e9 s\u00edt\u011b, Evolu\u010dn\u00ed v\u00fdpo\u010detn\u00ed techniky<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Robotika a um\u011bl\u00e1 inteligence<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>C\u0131\u0301lem t\u00e9to pr\u00e1ce je n\u00e1vrh a implementace programu pro automatizovan\u00fd n\u00e1vrh konvolu\u010dn\u0131\u0301ch neuronov\u00fdch s\u0131\u0301t\u0131\u0301 (CNN) s vyu\u017eit\u0131\u0301m evolu\u010dn\u0131\u0301ch v\u00fdpo\u010detn\u0131\u0301ch technik. Z praktick\u00e9ho hlediska tento p\u0159\u0131\u0301stup redukuje pot\u0159ebu lidsk\u00e9ho faktoru p\u0159i tvorb\u011b CNN, a tak eliminuje zdlouhav\u00fd a nam\u00e1hav\u00fd proces n\u00e1vrhu. Tato pr\u00e1ce vyu\u017e\u0131\u0301v\u00e1 speci\u00e1ln\u0131\u0301 formu genetick\u00e9ho programov\u00e1n\u0131\u0301 naz\u00fdvanou kart\u00e9zsk\u00e9 genetick\u00e9 programov\u00e1n\u0131\u0301, kter\u00e9 pro zak\u00f3dov\u00e1n\u0131\u0301 \u0159e\u0161en\u00e9ho probl\u00e9mu vyu\u017e\u0131\u0301v\u00e1 grafovou reprezentaci. Tato technika umo\u017e\u0148uje u\u017eivateli parametrizovat proces hled\u00e1n\u0131\u0301 CNN, a tak se zam\u011b\u0159it na architektury zaj\u0131\u0301mav\u00e9 z pohledu pou\u017eit\u00fdch v\u00fdpo\u010detn\u0131\u0301ch jednotek, p\u0159esnosti \u010di po\u010dtu parametr\u016f. Navrhovan\u00fd p\u0159\u0131\u0301stup byl otestov\u00e1n na standardizovan\u00e9 datov\u00e9 sad\u011b CIFAR-10, kter\u00e1 je \u010dasto vyu\u017e\u0131\u0301v\u00e1na v\u00fdzkumn\u0131\u0301ky pro srovn\u00e1n\u0131\u0301 v\u00fdkonnosti jejich CNN. Prvotn\u0131\u0301 experimenty uk\u00e1zaly, \u017ee vytvo\u0159en\u00e1 implementace (vyu\u017e\u0131\u0301vaj\u0131\u0301c\u0131\u0301 GPU akceleraci) je schopna vytvo\u0159it \u010di vylep\u0161it p\u0159esnost CNN. V\u00fdsledkem experiment\u016f, kdy bylo pro tr\u00e9nov\u00e1n\u0131\u0301 k dispozici pouze n\u011bkolik epoch, byla \u0159e\u0161en\u0131\u0301 s p\u0159esnost\u0131\u0301 64.5 % a po\u010dtem parametr\u016f 146K p\u0159i vyu\u017eit\u0131\u0301 z\u00e1kladn\u0131\u0301ch vrstev a \u0159e\u0161en\u0131\u0301 s p\u0159esnost\u0131\u0301 74.5 % s po\u010dtem parametr\u016f 475K p\u0159i vyu\u017eit\u0131\u0301 rezidu\u00e1ln\u0131\u0301ch vrstev. Z\u00e1m\u011brem t\u011bchto experiment\u016f bylo dok\u00e1zat funk\u010dnost implementovan\u00e9ho programu a proof-of-concept navr\u017een\u00e9 metody.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2020\/026\/26_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2020\/026\/26.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2020\/026\/26_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\r\n\t\t<div class=\"thumbnail topic09 topic13\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">29<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal29\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2020\/029\/29_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>Improving robustness of neural networks against adversarial examples<\/h4>\r\n\t\t\t\t<h5>Martin Ga\u0148o<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2020\/029\/29.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2020\/029\/29_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal29\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">29<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">Improving robustness of neural networks against adversarial examples<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>Martin Ga\u0148o<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Neural networks, Optimization, Machine learning<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Robotika a um\u011bl\u00e1 inteligence<\/span> <span class=\"label label-default\">Zpracov\u00e1n\u00ed dat (obraz, zvuk, text apod.)<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>The main goal of this work is to design and implement the framework that yields robust neural network model against whatever adversarial attack, while result models accuracy is not signi\ufb01cantly lower comparing to naturally trained model. Our approach is to minimize maximization the loss function of the target model. Related work and our experiments lead us to the usage of Projected gradient descent method as a reference attack, therefore, we train against data generated by PGD. As a result, using the framework we can reach accuracy more than 90% against sophisticated adversarial attacks on MNIST dataset. The greatest contribution of this work is an implementation of adversarial attacks and defences against them because there misses any public implementation.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2020\/029\/29_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2020\/029\/29.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2020\/029\/29_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div><div class=\"clearfix\"><\/div>\r\n\r\n\t\t<h2>2019<\/h2>\r\n\r\n\t\t<div class=\"thumbnail topic14\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">21<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal21\" rel=\"noopener noreferrer\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2019\/021\/21_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>4D-DCT Based Light Field Image Compression<\/h4>\r\n\t\t\t\t<h5>Drahom\u00edr Dlabaja<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2019\/021\/21.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2019\/021\/21_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal21\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">21<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">4D-DCT Based Light Field Image Compression<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>Drahom\u00edr Dlabaja<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Light field, Lossy compression, JPEG, Transform coding, Plenoptic representation, Quality assessment<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Zpracov\u00e1n\u00ed dat (obraz, zvuk, text apod.)<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>This paper proposes a light field image encoding solution based on four-dimensional discrete cosine transform and quantization. The solution is an extension to JPEG baseline compression. A light field image is interpreted and encoded as a four-dimensional volume to exploit both intra and inter view correlation. Solutions to 4D quantization and block traversal are introduced in this paper. The experiments compare the performance of the proposed solution against the compression of individual image views with JPEG and HEVC intra in terms of PSNR. Obtained results show that the proposed solution outperforms the reference encoders for light images with a low average disparity between views, therefore is suitable for images taken by lenslet based light field camera and images synthetically generated.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2019\/021\/21_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2019\/021\/21.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2019\/021\/21_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\r\n\t\t<div class=\"thumbnail topic11\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">59<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal59\" rel=\"noopener noreferrer\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2019\/059\/59_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>Scalable Static Analysis Using Facebook Infer<\/h4>\r\n\t\t\t\t<h5>Dominik Harmim, Vladim\u00edr Marcin, Ond\u0159ej Pavela<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2019\/059\/59.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2019\/059\/59_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal59\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">59<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">Scalable Static Analysis Using Facebook Infer<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>Dominik Harmim, Vladim\u00edr Marcin, Ond\u0159ej Pavela<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Facebook Infer, Static Analysis, Abstract Interpretation, Atomicity Violation, Concurrent Programs, Performance, Worst-Case Cost, Deadlock<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Testov\u00e1n\u00ed, anal\u00fdza a verifikace<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>Static analysis has nowadays become one of the most popular ways of catching bugs early in the modern software. However, reasonably precise static analyses do still often  have problems with scaling to larger codebases. And efficient static analysers, such as Coverity or Code Sonar, are often proprietary and difficult to openly evaluate or extend. Facebook Infer offers a static analysis framework that is open source, extendable, and promoting efficient modular and incremental analysis. In this work, we propose three inter-procedural analysers extending the capabilities of Facebook Infer: Looper (a resource bounds analyser), L2D2 (a low-level deadlock detector), and Atomer (an atomicity violation analyser). We evaluated our analysers on both smaller hand-crafted examples as well as publicly available benchmarks derived from real-life  low-level programs and obtained encouraging results. In particular, L2D2 attained  100 % detection rate and 11 % false positive rate on an extensive benchmark of hundreds of functions and millions of lines of code.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2019\/059\/59_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2019\/059\/59.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2019\/059\/59_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\r\n\t\t<div class=\"thumbnail topic14\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">54<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal54\" rel=\"noopener noreferrer\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2019\/054\/54_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>Exploring contextual information in neural machine translation<\/h4>\r\n\t\t\t\t<h5>Josef Jon<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2019\/054\/54.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2019\/054\/54_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal54\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">54<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">Exploring contextual information in neural machine translation<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>Josef Jon<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>neural machine translation, context, transformer, document level translation<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Zpracov\u00e1n\u00ed dat (obraz, zvuk, text apod.)<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>This works explores means of utilizing extra-sentential context in neural machine translation (NMT). Traditionally, NMT systems translate one source sentence to one target sentence without any notion of surrounding text. This is clearly insufficient and different from how humans translate text. For many high resource language pairs, NMT systems output is nowadays indistinguishable from human translations under certain (strict) conditions. One of the conditions is that evaluators see the sentences separately. When evaluating whole documents, even the best NMT systems still fall short of human translations. This motivates the research of employing document context in NMT, since there might not be much more space left to improve translations on sentence level, at least for high resource languages and domains. This work sumarizes recent state-of-the art approaches, implements them, evaluates them both in terms of general translation quality and on specific context related phenomena and analyzes their shortcomings. Additionaly, context phenomena test set for English to Czech translation was created to enable further comparison and analysis.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2019\/054\/54_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2019\/054\/54.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2019\/054\/54_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div><div class=\"clearfix\"><\/div>\r\n\r\n\t\t<h2>2018<\/h2>\r\n\r\n\t\t<div class=\"thumbnail topic10\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">16<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal16\" rel=\"noopener noreferrer\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2018\/016\/16_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>Towards the detection of performance degradation<\/h4>\r\n\t\t\t\t<h5>Ji\u0159\u00ed Pavela, \u0160imon Stupinsk\u00fd<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2018\/016\/16.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2018\/016\/16_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal16\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">16<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">Towards the detection of performance degradation<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>Ji\u0159\u00ed Pavela, \u0160imon Stupinsk\u00fd<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Performance, Continuous integration, Automated degradation detection, Difference analysis, Clusterization, Regression analysis<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Testov\u00e1n\u00ed, anal\u00fdza a verifikace<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>Current tools for project performance analysis focus mostly on detecting selected performance bugs in the source code. Although being useful, results of such tools cannot provide evaluation of project\u2019s overall performance which is often crucial for development of large applications. Building on our previous works, we aim to provide a solution to a long term monitoring of performance changes using the tool chain of performance data collection, regression analysis, and subsequent automated detection of performance changes performed. We evaluated our solution on series of arti\ufb01cial examples and we were able to detect about 85% of performance changes across different performance models and errors, and estimate their severity (e.g. constant, linear, etc). The proposed solution allows user to deploy new method of code review\u2014possibly integrated into continuous integration\u2014and reveal performance changes introduced by new versions of code in early development.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2018\/016\/16_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2018\/016\/16.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2018\/016\/16_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\r\n\t\t<div class=\"thumbnail topic02\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">39<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal39\" rel=\"noopener noreferrer\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2018\/039\/39_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>Pod\u0161trukt\u00farne vyh\u013ead\u00e1vanie v datab\u00e1zach chemick\u00fdch l\u00e1tok<\/h4>\r\n\t\t\t\t<h5>Ivan \u0160ev\u010d\u00edk<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2018\/039\/39.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2018\/039\/39_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal39\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">39<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">Pod\u0161trukt\u00farne vyh\u013ead\u00e1vanie v datab\u00e1zach chemick\u00fdch l\u00e1tok<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>Ivan \u0160ev\u010d\u00edk<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Datab\u00e1za, Vyh\u013ead\u00e1vanie vzorov, Grafov\u00fd izomorfizmus<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Datab\u00e1ze a data-mining<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>V tomto \u010dl\u00e1nku je predstaven\u00fd sp\u00f4sob, pomocou ktor\u00e9ho je mo\u017en\u00e9 vyh\u013ead\u00e1va\u0165 zadan\u00fd vzor ako pod\u0161trukt\u00faru v datab\u00e1zach chemick\u00fdch l\u00e1tok obsahuj\u00facich desiatky mili\u00f3nov z\u00e1znamov. Jedn\u00e1 sa o v\u00fdpo\u010detne n\u00e1ro\u010dn\u00fd probl\u00e9m, ktor\u00fd je potrebn\u00e9 rie\u0161i\u0165 na nieko\u013ek\u00fdch \u00farovniach. Met\u00f3da prezentovan\u00e1 v tomto \u010dl\u00e1nku vyu\u017e\u00edva kombin\u00e1ciu topologick\u00fdch indexov, tzv. molekul\u00e1rnych odtla\u010dkov, a r\u00fdchleho algoritmu pre h\u013eadanie izomorfn\u00e9ho podgrafu. Pr\u00e1ca porovn\u00e1va nieko\u013eko algoritmov, ako aj sp\u00f4sobov ulo\u017eenia molek\u00fal v syst\u00e9me. Najlep\u0161\u00edm rie\u0161en\u00edm sa uk\u00e1zalo by\u0165 pou\u017eitie algoritmu zvan\u00e9ho RI v kombin\u00e1cii s ulo\u017een\u00edm serializovan\u00fdch d\u00e1t do datab\u00e1zy MongoDB. Rie\u0161enie umo\u017e\u0148uje u\u017e\u00edvate\u013eom vyh\u013ead\u00e1va\u0165 v datab\u00e1zach v re\u00e1lnom \u010dase, do nieko\u013ek\u00fdch sek\u00fand. Cie\u013eom tohto \u010dl\u00e1nku je obozn\u00e1mi\u0165 \u010ditate\u013ea s problematikou vyh\u013ead\u00e1vania v chemick\u00fdch datab\u00e1zach a ako je mo\u017en\u00e9 vytvori\u0165 tak\u00fdto syst\u00e9m pre vyh\u013ead\u00e1vanie s oh\u013eadom na s\u00fa\u010dasn\u00fd v\u00fdskum. V\u00fdsledky a my\u0161lienky pr\u00e1ce by mohli by\u0165 vyu\u017eit\u00e9 v pr\u00edbuzn\u00fdch oblastiach vy\u017eaduj\u00facich vyh\u013ead\u00e1vanie vzorov v datab\u00e1zach, ako je napr\u00edklad po\u010d\u00edta\u010dov\u00e9 videnie.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2018\/039\/39_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2018\/039\/39.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2018\/039\/39_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\r\n\t\t<div class=\"thumbnail topic06\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">12<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal12\" rel=\"noopener noreferrer\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2018\/012\/12_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>High-speed DMA packet transfer in system DPDK<\/h4>\r\n\t\t\t\t<h5>Jan Kub\u00e1lek<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2018\/012\/12.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2018\/012\/12_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal12\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">12<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">High-speed DMA packet transfer in system DPDK<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>Jan Kub\u00e1lek<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>DMA, DPDK, FPGA, PCI-Express<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Po\u010d\u00edta\u010dov\u00e1 architektura a vestav\u011bn\u00e9 syst\u00e9my<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>Devices in computer networks, which are used for network management, require a high-speed processing of a large amounts of data for analysis.  For a device to enable the monitoring of a network with high data traffic, its network interface card needs to be capable of transferring received data to RAM at sufficient speed.   My project deals with the design,  implementation, and testing of a new module for an FPGA chip on a network interface card, which will carry out these transfers. The design aims to achieve a high throughput of up to 200 Gb\/s for the transfer of packets from the FPGA chip to a computer memory via a PCI-Express bus. For faster packet processing, in software system DPDK is used for data transfer control. This paper contains a short introduction to technologies used in the project and the summary of the resulting module design. Performace testing has shown that the module can achieve the target throughput of 200 Gb\/s, but also revealed possible ways for further improvements.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2018\/012\/12_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2018\/012\/12.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2018\/012\/12_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div><div class=\"clearfix\"><\/div>\r\n\r\n\t\t<h2>2017<\/h2>\r\n\r\n\t\t<div class=\"thumbnail topic23\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">53<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal53\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2017\/053\/53_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>Verifiability-driven synthesis of approximate arithmetic circuits using Cartesian GP<\/h4>\r\n\t\t\t\t<h5>Jiri Matyas, Milan Ceska, Vojtech Mrazek<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2017\/053\/53.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2017\/053\/53_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal53\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">53<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">Verifiability-driven synthesis of approximate arithmetic circuits using Cartesian GP<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>Jiri Matyas, Milan Ceska, Vojtech Mrazek<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Approximate computing, approximate arithmetic circuits, Cartesian genetic programming, SAT based fitness function evaluation, relaxed equivalence checking<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Nekonven\u010dn\u00ed v\u00fdpo\u010detn\u00ed techniky<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>We present a novel method allowing one to approximate complex arithmetic circuits with formal guarantees on the approximation error. The method integrates in a unique way formal techniques employed for approximate equivalence checking into a search-based circuit optimisation algorithm (Cartesian Genetic Programming). The key idea of our approach is to employ a novel search strategy that drives the search towards promptly verifiable approximate circuits. The method was implemented within the ABC tool and evaluated on functional approximation of multipliers (with up to 32-bit operands) and adders (with up to 128-bit operands). Within a few hours, we constructed a high-quality Pareto set of 32-bit multipliers providing trade-offs between the circuit error and size. This is for the first time when such complex approximate circuits with formal error bounds have been presented, which demonstrates an outstanding performance and scalability of our approach compared with the existing methods that have either been applied to synthesis of 8-bit multipliers or a statistical testing has been used only. Our approach thus significantly improves capabilities of existing methods and paves a~way towards an automated design process of provably-correct circuit approximations.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2017\/053\/53_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2017\/053\/53.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2017\/053\/53_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\r\n\t\t<div class=\"thumbnail topic10 topic18\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">12<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal12\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2017\/012\/12_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>GrooveSpired - Application for Drums Training with Beat Recognition<\/h4>\r\n\t\t\t\t<h5>Tom\u00e1\u0161 \u0160trba<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2017\/012\/12.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2017\/012\/12_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><a href=\"https:\/\/youtu.be\/FPjqo-8Xw0M\"><img src=\"\/submissions\/images\/video-icon.png\" width=\"32\" height=\"32\" alt=\"Video\"><\/a><\/p>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal12\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">12<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">GrooveSpired - Application for Drums Training with Beat Recognition<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>Tom\u00e1\u0161 \u0160trba<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>mobile application, iOS, drum beats recognition, discrete wavelet transform, audio analysis, drum training, GrooveSpired<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Zpracov\u00e1n\u00ed zvuku<\/span> <span class=\"label label-default\">U\u017eivatelsk\u00e1 rozhran\u00ed<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>The main goal is implementation of mobile application for drums training. The application must be capable to analyze and evaluate drumming skills of a drummer using drum beats recognition of recorded audio. Other features of the application are displaying drum notation of different grooves from various music styles and playing audio examples of those grooves. For time-frequency analysis discrete wavelet transform is used in this paper. Results show a true positive rate above 96\\% with reasonable time tolerance in the onset detection.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2017\/012\/12_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2017\/012\/12.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2017\/012\/12_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><a href=\"https:\/\/youtu.be\/FPjqo-8Xw0M\"><img src=\"\/submissions\/images\/video-icon.png\" width=\"48\" height=\"48\" alt=\"Video\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\r\n\t\t<div class=\"thumbnail topic10\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">24<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal24\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2017\/024\/24_nahled.png\" alt=\"\"><\/a>\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>Microphone Arrays for Speaker Recognition<\/h4>\r\n\t\t\t\t<h5>Ladislav Mo\u0161ner<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2017\/024\/24.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2017\/024\/24_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal24\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">24<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">Microphone Arrays for Speaker Recognition<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\r\n\t\t\t\t\t\t\t\t<p><strong>Ladislav Mo\u0161ner<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Speaker recognition, Microphone arrays, Beamforming, Room impulse response<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Zpracov\u00e1n\u00ed zvuku<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>This paper addresses the problem of remote speaker recognition (SRE). Nowadays, systems working with signals from close-talking microphones yield very good results. However, in the case of remotely obtained data, their accuracy decreases considerably. Therefore, we explore the applicability of microphone arrays for recovery from errors of SRE system introduced by the room reverberation, where microphone arrays are purposely positioned set of microphones. We discuss two approaches which are both based on microphone arrays -- beamforming (delay-and-sum) for enhancement of the input signals and the retraining of the SRE system components with the beamformed data. By the combination of both techniques, we have achieved significant improvement of accuracy in comparison with the results obtained with the single-microphone recordings.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2017\/024\/24_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2017\/024\/24.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2017\/024\/24_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div><div class=\"clearfix\"><\/div>\r\n\r\n\t\t<h2>2016<\/h2>\r\n\r\n\t\t<div class=\"thumbnail topic10 topic26\"> \r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">48<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal48\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2016\/048\/48_nahled.png\" alt=\"\"><\/a>\t\t\t\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>Far-field speech recognition<\/h4>        \r\n\t\t\t\t<h5>Kate\u0159ina \u017dmol\u00edkov\u00e1<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2016\/048\/48.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2016\/048\/48_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n\t\t\t<\/div>    \r\n\t\t<\/div> \r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal48\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">48<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">Far-field speech recognition<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t<p><strong>Kate\u0159ina \u017dmol\u00edkov\u00e1<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Speech recognition, Microphone arrays, Beamforming, Dereverberation<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Zpracov\u00e1n\u00ed zvuku<\/span> <span class=\"label label-default\">V\u00ddZKUM \/ RESEARCH - v\u00fdzkumn\u00e1 pr\u00e1ce<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>The paper deals with the problem of speech recognition using distant microphones. The usage of distant microphones is often more convenient in real applications than using the close talking microphone. However, this introduces the problem of noise and reverberation which degrades the accuracy of the speech recognition system. This problem can be reduced by using microphone arrays rather than single microphone. This paper explores the methods of processing of multichannel recordings to enhance the speech, thereby improving the speech recognition performance. To process the array and achieve noise reduction, two different methods (Delay-and-sum and Minimum variance distortionless response beamforming) are explored. For dereverberation, Weighted prediction error method is used. The methods are tested on three different noise robust datasets (AMI, CHiME3 and REVERB). The results achieved on these tasks are comparable with the published results. In this paper, we present the applied methods, analyze the results and discuss the modifications necessary for achieving the results.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2016\/048\/48_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\t\r\n\t\t\t\t\t\t<\/div>\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t<\/div>   \r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2016\/048\/48.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2016\/048\/48_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\t\t\t\t\t\t\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\r\n\t\t<div class=\"thumbnail topic16 topic26\"> \r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">59<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal59\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2016\/059\/59_nahled.png\" alt=\"\"><\/a>\t\t\t\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>RINA Simulator: Creating Distributed Applications in RINA Architecture<\/h4>        \r\n\t\t\t\t<h5>Kamil Je\u0159\u00e1bek<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2016\/059\/59.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2016\/059\/59_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n\t\t\t<\/div>    \r\n\t\t<\/div> \r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal59\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">59<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">RINA Simulator: Creating Distributed Applications in RINA Architecture<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t<p><strong>Kamil Je\u0159\u00e1bek<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>OMNeT++, RINA Architecture, Distributed Application, RINA Simulator<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Po\u010d\u00edta\u010dov\u00e9 s\u00edt\u011b<\/span> <span class=\"label label-default\">V\u00ddZKUM \/ RESEARCH - v\u00fdzkumn\u00e1 pr\u00e1ce<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>This paper is focused on application approach in RINA Architecture, on its design and implementation in RINA Simulator in OMNeT++. The work is carried out within research project PRISTINE within which the RINA Simulator is developed. Contribution of this work is to extend the functionality of the simulator by a programming interface and structure for creating distributed applications. There is also presented simple design of Application Programming Interface.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2016\/059\/59_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\t\r\n\t\t\t\t\t\t<\/div>\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t<\/div>   \r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2016\/059\/59.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2016\/059\/59_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\t\t\t\t\t\t\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\r\n\t\t<div class=\"thumbnail topic21 topic28\"> \r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">2<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal2\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2016\/002\/2_nahled.png\" alt=\"\"><\/a>\t\t\t\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>DSL for Configuration Files Verification<\/h4>        \r\n\t\t\t\t<h5>Matej Marecek<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2016\/002\/2.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2016\/002\/2_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n\t\t\t<\/div>    \r\n\t\t<\/div> \r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal2\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">2<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">DSL for Configuration Files Verification<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t<p><strong>Matej Marecek<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Domain-Specific Languages, Templates, Configuration Verification, Xtext, Parsers, Interpreters, WinCC OA, SCADA, JavaScript, JVM, CERN<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Programovac\u00ed jazyky a p\u0159eklada\u010de<\/span> <span class=\"label label-default\">INOVACE \/ INNOVATION - vylep\u0161en\u00ed existuj\u00edc\u00ed metody nebo jej\u00ed implementace, v\u010detn\u011b odstran\u011bn\u00ed omezen\u00ed<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>CERN (European Organization for Nuclear Research) is one of the biggest research organizations in the world. It heavily uses SCADA (Supervisory Control And Data Acquisition) software for their scientific and industrial machines. This paper tackles a problem of verifying that configuration files used by CERN's SCADA (WinCC Open Architecture) software are correct and comply with CERN standards.  The aim was to develop a tool that gives SCADA developers and administrators ability to easily create templates that describe how certain configuration files should look like and determine whether templates match configuration files.  This paper introduces a tool that solves the problem by using a specially designed domain-specific programming language and an interpreter of the language.   The language itself is based on declarative paradigm and its fundamental capabilities can be extended by JavaScript injection. As for the interpreter, it uses Xtext-based parser to convert configuration files and templates into form of abstract syntax trees (ASTs). The execution itself is a combination of AST interpretation, translation of certain parts of AST into a JavaScript code and running JavaScript code on top of the Java Virtual Machine.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2016\/002\/2_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\t\r\n\t\t\t\t\t\t<\/div>\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t<\/div>   \r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2016\/002\/2.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2016\/002\/2_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\t\t\t\t\t\t\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div><div class=\"clearfix\"><\/div>\r\n\r\n\t\t<h2>2015<\/h2>\r\n\r\n\t\t<div class=\"thumbnail topic07\"> \r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">19<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal19\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2015\/019\/19_nahled.png\" alt=\"\"><\/a>\t\t\t\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>Design, Construction and Control of Hexapod Walking Robot<\/h4>        \r\n\t\t\t\t<h5>Marek \u017d\u00e1k<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2015\/019\/19.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2015\/019\/19_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><a href=\"https:\/\/youtu.be\/Wf5Vrq0e_4M\"><img src=\"\/submissions\/images\/video-icon.png\" width=\"32\" height=\"32\" alt=\"Video\"><\/a><\/p>\r\n\t\t\t<\/div>    \r\n\t\t<\/div> \r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal19\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">19<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">Design, Construction and Control of Hexapod Walking Robot<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t<p><strong>Marek \u017d\u00e1k<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Hexapod, Legged chassis, Walking robot, Hexapod gaits<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Robotika a um\u011bl\u00e1 inteligence<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>This paper aims on design, construction and control of hexapod robot, which is six-leg walking robot. Basic characteristics of legged robots, a few existing robots and their pros and cons are described. Paper also describes basic gaits, which are used by legged robots for their locomotion. Result of this project is a legged robot, which can walk using tripod, wave and ripple gait and is equipped with sonars, force-sensitive resistors and encoders. Robot is controlled and monitored from user interface program. It can display data from sensors and positions of robot\u2019s legs. The robot can be used to test and verify algorithms, gaits and features of walking robots.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2015\/019\/19_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\t\r\n\t\t\t\t\t\t<\/div>\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t<\/div>   \r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2015\/019\/19.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2015\/019\/19_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><a href=\"https:\/\/youtu.be\/Wf5Vrq0e_4M\"><img src=\"\/submissions\/images\/video-icon.png\" width=\"48\" height=\"48\" alt=\"Video\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\t\t\t\t\t\t\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\r\n\t\t<div class=\"thumbnail topic15\"> \r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">35<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal35\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2015\/035\/35_nahled.png\" alt=\"\"><\/a>\t\t\t\r\n\t\t\t<\/div>\r\n\t\t\t<div class=\"caption\">\r\n\t\t\t\t<h4>Verification of Pointer Programs Based on Forest Automata<\/h4>        \r\n\t\t\t\t<h5>Martin Hru\u0161ka<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2015\/035\/35.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2015\/035\/35_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n\t\t\t<\/div>    \r\n\t\t<\/div> \r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal35\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n\t\t\t<div class=\"modal-dialog modal-lg\">\r\n\t\t\t\t<div class=\"modal-content\">\r\n\t\t\t\t\t<div class=\"modal-header\">\r\n\t\t\t\t\t\t<span class=\"badge\">35<\/span>\r\n\t\t\t\t\t\t<p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n\t\t\t\t\t\t<h3 class=\"modal-title\">Verification of Pointer Programs Based on Forest Automata<\/h3>\r\n\t\t\t\t\t<\/div>\r\n\t\t\t\t\t<div class=\"modal-body\">\r\n\t\t\t\t\t\t<div class=\"row\">\r\n\t\t\t\t\t\t\t<div class=\"col-md-8\">\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t<p><strong>Martin Hru\u0161ka<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Forest Automata, Formal Verification, Static Analysis, Complex Data Structures, Tree Automata, Backward Run, Predicate Abstraction<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Testov\u00e1n\u00ed, anal\u00fdza a verifikace<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>Forest automata are one of the formalisms recently used for analysis and verification of programs manipulating dynamic data structures. In the area of shape analysis there exists a tool Forester employing forest automata. Forest automata are based on tree automata and Forester has its own implementation of tree automata. However, there is the VATA library which implements the efficient algorithms for the tree automata manipulation, especially the efficient algorithms for the checking inclusion of languages of tree automata what is an operation crucial also for the verification procedure based on forest automata. The first goal of this work is to implement a version of Forester tool that uses the VATA library for tree automata manipulation. The second goal of this work is to extend forest automata based verification with backward run that checks whether a found error is a spurious or a real one what could be used for refinement of predicate abstraction. The first goal has been already fulfilled and the variant of Forester using the VATA library successfully participated in the competition SV-COMP 2015. The part of the second goal is done only partially -- the backward run is already finished and predicate abstraction implementation is in progress.<\/p>\r\n\t\t\t\t\t\t\t<\/div>\r\n\t\t\t\t\t\t\t<div class=\"col-md-4\">\r\n\t\t\t\t\t\t\t\t<p><img class=\"img-responsive\" src=\"\/submissions\/2015\/035\/35_nahled.png\" alt=\"\"><\/p>\r\n\t\t\t\t\t\t\t<\/div>\t\r\n\t\t\t\t\t\t<\/div>\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t<\/div>   \r\n\t\t\t\t\t<div class=\"modal-footer\">\r\n\t\t\t\t\t\t<div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2015\/035\/35.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2015\/035\/35_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n\t\t\t\t\t\t<div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n\t\t\t\t\t<\/div>\t\t\t\t\t\t\r\n\t\t\t\t<\/div>\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\r\n\r\n\r\n\t<\/div>\r\n\r\n\r\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":2,"featured_media":3625,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"ngg_post_thumbnail":0,"footnotes":""},"class_list":["post-3610","page","type-page","status-publish","has-post-thumbnail","hentry"],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/excel.fit.vutbr.cz\/2024\/wp-json\/wp\/v2\/pages\/3610","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/excel.fit.vutbr.cz\/2024\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/excel.fit.vutbr.cz\/2024\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/excel.fit.vutbr.cz\/2024\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/excel.fit.vutbr.cz\/2024\/wp-json\/wp\/v2\/comments?post=3610"}],"version-history":[{"count":11,"href":"https:\/\/excel.fit.vutbr.cz\/2024\/wp-json\/wp\/v2\/pages\/3610\/revisions"}],"predecessor-version":[{"id":3636,"href":"https:\/\/excel.fit.vutbr.cz\/2024\/wp-json\/wp\/v2\/pages\/3610\/revisions\/3636"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/excel.fit.vutbr.cz\/2024\/wp-json\/wp\/v2\/media\/3625"}],"wp:attachment":[{"href":"https:\/\/excel.fit.vutbr.cz\/2024\/wp-json\/wp\/v2\/media?parent=3610"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}