{"id":1989,"date":"2016-05-05T15:08:44","date_gmt":"2016-05-05T13:08:44","guid":{"rendered":"http:\/\/excel.fit.vutbr.cz\/2022\/?page_id=1989"},"modified":"2023-01-26T09:52:25","modified_gmt":"2023-01-26T08:52:25","slug":"vysledky","status":"publish","type":"page","link":"https:\/\/excel.fit.vutbr.cz\/2022\/vysledky\/","title":{"rendered":"V\u00fdsledky"},"content":{"rendered":"\r\n\t<link rel=\"stylesheet\" media=\"all\" type=\"text\/css\" href=\"\/submissions\/css\/results.css?v2020527\">\r\n\r\n\t<div class=\"well\">\r\n\t\t<ul>\r\n            <li><a href=\"#oceneni-odbornym-panelem\">Ocen\u011bn\u00ed <strong>odborn\u00fdm panelem<\/strong><\/a><\/li>\r\n            <li><a href=\"#oceneni-partnery\">Ocen\u011bn\u00ed <strong>partnery z pr\u016fmyslu<\/strong><\/a><\/li>\r\n            <li><a href=\"#oceneni-odbornou-verejnosti-cena-jiriho-kunovskeho\">Ocen\u011bn\u00ed <strong>odbornou ve\u0159ejnost\u00ed<\/strong> - cena Ji\u0159\u00edho Kunovsk\u00e9ho<\/a><\/li>\r\n\t\t<\/ul>\r\n\t<\/div>\r\n\t  \r\n\t<h2 id=\"oceneni-odbornym-panelem\" style=\"margin-top:0;padding-top:0\">Ocen\u011bn\u00ed <strong>odborn\u00fdm panelem<\/strong><\/h2>\r\n\t<div class=\"row results\">\r\n        <div class=\"thumbnail topic01 topic03\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"za experiment\u00e1ln\u00ed ov\u011b\u0159en\u00ed bezpe\u010dnosti blockchain protokolu Harmony, kter\u00e9 vede k nov\u00fdm informac\u00edm o jeho pou\u017eitelnosti.\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">3<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal3\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2022\/003\/3_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>Testovanie bezpe\u010dnosti a v\u00fdkonnosti blockchainu Harmony pomocou simul\u00e1cie<\/h4>\r\n\t\t\t\t<h5>Juraj Holub<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/003\/3.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/003\/3_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=\"modal3\" 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\">3<\/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\">Testovanie bezpe\u010dnosti a v\u00fdkonnosti blockchainu Harmony pomocou simul\u00e1cie<\/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>Juraj Holub<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Blockchain, Proof-of-Stake, Harmony, Simul\u00e1cia<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Bezpe\u010dnost<\/span> <span class=\"label label-default\">Modelov\u00e1n\u00ed a simulace<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>V s\u00fa\u010dasnosti je blockchain popul\u00e1rnou technol\u00f3giou pou\u017e\u00edvanou v distribuovan\u00fdch aplik\u00e1ciach, ktor\u00e9 klad\u00fa d\u00f4raz na bezpe\u010dnos\u0165 (napr\u00edklad kryptomeny alebo elektronick\u00e9 vo\u013eby). Neust\u00e1le prebieha v\u00fdvoj nov\u00fdch blockchain protokolov s nov\u00fdmi vlastnos\u0165ami. Vzh\u013eadom na ich finan\u010dn\u00fa citlivos\u0165 je potrebn\u00e9 tieto nov\u00e9 protokoly podrobne preveri\u0165 z h\u013eadiska bezpe\u010dnosti a v\u00fdkonnosti e\u0161te pred ich nasaden\u00edm. Prirodzene sa pre tento \u00fa\u010del naskyt\u00e1 simul\u00e1cia. Cie\u013eom tejto pr\u00e1ce je simulova\u0165 blockchain protokol Harmony, ktor\u00fd poskytuje vysok\u00fa priepustnos\u0165 transakci\u00ed nez\u00e1visle od ve\u013ekosti siete. Simul\u00e1cia sa zameriava na konsenzus protokol pou\u017eit\u00fd v tomto blockchaine. Simulovan\u00e9 boli konkr\u00e9tne \u00fatoky na konsenzus ako aj v\u0161eobecn\u00e1 efekt\u00edvnos\u0165 protokolu. V\u00fdsledky simul\u00e1cie poukazuj\u00fa na bezpe\u010dnostn\u00e9 riziko v podobe DDoS \u00fatoku. Na druhej strane, simul\u00e1cia potvrdila vysok\u00fa priepustnos\u0165 transakci\u00ed pomocou mechanizmu sharding, a to bez v\u00fdrazn\u00e9ho zn\u00ed\u017eenia bezpe\u010dnosti. Na z\u00e1ver je navrhnut\u00e1 a odsimulovan\u00e1 modifik\u00e1cia protokolu, ktor\u00e1 zni\u017euje zranite\u013enos\u0165 vo\u010di DDoS \u00fatoku. \u010citate\u013e tejto pr\u00e1ce sa obozn\u00e1mi s posledn\u00fdm v\u00fdvojom v technol\u00f3gii blockchain. Vytvoren\u00fd n\u00e1stroj m\u00f4\u017ee posl\u00fa\u017ei\u0165 ako z\u00e1klad pre simul\u00e1ciu \u010fal\u0161\u00edch protokolov.<\/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\/003\/3_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\/003\/3.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/003\/3_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<div class=\"thumbnail topic10\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"za zda\u0159il\u00fd teoretick\u00fd v\u00fdzkum v oblasti pokro\u010dil\u00fdch automat\u016f, kter\u00fd m\u016f\u017ee z\u00e1sadn\u011b urychlit pr\u00e1ci se slo\u017eit\u00fdmi regul\u00e1rn\u00edmi v\u00fdrazy.\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">10<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal10\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2022\/010\/10_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>Register Set Automata<\/h4>\r\n\t\t\t\t<h5>Sab\u00edna Gul\u010d\u00edkov\u00e1<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/010\/10.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/010\/10_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=\"modal10\" 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\">10<\/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\">Register Set 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>Sab\u00edna Gul\u010d\u00edkov\u00e1<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>finite memory automata, register automata, regular expression matching<\/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>Register automaton (RA) operating over an infinite alphabet is one of the great tools for pattern matching with backreferences, runtime verification, or modelling of parallel computation. In case of pattern matching with backreferences, the state-of-the-art matchers make use of backtracking algorithms, whose application causes significant slowdown in case of nondeterministic regular expressions. The RA's property of non-determinisability makes it an unsuitable model for solution to problems related to inefficient usage of backtracking algorithms. On the other hand, the RA's quality of being equipped by a finite memory serves as a~good basis for  storing the so-called capture groups used in this application.  In this work, a~formal model called register set automaton is proposed. A large class of RAs can be transformed into this deterministic model, which, among other things, allows for fast pattern matching with backreferences. In this paper, we explore its properties including determinisability, expressive power, and closure under Boolean operations. In addition, algorithms for other problems, such as emptiness testing, are introduced.<\/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\/010\/10_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\/010\/10.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/010\/10_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<div class=\"thumbnail topic01\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"za z\u00e1sadn\u00ed roz\u0161\u00ed\u0159en\u00ed a zrychlen\u00ed simul\u00e1toru blockchain protokol\u016f, kter\u00e9 dovoluje vyhodnocen\u00ed protokol\u016f na re\u00e1ln\u00fdch s\u00ed\u0165ov\u00fdch topologi\u00edch.\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">13<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal13\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2022\/013\/13_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>Simulator for Verifying the Properties of DAG-based Consensus Protocols<\/h4>\r\n\t\t\t\t<h5>Tom\u00e1\u0161 Hladk\u00fd<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/013\/13.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/013\/13_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=\"modal13\" 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\">13<\/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\">Simulator for Verifying the Properties of DAG-based Consensus Protocols<\/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 Hladk\u00fd<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Simulator, DAG-based consensus, Blockchain, Optimizations, Payoff function, Transaction throughput<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Bezpe\u010dnost<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>We study existing Directed Acyclic Graph (DAG) blockchain designs that propose to solve a blockchains throughput problem, especially protocols PHANTOM and its optimization GHOSTDAG. They utilize a Bitcoin protocol and propose a random transaction selection, resulting in increased transaction throughput. However, it has been proved by a simulation that actors that use the random transaction selection strategy have less profit than actors who do not follow the protocol and select transactions rationally (i.e., most profitable). That proof has been made on a small network of ten nodes with a circle topology. This article aims to extend, optimize, and automate an existing blockchain simulator. We implement a Bitcoin-like network topology with realistic block propagation latency. Furthermore, we optimize the simulator to run more simulations in parallel and faster, including automation tools that can create or edit input configurations, perform a combination of runs on multiple CPUs based on input parameters, and analyze profits and transaction collisions. Finally, we perform experiments to verify malicious actors' advantages in a Bitcoin-like network and create a payoff function to punish this behavior.<\/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\/013\/13_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\/013\/13.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/013\/13_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<div class=\"thumbnail topic10\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"za zda\u0159il\u00fd teoretick\u00fd v\u00fdzkum, kter\u00fd vedl ke \u0161pi\u010dkov\u00e9 publikaci v oblasti pokro\u010dil\u00fdch automat\u016f a rozhodovac\u00edch procedur.\">\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\t\t<div class=\"thumbnail topic10\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"za roz\u0161\u00ed\u0159en\u00ed a implementaci rozhodovac\u00ed procedury dovoluj\u00edc\u00ed efektivn\u011bj\u0161\u00ed anal\u00fdzu program\u016f pracuj\u00edc\u00edch s dynamickou pam\u011bt\u00ed.\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">38<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal38\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2022\/038\/38_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>A Decision Procedure For Strong-Separation Logic<\/h4>\r\n\t\t\t\t<h5>Tom\u00e1\u0161 Dac\u00edk<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/038\/38.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/038\/38_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=\"modal38\" 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\">38<\/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\">A Decision Procedure For Strong-Separation Logic<\/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 Dac\u00edk<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Logic, Separation Logic, Decision Procedure<\/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>Separation logic (SL) is one of the most successful tools for verification of programs that manipulate dynamically allocated memory. Its expressive power comes at a cost of undecidability when several of its features, namely negation, inductive predicates describing data structures and separating implications are combined. To circumvent this problem, the recently introduced strong-separation logic (SSL) uses a stricter definition of the semantics, making it decidable, while remaining suitable for verification. However, there is currently no implementation of a decision procedure for SSL. In this work, we propose a decision procedure for SSL based on a translation to first-order formulae that can be later solved by a specialized solver. Our preliminary experimental results show that our approach can effectively solve formulae obtained from verification tools based on SL and also outperform existing decision procedure based on similar translation.<\/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\/038\/38_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\/038\/38.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/038\/38_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<div class=\"thumbnail topic03 topic09\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"aplika\u010dn\u00ed potenci\u00e1l v oblasti klinick\u00e9ho v\u00fdzkumu a praxe d\u00edky vyu\u017eit\u00ed neuronov\u00fdch s\u00edt\u00ed pro aproximaci v\u00fdpo\u010dtu \u0161\u00ed\u0159en\u00ed ultrazvukov\u00fdch vln; d\u00edlo v\u00fdrazn\u011b p\u0159esahuje b\u011b\u017enou \u00farove\u0148 magistersk\u00fdch prac\u00ed.\">\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>\t\t\r\n\t\t<div class=\"thumbnail topic05 topic13\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"praktick\u00e9 vyu\u017eit\u00ed a experiment\u00e1ln\u00ed ov\u011b\u0159en\u00ed vlastnost\u00ed mechanismu automatick\u00e9ho zaost\u0159ov\u00e1n\u00ed na b\u00e1zi tekut\u00e9 \u010do\u010dky.\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">22<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal22\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2022\/022\/22_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>Zaostrovanie tekutej \u0161o\u0161ovky v re\u00e1lnom \u010dase<\/h4>\r\n\t\t\t\t<h5>Martin Za\u0165ovi\u010d<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/022\/22.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/022\/22_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><a href=\"https:\/\/youtu.be\/XnB-iBhf16A\"><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\t\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal22\" 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\">22<\/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\">Zaostrovanie tekutej \u0161o\u0161ovky v re\u00e1lnom \u010dase<\/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 Za\u0165ovi\u010d<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>autofocus, tekut\u00e1 \u0161o\u0161ovka, kamera, zaostrovanie, spracovanie obrazu<\/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> <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>R\u00fdchlos\u0165 zau\u017e\u00edvan\u00e9ho pr\u00edstupu k zaostrovaniu kamerov\u00fdch syst\u00e9mov nar\u00e1\u017ea na \u00fazke hrdlo - mechanick\u00fd pohyb motora, ktor\u00fd men\u00ed vzdialenos\u0165 \u0161o\u0161ovky od sn\u00edman\u00e9ho objektu. Tento pohyb spoma\u013euje zaostrovanie, ktor\u00e9 je v mnoh\u00fdch pr\u00edpadoch kritick\u00e1 oper\u00e1cia zariaden\u00ed, ktor\u00e9 vyu\u017e\u00edvaj\u00fa kamerov\u00fd syst\u00e9m, preto\u017ee vznik\u00e1 potreba vy\u010dk\u00e1va\u0165 na spr\u00e1vne zaostrenie. Rie\u0161enie predstavuje inovat\u00edvna technol\u00f3gia tekutej \u0161o\u0161ovky. Tekut\u00e1 \u0161o\u0161ovka eliminuje potrebu mechanick\u00e9ho pohybu a v\u010faka tomu je schopn\u00e1 tak\u00e9to syst\u00e9my ur\u00fdchli\u0165. Budeme sa venova\u0165 overeniu r\u00fdchlosti tejto technol\u00f3gie, jej v\u00fdhod\u00e1m a nev\u00fdhod\u00e1m a uk\u00e1\u017eeme si jej vyu\u017eitie na pr\u00edkladoch z re\u00e1lneho sveta. Ide\u00e1lnym pr\u00edkladom pre vyu\u017eitie tekutej \u0161o\u0161ovky s\u00fa zariadenia, ktor\u00e9 \u010dasto preostruj\u00fa - h\u013abkov\u00fd skener, alebo linka, ktor\u00e1 sn\u00edma \u0161t\u00edtky s textom na bal\u00edkoch r\u00f4znej ve\u013akosti.<\/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\/022\/22_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\/022\/22.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/022\/22_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><a href=\"https:\/\/youtu.be\/XnB-iBhf16A\"><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\t\t<div class=\"thumbnail topic01 topic07\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"vytvo\u0159en\u00ed kvalitn\u00edho datasetu pro komunitu a zv\u00fd\u0161en\u00ed bezpe\u010dnosti IoT s\u00edt\u00ed\">\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\/2022\/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>IoT Gateways Network Communication Analysis<\/h4>\r\n\t\t\t\t<h5>Jan Zbo\u0159il<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/001\/1.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/001\/1_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=\"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\">IoT Gateways Network Communication Analysis<\/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 Zbo\u0159il<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>IoT, IoT gateways, network traffic analysis, attacks on IoT devices<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Bezpe\u010dnost<\/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>Modern IoT gateways are mainly developed by private companies behind closed doors. This results in a closed ecosystem, where only a small amount of information about traffic is available to the public. Therefore, to gain knowledge regarding the operation and communication of such gateways, it is necessary to examine and analyse network traffic flowing to and fro such gateways. This paper's primary goal is to capture and process network traffic data of multiple commercially available gateways intended for home use, analyse their communication behaviours, compare the results to other studies carried out in this area, and discuss possible attacks on used gateways based on gathered data. Communication data were obtained by deploying a controlled environment and analysed using Zeek, together with Wireshark software.  Gathered communication data can be further used by researchers in the areas of networking or security.<\/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\/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\/2022\/001\/1.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/001\/1_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<div class=\"thumbnail topic07\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"vytvo\u0159en\u00ed prakticy pou\u017eiteln\u00e9ho v\u00fdsledku a p\u0159esah do pr\u016fmyslov\u00e9 aplikace\">\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\/2022\/019\/19_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>Dynamic Mesh network in Micropython on ESP32<\/h4>\r\n\t\t\t\t<h5>Jind\u0159ich \u0160est\u00e1k<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/019\/19.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/019\/19_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=\"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\">Dynamic Mesh network in Micropython on ESP32<\/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>Jind\u0159ich \u0160est\u00e1k<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>ESP32, ESP-NOW, Mesh network, Mesh, Espressif, MicroPython, Asyncio<\/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> <\/p>\r\n\t\t\t\t\t\t\t\t<p>The aim of this project is to implement a mesh network protocol on ESP32 microchips in MicroPython. It mainly focuses on the functioning of mesh in two modes, with connection to the Internet and without it. This thesis was ordered by Espressif company for improving and discovering new ways of mesh networking. %     The solution of this mesh network uses two network protocols. First, the ESP-NOW protocol offers low power consumption and doesn't need any network connection. The second is the common WiFi protocol which is used for data transmission. WiFi links are formed between ESP32 nodes and one of the nodes can even be connected to the Internet and offer a connection to the whole mesh. %     With full functionality, the mesh will be light weighted and will connect multiple nodes. It is possible to run user applications like light control on ESP32 boards on top of the mesh using WiFi. With WiFi, it is possible to transfer big amount of data for applications. The work is still in progress. %     In this project, there are used new innovations to ensure the formation of a structure in the mesh. The problem of how to select a root node in an environment without the WiFi Access Point (Router, AP) is presented.<\/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\/019\/19_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\/019\/19.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/019\/19_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<div class=\"thumbnail \" data-toggle=\"tooltip\" data-placement=\"top\" title=\"multioborov\u00fd p\u0159esah a kvalitn\u00ed textov\u00e9 zpracov\u00e1n\u00ed\">\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><\/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>\r\n\t\t<div class=\"thumbnail topic03 topic07\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"hodnotn\u00fd p\u0159\u00ednos komunit\u011b zab\u00fdvaj\u00edc\u00ed se modelov\u00e1n\u00edm a simulacemi\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">30<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal30\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2022\/030\/30_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 Border Gateway 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\/2022\/030\/30.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/030\/30_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=\"modal30\" 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\">30<\/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 Border Gateway 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>BGP, simulation, routing protocol, OMNeT++, INET<\/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>Border Gateway Protocol (BGP) was first sketched on two napkins over a conference lunch in 1989 by two gentlemen, and it would become one of, if not the most, essential routing protocols of our time in just a few years. It creates the global routing system of the Internet. Billions of people rely on BGP every single day without even knowing about it. A recent example of our collective reliance on BGP takes us back a few months ago when Facebook engineers misconfigured their BGP instances, effectively cutting themselves off from the outside. The global importance of this protocol led to the creation of this paper, which discusses improvements to the BGP simulation model. Such a model, if of high quality, could help network engineers and others test the stability of their topologies and configurations inside a safe discrete environment. The model, written in C++, is improved and extended in several directions with new features, such as full support for the IPv6 address family, Cisco-like configuration, the BGP table, TCP improvements, and many more. The quality of the model is ensured by a close comparison of all aspects of the model to Cisco's implementation of BGP.<\/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\/030\/30_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\/030\/30.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/030\/30_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<div class=\"thumbnail \" data-toggle=\"tooltip\" data-placement=\"top\" title=\"p\u0159\u00ednosn\u00e9 roz\u0161\u00ed\u0159en\u00ed platformy OpenStack\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">33<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal33\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2022\/033\/33_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>ENOSS - Event Notifications in OpenStack Swift<\/h4>\r\n\t\t\t\t<h5>Nemanja Vasiljevi\u0107<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/033\/33.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/033\/33_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=\"modal33\" 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\">33<\/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\">ENOSS - Event Notifications in OpenStack Swift<\/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>Nemanja Vasiljevi\u0107<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Event, Notifications, OpenStack Swift<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><\/p>\r\n\t\t\t\t\t\t\t\t<p>Currently, object storage OpenStack Swift does not provide any pieces of information to users about events that occurred in storage they own\/have access to. For example, users do not have information when the content of their object storage is accessed, changed, created, or deleted. This paper aims to create a solution that will send notifications about events that occurred in OpenStack Swift to user-specified destinations. The proposed solution, using metadata, allows users to specify where and which event should be published based on even types (read, create, modify, delete) and other properties such as object prefix, suffix, size. It also offers multiple destinations(Beanstalkd queue, Kafka, etc.) to which notifications can be published. The solution is fully compatible with AWS S3 Event Notifications and, compared to AWS, supports more destinations, event types, filters and allows unsuccessful events to be published. Event notification can be used for monitoring, automatization, and serverless computing (similar to AWS Lambda).<\/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\/033\/33_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\/033\/33.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/033\/33_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<div class=\"thumbnail topic13\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"kvalitn\u00ed \u0159e\u0161en\u00ed otev\u0159en\u00e9ho v\u011bdeck\u00e9ho probl\u00e9mu, je\u017e by nav\u00edc mohlo b\u00fdt p\u0159\u00edmo prakticky pou\u017eiteln\u00e9.\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">9<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal9\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2022\/009\/9_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>Detection of pre-recorded messages in speech<\/h4>\r\n\t\t\t\t<h5>Dominik Bobo\u0161<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/009\/9.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/009\/9_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=\"modal9\" 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\">9<\/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\">Detection of pre-recorded messages in speech<\/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 Bobo\u0161<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Detection of re-occurring sequences in audio, Segmental dynamic time warping, Recurrence quantification analysis, Fuzzy string matching, Bottleneck features, Phoneme posteriors<\/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>Recognition of pre-recorded messages in speech such as \"This number is not reachable\" is useful for any follow-up speech data mining.  To investigate the identification of redundant information in audio, it is necessary to have a large amount of data with the exact phrases repeated multiple times. Such a set is generated by mixing pre-recorded messages into phone calls with variations in speed, volume and repetitions. The created system tackles \u201cknown messages\u201d and \u201cunknown messages\u201d scenarios by using approaches like clustering or detection in chunks. Dynamic time warping, approximate string matching and recurrent quantification analysis are compared, and finally, all mentioned techniques are combined to obtain a precise and efficient system.<\/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\/009\/9_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\/009\/9.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/009\/9_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<div class=\"thumbnail topic13\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"inovativn\u00ed pr\u00e1ci v oblasti zpracov\u00e1n\u00ed sn\u00edmk\u016f z elektronov\u00e9ho mikroskopu s potenci\u00e1lem pro re\u00e1ln\u00e9 nasazen\u00ed a za kvalitn\u00ed zpracov\u00e1n\u00ed \u010dl\u00e1nku.\">\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\t\t<div class=\"thumbnail topic13\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"inovativn\u00ed \u0159e\u0161en\u00ed probl\u00e9mu z oblasti zpracov\u00e1n\u00ed dokument\u016f a za p\u0159esv\u011bd\u010div\u00e9 experiment\u00e1ln\u00ed vyhodnocen\u00ed.\">\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\/2022\/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>Uspo\u0159\u00e1d\u00e1n\u00ed zp\u0159eh\u00e1zen\u00fdch \u0159\u00e1dk\u016f s pomoc\u00ed jazykov\u00e9ho modelu<\/h4>\r\n\t\t\t\t<h5>Michael Holubec<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/023\/23.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/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>\r\n\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\">Uspo\u0159\u00e1d\u00e1n\u00ed zp\u0159eh\u00e1zen\u00fdch \u0159\u00e1dk\u016f s pomoc\u00ed jazykov\u00e9ho modelu<\/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>Michael Holubec<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Reading order, Posloupnost \u010dten\u00ed, Prostorov\u00e1 anal\u00fdza, Jazykov\u00e1 anal\u00fdza, Jazykov\u00fd model, LSTM, OCR<\/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>Pr\u00e1ce se zab\u00fdv\u00e1 stanoven\u00edm posloupnost \u010dten\u00ed (Reading order) textov\u00fdch region\u016f u digitalizovan\u00fdch dokument\u016f.  Identifikace posloupnosti \u010dten\u00ed je jednou z d\u016fle\u017eit\u00fdch sou\u010d\u00e1st\u00ed p\u0159i rekonstrukci a extrakci obsahu digitalizovan\u00fdch dokument\u016f. Krom\u011b zaveden\u00fdch metod vyu\u017e\u00edvaj\u00edc\u00edch k sestaven\u00ed posloupnost\u00ed \u010dten\u00ed prostorov\u00fdch informac\u00ed, pr\u00e1ce zkoum\u00e1 tak\u00e9 mo\u017enost vyu\u017eit\u00ed textov\u00e9ho obsahu dokumentu a jeho anal\u00fdzy pomoc\u00ed jazykov\u00e9ho modelu.  Na datasetu t\u0159in\u00e1cti novinov\u00fdch \u010dl\u00e1nk\u016f porovn\u00e1v\u00e1 \u00fasp\u011b\u0161nost identifikace spr\u00e1vn\u00e9 posloupnosti \u010dten\u00ed pomoc\u00ed prostorov\u00e9 anal\u00fdzy, jazykov\u00e9 anal\u00fdzy a kombinovan\u00e9 anal\u00fdzy. Prostorov\u00e1 anal\u00fdza dle proveden\u00fdch experiment\u016f dosahuje 85  % \u00fasp\u011b\u0161nosti. Samotn\u00fd jazykov\u00fd model poskytuje velmi omezen\u00e9 v\u00fdsledky (\u00fasp\u011b\u0161nost 16 %), jeho u\u017eit\u00ed v kombinaci s prostorovou anal\u00fdzou v\u0161ak zvy\u0161uje \u00fasp\u011b\u0161nost z p\u016fvodn\u00edch 85 % na 89 %.   V\u00fdstupem pr\u00e1ce jsou mechanismy identifikuj\u00edc\u00ed posloupnost \u010dten\u00ed, kter\u00e9 mohou slou\u017eit pro dodate\u010dn\u00e9 zpracov\u00e1n\u00ed digitalizovan\u00fdch dokument\u016f. Rovn\u011b\u017e poskytuj\u00ed robustn\u00ed z\u00e1klad pro p\u0159\u00edpadn\u00e1 dal\u0161\u00ed roz\u0161\u00ed\u0159en\u00ed a vylep\u0161en\u00ed p\u0159esnosti identifikace posloupnosti \u010dten\u00ed.<\/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\/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\/2022\/023\/23.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/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><div class=\"clearfix\"><\/div>\r\n\t<\/div>\r\n\t\r\n\t\r\n\t\r\n\t\r\n\r\n\t<h2 id=\"oceneni-partnery\">Ocen\u011bn\u00ed <strong>partnery z pr\u016fmyslu<\/strong><\/h2>\r\n\t<div class=\"row results\">\r\n        <div class=\"thumbnail topic13\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"\">\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<div class=\"sponsor-logo\"><img src=\"\/wp-content\/partners\/2022\/generalni-partner\/thermo.png\"><\/div>\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\t\t<div class=\"thumbnail topic13\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">9<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal9\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2022\/009\/9_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>Detection of pre-recorded messages in speech<\/h4>\r\n\t\t\t\t<h5>Dominik Bobo\u0161<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/009\/9.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/009\/9_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<div class=\"sponsor-logo\"><img src=\"\/wp-content\/partners\/2022\/generalni-partner\/thermo.png\"><\/div>\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal9\" 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\">9<\/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\">Detection of pre-recorded messages in speech<\/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 Bobo\u0161<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Detection of re-occurring sequences in audio, Segmental dynamic time warping, Recurrence quantification analysis, Fuzzy string matching, Bottleneck features, Phoneme posteriors<\/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>Recognition of pre-recorded messages in speech such as \"This number is not reachable\" is useful for any follow-up speech data mining.  To investigate the identification of redundant information in audio, it is necessary to have a large amount of data with the exact phrases repeated multiple times. Such a set is generated by mixing pre-recorded messages into phone calls with variations in speed, volume and repetitions. The created system tackles \u201cknown messages\u201d and \u201cunknown messages\u201d scenarios by using approaches like clustering or detection in chunks. Dynamic time warping, approximate string matching and recurrent quantification analysis are compared, and finally, all mentioned techniques are combined to obtain a precise and efficient system.<\/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\/009\/9_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\/009\/9.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/009\/9_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<div class=\"thumbnail topic03 topic09\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"\">\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<div class=\"sponsor-logo\"><img src=\"\/wp-content\/partners\/2022\/generalni-partner\/innovatrics.png\"><\/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\">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\t\t<div class=\"thumbnail topic01\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">13<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal13\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2022\/013\/13_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>Simulator for Verifying the Properties of DAG-based Consensus Protocols<\/h4>\r\n\t\t\t\t<h5>Tom\u00e1\u0161 Hladk\u00fd<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/013\/13.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/013\/13_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<div class=\"sponsor-logo\"><img src=\"\/wp-content\/partners\/2022\/generalni-partner\/sap.png\"><\/div>\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal13\" 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\">13<\/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\">Simulator for Verifying the Properties of DAG-based Consensus Protocols<\/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 Hladk\u00fd<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Simulator, DAG-based consensus, Blockchain, Optimizations, Payoff function, Transaction throughput<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Bezpe\u010dnost<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>We study existing Directed Acyclic Graph (DAG) blockchain designs that propose to solve a blockchains throughput problem, especially protocols PHANTOM and its optimization GHOSTDAG. They utilize a Bitcoin protocol and propose a random transaction selection, resulting in increased transaction throughput. However, it has been proved by a simulation that actors that use the random transaction selection strategy have less profit than actors who do not follow the protocol and select transactions rationally (i.e., most profitable). That proof has been made on a small network of ten nodes with a circle topology. This article aims to extend, optimize, and automate an existing blockchain simulator. We implement a Bitcoin-like network topology with realistic block propagation latency. Furthermore, we optimize the simulator to run more simulations in parallel and faster, including automation tools that can create or edit input configurations, perform a combination of runs on multiple CPUs based on input parameters, and analyze profits and transaction collisions. Finally, we perform experiments to verify malicious actors' advantages in a Bitcoin-like network and create a payoff function to punish this behavior.<\/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\/013\/13_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\/013\/13.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/013\/13_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<div class=\"thumbnail topic13\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"\">\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\/2022\/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>Using generative adversarial networks to make robust speech separation systems<\/h4>\r\n\t\t\t\t<h5>J\u00e1n Pavlus<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/024\/24.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/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\t<div class=\"sponsor-logo\"><img src=\"\/wp-content\/partners\/2022\/generalni-partner\/sap.png\"><\/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\">Using generative adversarial networks to make robust speech separation systems<\/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>J\u00e1n Pavlus<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>speech-separation, GAN, robust, adversarial augmentations<\/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>Speech separation is a task of separating single signals from the given mixture of multiple speakers. Speech separation systems are trained on artificial mixtures generated from single speaker's signals. These signals are then used as targets for the training. Neural networks trained this way work well on artificial data but they often fail on real-world examples. To improve their behavior on real-world mixtures it is possible to use training data augmentations for example noise addition. Nevertheless, the power of these augmentations is limited as they have to be manually designed. Using generative adversarial networks (GAN) could improve this process by generating augmentations for data depending on the success of confusing the separation system using these data. Speech separation could be then made more and more robust with each generator and separator training step.  This paper describes experiments that are used to find the right parameters and their combination for the GAN model training. Although the experiments do not yet lead to a more robust speech separation, they provide an analysis of the pitfalls of training the GAN, which is the necessary first step towards a successful system. These experiments show that training the GAN model to the stable state is difficult by adjusting the exact number of batches, after which the separator and generator training is switched. On the other hand, adjusting the to-be-achieved scores of the generator or separator training move could work much better and train the GAN model properly. Other experiments have to be done to prove the correctness of these parameters and their settings.<\/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\/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\/2022\/024\/24.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/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>\r\n\t\t<div class=\"thumbnail topic01 topic07\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"\">\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\/2022\/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>Intrusive device against LTE mobile networks<\/h4>\r\n\t\t\t\t<h5>Timotej Kamensk\u00fd<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/012\/12.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/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\t<div class=\"sponsor-logo\"><img src=\"\/wp-content\/partners\/2022\/generalni-partner\/honeywell.png\"><\/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\">Intrusive device against LTE mobile 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>Timotej Kamensk\u00fd<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>LTE, SDR, IMSI catcher, DoS, Downgrade Attack<\/em><\/p>\r\n\t\t\t\t\t\t\t\t<p><span class=\"label label-default\">Bezpe\u010dnost<\/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 work strives to create an intrusive device targeting LTE networks. It should implement several already described attacks: IMSI catcher, downgrade attack, denial of service. These attacks are taking use of inherent weaknesses of the LTE protocol, which makes defending against them is hard. This goal should be achieved in a compact hardware package. The key piece of hardware is Software Defined Radio (SDR), namely Blade-RF 2.0. It is a general-purpose radio which allows us to work with radio technology through an abstract programming layer instead of relying on tinkering with hardware. The result of this work can serve the security community in penetration testing and researching security of mobile networks.<\/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\/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\/2022\/012\/12.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/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>\r\n\t\t<div class=\"thumbnail topic09 topic11\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">28<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal28\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2022\/028\/28_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>Bezpe\u010dn\u00fd pr\u016fzkum dronem s vyu\u017eit\u00edm chytr\u00e9ho pohybu po trajektori\u00edch<\/h4>\r\n\t\t\t\t<h5>Adam Ferencz<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/028\/28.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/028\/28_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<div class=\"sponsor-logo\"><img src=\"\/wp-content\/partners\/2022\/generalni-partner\/honeywell.png\"><\/div>\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal28\" 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\">28<\/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\">Bezpe\u010dn\u00fd pr\u016fzkum dronem s vyu\u017eit\u00edm chytr\u00e9ho pohybu po trajektori\u00edch<\/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>Adam Ferencz<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>dron, semiautonomn\u00ed, simulace, AirSim, python, bezpe\u010dn\u00fd let<\/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\">U\u017eivatelsk\u00e1 rozhran\u00ed<\/span> <\/p>\r\n\t\t\t\t\t\t\t\t<p>Piloti dronu \u010dasto mus\u00ed hl\u00eddat p\u0159i pln\u011bn\u00ed pr\u016fzkumn\u00e9 mise v\u00edce v\u011bc\u00ed z\u00e1rove\u0148. Pilot n\u011bco pozoruje, sleduje obraz, nato\u010den\u00ed dronu, rychlost a p\u0159ek\u00e1\u017eky. C\u00edlem t\u00e9to pr\u00e1ce je vytvo\u0159it aplikaci, kter\u00e1 pilotovi uleh\u010d\u00ed hl\u00edd\u00e1n\u00ed bezpe\u010dn\u00e9 polohy dronu.  \t  \u010cl\u00e1nek prezentuje novou metodu, kter\u00e1 reviduje povely pilota tak, aby se dron dr\u017eel \"bezpe\u010dn\u011b bl\u00edzko\" p\u0159edem definovan\u00e9 dr\u00e1ze letu. Pilot se tak m\u016f\u017ee v\u00edce v\u011bnovat pln\u011bn\u00ed c\u00edl\u016f mise, ne\u017e p\u0159\u00edm\u00e9mu a bezpe\u010dn\u00e9mu \u0159\u00edzen\u00ed dronu. Navr\u017een\u00e1 metoda byla testov\u00e1na v aplikaci, kter\u00e1 umo\u017e\u0148uje definovat bezpe\u010dnou trajektorii dronu a pro testovac\u00ed lety vyu\u017e\u00edv\u00e1 integraci simul\u00e1toru.   V\u00fdstupem jsou testy u\u017eivatelsk\u00e9 aplikace v simul\u00e1toru AirSim, kde u\u017eivatel d\u011bl\u00e1 nejd\u0159\u00edve misi bez zapnut\u00e9 korekce a pot\u00e9 s n\u00ed. V u\u017eivatelsk\u00fdch testech, kde byl c\u00edl splnit pr\u016fzkumnou misi, piloti p\u0159i letu bez korekce str\u00e1vili 55% mimo definovanou bezpe\u010dnou oblast a p\u0159i letu s asistentem takto str\u00e1vili pouze 5%. Pr\u016fm\u011brn\u00e9 vych\u00fdlen\u00ed zaveden\u00ed od ide\u00e1ln\u00ed trajektorie kleslo z 2,29 metr\u016f na 0,92 metru (bezpe\u010dn\u00e1 vzd\u00e1lenost byla p\u0159i testech do 2 metr\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\/2022\/028\/28_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\/028\/28.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/028\/28_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<div class=\"thumbnail topic13\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"\">\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\/2022\/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>Sledov\u00e1n\u00ed pohybu n\u00e1v\u0161t\u011bvn\u00edk\u016f muzejn\u00edch expozic<\/h4>\r\n\t\t\t\t<h5>Matej Viskupi\u010d<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/031\/31.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/031\/31_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><a href=\"https:\/\/youtu.be\/F_irtBwBN-k\"><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\t<div class=\"sponsor-logo\"><img src=\"\/wp-content\/partners\/2022\/hlavni-partner\/sewio.png\"><\/div>\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\">Sledov\u00e1n\u00ed pohybu n\u00e1v\u0161t\u011bvn\u00edk\u016f muzejn\u00edch expozic<\/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>Matej Viskupi\u010d<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Sledovanie os\u00f4b, Identifik\u00e1cia os\u00f4b, Heatmap of presence<\/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>Cie\u013eom tejto pr\u00e1ce je presk\u00fama\u0165 mo\u017enosti a navrhn\u00fa\u0165 syst\u00e9m monitorovania n\u00e1v\u0161tevn\u00edkov muzejn\u00fdch expoz\u00edci\u00ed. Na rozdiel od doteraj\u0161\u00edch met\u00f3d na\u0161e rie\u0161enia sk\u00fama vyu\u017eitie kamerovej technol\u00f3gie. Tento pr\u00edstup priniesol tri podprobl\u00e9my: (1.) detekciu \u013eud\u00ed v kamerovom z\u00e1zname za pomoci konvolu\u010dnej neur\u00f3novej siete (2.) presn\u00e9 ur\u010denie polohy os\u00f4b v monitorovanom priestore za pou\u017eitia externej konfigur\u00e1cie kamier a (3.) identifik\u00e1ciu detegovan\u00fdch os\u00f4b. V\u00fdstupom n\u00e1\u0161ho rie\u0161enia je \u0161tatistika n\u00e1v\u0161tevnosti jednotliv\u00fdch expoz\u00edci\u00ed, mapa zn\u00e1zor\u0148uj\u00faca pohyb n\u00e1v\u0161tevn\u00edkov a tepeln\u00e1 mapa zobrazuj\u00faca \u010das str\u00e1ven\u00fd pred jednotliv\u00fdmi expoz\u00edciami. Tieto v\u00fdstupy m\u00f4\u017eu prispie\u0165 k lep\u0161iemu vyhodnocovaniu potrieb n\u00e1v\u0161tevn\u00edkov a k efekt\u00edvnej\u0161iemu v\u00fdberu alebo rozmiestneniu expon\u00e1tov.<\/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\/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\/2022\/031\/31.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/031\/31_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><a href=\"https:\/\/youtu.be\/F_irtBwBN-k\"><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\t\t<div class=\"thumbnail topic05 topic13\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">22<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal22\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2022\/022\/22_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>Zaostrovanie tekutej \u0161o\u0161ovky v re\u00e1lnom \u010dase<\/h4>\r\n\t\t\t\t<h5>Martin Za\u0165ovi\u010d<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/022\/22.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/022\/22_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><a href=\"https:\/\/youtu.be\/XnB-iBhf16A\"><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\t<div class=\"sponsor-logo\"><img src=\"\/wp-content\/partners\/2022\/hlavni-partner\/tescan.png\"><\/div>\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal22\" 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\">22<\/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\">Zaostrovanie tekutej \u0161o\u0161ovky v re\u00e1lnom \u010dase<\/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 Za\u0165ovi\u010d<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>autofocus, tekut\u00e1 \u0161o\u0161ovka, kamera, zaostrovanie, spracovanie obrazu<\/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> <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>R\u00fdchlos\u0165 zau\u017e\u00edvan\u00e9ho pr\u00edstupu k zaostrovaniu kamerov\u00fdch syst\u00e9mov nar\u00e1\u017ea na \u00fazke hrdlo - mechanick\u00fd pohyb motora, ktor\u00fd men\u00ed vzdialenos\u0165 \u0161o\u0161ovky od sn\u00edman\u00e9ho objektu. Tento pohyb spoma\u013euje zaostrovanie, ktor\u00e9 je v mnoh\u00fdch pr\u00edpadoch kritick\u00e1 oper\u00e1cia zariaden\u00ed, ktor\u00e9 vyu\u017e\u00edvaj\u00fa kamerov\u00fd syst\u00e9m, preto\u017ee vznik\u00e1 potreba vy\u010dk\u00e1va\u0165 na spr\u00e1vne zaostrenie. Rie\u0161enie predstavuje inovat\u00edvna technol\u00f3gia tekutej \u0161o\u0161ovky. Tekut\u00e1 \u0161o\u0161ovka eliminuje potrebu mechanick\u00e9ho pohybu a v\u010faka tomu je schopn\u00e1 tak\u00e9to syst\u00e9my ur\u00fdchli\u0165. Budeme sa venova\u0165 overeniu r\u00fdchlosti tejto technol\u00f3gie, jej v\u00fdhod\u00e1m a nev\u00fdhod\u00e1m a uk\u00e1\u017eeme si jej vyu\u017eitie na pr\u00edkladoch z re\u00e1lneho sveta. Ide\u00e1lnym pr\u00edkladom pre vyu\u017eitie tekutej \u0161o\u0161ovky s\u00fa zariadenia, ktor\u00e9 \u010dasto preostruj\u00fa - h\u013abkov\u00fd skener, alebo linka, ktor\u00e1 sn\u00edma \u0161t\u00edtky s textom na bal\u00edkoch r\u00f4znej ve\u013akosti.<\/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\/022\/22_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\/022\/22.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/022\/22_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><a href=\"https:\/\/youtu.be\/XnB-iBhf16A\"><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\t\t<div class=\"thumbnail topic07\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"\">\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\/2022\/019\/19_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>Dynamic Mesh network in Micropython on ESP32<\/h4>\r\n\t\t\t\t<h5>Jind\u0159ich \u0160est\u00e1k<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/019\/19.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/019\/19_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<div class=\"sponsor-logo\"><img src=\"\/wp-content\/partners\/2022\/hlavni-partner\/espressif.png\"><\/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\">Dynamic Mesh network in Micropython on ESP32<\/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>Jind\u0159ich \u0160est\u00e1k<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>ESP32, ESP-NOW, Mesh network, Mesh, Espressif, MicroPython, Asyncio<\/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> <\/p>\r\n\t\t\t\t\t\t\t\t<p>The aim of this project is to implement a mesh network protocol on ESP32 microchips in MicroPython. It mainly focuses on the functioning of mesh in two modes, with connection to the Internet and without it. This thesis was ordered by Espressif company for improving and discovering new ways of mesh networking. %     The solution of this mesh network uses two network protocols. First, the ESP-NOW protocol offers low power consumption and doesn't need any network connection. The second is the common WiFi protocol which is used for data transmission. WiFi links are formed between ESP32 nodes and one of the nodes can even be connected to the Internet and offer a connection to the whole mesh. %     With full functionality, the mesh will be light weighted and will connect multiple nodes. It is possible to run user applications like light control on ESP32 boards on top of the mesh using WiFi. With WiFi, it is possible to transfer big amount of data for applications. The work is still in progress. %     In this project, there are used new innovations to ensure the formation of a structure in the mesh. The problem of how to select a root node in an environment without the WiFi Access Point (Router, AP) is presented.<\/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\/019\/19_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\/019\/19.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/019\/19_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<div class=\"thumbnail topic05 topic10\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">34<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal34\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2022\/034\/34_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>Emulace perif\u00e9ri\u00ed vestav\u011bn\u00fdch syst\u00e9m\u016f pro rychl\u00e9 prototypov\u00e1n\u00ed<\/h4>\r\n\t\t\t\t<h5>Dominik M\u00fcller<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/034\/34.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/034\/34_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<div class=\"sponsor-logo\"><img src=\"\/wp-content\/partners\/2022\/hlavni-partner\/nxp.png\"><\/div>\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal34\" 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\">34<\/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\">Emulace perif\u00e9ri\u00ed vestav\u011bn\u00fdch syst\u00e9m\u016f pro rychl\u00e9 prototypov\u00e1n\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>Dominik M\u00fcller<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>Hardware-in-the-loop, Simulace vestav\u011bn\u00fdch syst\u00e9m\u016f, Akcelerace v\u00fdvoje<\/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> <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>Tato pr\u00e1ce se zab\u00fdv\u00e1 n\u00e1vrhem a realizac\u00ed platformy, umo\u017e\u0148uj\u00edc\u00ed v\u00fdvoj\u00e1\u0159i definovat simulovan\u00e9 prost\u0159ed\u00ed vestav\u011bn\u00e9ho syst\u00e9mu. Platforma umo\u017e\u0148uje v\u00fdvoj\u00e1\u0159i vybrat nebo vytvo\u0159it za\u0159\u00edzen\u00ed, vyskytuj\u00edc\u00ed se v okol\u00ed vyv\u00edjen\u00e9ho syst\u00e9mu a detailn\u011b definovat jejich parametry a chov\u00e1n\u00ed. Simulace okol\u00ed mikrokontrol\u00e9ru je rozd\u011blena na harwarovou \u00farove\u0148 a na \u00farove\u0148 deterministick\u00e9ho real-time prost\u0159ed\u00ed. Odpadaj\u00ed tak n\u011bkter\u00e9 limitace softwarov\u00fdch \u0159e\u0161en\u00ed. Navrhovan\u00e1 platforma p\u0159edstavuje pohled na testov\u00e1n\u00ed vestav\u011bn\u00fdch syst\u00e9m\u016f b\u011bhem rann\u00fdch faz\u00ed v\u00fdvoje. Tento pohled je odli\u0161n\u00fd od b\u011b\u017en\u00fdch \u0159e\u0161en\u00ed a sna\u017e\u00ed se tak zv\u00fd\u0161it efektivitu v\u00fdvoj\u00e1\u0159e. N\u00e1vrh platformy c\u00edl\u00ed na jej\u00ed snadnou roz\u0161\u00ed\u0159itelnost, konfigurovatelnost a univerzalitu. V\u00fdstupem t\u00e9to pr\u00e1ce je platforma demonstruj\u00edc\u00ed my\u0161lenky uveden\u00e9 v tomto \u010dl\u00e1nku, kter\u00e1 slou\u017e\u00ed jako vhodn\u00fd z\u00e1klad pro budouc\u00ed roz\u0161\u00ed\u0159en\u00ed.<\/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\/034\/34_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\/034\/34.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/034\/34_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<div class=\"thumbnail topic05\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"\">\r\n\t\t\t<div class=\"caption caption-image\">\r\n\t\t\t\t<span class=\"badge\">4<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal4\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2022\/004\/4_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>Asynchronous MQTT Client Library for Embedded Devices Running on Drogue-IoT Firmware<\/h4>\r\n\t\t\t\t<h5>Ond\u0159ej Babec<\/h5>\r\n\t\t\t\t<p class=\"download-menu\"><a href=\"\/submissions\/2022\/004\/4.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/004\/4_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><a href=\"https:\/\/youtu.be\/XHi3HQsUdwA\"><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\t<div class=\"sponsor-logo\"><img src=\"\/wp-content\/partners\/2022\/hlavni-partner\/edhouse.png\"><\/div>\r\n\t\t<\/div>\r\n\t\t<div class=\"modal fade bs-example-modal-lg\" id=\"modal4\" 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\">4<\/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\">Asynchronous MQTT Client Library for Embedded Devices Running on Drogue-IoT Firmware<\/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 Babec<\/strong><\/p>\r\n\t\t\t\t\t\t\t\t<p><em>MQTT, Async, Rust, Embedded, Industry4.0, Smart-home<\/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>The main target of this work is to create an asynchronous MQTT client, supporting MQTT version 5, in Rust running on embedded devices powered by Drogue device opensource firmware. The number  of clients that support MQTT version 5 is highly limited, and currently, no client implementation exists in Rust. The main implementation challenge is that MQTT version 5 has properties of variable lengths. Storing these properties of size which is unknown during compile time is a massive obstacle because embedded Rust does not support dynamic allocation as there is no underlying operating system. The result of the work is a client that has comparable functionalities as other available clients in different languages. The client library is extended with both desktop and embedded async executors. Although the client could be used almost everywhere, the leading variants are  Industry 4.0 and Smart home.<\/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\/004\/4_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\/004\/4.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/004\/4_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><a href=\"https:\/\/youtu.be\/XHi3HQsUdwA\"><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><div class=\"clearfix\"><\/div>\r\n\t\t<\/div>\r\n\t<\/div>\r\n\t\r\n\t\r\n\r\n\t<h2 id=\"oceneni-odbornou-verejnosti-cena-jiriho-kunovskeho\">Ocen\u011bn\u00ed <strong>odbornou ve\u0159ejnost\u00ed<\/strong> - cena Ji\u0159\u00edho Kunovsk\u00e9ho<\/h2>\r\n    <div class=\"row results\">\r\n    <div class=\"thumbnail topic03 topic09\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"\">\r\n        <div class=\"caption caption-image\">\r\n            <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        <\/div>\r\n        <div class=\"caption\">\r\n            <h4>Approximation of Sound Propagation by Neural Networks<\/h4>\r\n            <h5>Son Hai Nguyen<\/h5>\r\n            <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        <\/div>\r\n        \r\n    <\/div>\r\n    <div class=\"modal fade bs-example-modal-lg\" id=\"modal2\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n        <div class=\"modal-dialog modal-lg\">\r\n            <div class=\"modal-content\">\r\n                <div class=\"modal-header\">\r\n                    <span class=\"badge\">2<\/span>\r\n                    <p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n                    <h3 class=\"modal-title\">Approximation of Sound Propagation by Neural Networks<\/h3>\r\n                <\/div>\r\n                <div class=\"modal-body\">\r\n                    <div class=\"row\">\r\n                        <div class=\"col-md-8\">\r\n                            <p><strong>Son Hai Nguyen<\/strong><\/p>\r\n                            <p><em>neural solver, Helmholtz equation, graph neural network, transcranial ultrasound, PDE<\/em><\/p>\r\n                            <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                            <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                        <\/div>\r\n                        <div class=\"col-md-4\">\r\n                            <p><img class=\"img-responsive\" src=\"\/submissions\/2022\/002\/2_nahled.png\" alt=\"\"><\/p>\r\n                        <\/div>\r\n                    <\/div>\r\n                <\/div>\r\n                <div class=\"modal-footer\">\r\n                    <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                    <div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n                <\/div>\r\n            <\/div>\r\n        <\/div>\r\n    <\/div>\r\n    <div class=\"thumbnail topic03 topic07\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"\">\r\n        <div class=\"caption caption-image\">\r\n            <span class=\"badge\">30<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal30\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2022\/030\/30_nahled.png\" alt=\"\"><\/a>\r\n        <\/div>\r\n        <div class=\"caption\">\r\n            <h4>Modeling of Border Gateway Protocol<\/h4>\r\n            <h5>Jan Zav\u0159el<\/h5>\r\n            <p class=\"download-menu\"><a href=\"\/submissions\/2022\/030\/30.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/030\/30_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n        <\/div>\r\n        \r\n    <\/div>\r\n    <div class=\"modal fade bs-example-modal-lg\" id=\"modal30\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n        <div class=\"modal-dialog modal-lg\">\r\n            <div class=\"modal-content\">\r\n                <div class=\"modal-header\">\r\n                    <span class=\"badge\">30<\/span>\r\n                    <p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n                    <h3 class=\"modal-title\">Modeling of Border Gateway Protocol<\/h3>\r\n                <\/div>\r\n                <div class=\"modal-body\">\r\n                    <div class=\"row\">\r\n                        <div class=\"col-md-8\">\r\n                            <p><strong>Jan Zav\u0159el<\/strong><\/p>\r\n                            <p><em>BGP, simulation, routing protocol, OMNeT++, INET<\/em><\/p>\r\n                            <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                            <p>Border Gateway Protocol (BGP) was first sketched on two napkins over a conference lunch in 1989 by two gentlemen, and it would become one of, if not the most, essential routing protocols of our time in just a few years. It creates the global routing system of the Internet. Billions of people rely on BGP every single day without even knowing about it. A recent example of our collective reliance on BGP takes us back a few months ago when Facebook engineers misconfigured their BGP instances, effectively cutting themselves off from the outside. The global importance of this protocol led to the creation of this paper, which discusses improvements to the BGP simulation model. Such a model, if of high quality, could help network engineers and others test the stability of their topologies and configurations inside a safe discrete environment. The model, written in C++, is improved and extended in several directions with new features, such as full support for the IPv6 address family, Cisco-like configuration, the BGP table, TCP improvements, and many more. The quality of the model is ensured by a close comparison of all aspects of the model to Cisco's implementation of BGP.<\/p>\r\n                        <\/div>\r\n                        <div class=\"col-md-4\">\r\n                            <p><img class=\"img-responsive\" src=\"\/submissions\/2022\/030\/30_nahled.png\" alt=\"\"><\/p>\r\n                        <\/div>\r\n                    <\/div>\r\n                <\/div>\r\n                <div class=\"modal-footer\">\r\n                    <div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2022\/030\/30.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/030\/30_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n                    <div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n                <\/div>\r\n            <\/div>\r\n        <\/div>\r\n    <\/div>\r\n    <div class=\"thumbnail topic10\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"\">\r\n        <div class=\"caption caption-image\">\r\n            <span class=\"badge\">10<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal10\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2022\/010\/10_nahled.png\" alt=\"\"><\/a>\r\n        <\/div>\r\n        <div class=\"caption\">\r\n            <h4>Register Set Automata<\/h4>\r\n            <h5>Sab\u00edna Gul\u010d\u00edkov\u00e1<\/h5>\r\n            <p class=\"download-menu\"><a href=\"\/submissions\/2022\/010\/10.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/010\/10_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n        <\/div>\r\n        \r\n    <\/div>\r\n    <div class=\"modal fade bs-example-modal-lg\" id=\"modal10\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n        <div class=\"modal-dialog modal-lg\">\r\n            <div class=\"modal-content\">\r\n                <div class=\"modal-header\">\r\n                    <span class=\"badge\">10<\/span>\r\n                    <p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n                    <h3 class=\"modal-title\">Register Set Automata<\/h3>\r\n                <\/div>\r\n                <div class=\"modal-body\">\r\n                    <div class=\"row\">\r\n                        <div class=\"col-md-8\">\r\n                            <p><strong>Sab\u00edna Gul\u010d\u00edkov\u00e1<\/strong><\/p>\r\n                            <p><em>finite memory automata, register automata, regular expression matching<\/em><\/p>\r\n                            <p><span class=\"label label-default\">Testov\u00e1n\u00ed, anal\u00fdza a verifikace<\/span> <\/p>\r\n                            <p>Register automaton (RA) operating over an infinite alphabet is one of the great tools for pattern matching with backreferences, runtime verification, or modelling of parallel computation. In case of pattern matching with backreferences, the state-of-the-art matchers make use of backtracking algorithms, whose application causes significant slowdown in case of nondeterministic regular expressions. The RA's property of non-determinisability makes it an unsuitable model for solution to problems related to inefficient usage of backtracking algorithms. On the other hand, the RA's quality of being equipped by a finite memory serves as a~good basis for  storing the so-called capture groups used in this application.  In this work, a~formal model called register set automaton is proposed. A large class of RAs can be transformed into this deterministic model, which, among other things, allows for fast pattern matching with backreferences. In this paper, we explore its properties including determinisability, expressive power, and closure under Boolean operations. In addition, algorithms for other problems, such as emptiness testing, are introduced.<\/p>\r\n                        <\/div>\r\n                        <div class=\"col-md-4\">\r\n                            <p><img class=\"img-responsive\" src=\"\/submissions\/2022\/010\/10_nahled.png\" alt=\"\"><\/p>\r\n                        <\/div>\r\n                    <\/div>\r\n                <\/div>\r\n                <div class=\"modal-footer\">\r\n                    <div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2022\/010\/10.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/010\/10_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n                    <div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n                <\/div>\r\n            <\/div>\r\n        <\/div>\r\n    <\/div>\r\n    <div class=\"thumbnail \" data-toggle=\"tooltip\" data-placement=\"top\" title=\"\">\r\n        <div class=\"caption caption-image\">\r\n            <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        <\/div>\r\n        <div class=\"caption\">\r\n            <h4>Identifikace proteinov\u00fdch tunel\u016f s vyu\u017eit\u00edm molekul\u00e1rn\u00edch dynamik<\/h4>\r\n            <h5>Petr Kohout<\/h5>\r\n            <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        <\/div>\r\n        \r\n    <\/div>\r\n    <div class=\"modal fade bs-example-modal-lg\" id=\"modal25\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n        <div class=\"modal-dialog modal-lg\">\r\n            <div class=\"modal-content\">\r\n                <div class=\"modal-header\">\r\n                    <span class=\"badge\">25<\/span>\r\n                    <p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n                    <h3 class=\"modal-title\">Identifikace proteinov\u00fdch tunel\u016f s vyu\u017eit\u00edm molekul\u00e1rn\u00edch dynamik<\/h3>\r\n                <\/div>\r\n                <div class=\"modal-body\">\r\n                    <div class=\"row\">\r\n                        <div class=\"col-md-8\">\r\n                            <p><strong>Petr Kohout<\/strong><\/p>\r\n                            <p><em>bioinformatika, proteinove\u0301 inz\u030ceny\u0301rstv\u0131\u0301, molekula\u0301rn\u0131\u0301 dynamika, tunely, dokova\u0301n\u0131\u0301<\/em><\/p>\r\n                            <p><\/p>\r\n                            <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                        <\/div>\r\n                        <div class=\"col-md-4\">\r\n                            <p><img class=\"img-responsive\" src=\"\/submissions\/2022\/025\/25_nahled.png\" alt=\"\"><\/p>\r\n                        <\/div>\r\n                    <\/div>\r\n                <\/div>\r\n                <div class=\"modal-footer\">\r\n                    <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                    <div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n                <\/div>\r\n            <\/div>\r\n        <\/div>\r\n    <\/div>\r\n    <div class=\"thumbnail topic01\" data-toggle=\"tooltip\" data-placement=\"top\" title=\"\">\r\n        <div class=\"caption caption-image\">\r\n            <span class=\"badge\">13<\/span><a href=\"#\" data-toggle=\"modal\" data-target=\"#modal13\"><img class=\"thumbnail-icon\" src=\"\/submissions\/2022\/013\/13_nahled.png\" alt=\"\"><\/a>\r\n        <\/div>\r\n        <div class=\"caption\">\r\n            <h4>Simulator for Verifying the Properties of DAG-based Consensus Protocols<\/h4>\r\n            <h5>Tom\u00e1\u0161 Hladk\u00fd<\/h5>\r\n            <p class=\"download-menu\"><a href=\"\/submissions\/2022\/013\/13.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"32\" height=\"32\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/013\/13_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"32\" height=\"32\" alt=\"Plak\u00e1t\"><\/a><\/p>\r\n        <\/div>\r\n        \r\n    <\/div>\r\n    <div class=\"modal fade bs-example-modal-lg\" id=\"modal13\" tabindex=\"-1\" role=\"dialog\" aria-hidden=\"true\">\r\n        <div class=\"modal-dialog modal-lg\">\r\n            <div class=\"modal-content\">\r\n                <div class=\"modal-header\">\r\n                    <span class=\"badge\">13<\/span>\r\n                    <p><button type=\"button\" class=\"close\" data-dismiss=\"modal\" aria-label=\"Close\"><span aria-hidden=\"true\">\u00d7<\/span><\/button><\/p>\r\n                    <h3 class=\"modal-title\">Simulator for Verifying the Properties of DAG-based Consensus Protocols<\/h3>\r\n                <\/div>\r\n                <div class=\"modal-body\">\r\n                    <div class=\"row\">\r\n                        <div class=\"col-md-8\">\r\n                            <p><strong>Tom\u00e1\u0161 Hladk\u00fd<\/strong><\/p>\r\n                            <p><em>Simulator, DAG-based consensus, Blockchain, Optimizations, Payoff function, Transaction throughput<\/em><\/p>\r\n                            <p><span class=\"label label-default\">Bezpe\u010dnost<\/span> <\/p>\r\n                            <p>We study existing Directed Acyclic Graph (DAG) blockchain designs that propose to solve a blockchains throughput problem, especially protocols PHANTOM and its optimization GHOSTDAG. They utilize a Bitcoin protocol and propose a random transaction selection, resulting in increased transaction throughput. However, it has been proved by a simulation that actors that use the random transaction selection strategy have less profit than actors who do not follow the protocol and select transactions rationally (i.e., most profitable). That proof has been made on a small network of ten nodes with a circle topology. This article aims to extend, optimize, and automate an existing blockchain simulator. We implement a Bitcoin-like network topology with realistic block propagation latency. Furthermore, we optimize the simulator to run more simulations in parallel and faster, including automation tools that can create or edit input configurations, perform a combination of runs on multiple CPUs based on input parameters, and analyze profits and transaction collisions. Finally, we perform experiments to verify malicious actors' advantages in a Bitcoin-like network and create a payoff function to punish this behavior.<\/p>\r\n                        <\/div>\r\n                        <div class=\"col-md-4\">\r\n                            <p><img class=\"img-responsive\" src=\"\/submissions\/2022\/013\/13_nahled.png\" alt=\"\"><\/p>\r\n                        <\/div>\r\n                    <\/div>\r\n                <\/div>\r\n                <div class=\"modal-footer\">\r\n                    <div class=\"pull-left\"><div class=\"btn-group\" role=\"group\"><a href=\"\/submissions\/2022\/013\/13.pdf\"><img src=\"\/submissions\/images\/paper-icon.png\" width=\"48\" height=\"48\" alt=\"\u010cl\u00e1nek\"><\/a><a href=\"\/submissions\/2022\/013\/13_poster.pdf\"><img src=\"\/submissions\/images\/poster-icon.png\" width=\"48\" height=\"48\" alt=\"Plak\u00e1t\"><\/a><\/div><\/div>\r\n                    <div class=\"pull-right\"><button type=\"button\" class=\"btn btn-primary\" data-dismiss=\"modal\">Zav\u0159\u00edt<\/button><\/div>\r\n                <\/div>\r\n            <\/div>\r\n        <\/div>\r\n    <\/div><div class=\"clearfix\"><\/div>\r\n\t<\/div>\r\n\r\n\r\n<script>\t\t\t\t\t\t\t\r\njQuery(function() {\r\n  jQuery('[data-toggle=\"tooltip\"]').tooltip()\r\n})\t\r\n<\/script>\r\n\r\n\r\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":2,"featured_media":3378,"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-1989","page","type-page","status-publish","has-post-thumbnail","hentry"],"_links":{"self":[{"href":"https:\/\/excel.fit.vutbr.cz\/2022\/wp-json\/wp\/v2\/pages\/1989","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/excel.fit.vutbr.cz\/2022\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/excel.fit.vutbr.cz\/2022\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/excel.fit.vutbr.cz\/2022\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/excel.fit.vutbr.cz\/2022\/wp-json\/wp\/v2\/comments?post=1989"}],"version-history":[{"count":44,"href":"https:\/\/excel.fit.vutbr.cz\/2022\/wp-json\/wp\/v2\/pages\/1989\/revisions"}],"predecessor-version":[{"id":3453,"href":"https:\/\/excel.fit.vutbr.cz\/2022\/wp-json\/wp\/v2\/pages\/1989\/revisions\/3453"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/excel.fit.vutbr.cz\/2022\/wp-json\/wp\/v2\/media\/3378"}],"wp:attachment":[{"href":"https:\/\/excel.fit.vutbr.cz\/2022\/wp-json\/wp\/v2\/media?parent=1989"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}