Mazyar Ghezelji, Chitra Dadkhah, Nasim Tohidi, Alexander Gelbukh
—Recommender systems are one of the most used tools for knowledge discovery in databases, and they have become extremely popular in recent years. These systems have been applied in many internet-based communities and businesses to make personalized recommendations and acquire higher profits. Core entities in recommender systems are ratings given by users to items. However, there is much additional information which using it can result in better performance. The personality of each user is one of the most useful data that can help the system produce more accurate and suitable recommendations for active users. It is noteworthy that the characteristics of a person can directly affect his/her behavior. Therefore, in this paper, the personality of users is identified, and a novel mathematical and algorithmic approach is proposed in order to utilize this information for making suitable recommendations. The base model in our proposed approach is matrix factorization, which is one of the most powerful methods in model-based recommender systems. Experimental results on MovieLens dataset demonstrate the positive impact of using personality information in the matrix factorization technique, and also reveal better performance by comparing them with the state-of-the-art algorithms.
{"title":"Personality-Based Matrix Factorization for Personalization in Recommender Systems","authors":"Mazyar Ghezelji, Chitra Dadkhah, Nasim Tohidi, Alexander Gelbukh","doi":"10.52547/itrc.14.1.48","DOIUrl":"https://doi.org/10.52547/itrc.14.1.48","url":null,"abstract":"—Recommender systems are one of the most used tools for knowledge discovery in databases, and they have become extremely popular in recent years. These systems have been applied in many internet-based communities and businesses to make personalized recommendations and acquire higher profits. Core entities in recommender systems are ratings given by users to items. However, there is much additional information which using it can result in better performance. The personality of each user is one of the most useful data that can help the system produce more accurate and suitable recommendations for active users. It is noteworthy that the characteristics of a person can directly affect his/her behavior. Therefore, in this paper, the personality of users is identified, and a novel mathematical and algorithmic approach is proposed in order to utilize this information for making suitable recommendations. The base model in our proposed approach is matrix factorization, which is one of the most powerful methods in model-based recommender systems. Experimental results on MovieLens dataset demonstrate the positive impact of using personality information in the matrix factorization technique, and also reveal better performance by comparing them with the state-of-the-art algorithms.","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129072695","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}
2021 Abstract —In this study, an image retrieval system is proposed based on complex network model. Assuming a prior image categorization, firstly, a multilayered complex network is constructed between the images of each category according to the color, texture, and shape features. Secondly, by defining a meta-path as the way of connecting two images in the network, a set of informative meta-paths are composed to find the similar images by exploring the network. The established complex network provides an efficient way to benefit from the image correlations to enhance the similarity search of the images. On the other hand, employing diverse meta-paths with different semantics leads to measuring the image similarities based on effective image features for each category. The primary results indicate the efficiency and validity of the proposed
{"title":"A Multilayered Complex Network Model for Image Retrieval","authors":"Hadi i Shakibian, Nasrollah Moghadam Charkari","doi":"10.52547/itrc.13.4.36","DOIUrl":"https://doi.org/10.52547/itrc.13.4.36","url":null,"abstract":"2021 Abstract —In this study, an image retrieval system is proposed based on complex network model. Assuming a prior image categorization, firstly, a multilayered complex network is constructed between the images of each category according to the color, texture, and shape features. Secondly, by defining a meta-path as the way of connecting two images in the network, a set of informative meta-paths are composed to find the similar images by exploring the network. The established complex network provides an efficient way to benefit from the image correlations to enhance the similarity search of the images. On the other hand, employing diverse meta-paths with different semantics leads to measuring the image similarities based on effective image features for each category. The primary results indicate the efficiency and validity of the proposed","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123652877","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}
2021 Abstract — The recent explosion of data of all kinds (persistent and short-lived) have imposed processing speed constraints on big data processing systems (BDPSs). One such constraint on running these systems in Cloud computing environments is to utilize as many parallel processors as required to process data fast. Consequently, the nodes in a Cloud environment encounter highly crowded clusters of computational units. To properly cater for high degree of parallelism to process data fast, efficient task and resource allocation schemes are required. These schemes must distribute tasks on the nodes in a way to yield highest resource utilization as possible. Such scheduling has proved even more complex in the case of processing of short-lived data. Task scheduling is vital not only to handle big data but also to provide fast processing of data to satisfy modern time data processing constraints. To this end, this paper reviews the most recently published (2020-2021) task scheduling schemes and their deployed algorithms from the fast data processing perspective
{"title":"A Survey on Task Scheduling Algorithms in Cloud Computing for Fast Big Data Processing","authors":"Zahra Jalalian, Mohsen Sharifi","doi":"10.52547/itrc.13.4.28","DOIUrl":"https://doi.org/10.52547/itrc.13.4.28","url":null,"abstract":"2021 Abstract — The recent explosion of data of all kinds (persistent and short-lived) have imposed processing speed constraints on big data processing systems (BDPSs). One such constraint on running these systems in Cloud computing environments is to utilize as many parallel processors as required to process data fast. Consequently, the nodes in a Cloud environment encounter highly crowded clusters of computational units. To properly cater for high degree of parallelism to process data fast, efficient task and resource allocation schemes are required. These schemes must distribute tasks on the nodes in a way to yield highest resource utilization as possible. Such scheduling has proved even more complex in the case of processing of short-lived data. Task scheduling is vital not only to handle big data but also to provide fast processing of data to satisfy modern time data processing constraints. To this end, this paper reviews the most recently published (2020-2021) task scheduling schemes and their deployed algorithms from the fast data processing perspective","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121526642","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}
—Although applying new Internet-based communication technologies on industrial physical processes made great improvements in factory automation, there are still many challenges to meet the response time and reliability requirements of industrial communications. These challenges resulted from strict real-time requirements of industrial control system communications which are performed in harsh environments. The controller area network (CAN) communication protocol is commonly employed to deal with these challenges. However, in this protocol, even message retransmission requests of a faulty node can lead to timing failures. In this paper, to control the behavior of nodes, message retransmission is performed based on the criticality level of message reception. The proposed method, called MRMC+, improves the real-time behavior of a CAN bus in terms of response time by an average of 36.32% and 18.02%, respectively, compared to the standard CAN and WCTER-based approaches.
{"title":"Real-Timeness Improvement of CAN-based Industrial Networks Based on Criticality Level","authors":"Ismail Ghodsollahee, Yasser Sedaghat","doi":"10.52547/itrc.13.4.8","DOIUrl":"https://doi.org/10.52547/itrc.13.4.8","url":null,"abstract":"—Although applying new Internet-based communication technologies on industrial physical processes made great improvements in factory automation, there are still many challenges to meet the response time and reliability requirements of industrial communications. These challenges resulted from strict real-time requirements of industrial control system communications which are performed in harsh environments. The controller area network (CAN) communication protocol is commonly employed to deal with these challenges. However, in this protocol, even message retransmission requests of a faulty node can lead to timing failures. In this paper, to control the behavior of nodes, message retransmission is performed based on the criticality level of message reception. The proposed method, called MRMC+, improves the real-time behavior of a CAN bus in terms of response time by an average of 36.32% and 18.02%, respectively, compared to the standard CAN and WCTER-based approaches.","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122166524","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 investigates a novel method to solve distributed optimization problems in the presence of communication delays between the networked agents that cooperate together to find an optimal solution of a global cost function composed of local ones. In the problem of distributed optimization in a network of multi-agent because of existing phenomena such as communication delay, deriving approaches having appropriate performance so that the states of all agents converge to the same value always has been a substantial challenge. Delay-dependent conditions in the form of linear matrix inequities are derived to analyze the convergence of the introduced scheme to the optimal solution. It is demonstrated that the maximum allowable time delay in the network and convergence rate of the optimization procedure are increased by the suggested strategy. Finally, comparative simulation results are considered to illustrate the superior performance of the introduced scheme compared to a rival one in the literature.
{"title":"A Distributed Optimization Approach for Multi-Agent Systems over Delaying Networks","authors":"Farshad Rahiimi","doi":"10.52547/itrc.13.4.18","DOIUrl":"https://doi.org/10.52547/itrc.13.4.18","url":null,"abstract":"—This paper investigates a novel method to solve distributed optimization problems in the presence of communication delays between the networked agents that cooperate together to find an optimal solution of a global cost function composed of local ones. In the problem of distributed optimization in a network of multi-agent because of existing phenomena such as communication delay, deriving approaches having appropriate performance so that the states of all agents converge to the same value always has been a substantial challenge. Delay-dependent conditions in the form of linear matrix inequities are derived to analyze the convergence of the introduced scheme to the optimal solution. It is demonstrated that the maximum allowable time delay in the network and convergence rate of the optimization procedure are increased by the suggested strategy. Finally, comparative simulation results are considered to illustrate the superior performance of the introduced scheme compared to a rival one in the literature.","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131795807","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}
— In this paper, we show that the digital code bits used in the coded time-modulated arrays (TMA) can be interpreted as vector elements, and with this new interpretation, a better understanding of the relationship between the codes and the amplitude/phase of the generated harmonic signals is obtained. Using such interpretation, we first select the proper codes for the maximum radiation in a coded TMA, and then we show that one can easily perform the beam steering in a TMA by electronically shifting the bits of the selected codes. Through full-wave simulations, we demonstrate the beam steering of a TMA without the use of any phase shifter, and only by shifting the digital code bits. The proposed interpretation can play an important role in reducing the complexity of the code selection in controlling of TMAs.
{"title":"A New Look at the Coding in Time-Modulated Arrays","authors":"M. Gholami, E. Sadeghi, M. Neshat","doi":"10.52547/itrc.13.4.1","DOIUrl":"https://doi.org/10.52547/itrc.13.4.1","url":null,"abstract":"— In this paper, we show that the digital code bits used in the coded time-modulated arrays (TMA) can be interpreted as vector elements, and with this new interpretation, a better understanding of the relationship between the codes and the amplitude/phase of the generated harmonic signals is obtained. Using such interpretation, we first select the proper codes for the maximum radiation in a coded TMA, and then we show that one can easily perform the beam steering in a TMA by electronically shifting the bits of the selected codes. Through full-wave simulations, we demonstrate the beam steering of a TMA without the use of any phase shifter, and only by shifting the digital code bits. The proposed interpretation can play an important role in reducing the complexity of the code selection in controlling of TMAs.","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128942130","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
扫码关注我们
求助内容：
应助结果提醒方式：