{"title":"Resource Management for a Multi-Channel Cognitive-NOMA D2D Network","authors":"Javad Zeraatkar Moghaddam, M. Ardebilipour","doi":"10.52547/itrc.14.4.1","DOIUrl":"https://doi.org/10.52547/itrc.14.4.1","url":null,"abstract":"","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123988849","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":"Collaborative Mappers based on Co-evolutionary Optimization Technique in MapReduce","authors":"M. Ahmadi, D. Maleki","doi":"10.52547/itrc.14.4.28","DOIUrl":"https://doi.org/10.52547/itrc.14.4.28","url":null,"abstract":"","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"48 16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131448590","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":"Digital Image Enhancement Through Bi-Histogram Equalization Using Entropy-Based Plateau Limit","authors":"Vida Safardoulabi, K. Rahbar","doi":"10.52547/itrc.14.4.36","DOIUrl":"https://doi.org/10.52547/itrc.14.4.36","url":null,"abstract":"","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"296 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122409865","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":"Providing a Solution to Reduce Energy Consumption in IoT-Based WSNs Based on Node Activity Management","authors":"M. Isvandi","doi":"10.52547/itrc.14.4.9","DOIUrl":"https://doi.org/10.52547/itrc.14.4.9","url":null,"abstract":"","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125717934","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":"Stance Detection Dataset for Persian Tweets","authors":"M. Bokaei, M. Farhoodi, Mona Davoudi","doi":"10.52547/itrc.14.4.46","DOIUrl":"https://doi.org/10.52547/itrc.14.4.46","url":null,"abstract":"","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134475590","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":"Spectrum Similarity-Based Quality Assessment Metric","authors":"S. Aghapour Maleki, H. Ghassemian, M. Imani","doi":"10.52547/itrc.14.4.19","DOIUrl":"https://doi.org/10.52547/itrc.14.4.19","url":null,"abstract":"","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"60 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133488841","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}
Ebrahim Mahdipour, Ali Aghamohammadpour, I. Attarzadeh
— Ransomware attacks are taking advantage of the ongoing coronavirus pandemics and attacking the vulnerable systems in the health sector. Modeling ransomware attacks help to identify and simulate attacks against security environments, using likely adversary techniques. Process Mining (PM) is a field of study that focuses on analyzing process logs linked with the execution of the processes of a system to acquire insight into the variety of characteristics of how the functions behave. This paper presents a PM conformance-based approach to determining ransomware processes. First, frequent ransomware techniques were identified using state-of-the-art MITRE ATT&CK. Then, a model was developed to gather ransomware techniques using a process-based approach. The PM-based Prom tool is used to check the conformance of malware processes alongside the presented model to illustrate its efficiency. The model can identify chain processes associated with ransom-related behaviors. In this study, the presented model was evaluated using thirty common malwares in the healthcare industry. The approach demonstrates that this model could successfully classify ninety percent of malware instances as ransomware and non-ransomware. Finally, guidelines for future research are provided. We believe the proposed method will uncover behavioral models that will enable us to hunt ransomware threats.
{"title":"Ransomware Modeling Based on a Process Mining Approach","authors":"Ebrahim Mahdipour, Ali Aghamohammadpour, I. Attarzadeh","doi":"10.52547/itrc.14.3.27","DOIUrl":"https://doi.org/10.52547/itrc.14.3.27","url":null,"abstract":"— Ransomware attacks are taking advantage of the ongoing coronavirus pandemics and attacking the vulnerable systems in the health sector. Modeling ransomware attacks help to identify and simulate attacks against security environments, using likely adversary techniques. Process Mining (PM) is a field of study that focuses on analyzing process logs linked with the execution of the processes of a system to acquire insight into the variety of characteristics of how the functions behave. This paper presents a PM conformance-based approach to determining ransomware processes. First, frequent ransomware techniques were identified using state-of-the-art MITRE ATT&CK. Then, a model was developed to gather ransomware techniques using a process-based approach. The PM-based Prom tool is used to check the conformance of malware processes alongside the presented model to illustrate its efficiency. The model can identify chain processes associated with ransom-related behaviors. In this study, the presented model was evaluated using thirty common malwares in the healthcare industry. The approach demonstrates that this model could successfully classify ninety percent of malware instances as ransomware and non-ransomware. Finally, guidelines for future research are provided. We believe the proposed method will uncover behavioral models that will enable us to hunt ransomware threats.","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123093630","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}
Roghayeh Doost, P. Hajipour, Saber Shahidzadeh, Roghieh Roghieh Karimzadeh Baee
—Determining and observing the minimum allowable distance of the marine earth station in motion (M-ESIM) from the shore prevents its destructive interference on the co-frequency shore fixed station. ESIMs are providing broadband Fixed Satellite Services (FSS). This paper studies the parameters involved in determining the minimum allowable distance of the ship from the shore by the interference simulation. The results show that with decreasing the carrier frequency, decreasing latitude or increasing the number of annual passing vessels, this minimum distance increases. In this paper a methodology is presented and simulated to keep constant the minimum allowed distance by adjusting the values of the frequency dependent rejection (FDR). FDR is caused by shifting the M-ESIM frequency band. The minimum distance of 100, 105 and 110Km is evaluated in this paper. In this way, the M-ESIM can be close to the shore as near as the desired distance using the FDR adjustment.
{"title":"FDR Adjustment for Achieving Desired Minimum Distance of Marine ESIM from the Shore","authors":"Roghayeh Doost, P. Hajipour, Saber Shahidzadeh, Roghieh Roghieh Karimzadeh Baee","doi":"10.52547/itrc.14.3.1","DOIUrl":"https://doi.org/10.52547/itrc.14.3.1","url":null,"abstract":"—Determining and observing the minimum allowable distance of the marine earth station in motion (M-ESIM) from the shore prevents its destructive interference on the co-frequency shore fixed station. ESIMs are providing broadband Fixed Satellite Services (FSS). This paper studies the parameters involved in determining the minimum allowable distance of the ship from the shore by the interference simulation. The results show that with decreasing the carrier frequency, decreasing latitude or increasing the number of annual passing vessels, this minimum distance increases. In this paper a methodology is presented and simulated to keep constant the minimum allowed distance by adjusting the values of the frequency dependent rejection (FDR). FDR is caused by shifting the M-ESIM frequency band. The minimum distance of 100, 105 and 110Km is evaluated in this paper. In this way, the M-ESIM can be close to the shore as near as the desired distance using the FDR adjustment.","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134594172","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}
—Today we live in a period that is known to an area of communication. By increasing the information on the internet, the extra news are published on news agencies websites or other resources, the users are confused more with the problems of finding their desired information and related news. Among these are recommended systems they can automatically finding the news and information of their favorite’s users and suggesting to them too. This article attempts to improve the user’s interests and user’s satisfactions by refining the content based recommendation system to suggest better sources to their users. A clustering approach has been used to carry out this improvement. An attempt has been made to define a cluster threshold for clustering the same news and information in the K-means clustering algorithm. By detecting best resemblance criterion value and using an external knowledge base (ontology), we could generalize words into a set of related words (instead of using them alone). This approach is promoted the accuracy of news clustering and use the provided cluster to find user’s favorite news and also could have suggest the news to the user. Since the dataset has an important and influential role in advisory recommended systems, the standard Persian dataset is not provided and not published yet. In this research, an attempted has been made to connect and publish the dataset to finish the effect of this vacuum. The data are collected and crawl 8 periods of days from the Tabnak news agency website. The profile of each volunteers has been created and also saved at the same time as they read the favorite news on that period of time. An analysis shows that the proposed clustering approach provided by the NMI criterion has reached 70.2% on our the dataset. Also, using the suggested clustering recommendation system yield 89.2% performance based on the accuracy criterion, which shows an improvement of 8.5% in a standardized way.
{"title":"Improving Content-Based Recommender System For Clustering Documents Based on Ontology And New Hierarchical Clustering Method","authors":"Maryam Hourali, Mansoureh Hourali","doi":"10.52547/itrc.14.3.37","DOIUrl":"https://doi.org/10.52547/itrc.14.3.37","url":null,"abstract":"—Today we live in a period that is known to an area of communication. By increasing the information on the internet, the extra news are published on news agencies websites or other resources, the users are confused more with the problems of finding their desired information and related news. Among these are recommended systems they can automatically finding the news and information of their favorite’s users and suggesting to them too. This article attempts to improve the user’s interests and user’s satisfactions by refining the content based recommendation system to suggest better sources to their users. A clustering approach has been used to carry out this improvement. An attempt has been made to define a cluster threshold for clustering the same news and information in the K-means clustering algorithm. By detecting best resemblance criterion value and using an external knowledge base (ontology), we could generalize words into a set of related words (instead of using them alone). This approach is promoted the accuracy of news clustering and use the provided cluster to find user’s favorite news and also could have suggest the news to the user. Since the dataset has an important and influential role in advisory recommended systems, the standard Persian dataset is not provided and not published yet. In this research, an attempted has been made to connect and publish the dataset to finish the effect of this vacuum. The data are collected and crawl 8 periods of days from the Tabnak news agency website. The profile of each volunteers has been created and also saved at the same time as they read the favorite news on that period of time. An analysis shows that the proposed clustering approach provided by the NMI criterion has reached 70.2% on our the dataset. Also, using the suggested clustering recommendation system yield 89.2% performance based on the accuracy criterion, which shows an improvement of 8.5% in a standardized way.","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132807428","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 a multiplex network, there exists different types of relationships between the same set of nodes such as people which have different accounts in online social networks. Previous researches have proved that in a multiplex network the structural features of different layers are interrelated. Therefore, effective use of information from other layers can improve link prediction accuracy in a specific layer. In this paper, we propose a new inter-layer similarity metric DSMN, for predicting missing links in multiplex networks. We then combine this metric with a strong intra-layer similarity metric to enhance the performance of link prediction. The efficiency of our proposed method has been evaluated on both real-world and synthetic networks and the experimental results indicate the outperformance of the proposed method in terms of prediction accuracy in comparison with similar methods
{"title":"DSMN: A New Approach for Link Prediction in Multilplex Networks","authors":"Samira Rafiee Samira Rafiee, Alireza Abdollahpouri","doi":"10.52547/itrc.14.3.19","DOIUrl":"https://doi.org/10.52547/itrc.14.3.19","url":null,"abstract":"— In a multiplex network, there exists different types of relationships between the same set of nodes such as people which have different accounts in online social networks. Previous researches have proved that in a multiplex network the structural features of different layers are interrelated. Therefore, effective use of information from other layers can improve link prediction accuracy in a specific layer. In this paper, we propose a new inter-layer similarity metric DSMN, for predicting missing links in multiplex networks. We then combine this metric with a strong intra-layer similarity metric to enhance the performance of link prediction. The efficiency of our proposed method has been evaluated on both real-world and synthetic networks and the experimental results indicate the outperformance of the proposed method in terms of prediction accuracy in comparison with similar methods","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132018834","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
扫码关注我们
求助内容：
应助结果提醒方式：