Zahra Taghiyarrenani, A. Fanian, Ehsan Mahdavi, Abdolreza Mirzaei, Hamed Farsi
{"title":"Transfer Learning Based Intrusion Detection","authors":"Zahra Taghiyarrenani, A. Fanian, Ehsan Mahdavi, Abdolreza Mirzaei, Hamed Farsi","doi":"10.1109/ICCKE.2018.8566601","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566601","url":null,"abstract":"In the past decades, machine learning based intrusion detection systems have been developed. This paper discloses a new aspect of machine learning based intrusion detection systems. The proposed method detects normal and anomaly behaviors in the desired network where there are not any labeled samples as training dataset. That is while a plenty of labeled samples may exist in another network that is different from the desired network. Because of the difference between two networks, their samples produce in different manners. So, direct utilizing of labeled samples of a different network as training samples does not provide acceptable accuracy to detect anomaly behaviors in the desired network. In this paper, we propose a transfer learning based intrusion detection method which transfers knowledge between the networks and eliminates the problem of providing training samples that is a costly procedure. Comparing the experimental results with the results of a basic machine learning method (SVM) and also baseline method(DAMA) shows the effectiveness of the proposed method for transferring knowledge for intrusion detection systems.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121630669","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}
Mohammad Rezaalipour, Lida Talebsafa, M. Vahidi-Asl
{"title":"Arselda: An Improvement on Adaptive Random Testing by Adaptive Region Selection","authors":"Mohammad Rezaalipour, Lida Talebsafa, M. Vahidi-Asl","doi":"10.1109/ICCKE.2018.8566625","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566625","url":null,"abstract":"Distance-aware Forgetting Fixed Size Candidate Set (DF-FSCS) is an Adaptive Random Testing (ART) technique, which lowers the computational overhead of Fixed Size Candidate Set ART (FSCS-ART), using a forgetting strategy. DF-FSCS partitions the input domain into regions, and while computing the distance of a candidate test case from executed test cases, as a vector in the input domain, it only considers test cases that are in the same region as the candidate. Although being a lightweight technique, there are two issues with DF-FSCS. First, it does not attempt to generate test cases in low-density regions, which if done, could result in a more even spread of test cases. Second, the regions it defines are smaller at the lower or upper boundaries of input domains, which declines the quality of test cases produced in these regions. We propose Arselda, an APR technique that improves DF-FSCS. By generating test cases in low-density regions that have a fewer number of test cases and enlarging regions at lower or upper boundaries of input domains, Arselda addresses the two issues mentioned above. Considering DF-FSCS as the baseline, a simulation analysis has been performed to evaluate the effectiveness of Arselda. According to the experiment results, Arselda has better failure detection effectiveness compared with the baseline for the block failure pattern. Also, Arselda has lower computational overhead than the baseline.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115397642","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}
Fazeleh Tavassolian, Hassan Khotanlou, P. Varshovi-Jaghargh
{"title":"Forward Kinematics Analysis of a 3-PRR Planer Parallel Robot Using a Combined Method Based on the Neural Network","authors":"Fazeleh Tavassolian, Hassan Khotanlou, P. Varshovi-Jaghargh","doi":"10.1109/ICCKE.2018.8566243","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566243","url":null,"abstract":"Forward kinematics problem has always been a controversial topic in the case of parallel robots because of the close loop structure and the complicated nonlinear system of equations. In this paper, the forward kinematics problem of a planar parallel robot in its workspace is considered and a neural network based solution is proposed. In this approach, the robot's workspace is segmented into several subspaces for improving the accuracy of the solutions. Then, the pose of the parallel robot is precisely estimated using a neural network for each subspace. In order to determine the validity of this approach, the circular motion of a 3-PRR planar parallel robot is simulated by applying the proposed method. The simulation results indicate the advantages of this approach compared to other methods.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121795768","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":"Maximum Degree Based Heuristics for Influence Maximization","authors":"Maryam Adineh, Mostafa Nouri-Baygi","doi":"10.1109/ICCKE.2018.8566515","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566515","url":null,"abstract":"Influence maximization is the problem of selecting a subset of individuals in a social network that maximizes the influence propagated in the network. With the popularity of social network sites, and the development of viral marketing, the importance of the problem has been increased. Finding the most influential vertices, called seeds, in a social network graph is an NP-hard problem, and therefore, time consuming. Many heuristics are proposed to find a nearly good solution in a shorter time. In this paper, we propose two heuristic algorithms to find a good seed set. We evaluate our algorithms on several well-known datasets and show that our heuristics achieve the best results (up to 800 improvements in influence spread) for this problem in a shorter time (up to 10% improvement in runtime).","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122762450","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}
Hanieh Zehtab Hashemi, Parvaneh Parvasideh, Zahra Hasan Larijani, Fatemeh Moradi
{"title":"Analyze Students Performance of a National Exam Using Feature Selection Methods","authors":"Hanieh Zehtab Hashemi, Parvaneh Parvasideh, Zahra Hasan Larijani, Fatemeh Moradi","doi":"10.1109/ICCKE.2018.8566671","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566671","url":null,"abstract":"Recently, educational institutions are generating the mass of data and interesting to analyze these data for their applications. This purpose is achieved by data mining methods to extract knowledge required by the systems. This kind of dataset is usually huge and include many samples and unnecessary features. The nature of dataset implies that the analysis of data leads to inaccurate results without preprocessing. In this study, we want to find and evaluate the most important features by different feature selection methods. These methods give different results based on their nature. Therefore in the following, we evaluate obtained feature subsets with applying some machine learning methods. Here we use one educational dataset of an exam and want to construct a reliable model to predict the final outcome of this exam. We survey different feature selection and machine learning algorithms and find out the Information Gain and Gain Ratio yield better performance.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116227724","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":"No-Reference Deep Compressed-Based Video Quality Assessment","authors":"M. Alizadeh, A. Mohammadi, M. Sharifkhani","doi":"10.1109/ICCKE.2018.8566395","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566395","url":null,"abstract":"A novel No-Reference Video Quality Assessment (NR-VQA), based on Convolutional Neural Network (CNN) for High Efficiency Video Codec (HEVC) is presented. Deep Compressed-domain Video Quality (DCVQ) measures the video quality, with compressed domain features such as motion vector, bit allocation, partitioning and quantization parameter. For the training of the network, P-MOS is used due to the limitation of existing datasets. The evaluation of the proposed method shows that it has “96%” correlation to subjective quality assessment (MOS). The method can work simultaneously with the decoding process and measures the quality in different resolutions.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122283430","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":"Extending RISC- V ISA for Accelerating the H.265/HEVC Deblocking Filter","authors":"M. Alizadeh, M. Sharifkhani","doi":"10.1109/ICCKE.2018.8566467","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566467","url":null,"abstract":"In this paper, we present an RISC-V based Application Specific Instruction Set Processor (ASIP) for accelerating the HEVC deblocking filter. The proposed ASIP extends the RISC-V instruction set to include new instructions specifically targeted to expedite the HEVC deblocking filter. These instructions are designed by profiling the implementation of the OpenHEVC filter. Our proposed solution improves the performance of the deblocking filter compared to the standard implementation by 11%. Furthermore, our approach can also be applied to accelerate other parts of the decoder by taking advantage of the programmability and flexibility of ASIPs.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128156044","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":"Max-Min Ant Colony Optimization Method for Edge Detection Exploiting a New Heuristic Information Function","authors":"Saba Kheirinejad, S. Hasheminejad, N. Riahi","doi":"10.1109/ICCKE.2018.8566516","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566516","url":null,"abstract":"Edge detection is a substantial operation in machine vision and image processing. Recently, many ant colony optimization (ACO) algorithms have been exploited for a wide range of optimization problem such as edge detection. In this study, we apply the max-min ant colony optimization (MMACO) method to detect the image edges. Moreover, we propose a new heuristic information function (HIF) namely group based heuristic information function (GBHIF) to determine the nodes which ants visit around their place. Our proposed HIF exploits the difference between the intensity of two groups of nodes instead of two single one. In the simulation result section we show that the robustness of proposed edge detection algorithm is more than that of the previous algorithms.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"802 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131704634","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":"Routing in VANETs Based on Intersection Using SDN and Fog Computing","authors":"Naserali Noorani, S. Seno","doi":"10.1109/ICCKE.2018.8566352","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566352","url":null,"abstract":"Vehicular ad-hoc networks (VANET), as one of the main components of intelligent transport systems (ITS), face many issues including architecture inflexibility, instability of wireless communications, limitation in transmission range, repetitive topological variations due to high vehicle mobility, etc. One of the current challenges in VANETs in establishing communication and data forwarding arises in areas without Road Side Unit (RSU) coverage, called communication coverage holes. In these areas, vehicles are responsible for data forwarding through vehicle-to-vehicle (V2V) communication. Also given the issues of large data production and big data, communicative capability of vehicles can be used for data forwarding and establishing efficient communication, eliminating unnecessary bandwidth usage through the Internet and its infrastructures. The purpose of this article is proposing a method to improve data forwarding in V2V communication so as to cover communication coverage holes. This can help cover communication coverage holes. To this end, the advantages of software-defined network (SDN) and fog computing are used to improve V2V communication, and propose an intersection-based routing based on SDN and fog computing called SFIR. Finally the method is simulated and compared with the current protocols. Results indicate that SFIR significantly improves packet delivery ratio, packet loss ratio, and delay time.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131395455","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":"Real-Time Object Detection and Classification for Autonomous Driving","authors":"Seyyed Hamed Naghavi, H. Pourreza","doi":"10.1109/ICCKE.2018.8566491","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566491","url":null,"abstract":"In this paper, a single deep convolutional neural network for real-time detection and classification of on-road objects has been proposed. The resulted network could to be used for implementing a cost-effective and useful system in the domain of self-driving vehicles. Our network has been trained on KITTI Road dataset and could be used to recognize various on-road objects including vehicles, bicyclist, and pedestrians. The final network processes 448×448 input images at 47 frame per second (fps) on a NVIDIA GeForce GTX960 GPU. Our model achieves 78.4% mAP on the KITTI dataset, which is 11.9% higher than traditional YOLO and 5.2% more than SSD300, two of the top real-time object detection systems. Although our system is about 12 fps slower than SSD300, it is still well above the real-time performance.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"26 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132236933","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}