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

筛选
英文 中文
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
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 Method For Answer Selection Using DistilBERT And Important Words 一种利用蒸馏酒和重要词进行答案选择的方法
2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122302
Jamshid Mozafari, A. Fatemi, P. Moradi
{"title":"A Method For Answer Selection Using DistilBERT And Important Words","authors":"Jamshid Mozafari, A. Fatemi, P. Moradi","doi":"10.1109/ICWR49608.2020.9122302","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122302","url":null,"abstract":"Question Answering is a hot topic in artificial intelligence and has many real-world applications. This field aims at generating an answer to the user's question by analyzing a massive volume of text documents. Answer Selection is a significant part of a question answering system and attempts to extract the most relevant answers to the user's question from the candidate answers pool. Recently, researchers have attempted to resolve the answer selection task by using deep neural networks. They first employed the recurrent neural networks and then gradually migrated to convolutional neural networks. Nevertheless, the use of language models, which is implemented by deep neural networks, has recently been considered. In this research, the DistilBERT language model was employed as the language model. The outputs of the Question Analysis part and Expected Answer Extraction component are also applied with [CLS] token output as the final feature vector. This operation leads to improving the method performance. Several experiments are performed to evaluate the effectiveness of the proposed method, and the results are reported based on the MAP and MRR metrics. The results show that the MAP values of the proposed method improved by 0.6%, and the MRR metric is improved by 0.2%. The results of our research show that using a heavy language model does not guarantee a more reliable method for answer selection problem. It also shows that the use of particular words, such as Question Word and Expected Answer word, can improve the performance of the method.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"19 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":"121784947","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
Developing of a New Hybrid Clustering Algorithm Based on Density 一种新的基于密度的混合聚类算法
2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122309
Mostafa Ghazizadeh-Ahsaee, Afsaneh Shamsadini-Farsangi
{"title":"Developing of a New Hybrid Clustering Algorithm Based on Density","authors":"Mostafa Ghazizadeh-Ahsaee, Afsaneh Shamsadini-Farsangi","doi":"10.1109/ICWR49608.2020.9122309","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122309","url":null,"abstract":"Clustering is one of the fundamental techniques of data mining that is used for dataset analysis. Clustering algorithms group available data based on similarity or distance measures. Two important clustering methods used in the literature are hierarchical and density based methods. A lot of algorithms have been developed based on these two concepts separately. Birch and its extensions are samples of hierarchical based methods. DBSCAN and its extensions are samples of density based methods. In this paper, a new algorithm is proposed to use both concepts together to achieve an acceptable speed and results, simultaneously. At first, it tries to make clusters using a hierarchical method. If it decides to make a new cluster, then the algorithm checks for density. In this manner, it tries to postpone splitting the clusters. To show the effect of the proposed algorithm, some evaluations are performed on some synthetic and real datasets which show some improvements over related works.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"30 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":"121374189","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
A New Follow based Community Detection Algorithm 一种新的基于关注的社区检测算法
2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122277
Maryam Yazdani, A. Moeini, M. Mazoochi, Farzaneh Rahmani, Leila Rabiei
{"title":"A New Follow based Community Detection Algorithm","authors":"Maryam Yazdani, A. Moeini, M. Mazoochi, Farzaneh Rahmani, Leila Rabiei","doi":"10.1109/ICWR49608.2020.9122277","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122277","url":null,"abstract":"Nowadays, social networks have gained a lot of popularity among people. With the growth of these networks and a large number of people using these networks, social network analysis has received special attention, so the need for highly accurate and fast algorithms on various issues is strongly felt. One of the important issues in these networks is community detection problem that many algorithms have been proposed for this purpose. In social networks, communities usually are formed around popular or influential nodes. Most algorithms in this field, that are usually density-based, are unable to detect this structure. In this paper, we propose a new community detection algorithm based on the local popularity structure. In this algorithm, the most popular person in neighborhood of each user is selected as a leader and the user falls into that group. Experimental results on six real networks show that the proposed method not only has comparable results in terms of NMI and ARI, but also has shorter execution time compared to existing algorithms.","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":"128792072","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
LookLike: Similarity-based Trust Prediction in Weighted Sign Networks LookLike:加权符号网络中基于相似性的信任预测
2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122293
Pooria Taghizadeh Naderi, F. Taghiyareh
{"title":"LookLike: Similarity-based Trust Prediction in Weighted Sign Networks","authors":"Pooria Taghizadeh Naderi, F. Taghiyareh","doi":"10.1109/ICWR49608.2020.9122293","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122293","url":null,"abstract":"Trust network is widely considered to be one of the most important aspects of social networks. It has many applications in the field of recommender systems and opinion formation. Few researchers have addressed the problem of trust/distrust prediction and, it has not yet been established whether the similarity measures can do trust prediction. The present paper aims to validate that similar users have related trust relationships. To predict trust relations between two users, the LookLike algorithm was introduced. Then we used the LookLike algorithm results as new features for supervised classifiers to predict the trust/distrust label. We chose a list of similarity measures to examined our claim on four real-world trust network datasets. The results demonstrated that there is a strong correlation between users' similarity and their opinion on trust networks. Due to the tight relation between trust prediction and truth discovery, we believe that our similarity-based algorithm could be a promising solution in their challenging domains.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"79 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":"125967262","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 Semi-blind Watermarking Method for Authentication of Face Images Using Autoencoders 基于自编码器的人脸图像半盲水印认证方法
2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122276
Saeed Khalilidan, M. Mahdavi, Arian Balouchestani, Zahra Moti, Yeganeh Hallaj
{"title":"A Semi-blind Watermarking Method for Authentication of Face Images Using Autoencoders","authors":"Saeed Khalilidan, M. Mahdavi, Arian Balouchestani, Zahra Moti, Yeganeh Hallaj","doi":"10.1109/ICWR49608.2020.9122276","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122276","url":null,"abstract":"Recent advents of the internet have made accessibility of people to digital data such as audio, images, and videos much easier. Meanwhile, one of the cases that adversaries take advantage of is the people's face images that are available across the web. Digital watermarking is used to authenticate the original owner of the images and protect their copyright. With the help of digital watermarking, hidden data is embedded inside the image. Recently, neural networks such as autoencoders are one of the most popular models that are used in many fields. Neural networks are capable of understanding all kinds of raw data such as images and videos. In this paper, we present a method for embedding the user's national ID in their face images using autoencoders. The proposed autoencoder is trained with a dataset contains face images. The image is coded into some code using the autoencoders' encoder. Then, the national ID is embedded in this code and the modified code is reconstructed using the decoder to form the watermarked image. To extract the watermark, the watermarked image is encoded with the encoder and the watermark is extracted. Experiment results show that our model recovers the watermark with high accuracy and it is resistant against JPEG attacks. Moreover, the quality of the watermarked images is acceptable, and their SSIM compare to the original image is about 90%.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"105 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":"128815738","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
How has Social Media Impacted the Life of an Individual Who Publicly Challenges Authoritative Discourse? 社交媒体如何影响公开挑战权威话语的个人生活?
2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122305
U. Hashmi, R. A. Rashid, Mohamed Anwar Omar Din, Kamariah Yunus
{"title":"How has Social Media Impacted the Life of an Individual Who Publicly Challenges Authoritative Discourse?","authors":"U. Hashmi, R. A. Rashid, Mohamed Anwar Omar Din, Kamariah Yunus","doi":"10.1109/ICWR49608.2020.9122305","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122305","url":null,"abstract":"This paper discusses the role of social media in shaping the life of an individual who publicly challenges Islamic authoritative discourse (i.e the hadith of Prophet Muhammad and the Quran). Sally (pseudonym), a 49 year old Malaysian lady, was the sole participant of this study where the impacts of social media on her life were investigated in-depth. Data were generated using an ethnographic approach involving a prolonged observation of her social media accounts (i.e Facebook, Blog and Twitter) for four years from 2014 to 2017. This time period covers the major developments in her life since her public rejection of Islamic authoritative discourse to her settlement in the USA. A thematic analysis was carried out to make sense of the data. The findings reveal that social media has affected her life in both negative and positive ways. She faced several problematic experiences (e.g. break up with family, life threats, police reports and exile) due to her postings which challenge Islamic authoritative discourses, however she also made full use of the social media to finally put a stop to the problematic experiences.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"22 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":"120981657","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
IMT: Selection of Top-k Nodes based on the Topology Structure in Social Networks IMT:基于拓扑结构的Top-k节点选择
2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122283
Hamid Ahmadi Beni, Zahra Aghaee, Asgarali Bouyer, M. Vahidipour
{"title":"IMT: Selection of Top-k Nodes based on the Topology Structure in Social Networks","authors":"Hamid Ahmadi Beni, Zahra Aghaee, Asgarali Bouyer, M. Vahidipour","doi":"10.1109/ICWR49608.2020.9122283","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122283","url":null,"abstract":"Influence maximization is a problem based on diffusion and probability in social networks with the aim of finding the least $k$ node with the most influence. These nodes play an essential role in the diffusion process. However, the influence maximization problem faces two essential challenges of time efficiency and optimal selection of the seed nodes. To solve these challenges, we proposed an algorithm based on the properties of the graph topology structure and centrality, called IMT (Influence Maximization based on the Topology) algorithm. This algorithm selects the seed nodes from the dense part of the graph that can access more nodes in the shortest distance. Finally, experiments showed that the proposed algorithm outperformed the other algorithms in terms of influence spread and running time.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"68 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":"133698493","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}
引用次数: 11
A Survey on Challenges in Designing Cognitive Engines 认知引擎设计中的挑战综述
2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122273
A. Saghiri
{"title":"A Survey on Challenges in Designing Cognitive Engines","authors":"A. Saghiri","doi":"10.1109/ICWR49608.2020.9122273","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122273","url":null,"abstract":"The primary goal of cognitive computing is to design a digitalized model that is able to mimic human thinking processes. The cognitive engine is in charge of implementing the functionality of a cognitive system. Nowadays, cognitive engines are used as a self-organized management mechanism in different fields such as computer networks, Internet of Things (IoT), and Robotics. This is because the management algorithms of these fields are going to be very complex and therefore human thinking models as digitalized models are required for fast and accurate decision making. In this paper, we summarize challenges in designing cognitive engines. Then, a set of challenges in designing the cognitive engine for body-mind operating system in the digitalized healthcare system is obtained. In the literature, our survey and also suggested case study in the healthcare system have not been considered yet.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"13 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":"122896479","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
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学术文献互助群
群 号:481959085
Book学术官方微信