2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)最新文献

筛选
英文 中文
A Modified Grey Wolf Optimization for Energy Efficiency and Resource Wastage Balancing in Cloud Data-Centers 云数据中心能源效率与资源浪费平衡的改进灰狼优化
2020 10th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2020-10-29 DOI: 10.1109/ICCKE50421.2020.9303615
Atiyeh Ansari, M. Asghari, S. Gorgin, D. Rahmati
{"title":"A Modified Grey Wolf Optimization for Energy Efficiency and Resource Wastage Balancing in Cloud Data-Centers","authors":"Atiyeh Ansari, M. Asghari, S. Gorgin, D. Rahmati","doi":"10.1109/ICCKE50421.2020.9303615","DOIUrl":"https://doi.org/10.1109/ICCKE50421.2020.9303615","url":null,"abstract":"Virtual Machine Placement (VMP) process is one of the significant issues in Cloud data-centers. This operation can manage VMs to be placed on the best available Physical Machine (PM) and it has a notable impact on the performance, resource utilization, and power consumption of the data-centers. Meta-heuristics swarm intelligence methods are a common approach of solving these types of optimization problems. Grey Wolf Optimization (GWO) is a meta-heuristic algorithm that has proved its advantages. In this paper, we propose a Modified Grey Wolf Optimizer (MGWO) to balance power consumption and memory resource wastage using virtual machine placement. The suggested algorithm compared with two existing greedy algorithms, First Fit (FF) and First Fit Decreasing (FFD). The simulation results revealed the effectiveness of the proposed MGWO to provide a tradeoff between energy efficiency and memory resource wastage. The average of resource wastage of the MGWO is less than 10 percent, considering the tradeoff between energy consumption and the memory wastage parameter. In addition, the convergence test of the MGWO has been compared with a Genetic Algorithm (GA). The proposed solution is useful for defining some constraints for controlling resource wastage, such as cores and memory wastage.","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"2674 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124387741","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
Distributed synchronization for charging sensors based on service priority in WSAN WSAN中基于服务优先级的计费传感器分布式同步
2020 10th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2020-10-29 DOI: 10.1109/ICCKE50421.2020.9303688
Rahim Abri Ligvan, Reza Soitani, S. Pashazadeh
{"title":"Distributed synchronization for charging sensors based on service priority in WSAN","authors":"Rahim Abri Ligvan, Reza Soitani, S. Pashazadeh","doi":"10.1109/ICCKE50421.2020.9303688","DOIUrl":"https://doi.org/10.1109/ICCKE50421.2020.9303688","url":null,"abstract":"Wireless sensor and actuator networks are based on the collaboration of sensor and actuator nodes, relying on low power consumption, low cost, and wireless communication. One of the significant limitations of sensor and actuator networks is low power supply. In this paper, an algorithm based on the cooperation of actuators and sensors extends the life of nodes. Since the actuators are more energy-efficient and capable of moving and charging immobile sensor nodes, prevent a network from splitting, and can extend network life by identifying and charging the sensor nodes whose energy is running out. Our goal is to identify and charge the low-energy sensors by the actuators. In the proposed method, based on the priority of each sensor and considering the amount of remaining charge, the actuator moves to the desired sensor. A distributed algorithm is presented in this paper that its aim is to identifies the desired sensor nodes and with the coordination between the actuators, serves the sensor nodes and extends their life.","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116643846","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
Spiking Neural Controller for Autonomous Robot Navigation in Dynamic Environments 动态环境下自主机器人导航的脉冲神经控制器
2020 10th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2020-10-29 DOI: 10.1109/ICCKE50421.2020.9303687
M. T. Ramezanlou, V. Azimirad, Saleh Valizadeh Sotubadi, F. Janabi-Sharifi
{"title":"Spiking Neural Controller for Autonomous Robot Navigation in Dynamic Environments","authors":"M. T. Ramezanlou, V. Azimirad, Saleh Valizadeh Sotubadi, F. Janabi-Sharifi","doi":"10.1109/ICCKE50421.2020.9303687","DOIUrl":"https://doi.org/10.1109/ICCKE50421.2020.9303687","url":null,"abstract":"In this paper, a neural controller based on Spiking Neural Network (SNN) is trained using the Reward-modulated Spike-Timing-Dependent Plasticity (R-STDP) learning approach for the tasks of simultaneous target tracking and obstacle avoidance. The neural controller has two separate layers with a fully connected architecture. A random number vector encodes the sensor data within the network, and its output is obtained by calculating the membrane potential of the output layer. The SNN is connected to a 2 DoF robotic arm with two degrees of freedom and to control the motors. Two moving objects are used as targets and obstacles. The results showed that the network is able to distinguish between two objects in the environment. After learning, the robot found the proper path to reach the target without colliding the obstacle.","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"12 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120993779","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
Handling Class Imbalance in Customer Churn Prediction in Telecom Sector Using Sampling Techniques, Bagging and Boosting Trees 利用抽样技术、套袋和提升树处理电信行业客户流失预测中的阶层不平衡
2020 10th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2020-10-29 DOI: 10.1109/ICCKE50421.2020.9303698
Sajjad Shumaly, Pedram Neysaryan, Yanhui Guo
{"title":"Handling Class Imbalance in Customer Churn Prediction in Telecom Sector Using Sampling Techniques, Bagging and Boosting Trees","authors":"Sajjad Shumaly, Pedram Neysaryan, Yanhui Guo","doi":"10.1109/ICCKE50421.2020.9303698","DOIUrl":"https://doi.org/10.1109/ICCKE50421.2020.9303698","url":null,"abstract":"Customer churn is a serious problem in the telecommunications industry and occurs more often. The cost of maintaining existing customers is much lower than attracting new customers, and the literature stated that five times the cost of maintaining existing customers have to be spent on attracting new customers. In this article, we have identified customers who intend to stop using the organization's services. One of the most important problems in predicting customer churn is the imbalanced data, which has been tried to be solved and compared with different methods. The machine learning algorithms used in this paper are Decision Tree, Support Vector Machine, Multi-Layer Perceptron, Random Forest, and Gradient Boosting. Data was balanced by random over-sampling, random under-sampling and SMOTE methods. The methods of over-sampling and under-sampling had appropriate and almost similar results in terms of the area under the receiver character curve (AUC) index, the method of under-sampling has shown the better specificity, and the method over-sampling has shown the better sensitivity. Also, the performance of random forest and gradient boosting algorithms were better than other algorithms.","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127058431","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
Noise Margin Calculation in Multiple-Valued Logic 多值逻辑中的噪声余量计算
2020 10th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2020-10-29 DOI: 10.1109/ICCKE50421.2020.9303638
Mehdi Takbiri, K. Navi, R. F. Mirzaee
{"title":"Noise Margin Calculation in Multiple-Valued Logic","authors":"Mehdi Takbiri, K. Navi, R. F. Mirzaee","doi":"10.1109/ICCKE50421.2020.9303638","DOIUrl":"https://doi.org/10.1109/ICCKE50421.2020.9303638","url":null,"abstract":"Noise margin (NM) is an important concept in circuit design since noise is one of the major challenges for reliability. This subject is very critical in multiple-valued logic (MVL), where the entire voltage range is divided into several narrow zones. Ternary NMs are currently calculated based on a conventional definition. In this paper, we use another slightly different definition to present a new set of equations. Our investigations show that the proposed equations are more accurate and return closer results to reality. Furthermore, the given explanations are extended beyond ternary logic in this paper for MVL NM calculations in higher radixes.","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124849129","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 Large-Scale Application Mapping in Reconfigurable Hardware Using Deep Graph Convolutional Network 基于深度图卷积网络的可重构硬件中的大规模应用映射
2020 10th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2020-10-29 DOI: 10.1109/ICCKE50421.2020.9303679
S. M. Mohtavipour, H. Shahhoseini
{"title":"A Large-Scale Application Mapping in Reconfigurable Hardware Using Deep Graph Convolutional Network","authors":"S. M. Mohtavipour, H. Shahhoseini","doi":"10.1109/ICCKE50421.2020.9303679","DOIUrl":"https://doi.org/10.1109/ICCKE50421.2020.9303679","url":null,"abstract":"Reconfigurable Computing (RC) systems are capable of hardware implementation for processing speedup with different reconfiguration features. They are key elements in nowadays High Performance Computing (HPC) systems with enormous demand of application execution. This paper aims to reduce the compilation time of RC applications by providing a hierarchical model in the mapping part. In this model, the application graph is clustered by using a Graph Convolutional Network (GCN). Merging information of neighborhood nodes in the layers of GCN, the network is trained to classify the nodes into least dependent clusters. To reduce the heavy computations of mapping operation, it is performed in independent steps, inter-cluster, and intra-cluster mappings. Intra-cluster mapping organizes logic blocks in small regions and inter-cluster mapping places these regions in the implementation area by using an average distance metric. Simulation results showed that high-quality solutions for the mapping problem have been achieved faster in comparison with previous works.","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125845306","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
Improved MDNET Tracker in Better Localization Accuracy 改进MDNET跟踪器,提高定位精度
2020 10th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2020-10-29 DOI: 10.1109/ICCKE50421.2020.9303727
Zahra Soleimanitaleb, Mohammad Ali Keyvanrad, Ali Jafari
{"title":"Improved MDNET Tracker in Better Localization Accuracy","authors":"Zahra Soleimanitaleb, Mohammad Ali Keyvanrad, Ali Jafari","doi":"10.1109/ICCKE50421.2020.9303727","DOIUrl":"https://doi.org/10.1109/ICCKE50421.2020.9303727","url":null,"abstract":"Object tracking is one of the most important issues in the field of computer vision, which has many applications in the automotive, defense, robotics, medicine, industries, etc. In recent years, various researches have been done in this field and due to its many applications, research in this field continues. In this paper, a deep end-to-end, multi-domain method, or MDNET was examined. The MDNET method works well in tracking video sequences, but has the following problems: The first problem is finding the target position, where the candidate is selected as the target with the highest score. To solve this problem, a new way to find the target position is provided. In this way, the average of the top five candidates is selected as the target position, which was able to increase the IOU standard of the basic method on the OTB100 dataset from 69 to 70.3 and also the results based on the OTB50 and the various challenges are investigated. The second problem is the loss of target in some frames, In this case, instead of drawing the candidates around the target, the candidates are drawn in the whole image and the candidate with the highest score is selected as the target. This method was able to increase the IOU standard on the OTB100 dataset from 70.3 to 72.2 and the results based on the OTB50 and the various challenges are investigated.","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125887957","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
Reconstruction of Worm Propagation Path Using a Trace-back Approach 用回溯法重建蠕虫传播路径
2020 10th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2020-10-29 DOI: 10.1109/ICCKE50421.2020.9303712
Sara Asgari, B. Sadeghiyan
{"title":"Reconstruction of Worm Propagation Path Using a Trace-back Approach","authors":"Sara Asgari, B. Sadeghiyan","doi":"10.1109/ICCKE50421.2020.9303712","DOIUrl":"https://doi.org/10.1109/ICCKE50421.2020.9303712","url":null,"abstract":"Worm origin identification and propagation path reconstruction are essential problems in digital forensics. However, a small number of studies have specifically investigated these problems so far. In this paper, we extend a distributed trace-back algorithm, called Origins, which is only able to identify the origins of fast-spreading worms. We make some modifications to this algorithm so that in addition to identifying the worm origins, it can also reconstruct the propagation path. We also evaluate our extended algorithm. The results show that our algorithm can reconstruct the propagation path of worms with high recall and precision, on average around 0.96. Also, the algorithm identifies the origins correctly in all of our experiments.","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114959036","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
Sing Network Slicing And NFV Technology Sing网络切片和NFV技术
2020 10th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2020-10-29 DOI: 10.1109/ICCKE50421.2020.9303683
Z. Mohammady, R. Azmi
{"title":"Sing Network Slicing And NFV Technology","authors":"Z. Mohammady, R. Azmi","doi":"10.1109/ICCKE50421.2020.9303683","DOIUrl":"https://doi.org/10.1109/ICCKE50421.2020.9303683","url":null,"abstract":"With the growth of the network and the emergence of 5G networks, it is not possible to achieve a reliable service with proper performance in all cases of use with a single design. Recent advances in virtualization and machine learning techniques have ushered in a new era of network management. By separating network functions from traditional hardware, Network Function virtualization (NFV) is expected to provide more flexible management of network functions and efficient sharing of network resources. Network slicing with Software-Defined Networks (SDN) and NFV creates the flexible deployment of network functions belonging to several Service Function Chains (SFC) on a common infrastructure. In this paper, with the help of NFV capabilities as well as existing machine learning methods, a framework for intelligent network slicing is proposed. In this method, Convolutional Neural Networks (CNN) are used to analyze network traffic and classify them. This method can classify traffic without human intervention for feature extraction. By using CNN results, we were able to make the network slice with 97% accuracy.","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"316 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122314866","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
Reducing Search Space in Subgraph Matching Problem 子图匹配问题中搜索空间的缩减
2020 10th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2020-10-29 DOI: 10.1109/ICCKE50421.2020.9303627
Hojjat Moayed, E. Mansoori
{"title":"Reducing Search Space in Subgraph Matching Problem","authors":"Hojjat Moayed, E. Mansoori","doi":"10.1109/ICCKE50421.2020.9303627","DOIUrl":"https://doi.org/10.1109/ICCKE50421.2020.9303627","url":null,"abstract":"Subgraph matching problem refers to finding query graphs in a large graph. The size of search space in subgraph matching depends on the size of large graph. Due to this large search space, some methods have been proposed to reduce the computational time of matching by preprocessing the large graph. The structural indexing methods restrict the potential occurrences of subgraphs. However, a large percent of these candidates are false positives, which waste resources in matching time. In this paper, we propose a method to find and remove false positive candidates using spectral features in localities. Experiments on biological datasets demonstrate the efficiency of our method in terms of pruning the search space and reducing the matching time.","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122388015","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
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学术官方微信