Two of the very well-known hash algorithms from SHA2 (SHA-2) family include SHA-256 and SHA-512. Nowadays, there exists another hash algorithms family -- SHA3(SHA-3), which includes SHA3-256 and SHA3-512 algorithms, also known as Keccak algorithms. This paper provides a comparison of the empirical performance calculations with these 4 algorithms with different input volumes of sequential data (where every next slice of information is dependent of previous one) to make it impossible for parallel computation. For the purpose of calculations, 4 totally different environments are used but with exact number of CPUs and approximately similar amount of memory (using only standard instances types) -- one personal computer from one side and 3 of the biggest public cloud providers from another -- Amazon AWS (t2.medium), Microsoft Azure (Standard D2s v3) and Google Cloud (n1-standard-2). The purpose of the research is to compare these environments in terms of additional compute calculations and additional storage space (volumes and prices) for the presented new security improvement of the Merkle-root calculation. The Merkle-root is an integral part of the blockchain and therefore, security improvement of this component is a security improvement of the whole blockchain structure.
{"title":"Security Improvement in a Modified Merkle-tree: Computation and Storage Comparison Between Different Cloud Providers","authors":"I. Chenchev","doi":"10.1145/3351556.3351569","DOIUrl":"https://doi.org/10.1145/3351556.3351569","url":null,"abstract":"Two of the very well-known hash algorithms from SHA2 (SHA-2) family include SHA-256 and SHA-512. Nowadays, there exists another hash algorithms family -- SHA3(SHA-3), which includes SHA3-256 and SHA3-512 algorithms, also known as Keccak algorithms. This paper provides a comparison of the empirical performance calculations with these 4 algorithms with different input volumes of sequential data (where every next slice of information is dependent of previous one) to make it impossible for parallel computation. For the purpose of calculations, 4 totally different environments are used but with exact number of CPUs and approximately similar amount of memory (using only standard instances types) -- one personal computer from one side and 3 of the biggest public cloud providers from another -- Amazon AWS (t2.medium), Microsoft Azure (Standard D2s v3) and Google Cloud (n1-standard-2). The purpose of the research is to compare these environments in terms of additional compute calculations and additional storage space (volumes and prices) for the presented new security improvement of the Merkle-root calculation. The Merkle-root is an integral part of the blockchain and therefore, security improvement of this component is a security improvement of the whole blockchain structure.","PeriodicalId":126836,"journal":{"name":"Proceedings of the 9th Balkan Conference on Informatics","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126953873","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}
At present, the technique of coordinating a team of robots in a manner that is responsive to communication failures, presents itself as an actual challenge. In swarm scenarios where the concept for the teams of robots requires performing cooperative tasks, robots need to be enforced to communicate with each other in the background while executing specific collaborative missions. In order to achieve complex tasks in real-time beyond their individual capability, multi-robot systems (MRS) require a stable, sustained and secure stream of data exchange. Typically, this technique also requires an approach of communication and synchronization among the robots known as swarm R2R (robot to robot) communication in real time [1]. This paper presents a theoretical concept for a wireless mesh robot network that can be protected against electromagnetic interference (EMI), electromagnetic jamming, RF denial-of-service (DoS) attacks, and eavesdropping. The team behind this paper aims to present and propose a conceptual model for a hybrid short-range modular wireless transceiver (HSMWT) used in a distributed network environment. Specific issues on designing HSMWT based on the light and sound mediums for this environment will be explored.
{"title":"Emerging and secured mobile ad-hoc wireless network (MANET) for swarm applications","authors":"A. Anguelov, R. Trifonov, Ognian Nakov","doi":"10.1145/3351556.3351557","DOIUrl":"https://doi.org/10.1145/3351556.3351557","url":null,"abstract":"At present, the technique of coordinating a team of robots in a manner that is responsive to communication failures, presents itself as an actual challenge. In swarm scenarios where the concept for the teams of robots requires performing cooperative tasks, robots need to be enforced to communicate with each other in the background while executing specific collaborative missions. In order to achieve complex tasks in real-time beyond their individual capability, multi-robot systems (MRS) require a stable, sustained and secure stream of data exchange. Typically, this technique also requires an approach of communication and synchronization among the robots known as swarm R2R (robot to robot) communication in real time [1]. This paper presents a theoretical concept for a wireless mesh robot network that can be protected against electromagnetic interference (EMI), electromagnetic jamming, RF denial-of-service (DoS) attacks, and eavesdropping. The team behind this paper aims to present and propose a conceptual model for a hybrid short-range modular wireless transceiver (HSMWT) used in a distributed network environment. Specific issues on designing HSMWT based on the light and sound mediums for this environment will be explored.","PeriodicalId":126836,"journal":{"name":"Proceedings of the 9th Balkan Conference on Informatics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125667492","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}
Konstantinos Georgiou, M. Papoutsoglou, A. Vakali, L. Angelis
Software design and development technologies evolve very fast and in unpredicted rates, posing many challenges for programmers who strive to use them properly and to be up-to-date, especially since software development demands teamwork and collaboration. As a result, Question and Answer (Q&A) sites, like Stack Overflow, have seen large growth. The questions are characterized by tags, which support developers to easily trace their topic of interest. Very often, these tags refer to technologies that are connected or serve the same purpose. This work is motivated by the fact that despite the volume of questions and technologies change over time, tags inter-connections carry insightful information since they can be utilized to monitor the technology trends and their dynamics given technologies fast simultaneous evolution over time. This work recognizes the value of such connections, to reveal associations of technologies and to support the scientific community, which can be highly inspired by this study, using advanced data analysis tools. Benefits of the present study include early notification of the labor market needs, competency discovery and directions for educational planning. In the present study, graph theory principles and tools were employed to profile chronologically the evolution and the associations of technologies related to tags, and the experimentation carried out has involved the entire set of Stack Overflow questions posted during a decade, between 2008 and 2018. Very interesting conclusions are summarized based on the tags related to Computer Science Technologies (Hard Skills) analysis, revealing non-evident software technologies skills, associations and dynamics.
{"title":"Software technologies skills: A graph-based study to capture their associations and dynamics","authors":"Konstantinos Georgiou, M. Papoutsoglou, A. Vakali, L. Angelis","doi":"10.1145/3351556.3351565","DOIUrl":"https://doi.org/10.1145/3351556.3351565","url":null,"abstract":"Software design and development technologies evolve very fast and in unpredicted rates, posing many challenges for programmers who strive to use them properly and to be up-to-date, especially since software development demands teamwork and collaboration. As a result, Question and Answer (Q&A) sites, like Stack Overflow, have seen large growth. The questions are characterized by tags, which support developers to easily trace their topic of interest. Very often, these tags refer to technologies that are connected or serve the same purpose. This work is motivated by the fact that despite the volume of questions and technologies change over time, tags inter-connections carry insightful information since they can be utilized to monitor the technology trends and their dynamics given technologies fast simultaneous evolution over time. This work recognizes the value of such connections, to reveal associations of technologies and to support the scientific community, which can be highly inspired by this study, using advanced data analysis tools. Benefits of the present study include early notification of the labor market needs, competency discovery and directions for educational planning. In the present study, graph theory principles and tools were employed to profile chronologically the evolution and the associations of technologies related to tags, and the experimentation carried out has involved the entire set of Stack Overflow questions posted during a decade, between 2008 and 2018. Very interesting conclusions are summarized based on the tags related to Computer Science Technologies (Hard Skills) analysis, revealing non-evident software technologies skills, associations and dynamics.","PeriodicalId":126836,"journal":{"name":"Proceedings of the 9th Balkan Conference on Informatics","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129327037","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}
This paper introduces a multiprocessor scheduling algorithm for (m,k)-firm tasks. Firm task sets allow limited deadline misses and therefore the load factor of the task set can be greater than one. Many algorithms exist but most of them concern uniprocessor scheduling. The current paper blends the classical Distance Based Priority (DBP) scheduling algorithm and multiprocessor PFair into pfair-based multiprocessor (m,k)-firm scheduling algorithm.
{"title":"Proportionate (m,k)-firm Scheduling for Multiprocessor Systems","authors":"Ivaylo Atanassov","doi":"10.1145/3351556.3351579","DOIUrl":"https://doi.org/10.1145/3351556.3351579","url":null,"abstract":"This paper introduces a multiprocessor scheduling algorithm for (m,k)-firm tasks. Firm task sets allow limited deadline misses and therefore the load factor of the task set can be greater than one. Many algorithms exist but most of them concern uniprocessor scheduling. The current paper blends the classical Distance Based Priority (DBP) scheduling algorithm and multiprocessor PFair into pfair-based multiprocessor (m,k)-firm scheduling algorithm.","PeriodicalId":126836,"journal":{"name":"Proceedings of the 9th Balkan Conference on Informatics","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127768950","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}
Connecting theory and practice in teaching is sometimes difficult as it requires expensive or delicate equipment, thus limiting the teacher to giving demonstrations in which students are passive participants. Numerical mathematics, as an applied discipline, should be taught on real world examples. By using inexpensive Arduino hardware, we can create simple experiments that are easily reproduced by students. Furthermore, the experiments generate tangible data which can be processed numerically. We present several exercises in numerical mathematics which are based on experiments in electrical engineering with Arduino, and show how to turn them into motivational examples.
{"title":"Arduino and Numerical Mathematics","authors":"D. Herceg, D. Herceg","doi":"10.1145/3351556.3351590","DOIUrl":"https://doi.org/10.1145/3351556.3351590","url":null,"abstract":"Connecting theory and practice in teaching is sometimes difficult as it requires expensive or delicate equipment, thus limiting the teacher to giving demonstrations in which students are passive participants. Numerical mathematics, as an applied discipline, should be taught on real world examples. By using inexpensive Arduino hardware, we can create simple experiments that are easily reproduced by students. Furthermore, the experiments generate tangible data which can be processed numerically. We present several exercises in numerical mathematics which are based on experiments in electrical engineering with Arduino, and show how to turn them into motivational examples.","PeriodicalId":126836,"journal":{"name":"Proceedings of the 9th Balkan Conference on Informatics","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127803135","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}
The image registration by digital still cameras and video cameras requires color filters to be posed onto the photosensitive sensors (CCD or CMOS). The filters are arranged in patterns across the face of the image sensing array. The conventional color filter array (CFA) capture only one color component at each image pixel. The missing colors in the raw sensor data are interpolated by a process called CFA interpolation or demosaicing. Quality of the full-color reconstruction process is mostly relied on demosaicing method applied. Most of the current demosaicing methods are computationally expensive and often too slow for real-time scenarios. Many industrial applications require real-time and high quality demosaicing solutions, and quite often slow image reconstruction process is a real bottleneck. The purpose of this research is to present a comparative performance study of demosaicing algorithms on general-purpose GPUs. The experimental results of CUDA-based implementations of two state-of-the-art and widely applied in practice CFA algorithms are presented. The performance efficiency is assessed and analyzed by experimental studies on a set of real photographic test images on two general-purpose graphic cards. The obtained results demonstrated the benefit of exploiting the contemporary GPUs in speeding up the demosaicing process, especially for practical applications that need to meet real-time and high-speed video processing requirements combined with high quality of the full-color image reconstruction.
{"title":"An Experimental Comparative Performance Study of Demosaicing Algorithms on General-purpose GPUs","authors":"G. Zapryanov, I. Nikolova","doi":"10.1145/3351556.3351561","DOIUrl":"https://doi.org/10.1145/3351556.3351561","url":null,"abstract":"The image registration by digital still cameras and video cameras requires color filters to be posed onto the photosensitive sensors (CCD or CMOS). The filters are arranged in patterns across the face of the image sensing array. The conventional color filter array (CFA) capture only one color component at each image pixel. The missing colors in the raw sensor data are interpolated by a process called CFA interpolation or demosaicing. Quality of the full-color reconstruction process is mostly relied on demosaicing method applied. Most of the current demosaicing methods are computationally expensive and often too slow for real-time scenarios. Many industrial applications require real-time and high quality demosaicing solutions, and quite often slow image reconstruction process is a real bottleneck. The purpose of this research is to present a comparative performance study of demosaicing algorithms on general-purpose GPUs. The experimental results of CUDA-based implementations of two state-of-the-art and widely applied in practice CFA algorithms are presented. The performance efficiency is assessed and analyzed by experimental studies on a set of real photographic test images on two general-purpose graphic cards. The obtained results demonstrated the benefit of exploiting the contemporary GPUs in speeding up the demosaicing process, especially for practical applications that need to meet real-time and high-speed video processing requirements combined with high quality of the full-color image reconstruction.","PeriodicalId":126836,"journal":{"name":"Proceedings of the 9th Balkan Conference on Informatics","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131802425","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}
A novel approach for improving the performance of a image feature matching and recommendation system is proposed that is a major continuation of the previous work in [3]. An advanced clustering method is suggested in order to deal with the binary image feature descriptors: a quantum variant of the k-majority algorithm over ORB descriptors. Jaccard-Needham dissimilarity measure is used as a distance measure step of the algorithm. Finally, the Grover's algorithm is used, providing the opportunity for a specific feature search in the database. The paper also provides the main steps in constructing a similar fast search system. The transformation from a classical to a quantum representation algorithm is described. Such approach can be applied in other applications. Both the computational complexity and the verification correctness are also indicated in the paper.
{"title":"Applying a quantum amplification over a system for image feature matching and image recommendation","authors":"D. Andreev, M. Lazarova","doi":"10.1145/3351556.3351564","DOIUrl":"https://doi.org/10.1145/3351556.3351564","url":null,"abstract":"A novel approach for improving the performance of a image feature matching and recommendation system is proposed that is a major continuation of the previous work in [3]. An advanced clustering method is suggested in order to deal with the binary image feature descriptors: a quantum variant of the k-majority algorithm over ORB descriptors. Jaccard-Needham dissimilarity measure is used as a distance measure step of the algorithm. Finally, the Grover's algorithm is used, providing the opportunity for a specific feature search in the database. The paper also provides the main steps in constructing a similar fast search system. The transformation from a classical to a quantum representation algorithm is described. Such approach can be applied in other applications. Both the computational complexity and the verification correctness are also indicated in the paper.","PeriodicalId":126836,"journal":{"name":"Proceedings of the 9th Balkan Conference on Informatics","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128394637","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}
{"title":"Deep Learning in Brain Computer Interfaces","authors":"P. Georgieva","doi":"10.1145/3351556.3351594","DOIUrl":"https://doi.org/10.1145/3351556.3351594","url":null,"abstract":"","PeriodicalId":126836,"journal":{"name":"Proceedings of the 9th Balkan Conference on Informatics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129618939","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}
K. Diamantaras, Georgios Evangelidis, Y. Manolopoulos, C. Georgiadis, P. Kefalas, D. Stamatis
This volume contains papers presented at the 6th Balkan Conference in Informatics (BCI'13), which was held during September 19--21, 2013, in Thessaloniki, Greece. BCI'13 continued the tradition of the successful BCI series of conferences previously held in Thessaloniki (2003), Ohrid (2005), Sofia (2007), Thessaloniki (2009) and Novi Sad (2012). The main objective of the BCI series of conferences is to provide a forum for dissemination of research accomplishments and to promote interaction, discussions and collaboration among scientists from South-East European countries and the rest of the world. Special emphasis is given to encourage involvement of young researchers from the region to present their work, as well as experts in the field to present current developments in South-East Europe, in the areas of Governance, Education and ICT Professional Issues & Priorities.
{"title":"Proceedings of the 9th Balkan Conference on Informatics","authors":"K. Diamantaras, Georgios Evangelidis, Y. Manolopoulos, C. Georgiadis, P. Kefalas, D. Stamatis","doi":"10.1145/3351556","DOIUrl":"https://doi.org/10.1145/3351556","url":null,"abstract":"This volume contains papers presented at the 6th Balkan Conference in Informatics (BCI'13), which was held during September 19--21, 2013, in Thessaloniki, Greece. \u0000 \u0000BCI'13 continued the tradition of the successful BCI series of conferences previously held in Thessaloniki (2003), Ohrid (2005), Sofia (2007), Thessaloniki (2009) and Novi Sad (2012). \u0000 \u0000The main objective of the BCI series of conferences is to provide a forum for dissemination of research accomplishments and to promote interaction, discussions and collaboration among scientists from South-East European countries and the rest of the world. Special emphasis is given to encourage involvement of young researchers from the region to present their work, as well as experts in the field to present current developments in South-East Europe, in the areas of Governance, Education and ICT Professional Issues & Priorities.","PeriodicalId":126836,"journal":{"name":"Proceedings of the 9th Balkan Conference on Informatics","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123474968","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
扫码关注我们
求助内容：
应助结果提醒方式：