2020 6th International Conference on Web Research (ICWR)最新文献

筛选
英文 中文
A New Method for Intrusion Detection on RPL Routing Protocol Using Fuzzy Logic 基于模糊逻辑的RPL路由协议入侵检测新方法
2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122278
Behnam Farzaneh, Mohammad Koosha, Elahe Boochanpour, Emad Alizadeh
{"title":"A New Method for Intrusion Detection on RPL Routing Protocol Using Fuzzy Logic","authors":"Behnam Farzaneh, Mohammad Koosha, Elahe Boochanpour, Emad Alizadeh","doi":"10.1109/ICWR49608.2020.9122278","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122278","url":null,"abstract":"The Internet of Things (IoT) is a new concept in the world of technology and communications for the description of the future in which physical objects or sensor nodes connect to the Internet using IPv6. One of the most prominent protocols used on the IoT for routing is RPL (IPv6 Routing Protocol for Low power and Lossy Networks) that could be exposed to specific attacks like the Local Repair attack. Hence, researchers focus on RPL security as the most important challenge at this protocol. In this paper, we proposed a new Fuzzy-based method for the detection of Local Repair Attack on the RPL routing protocol. The obtained results using the Cooja simulator in the Contiki OS show that the proposed method detects the Local Repair attack with a very high True Positive Rate (TPR) and very low False Positive Rate (FPR).","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133974552","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}
引用次数: 16
A New Metric to Evaluate Network Robustness 一种评价网络鲁棒性的新指标
2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122284
Maliheh Ghomsheh, A. Kamandi
{"title":"A New Metric to Evaluate Network Robustness","authors":"Maliheh Ghomsheh, A. Kamandi","doi":"10.1109/ICWR49608.2020.9122284","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122284","url":null,"abstract":"Robustness is one of the most important properties of network, because it represents the network tolerance against failures. Thus, this property is considered in many real-world networks, such as distribution networks and communication networks. In order to evaluate this property, many measurements have been proposed, most of which are based on the size of giant component. In this paper, we introduced a concept of coloring nodes, by which we can classify nodes into two groups, and based on this concept, we proposed a new metric to measure the network robustness. Then, we implemented our proposed metric on random network and scale-free network to compare their behaviors. Finally, we compare the efficiency of our proposed method with another state-of-the-are robustness metric.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"75 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134312391","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}
引用次数: 3
Coronavirus Spreading Analysis Using Dynamic Spreading Factor Epidemic Models 基于动态传播因子流行模型的冠状病毒传播分析
2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122308
Zahra Farahi, A. Kamandi
{"title":"Coronavirus Spreading Analysis Using Dynamic Spreading Factor Epidemic Models","authors":"Zahra Farahi, A. Kamandi","doi":"10.1109/ICWR49608.2020.9122308","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122308","url":null,"abstract":"By the growing number of viruses and also epidemics, predicting and controlling the epidemics have high priority in today's human life. Network theory is a useful instrument for modelling the epidemics. As we can see, some predictions have been proposed for the disease like influenza (N1H1 virus). In this paper we aimed to compare the spreading model of coronavirus with proposed epidemic models. Also, we have shown that informing people using impressive ways such as social networks and also preventing attempts done by the governments affects the transmission rate. So models which are formed based on static transmission rate are not applicable for disease with dynamic transmission rate.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127600125","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}
引用次数: 0
Personalization of E-Learning Environment Using the Kolb's Learning Style Model 基于Kolb学习风格模型的网络学习环境个性化
2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122314
Tahereh Sanjabi, G. Montazer
{"title":"Personalization of E-Learning Environment Using the Kolb's Learning Style Model","authors":"Tahereh Sanjabi, G. Montazer","doi":"10.1109/ICWR49608.2020.9122314","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122314","url":null,"abstract":"The e-learning environment includes various types of learners who should take responsibility for their learning. Personalization of the e-learning environment is a significant contributing factor in the effective learning process which enhances learning satisfaction, speed learning, quality and efficiency of the learning process. The major goal of personalization in e-learning is providing appropriate education as well as adjusting the environmental conditions for each learner according to their specific characteristics. Various factors could be considered for designing a personalized learning environment; this study focused on the selective learning style. In this research, the e-learning environment was personalized based on Kolb's learning style and tailored learning strategies were developed for learners. Finally, in the designed learning environment, the learners' performance in an e-learning course for 19 students was evaluated. The results showed that personalization in the e-learning environment based on learning style influences students' academic success and satisfaction significantly.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"229 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115106392","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}
引用次数: 8
A Game Theory-based Mechanism to Optimize the Traffic Congestion in VANETs 基于博弈论的vanet交通拥堵优化机制
2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122324
Khalilollah Raeisi Lejjy, Esmaeil Amiri, Emad Alizadeh, Mohammad Hossein Rezvani
{"title":"A Game Theory-based Mechanism to Optimize the Traffic Congestion in VANETs","authors":"Khalilollah Raeisi Lejjy, Esmaeil Amiri, Emad Alizadeh, Mohammad Hossein Rezvani","doi":"10.1109/ICWR49608.2020.9122324","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122324","url":null,"abstract":"One of the key issues in Vehicular Ad-hoc networks (VANETs) is to optimize the traffic congestion. Cooperation in these networks is a challenging issue due to their specific characteristics. In this paper, a non-cooperative game theory-based approach is introduced for packet forwarding. Through extensive mathematical analyses and also experimental validation, we prove that the proposed non-cooperative game mechanism attains the Nash equilibrium point. Our designed mechanism encourages all vehicles to collaborate with each other in packet forwarding operations. This, in turn, results in decreasing the payments by nodes to the network side and also results in optimizing traffic congestion. The simulation results established the robustness of the proposed mechanism in terms of cost-related criteria.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130162799","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}
引用次数: 1
SW-DBSCAN: A Grid-based DBSCAN Algorithm for Large Datasets SW-DBSCAN:基于网格的大数据集DBSCAN算法
2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122313
Negar Ohadi, A. Kamandi, M. Shabankhah, Seyed Mohsen Fatemi, S. Hosseini, Alireza Mahmoudi
{"title":"SW-DBSCAN: A Grid-based DBSCAN Algorithm for Large Datasets","authors":"Negar Ohadi, A. Kamandi, M. Shabankhah, Seyed Mohsen Fatemi, S. Hosseini, Alireza Mahmoudi","doi":"10.1109/ICWR49608.2020.9122313","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122313","url":null,"abstract":"Data clustering aims to discover the underlying structure of data. it has many applications in data analysis and it is one of the most widely used tools in data mining. DBSCAN is one of the most famous clustering algorithms. its advantages are to identify clusters of various shapes and define the number of clusters. Since DBSCAN is sensitive to its parameters which are ε and MinPts, it may perform poorly when the dataset is unbalanced. To solve this problem, this paper proposes a sliding window DBSCAN clustering algorithm that uses Gridding and local parameters for unbalanced data which we will refer to as SW-DBSCAN. The algorithm divides the dataset into several grids. The size and shape of each gird depends on the specimen density specification. Then, for each grid, the parameters are adjusted for local clustering and eventually merging data zones. Experimental results show that this algorithm can help to improve the performance of the DBSCAN algorithm and can deal with arbitrary data and asymmetric data.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115900301","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}
引用次数: 16
An Efficient Ensemble of Convolutional Deep Steganalysis Based on Clustering 基于聚类的卷积深度隐写分析的高效集成
2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122294
Tayebe Abazar, Peyman Masjedi, M. Taheri
{"title":"An Efficient Ensemble of Convolutional Deep Steganalysis Based on Clustering","authors":"Tayebe Abazar, Peyman Masjedi, M. Taheri","doi":"10.1109/ICWR49608.2020.9122294","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122294","url":null,"abstract":"Steganography is the task of hiding information in some media normally images. Steganalysis is the process of discriminating such instances and clean ones. In recent years, steganalysis has tended to use deep learning for feature extraction and classification. Convolutional Neural Networks (CNN) have improved the steganalysis performance but at the cost of computational complexity and memory space due to huge amount of training data. In this paper, a new framework is proposed to reduce the learning cost by a divide and conquer strategy. In the first phase, data is divided into disjoint clusters by use of k-means. Each cluster is then fed to a separate CNN to be customized on a specific region of data space. In the final phase, the networks are merged leveraging a fast alternate-weighting process. The proposed weighting can, to some extent, compensate for reducing the size of training data per model. The experimental results show that the proposed scalable framework reduces memory and time complexity with preserving accuracy.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122687187","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}
引用次数: 4
Hierarchical Three-module Method of Text Classification in Web Big Data Web大数据文本分类的分层三模块方法
2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122326
Zahra Rezaei, B. Eslami, M. Amini, Mohammad Eslami
{"title":"Hierarchical Three-module Method of Text Classification in Web Big Data","authors":"Zahra Rezaei, B. Eslami, M. Amini, Mohammad Eslami","doi":"10.1109/ICWR49608.2020.9122326","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122326","url":null,"abstract":"Text analysis is a method for extracting knowledge from text. Memory and time limitations in processing big data is crucial due to data sources distributed in web, search engines and socials network sites. In addition, due to automatizing search process, summarizing and finding the interests of users, immediate classification of various texts in a streaming manner has gained attention in industrial and scientific fields. Hierarchical classification of text is among common issues which is simply possible in traditional methods using bag of words; however, while talking about big data and when there are a lot of labels of classes, employing traditional methods will not meet the needs of societies. With the improvement of data in internet and social networks, more powerful methods are needed which can classify the data closely and immediately. Through abstraction in textual data, deep learning can deal with these challenges. In this paper a deep learning method will be introduced which is based on hierarchical classification (HAN) named HAN-MODI and which can classify texts from social networks and web sites with an accuracy of 98.81% at the real time bilingually in English and Farsi. This paper also shows that this complex network with three modules word, sentence and document can work better at word level and there is no need to know syntactic or semantics structure of language. The novelty of the proposed method is adding a third level to the hierarchical structure for general detection and for more exact detection of the class. In addition, classification using this method will be multi-level classification and finally with a change in HAN, this method can be used with Farsi texts. Model improvement is done by adding a new layer above the architecture HAN. We called it as segmentation of sentences into expressions Bag of Sentences and added a dynamicity window in any stage that applied attention mechanism simultaneously.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"61 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113977568","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}
引用次数: 2
PEDM: Pre-Ensemble Decision Making for Malware Identification and Web Files PEDM:恶意软件识别和网络文件的预集成决策
2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122322
Elham Velayati, Seyed Mehdi Hazrati Fard
{"title":"PEDM: Pre-Ensemble Decision Making for Malware Identification and Web Files","authors":"Elham Velayati, Seyed Mehdi Hazrati Fard","doi":"10.1109/ICWR49608.2020.9122322","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122322","url":null,"abstract":"Connecting your system or device to an insecure network can create the possibility of infecting by the unwanted files. Malware is every malicious code that has the potential to harm any computer or network. So, detecting harmful files is a crucial duty and an important role in any system. Machine learning approaches use a variety of features such as Opcodes, Bytecodes, and System-calls to achieve accurate malware identification. Each of these feature sets provides a unique semantic view, while, considering the effect of altogether is more reliable to detect attacks. Malware can disguise itself in some views, but hiding in all views will be much more difficult. Multi-View Learning (MVL) is an outstanding approach that considers multiple views of a problem to improve the overall performance. In this paper, inspiring MVL an approach is proposed to incorporate some various feature sets and exploit complementary information to identify a file. In this way, the consensus of multiple views is used to minimize the overall error of a classifier based on sparse representation. To show the generalization power of the proposed method, various datasets are employed. Experimental results indicate that in addition to high performance, the proposed method has the advantage of overcoming the imbalanced conditions.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132195058","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}
引用次数: 1
A List-based Heuristic Algorithm for Static Task Scheduling in Heterogeneous Distributed Computing Systems 异构分布式计算系统中静态任务调度的启发式算法
2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122306
Hadi Gholami, Reza Zakerian
{"title":"A List-based Heuristic Algorithm for Static Task Scheduling in Heterogeneous Distributed Computing Systems","authors":"Hadi Gholami, Reza Zakerian","doi":"10.1109/ICWR49608.2020.9122306","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122306","url":null,"abstract":"Executing complicated computations in parallel increases the speed of computing and brings user delight to the system. Decomposing the program into several small programs and running multiple parallel processors are modeled by Directed Acyclic Graph. Scheduling nodes to execute this task graph is an important problem that will speed up computations. Since task scheduling in this graph belongs to NP-hard problems, various algorithms were developed for node scheduling to contribute to quality service delivery. The present study brought a heuristic algorithm named looking ahead sequencing algorithm (LASA) to cope with static scheduling in heterogeneous distributed computing systems with the intention of minimizing the schedule length of the user application. In the algorithm proposed here, looking ahead is considered as a criterion for prioritizing tasks. Also, a property called Emphasized Processor has been added to the algorithm to emphasize the task execution on a particular processor. The effectiveness of the algorithm was shown on few workflow type applications and the results of the algorithm implementation were compared with two more heuristic and meta-heuristic algorithms.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130346138","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}
引用次数: 6
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书