Pub Date : 2021-06-22DOI: 10.1109/idt52577.2021.9497550
{"title":"[IDT 2021 Front cover]","authors":"","doi":"10.1109/idt52577.2021.9497550","DOIUrl":"https://doi.org/10.1109/idt52577.2021.9497550","url":null,"abstract":"","PeriodicalId":316100,"journal":{"name":"2021 International Conference on Information and Digital Technologies (IDT)","volume":"1992 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125525785","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-06-22DOI: 10.1109/IDT52577.2021.9497615
Luisa Francini, P. Soda, R. Sicilia
Nowadays, people use more and more social media as a source of information, leading to an increased and uncontrolled spread of misinformation. For this reason, tools to detect unverified and instrumentally relevant news, named as rumours, are necessary. In this work we compare two state-of-the-art handcrafted representations, namely User-Network and Social-Content, designed for developing machine learning-based rumour detection systems, in order to analyse which descriptors best capture the information hidden in unknown rumours. To this end we set up an experimental assessment implementing a Leave-One-Topic-Out evaluation on 8 different topics retrieved from Twitter social microblog. The results obtained for both representations are low as we designed a simple and non optimised pipeline for a fair comparison. Besides this, we were able to find out that the User-Network set of feature results more stable to topic changes. As a further contribution, we introduce two new datasets labelled for rumour detection task on Twitter.
{"title":"Describing rumours: a comparative evaluation of two handcrafted representations for rumour detection","authors":"Luisa Francini, P. Soda, R. Sicilia","doi":"10.1109/IDT52577.2021.9497615","DOIUrl":"https://doi.org/10.1109/IDT52577.2021.9497615","url":null,"abstract":"Nowadays, people use more and more social media as a source of information, leading to an increased and uncontrolled spread of misinformation. For this reason, tools to detect unverified and instrumentally relevant news, named as rumours, are necessary. In this work we compare two state-of-the-art handcrafted representations, namely User-Network and Social-Content, designed for developing machine learning-based rumour detection systems, in order to analyse which descriptors best capture the information hidden in unknown rumours. To this end we set up an experimental assessment implementing a Leave-One-Topic-Out evaluation on 8 different topics retrieved from Twitter social microblog. The results obtained for both representations are low as we designed a simple and non optimised pipeline for a fair comparison. Besides this, we were able to find out that the User-Network set of feature results more stable to topic changes. As a further contribution, we introduce two new datasets labelled for rumour detection task on Twitter.","PeriodicalId":316100,"journal":{"name":"2021 International Conference on Information and Digital Technologies (IDT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115341786","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-06-22DOI: 10.1109/IDT52577.2021.9497630
S. Stankevich, M. Lubskyi, A. Lysenko
Remote sensing imagery in the long-wave infrared band represents land surface thermal radiance which is crucial for many studies related to urbanization development, geological activity, climate and landscape changes, etc. The main problem of long-wave infrared data application is insufficient spatial resolution relative to visible and short-wave infrared data. For detailed surface temperature mapping, which can be derived from the long-wave infrared data the resolution enhancement needs to be applied. The resolution enhancement technique based on the imaging system’s modulation transfer functions (MTF) processing is proposed. As a basic, the high-resolution visible band image has been taken. Fusion of the low-resolution (longwave infrared) and the high-resolution image (visible) was conducted by inverse filtering within the frequency domain. The more sharpened land surface temperature (LST) distribution without technical improvements of imaging systems is provided.
{"title":"Long-wave infrared remote sensing data spatial resolution enhancement using modulation transfer function fusion approach","authors":"S. Stankevich, M. Lubskyi, A. Lysenko","doi":"10.1109/IDT52577.2021.9497630","DOIUrl":"https://doi.org/10.1109/IDT52577.2021.9497630","url":null,"abstract":"Remote sensing imagery in the long-wave infrared band represents land surface thermal radiance which is crucial for many studies related to urbanization development, geological activity, climate and landscape changes, etc. The main problem of long-wave infrared data application is insufficient spatial resolution relative to visible and short-wave infrared data. For detailed surface temperature mapping, which can be derived from the long-wave infrared data the resolution enhancement needs to be applied. The resolution enhancement technique based on the imaging system’s modulation transfer functions (MTF) processing is proposed. As a basic, the high-resolution visible band image has been taken. Fusion of the low-resolution (longwave infrared) and the high-resolution image (visible) was conducted by inverse filtering within the frequency domain. The more sharpened land surface temperature (LST) distribution without technical improvements of imaging systems is provided.","PeriodicalId":316100,"journal":{"name":"2021 International Conference on Information and Digital Technologies (IDT)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123897779","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-06-22DOI: 10.1109/IDT52577.2021.9497524
A. Dudáš, J. Škrinárová, A. Kiss
The focus of the presented article is put on the analysis of edge coloring of selected sets of graphs - we are specifically interested in edge 3-coloring of graphs called snarks. Previous research suggests, that while using a single coloring algorithm and using various initial graph coloring edges, coloring of such graph may take anywhere from time lower than one millisecond to the time ranging in hundreds of milliseconds. In our case, we use recursive backtracking coloring algorithm based on breadth-first search and implement the change of initial graph coloring edge via permutation of adjacency matrix of graph. In this article, we present a tool created for the needs of analysis of edge coloring of graphs which is based on visualization of edge coloring and we present several problematic subgraphs and patterns which increase the time of edge coloring of cubic graphs.
{"title":"On Graph Coloring Analysis Through Visualization","authors":"A. Dudáš, J. Škrinárová, A. Kiss","doi":"10.1109/IDT52577.2021.9497524","DOIUrl":"https://doi.org/10.1109/IDT52577.2021.9497524","url":null,"abstract":"The focus of the presented article is put on the analysis of edge coloring of selected sets of graphs - we are specifically interested in edge 3-coloring of graphs called snarks. Previous research suggests, that while using a single coloring algorithm and using various initial graph coloring edges, coloring of such graph may take anywhere from time lower than one millisecond to the time ranging in hundreds of milliseconds. In our case, we use recursive backtracking coloring algorithm based on breadth-first search and implement the change of initial graph coloring edge via permutation of adjacency matrix of graph. In this article, we present a tool created for the needs of analysis of edge coloring of graphs which is based on visualization of edge coloring and we present several problematic subgraphs and patterns which increase the time of edge coloring of cubic graphs.","PeriodicalId":316100,"journal":{"name":"2021 International Conference on Information and Digital Technologies (IDT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121289055","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-06-22DOI: 10.1109/IDT52577.2021.9497634
A. Astrakhantsev, L. Globa, R. Novogrudska, M. Skulysh, Stryzhak O. Ye
5G Networks must provide high-quality communication for various devices and users, but unfortunately today, when building such networks, energy efficiency and security factors are not taken into account, provided that the specified quality of service is ensured. In this paper proposes a comprehensive approach to servicing hybrid telecommunications services in 5G networks, which allows flexible management of information and communication system resources involved in servicing the load with a given level of QoS. The main advantage of the approach is to take into account the relationship between service quality and resource allocation processes, taking into account energy efficiency and productivity of computing processes. The results of the approach will allow to take into account the characteristic features of the next generation of communication networks, will provide a minimum delay and a given level of service quality when providing services to users.
{"title":"Improving resource allocation system for 5G networks","authors":"A. Astrakhantsev, L. Globa, R. Novogrudska, M. Skulysh, Stryzhak O. Ye","doi":"10.1109/IDT52577.2021.9497634","DOIUrl":"https://doi.org/10.1109/IDT52577.2021.9497634","url":null,"abstract":"5G Networks must provide high-quality communication for various devices and users, but unfortunately today, when building such networks, energy efficiency and security factors are not taken into account, provided that the specified quality of service is ensured. In this paper proposes a comprehensive approach to servicing hybrid telecommunications services in 5G networks, which allows flexible management of information and communication system resources involved in servicing the load with a given level of QoS. The main advantage of the approach is to take into account the relationship between service quality and resource allocation processes, taking into account energy efficiency and productivity of computing processes. The results of the approach will allow to take into account the characteristic features of the next generation of communication networks, will provide a minimum delay and a given level of service quality when providing services to users.","PeriodicalId":316100,"journal":{"name":"2021 International Conference on Information and Digital Technologies (IDT)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126298555","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-06-22DOI: 10.1109/IDT52577.2021.9497523
Milan Ondrašovič, P. Tarábek, O. Such
This paper deals with the position estimation of a road sign from a single camera attached to a vehicle. We developed, implemented, and tested two mathematical approaches based on triangulation when the object annotation in the form of a bounding box is provided. We created a synthetic dataset (a simulation of a car passing by a road sign) to test the methods in a controlled environment. Additionally, the real dataset was created by recording a car trip within a town. Results on the synthetic dataset showed that the position could be estimated within 1 m accuracy. In the case of the real dataset, we measured the accuracy to be up to 4.3 m depending on the distance from the object. We performed experiments with artificial noise on synthetic data to evaluate the impact of different types of noise. Our contribution consists of two computationally inexpensive methods for object position estimation that are easy to use as they do not require calibration of parameters.
{"title":"Object Position Estimation from a Single Moving Camera","authors":"Milan Ondrašovič, P. Tarábek, O. Such","doi":"10.1109/IDT52577.2021.9497523","DOIUrl":"https://doi.org/10.1109/IDT52577.2021.9497523","url":null,"abstract":"This paper deals with the position estimation of a road sign from a single camera attached to a vehicle. We developed, implemented, and tested two mathematical approaches based on triangulation when the object annotation in the form of a bounding box is provided. We created a synthetic dataset (a simulation of a car passing by a road sign) to test the methods in a controlled environment. Additionally, the real dataset was created by recording a car trip within a town. Results on the synthetic dataset showed that the position could be estimated within 1 m accuracy. In the case of the real dataset, we measured the accuracy to be up to 4.3 m depending on the distance from the object. We performed experiments with artificial noise on synthetic data to evaluate the impact of different types of noise. Our contribution consists of two computationally inexpensive methods for object position estimation that are easy to use as they do not require calibration of parameters.","PeriodicalId":316100,"journal":{"name":"2021 International Conference on Information and Digital Technologies (IDT)","volume":"6 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113942711","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-06-22DOI: 10.1109/IDT52577.2021.9497621
Matej Mesko, Patrik Hrkút, Stefan Toth, Michal Duracík, Dominik Komhauser
This article focuses on the design of a procedure for solving the correction of commas (incorrectly placed or missing) in the text written in the Slovak language. At the beginning of the article, the text deals with existing third-party applications that address the same issue. Subsequently, we focus on the ways in which the field of neural networks is currently applied to the problem of finding mistakes in the text. Based on the acquired knowledge, we proposed a solution using neural networks. The next part of the article deals with experiments with our neural network and different lengths of the input vector. The last part contains an evaluation of the experiments and an overall summary.
{"title":"Checking the writing of commas in Slovak","authors":"Matej Mesko, Patrik Hrkút, Stefan Toth, Michal Duracík, Dominik Komhauser","doi":"10.1109/IDT52577.2021.9497621","DOIUrl":"https://doi.org/10.1109/IDT52577.2021.9497621","url":null,"abstract":"This article focuses on the design of a procedure for solving the correction of commas (incorrectly placed or missing) in the text written in the Slovak language. At the beginning of the article, the text deals with existing third-party applications that address the same issue. Subsequently, we focus on the ways in which the field of neural networks is currently applied to the problem of finding mistakes in the text. Based on the acquired knowledge, we proposed a solution using neural networks. The next part of the article deals with experiments with our neural network and different lengths of the input vector. The last part contains an evaluation of the experiments and an overall summary.","PeriodicalId":316100,"journal":{"name":"2021 International Conference on Information and Digital Technologies (IDT)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131844482","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-06-22DOI: 10.1109/IDT52577.2021.9497611
M. Zaghouani, H. Nemouchi, J. Sztrik
The principle of balking and reneging on Cognitive Radio Networks taking into consideration servers unreliability, is investigated in this paper. In today’s networking environment, the concepts of balking and reneging are very common. The more crowded the system is, the more discouraged potential customers will be, on the other hand, once their total waiting time hits the maximum, impatient users exit the system. To be closer to real-life scenarios, servers unreliability is taken into consideration.
{"title":"Reliability analysis of Cognitive Radio Networks with balking and reneging","authors":"M. Zaghouani, H. Nemouchi, J. Sztrik","doi":"10.1109/IDT52577.2021.9497611","DOIUrl":"https://doi.org/10.1109/IDT52577.2021.9497611","url":null,"abstract":"The principle of balking and reneging on Cognitive Radio Networks taking into consideration servers unreliability, is investigated in this paper. In today’s networking environment, the concepts of balking and reneging are very common. The more crowded the system is, the more discouraged potential customers will be, on the other hand, once their total waiting time hits the maximum, impatient users exit the system. To be closer to real-life scenarios, servers unreliability is taken into consideration.","PeriodicalId":316100,"journal":{"name":"2021 International Conference on Information and Digital Technologies (IDT)","volume":"165 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115436933","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-06-22DOI: 10.1109/IDT52577.2021.9497596
Marek Kvet
Healthcare represents one of the most important disciplines to ensure certain life quality for human beings. Its importance can be fully shown mainly in emergency situations, in which health or life finds itself in direct danger. Emergency medical service systems face significant challenges and they should perform as effectively as possible. From the viewpoint of clients, to whom the associated service is provided, one of the most important and most frequently used criteria in system optimization takes into account service accessibility for clients. Thus, the usual objective can be expressed by minimization of the distance to the nearest source of service from each client location. This paper focuses on additional fairness constraints, which take into account those clients, which are far from any located service center. Presented computational study is aimed at investigation how these fairness constraints affect the computational demands of the problem and how much they may affect the average service accessibility for all clients.
{"title":"Impact of Fairness Constraints on Average Service Accessibility in Emergency Medical System","authors":"Marek Kvet","doi":"10.1109/IDT52577.2021.9497596","DOIUrl":"https://doi.org/10.1109/IDT52577.2021.9497596","url":null,"abstract":"Healthcare represents one of the most important disciplines to ensure certain life quality for human beings. Its importance can be fully shown mainly in emergency situations, in which health or life finds itself in direct danger. Emergency medical service systems face significant challenges and they should perform as effectively as possible. From the viewpoint of clients, to whom the associated service is provided, one of the most important and most frequently used criteria in system optimization takes into account service accessibility for clients. Thus, the usual objective can be expressed by minimization of the distance to the nearest source of service from each client location. This paper focuses on additional fairness constraints, which take into account those clients, which are far from any located service center. Presented computational study is aimed at investigation how these fairness constraints affect the computational demands of the problem and how much they may affect the average service accessibility for all clients.","PeriodicalId":316100,"journal":{"name":"2021 International Conference on Information and Digital Technologies (IDT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115559521","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-06-22DOI: 10.1109/IDT52577.2021.9497555
J. Kučera, N. Adamko, Michal Varga
Computing triangular meshes with constrained edges requires both advanced mathematics and thoughtful logic of the implemented algorithm. Our approach to this is modifying an already created triangulation (e.g., Delaunay triangulation), which can be constructed by a simple algorithm. By swapping edges between triangles and splitting them in needed scenarios, we achieve a mathematically simple algorithm, that supports the construction of wanted edges. This algorithm has been tested in a scenario where it was used to automatically generate terrain based on an infrastructure of a railway station model.
{"title":"Securing Constrained Edges in a Triangulation","authors":"J. Kučera, N. Adamko, Michal Varga","doi":"10.1109/IDT52577.2021.9497555","DOIUrl":"https://doi.org/10.1109/IDT52577.2021.9497555","url":null,"abstract":"Computing triangular meshes with constrained edges requires both advanced mathematics and thoughtful logic of the implemented algorithm. Our approach to this is modifying an already created triangulation (e.g., Delaunay triangulation), which can be constructed by a simple algorithm. By swapping edges between triangles and splitting them in needed scenarios, we achieve a mathematically simple algorithm, that supports the construction of wanted edges. This algorithm has been tested in a scenario where it was used to automatically generate terrain based on an infrastructure of a railway station model.","PeriodicalId":316100,"journal":{"name":"2021 International Conference on Information and Digital Technologies (IDT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128514243","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：