{"id":246,"date":"2013-11-27T12:41:54","date_gmt":"2013-11-27T12:41:54","guid":{"rendered":"http:\/\/eventmanagerblog.com\/event-wordpress-theme-tyler\/?page_id=2"},"modified":"2023-01-26T09:50:30","modified_gmt":"2023-01-26T08:50:30","slug":"program","status":"publish","type":"page","link":"https:\/\/excel.fit.vutbr.cz\/2022\/program\/","title":{"rendered":"Program"},"content":{"rendered":"\r\n<div id=\"program\">\r\n    <div class=\"row\">\r\n        <div class=\"col-md-12\">\r\n            <p>Konference Excel@FIT 2022 prob\u011bhne v sobotu 30. 4. 2022 na Fakult\u011b informa\u010dn\u00edch technologi\u00ed VUT v Brn\u011b v r\u00e1mci <a href=\"https:\/\/festivalfit.cz\"><strong>festivalu konan\u00e9ho k 20. v\u00fdro\u010d\u00ed fakulty<\/strong><\/a>.<\/p>\r\n        <\/div>\r\n    <\/div>\r\n\r\n        <h3>Program konference<\/h3>\r\n    <div class=\"row\">\r\n        <div class=\"col-md-6\">\r\n        <table class=\"program-table table\">\r\n        <tbody>\r\n            <tr class=\"default\">\r\n                <th>9-11<\/th>\r\n                <td>Prezentace nejlep\u0161\u00edch studentsk\u00fdch prac\u00ed<\/td>\r\n                <\/tr>\r\n                <tr class=\"refreshment\">\r\n                <th>11-12<\/th>\r\n                <td>P\u0159est\u00e1vka (prota\u017een\u00ed, vyv\u011btr\u00e1n\u00ed, dopln\u011bn\u00ed hrnk\u016f a skleni\u010dek)<\/td>\r\n                <\/tr>\r\n                <tr class=\"default\">\r\n                <th>12-14<\/th>\r\n                <td>P\u0159ehl\u00eddka studentsk\u00fdch prac\u00ed<\/td>\r\n                <\/tr>\r\n                <tr class=\"default\">\r\n                <th>15-16<\/th>\r\n                <td>Vyhl\u00e1\u0161en\u00ed ocen\u011bn\u00fdch prac\u00ed<\/td>\r\n                <\/tr>\r\n        <\/tbody>\r\n        <\/table>\r\n        <\/div>\r\n        <div class=\"col-md-6\">\r\n        <table class=\"program-table table\">\r\n        <tbody>\r\n        <tr class=\"default\">\r\n        <th>9-17<\/th>\r\n        <td>Prezentace partner\u016f FIT<\/td>\r\n        <\/tr>\r\n        <\/tbody>\r\n        <\/table>\r\n        <\/div>\r\n    <\/div>\r\n\r\n    <h2>P\u0159edn\u00e1\u0161ky<\/h2>\r\n<p>V dopoledn\u00edm bloku budou v hlavn\u00edm s\u00e1le konference auto\u0159i vybran\u00fdch prac\u00ed prezentovat sv\u00e9 v\u00fdsledky.<\/p>\r\n<link rel=\"stylesheet\" media=\"all\" type=\"text\/css\" href=\"\/submissions\/css\/proceedings.css?v20220428\">  \r\n<div class=\"row\" id=\"submissions\">\r\n    <div class=\"thumbnail topic04 topic10\">\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 topic14\">\r\n        <div class=\"caption caption-image\">\r\n            <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        <\/div>\r\n        <div class=\"caption\">\r\n            <h4>Detection of pre-recorded messages in speech<\/h4>\r\n            <h5>Dominik Bobo\u0161<\/h5>\r\n            <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        <\/div>\r\n        \r\n    <\/div>\r\n    <div class=\"modal fade bs-example-modal-lg\" id=\"modal9\" 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\">9<\/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\">Detection of pre-recorded messages in speech<\/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>Dominik Bobo\u0161<\/strong><\/p>\r\n                            <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                            <p><span class=\"label label-default\">Zpracov\u00e1n\u00ed dat (obraz, zvuk, text apod.)<\/span> <\/p>\r\n                            <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                        <\/div>\r\n                        <div class=\"col-md-4\">\r\n                            <p><img class=\"img-responsive\" src=\"\/submissions\/2022\/009\/9_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\/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                    <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\">\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>\r\n    <div class=\"thumbnail topic11\">\r\n        <div class=\"caption caption-image\">\r\n            <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        <\/div>\r\n        <div class=\"caption\">\r\n            <h4>Efficient Complementation of Elevator B\u00fcchi Automata<\/h4>\r\n            <h5>Barbora \u0160mahl\u00edkov\u00e1<\/h5>\r\n            <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        <\/div>\r\n        \r\n    <\/div>\r\n    <div class=\"modal fade bs-example-modal-lg\" id=\"modal18\" 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\">18<\/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\">Efficient Complementation of Elevator B\u00fcchi 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>Barbora \u0160mahl\u00edkov\u00e1<\/strong><\/p>\r\n                            <p><em>B\u00fcchi Automata, Elevator Automata, B\u00fcchi Complementation<\/em><\/p>\r\n                            <p><span class=\"label label-default\">Testov\u00e1n\u00ed, anal\u00fdza a verifikace<\/span> <\/p>\r\n                            <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                        <\/div>\r\n                        <div class=\"col-md-4\">\r\n                            <p><img class=\"img-responsive\" src=\"\/submissions\/2022\/018\/18_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\/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                    <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 topic08\">\r\n        <div class=\"caption caption-image\">\r\n            <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        <\/div>\r\n        <div class=\"caption\">\r\n            <h4>Dynamic Mesh network in Micropython on ESP32<\/h4>\r\n            <h5>Jind\u0159ich \u0160est\u00e1k<\/h5>\r\n            <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        <\/div>\r\n        \r\n    <\/div>\r\n    <div class=\"modal fade bs-example-modal-lg\" id=\"modal19\" 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\">19<\/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\">Dynamic Mesh network in Micropython on ESP32<\/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>Jind\u0159ich \u0160est\u00e1k<\/strong><\/p>\r\n                            <p><em>ESP32, ESP-NOW, Mesh network, Mesh, Espressif, MicroPython, Asyncio<\/em><\/p>\r\n                            <p><span class=\"label label-default\">Po\u010d\u00edta\u010dov\u00e9 s\u00edt\u011b<\/span> <\/p>\r\n                            <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                        <\/div>\r\n                        <div class=\"col-md-4\">\r\n                            <p><img class=\"img-responsive\" src=\"\/submissions\/2022\/019\/19_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\/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                    <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 topic02\">\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><span class=\"label label-default\">Bioinformatika<\/span> <\/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 topic14\">\r\n        <div class=\"caption caption-image\">\r\n            <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        <\/div>\r\n        <div class=\"caption\">\r\n            <h4>Photometric Stereo Processing for Microscopy<\/h4>\r\n            <h5>Samuel Repka<\/h5>\r\n            <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        <\/div>\r\n        \r\n    <\/div>\r\n    <div class=\"modal fade bs-example-modal-lg\" id=\"modal32\" 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\">32<\/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\">Photometric Stereo Processing for Microscopy<\/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>Samuel Repka<\/strong><\/p>\r\n                            <p><em>Photometric stereo, Scanning electron microscope, 4-segment BSE detector<\/em><\/p>\r\n                            <p><span class=\"label label-default\">Zpracov\u00e1n\u00ed dat (obraz, zvuk, text apod.)<\/span> <\/p>\r\n                            <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                        <\/div>\r\n                        <div class=\"col-md-4\">\r\n                            <p><img class=\"img-responsive\" src=\"\/submissions\/2022\/032\/32_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\/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                    <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<\/div> \r\n\r\n\r\n<\/div>\r\n\r\n","protected":false},"excerpt":{"rendered":"Program konference Excel@FIT, kter\u00e1 se kon\u00e1 na Fakult\u011b informa\u010dn\u00edch technologi\u00ed VUT v Brn\u011b.  ","protected":false},"author":2,"featured_media":3413,"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-246","page","type-page","status-publish","has-post-thumbnail","hentry"],"_links":{"self":[{"href":"https:\/\/excel.fit.vutbr.cz\/2022\/wp-json\/wp\/v2\/pages\/246","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=246"}],"version-history":[{"count":239,"href":"https:\/\/excel.fit.vutbr.cz\/2022\/wp-json\/wp\/v2\/pages\/246\/revisions"}],"predecessor-version":[{"id":3452,"href":"https:\/\/excel.fit.vutbr.cz\/2022\/wp-json\/wp\/v2\/pages\/246\/revisions\/3452"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/excel.fit.vutbr.cz\/2022\/wp-json\/wp\/v2\/media\/3413"}],"wp:attachment":[{"href":"https:\/\/excel.fit.vutbr.cz\/2022\/wp-json\/wp\/v2\/media?parent=246"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}