A. Maric, V. Lipovac, Pamela Njemcevic, Enio Kaljic
{"title":"An Alternative Approach in Derivation of Nakagami-m Distribution","authors":"A. Maric, V. Lipovac, Pamela Njemcevic, Enio Kaljic","doi":"10.1109/icat47117.2019.8938983","DOIUrl":"https://doi.org/10.1109/icat47117.2019.8938983","url":null,"abstract":"Nakagami-m probability density function (pdf) is one of the frequently used distributions for describing fast received signal variations in radio channels, obtained as a result of multipath phenomenon. It is foremost derived by assuming the most general multipath channel model but applying mathematical approximations. Afterward, it is derived without approximations, but based on dedicated physical models with many constraints. Consequently, neither approach can be considered both, universally applicable and exact. Accordingly, in this paper, a novel approach in deriving Nakagami-m pdf is provided, being based on fewer constraints on propagation phenomena than others. Herein, it is shown that Nakagami-m pdf can be obtained as a distribution of a Euclidean distance of a point orthogonally projected from homogeneous distributed n-dimensional hypersphere on N-dimensional space, where received signal envelope is interpreted as mentioned Euclidean distance, with $n$ being a total number of orthogonal multipath components which can reach the receiver in idealized condition and $N$ being a number of these components which reach the receiver in reality (with N < n).","PeriodicalId":214902,"journal":{"name":"2019 XXVII International Conference on Information, Communication and Automation Technologies (ICAT)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127044239","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}
Bjoern Holste, V. Stankovski, Petar Kochovski, A. Puliafito, Philippe Massonet
{"title":"Blockchain Based Variability Management Solutions for Fog Native Open Source Software","authors":"Bjoern Holste, V. Stankovski, Petar Kochovski, A. Puliafito, Philippe Massonet","doi":"10.1109/icat47117.2019.8938888","DOIUrl":"https://doi.org/10.1109/icat47117.2019.8938888","url":null,"abstract":"The complexity of Cloud-Fog-Edge computing systems is high due to the high variability which can be expected to grow further in the future with more IoT devices, computing architecture and specific requirements from security, regulation and users. One way to manage this complexity is to consider the Cloud-Fog-Edge Continuum as a single infrastructure of devices and components to be used in a seamless way to deliver new advanced services. Such a framework would integrate the handling of all connected devices, requirements and manage their variability. This paper proposes a framework called VarOps which provides an intuitive Workbench, enabling the design of software considering variability, making possible the re-use of dockerized components to significantly increase efficiency in development of new solutions. VarOps exploits Blockchain as a distributed ledger technology, variability formal modelling approaches, Smart Contracts, Trustful and Trustless Smart Oracles and knowledge management solutions as the underlying technologies and presents some example use cases.","PeriodicalId":214902,"journal":{"name":"2019 XXVII International Conference on Information, Communication and Automation Technologies (ICAT)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115074459","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}
Tarik Hrnjić, I. Džafić, Haris Ačkar, S. Huseinbegović
{"title":"Impact of Distributed Generation on Performance of Power Flow Methods","authors":"Tarik Hrnjić, I. Džafić, Haris Ačkar, S. Huseinbegović","doi":"10.1109/icat47117.2019.8938950","DOIUrl":"https://doi.org/10.1109/icat47117.2019.8938950","url":null,"abstract":"Distribution network power flow (DNPF) is a core application of distribution management system (DMS). Two methods to implement fast DNPF are using Newton-Raphson (NR) approach and current iteration (CI) approach. In distribution systems with high penetration of renewable energy sources both methods must be able to model PV nodes correctly and efficiently. This paper explores implementations of NR DNPF and CI DNPF, their execution time and performance in networks with numerous distributed generators.","PeriodicalId":214902,"journal":{"name":"2019 XXVII International Conference on Information, Communication and Automation Technologies (ICAT)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133939184","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":"Analysis of Fault Tolerance in Permissioned Blockchain Networks","authors":"Blaž Podgorelec, Vid Keršič, Muhamed Turkanović","doi":"10.1109/icat47117.2019.8938836","DOIUrl":"https://doi.org/10.1109/icat47117.2019.8938836","url":null,"abstract":"Blockchain fundamentals are based on a distributed peer-to-peer network, which has to deal with fault tolerances, like all other similar networks. This is specifically important for blockchain technology, due to its promised data integrity features like immutability and traceability. In this paper, we analyze the basic principles of distributed consensus algorithms while focusing on permissioned blockchain networks. We analyze how distributed consensus mechanisms in two permissioned blockchain networks (Hyperledger Fabric and Iroha) cope with a crash fault-prone environment.","PeriodicalId":214902,"journal":{"name":"2019 XXVII International Conference on Information, Communication and Automation Technologies (ICAT)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133011098","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":"Non-uniform sampling using synchronised ADCs","authors":"K. Dudácek","doi":"10.1109/icat47117.2019.8938958","DOIUrl":"https://doi.org/10.1109/icat47117.2019.8938958","url":null,"abstract":"Some microcontrollers of the STM32 family are equipped with two or three synchronised ADCs. Non-uniform sampling could be utilized for increasing an unaliased signal bandwidth, that could be processed by these microcontrollers. In this paper, conversion timing was studied, and non-uniform sampling function proposed in order to exploit the ADC as most as possible. It was found that attenuation of a sample&hold circuit limits an input bandwidth earlier than aliasing, nevertheless, it is still significantly wider bandwidth than an unaliased bandwidth without usage of non-uniform sampling.","PeriodicalId":214902,"journal":{"name":"2019 XXVII International Conference on Information, Communication and Automation Technologies (ICAT)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133990880","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":"NeurIPS Conference Papers Classification Based on Topic Modeling","authors":"Ajsa Terko, E. Žunić, D. Donko","doi":"10.1109/icat47117.2019.8938961","DOIUrl":"https://doi.org/10.1109/icat47117.2019.8938961","url":null,"abstract":"Paper illustrates the process of topic modeling and text classification. Specifically, the dataset used is a corpus consisting of scientific publications published by Neural Information Systems Processing Conference. Topic modeling itself is performed using Latent Dirichlet Allocation model. It is followed by optimization of a number of topics on the basis of topic coherence, a quality measure of human interpretability. Results of topic modeling are used for labeling data prior to text classification. Labels are determined based on the distribution of assigned papers' topics over time. Specifically, peak changes used for differentiating between time periods dominated by specific topics are calculated as a Kullback-Leibler divergence. Finally, transforming data into the feature vectors, several different text classification approaches are evaluated. As observed, the greatest accuracy score is recorded for the use of extreme gradient boosting classifier being 77.1%.","PeriodicalId":214902,"journal":{"name":"2019 XXVII International Conference on Information, Communication and Automation Technologies (ICAT)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126521609","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":"Optimal City Selection and Concert Tour Planning Based on Heuristic Optimization Methods and the Use of Social Media Analytics","authors":"Sead Delalic, Malek Chahin, Adis Alihodžić","doi":"10.1109/icat47117.2019.8939040","DOIUrl":"https://doi.org/10.1109/icat47117.2019.8939040","url":null,"abstract":"The planning of concert tours can be a challenging process which requires a large amount of data to be analyzed. The greatest profit cannot be obtained only by maximizing the expected number of visitors. However, most of the organizers mainly focus on that part of planning. To achieve the maximum profit possible, organizers must include other data in their analysis. Social media play a powerful role in music industry. Most of the mentioned data can be found online on social media like Facebook, YouTube or Instagram. Such data can be found in analytic sections of fan or event pages. In this paper, algorithms for tour planning have been introduced by using above mentioned data. Proposed algorithms are based on heuristic methods such as simulated annealing and genetic algorithm. A clustering based method is also implemented. Aforementioned algorithms were tested on real-world instances from Facebook fan page analytics and use number of fans and distance between cities.","PeriodicalId":214902,"journal":{"name":"2019 XXVII International Conference on Information, Communication and Automation Technologies (ICAT)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114659458","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":"A New Method for Improving Content-Based Image Retrieval using Deep Learning","authors":"Faruk Mustafic, Irfan Prazina, Vedran Ljubovic","doi":"10.1109/icat47117.2019.8939009","DOIUrl":"https://doi.org/10.1109/icat47117.2019.8939009","url":null,"abstract":"In this work we will show a novel method for improving the performance of content-based image retrieval using a deep neural network. The main focus of the method is training the distance function using the deep neural network and transfer learning. An existing pretrained network for image classification is used as a basis. One of the method's benefits is the fact that the existing network is not retrained and features for the distance function are the neural network's layers which were trained and stored before. The method is tested with the publicly available VGG19 deep neural network. Obtained results are comparable or in some cases better than the state of the art methods with a similar approach.","PeriodicalId":214902,"journal":{"name":"2019 XXVII International Conference on Information, Communication and Automation Technologies (ICAT)","volume":"320 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123491106","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}
Razija Turcinhodzic, S. Ribic, Edo Imamovic, Emilija Zdilar
{"title":"School Timetable - suggestions for a more efficient representation and a solution for schools with shifts","authors":"Razija Turcinhodzic, S. Ribic, Edo Imamovic, Emilija Zdilar","doi":"10.1109/icat47117.2019.8939007","DOIUrl":"https://doi.org/10.1109/icat47117.2019.8939007","url":null,"abstract":"Creating school timetables is a problem whose complexity varies depending on school size and the requirements that occur in a model. The topic of this paper is related to schools that lack resources because they work in shifts and they are rarely discussed in literature. The first problem is the way the requirements are written. The paper deals with the XHSTT format and REDOSPLAT, a domain-specific language designed to set up timetable requirements. Another problem is the way a model is solved. We investigated the VNS and SVNS algorithms because they showed good results for this type of school. Their application on the actual test cases also revealed some interesting phenomena in formulating the requirements that can significantly affect the quality of the solution.","PeriodicalId":214902,"journal":{"name":"2019 XXVII International Conference on Information, Communication and Automation Technologies (ICAT)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129090098","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}