2015 5th International Conference on Computer and Knowledge Engineering (ICCKE)最新文献

筛选
英文 中文
Hierarchical VM scheduling to improve energy and performance efficiency in IaaS Cloud data centers 分层虚拟机调度,提高IaaS云数据中心的能源和性能效率
2015 5th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2015-12-28 DOI: 10.1109/ICCKE.2015.7365872
Ali Nadjar, S. Abrishami, H. Deldari
{"title":"Hierarchical VM scheduling to improve energy and performance efficiency in IaaS Cloud data centers","authors":"Ali Nadjar, S. Abrishami, H. Deldari","doi":"10.1109/ICCKE.2015.7365872","DOIUrl":"https://doi.org/10.1109/ICCKE.2015.7365872","url":null,"abstract":"Efficient energy use has become a critical issue for resource management in Cloud data centers. Virtualization is a key technology for reducing energy cost and improving resource utilization in data centers. One of the challenges faced by virtualized data centers is to decide how to pack VMs on the least number of hosts. This paper presents a decentralized scheduling policy for dynamic consolidation of VMs equipped with ARIMA model to improve resource allocation by predicting resource usage of VMs in the near future so as to minimize Service Level Agreement (SLA) violations and energy consumption in Cloud data centers.","PeriodicalId":439113,"journal":{"name":"2015 5th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115202596","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}
引用次数: 9
The PFPASAP algorithm for energy harvesting real-time systems with a non-ideal supercapacitor 非理想超级电容器能量收集实时系统的PFPASAP算法
2015 5th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2015-12-28 DOI: 10.1109/ICCKE.2015.7365842
Khadijeh Faramarzi, Mahmood Hasanloo, M. Kargahi
{"title":"The PFPASAP algorithm for energy harvesting real-time systems with a non-ideal supercapacitor","authors":"Khadijeh Faramarzi, Mahmood Hasanloo, M. Kargahi","doi":"10.1109/ICCKE.2015.7365842","DOIUrl":"https://doi.org/10.1109/ICCKE.2015.7365842","url":null,"abstract":"This paper considers a real-time embedded system which uses an energy harvester and a non-ideal supercapacitor to supply the system energy. As supercapacitors suffer from energy leakage, the stored energy is better to be consumed as soon as possible. PFPASAP is a previously proposed preemptive fixed-priority scheduling algorithm that executes jobs as soon as possible when the available energy is enough to execute one time unit of the highest priority job. This algorithm assumes an ideal non-leaking energy storage unit. In this paper, however, we present another version of the algorithm, named NI_PFPASAP, which considers a non-ideal supercapacitor as the energy storage. For this purpose, we calculate the energy leakage of each task that can be broken into two parts: (i) leaked energy at the charging interval, and (ii) leaked energy at the discharging interval. Also, the optimality of the proposed method is proven in the paper. Finally, the importance of taking the non-ideality of the supercapacitor into account during task scheduling is evaluated by comparing the proposed method with PFPASAP using extensive simulations.","PeriodicalId":439113,"journal":{"name":"2015 5th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128497550","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
A lightweight method to investigate unknown social network structure 一个轻量级的方法来调查未知的社会网络结构
2015 5th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2015-12-28 DOI: 10.1109/ICCKE.2015.7365838
Negar Foroutan Eghlidi, Ardavan Afshar, Bahareh Ashenagar, A. Hamzeh
{"title":"A lightweight method to investigate unknown social network structure","authors":"Negar Foroutan Eghlidi, Ardavan Afshar, Bahareh Ashenagar, A. Hamzeh","doi":"10.1109/ICCKE.2015.7365838","DOIUrl":"https://doi.org/10.1109/ICCKE.2015.7365838","url":null,"abstract":"Information, rumors, infectious diseases, actions and influence propagate and diffuse through networks as probabilistic processes. Each piece of information appears in some nodes and spreads node by node over the underlying network. So, inferring network structures and analyzing information diffusion processes are required in various domains. In most cases the underlying network is hidden and we only observe the times in which nodes are infected by contagions. The vast majority of existing methods are parametric with the assumption that information diffusion patterns follow a particular distribution. In this paper, to tackle this problem, we propose a simple and non-parametric method that infers the networks topology given a set of cascades. We consider that there exists an unobserved network and we just observe the temporal diffusion events that occur over the edges of the network. First we extract all candidates edges in the network and after that we estimate weights and strength of these edges. In other words, we calculate the occurrence probability between each pair of nodes in all given cascades which is the pairwise transmission rate between that two nodes. The most dominant feature of our approach is having a very low time and computational complexity compared to the current approaches. In addition, as have not considered any assumptions on the information diffusion pattern, our proposed approach has the advantage of being more general and it can be used in various inferring network problems. In summary, experimental results show that not only our method can reach better or equal performance in comparison with baseline models but also it solves the problem in a simpler way with low time complexity.","PeriodicalId":439113,"journal":{"name":"2015 5th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124582079","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
Diagnosis of type 2 diabetes using cost-sensitive learning 使用成本敏感学习诊断2型糖尿病
2015 5th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2015-12-28 DOI: 10.1109/ICCKE.2015.7365820
Kiarash Zahirnia, M. Teimouri, R. Rahmani, Amin Salaq
{"title":"Diagnosis of type 2 diabetes using cost-sensitive learning","authors":"Kiarash Zahirnia, M. Teimouri, R. Rahmani, Amin Salaq","doi":"10.1109/ICCKE.2015.7365820","DOIUrl":"https://doi.org/10.1109/ICCKE.2015.7365820","url":null,"abstract":"Diabetes is the fourth cause of death in the world and has some complications such as amputation, visual impairment, kidney disorder and early death. 80% of diabetes symptoms is avoidable by early diagnosis. There are standard methods to diagnose diabetes by measuring the plasma glucose concentration. However, screening all people is impossible due to financial shortages especially in developing countries. Therefore, it is proposed that the people more than 20 years old who are prone to diabetes be tested. Identifying diabetic people is possible by using different methods including machine learning algorithms. Standard machines assume balance in data and use all the available and related features to achieve lower error rates. However, in medical applications misclassification cost should be minimized as misclassification costs for healthy and patient instances are different. In addition, we are facing imbalanced data in the most medical issues including diabetes diagnosis. The features will also have different knowledge levels and costs. As a result, cost-sensitive methods should be applied in such situations. In this paper, we present and compare different cost-sensitive learning methods for diagnosis of type 2 diabetes. For evaluation of the methods two different data sets are used, which one of them is data set of Tabriz, Iran and the other one is for Pima Indian data set. By defining different scenarios, we will show that none of the studied methods has absolute superiority over the other methods and the performance of algorithms will be different due to used data set and defined scenario.","PeriodicalId":439113,"journal":{"name":"2015 5th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121136638","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}
引用次数: 12
Spectral Clustering-based Classification 基于光谱聚类的分类
2015 5th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2015-12-28 DOI: 10.1109/ICCKE.2015.7365831
Moein Owhadi-Kareshk, Akbarzadeh-T
{"title":"Spectral Clustering-based Classification","authors":"Moein Owhadi-Kareshk, Akbarzadeh-T","doi":"10.1109/ICCKE.2015.7365831","DOIUrl":"https://doi.org/10.1109/ICCKE.2015.7365831","url":null,"abstract":"Multi-class classification is a challenging problem in pattern recognition. Clustering-based Classification (CC) is one of the most effective classification methods that first divides data into several clusters, each cluster then being described by a One-Class Classifier (OCC). Scalability and accuracy are two key advantages of this clustering-enhanced approach. In continuation of this strategy, in this paper, we further propose Spectral Clustering-based Classification (SCC). In contrast to many other clustering algorithms, Spectral Clustering (SC) aims to put the more mutually interconnected data points in one cluster, hence producing output clusters with smoother borders. A simpler border is easier to be described by an OCC, leading to higher accuracy. Application to seven UCI data sets of various nature and size confirms this improved performance in terms of higher accuracy, while keeping scalability property.","PeriodicalId":439113,"journal":{"name":"2015 5th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116826144","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
Threshold feature selection (TFS), an improvement over forward selection in steganalysis feature selection 阈值特征选择(TFS)是隐写分析特征选择中对前向选择的改进
2015 5th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2015-12-28 DOI: 10.1109/ICCKE.2015.7365825
Morteza Darvish Morshedi Hosseini, M. Mahdavi
{"title":"Threshold feature selection (TFS), an improvement over forward selection in steganalysis feature selection","authors":"Morteza Darvish Morshedi Hosseini, M. Mahdavi","doi":"10.1109/ICCKE.2015.7365825","DOIUrl":"https://doi.org/10.1109/ICCKE.2015.7365825","url":null,"abstract":"High-dimensional feature sets proposed for steganalysis are able to model a lot of dependencies between pixels. Although these dependencies can reveal the changes induced by steganography in pixels or JPEG coefficients values, for some known steganography methods, some features may not change significantly. The significance of feature selection in steganalysis relies on two facets. First, by keeping particular features constant in steganography, a more resistant embedding scheme can be obtained; in other words, the most prominent features for detecting a particular steganography method can reveal the weaknesses of the method. Second, extraction of high-dimensional feature sets in steganalysis is a time-consuming process and this issue prevents steganalysis applicability in the real-word problems, whereas in some cases feature selection might lead to reduction of feature extraction time. In this paper, a novel and simple method is suggested in order to select the most prominent features from the feature sets. The aim of the proposed method is not to increase the classification accuracy, but it aims at decreasing the negative effect of removing weak-discriminant features on classification accuracy and therefore at decreasing the classification complexity along with minimum degradation. Also another goal is to find the features that should be preserved in steganography process in order to avoid detection of steganography. The proposed method begins with sorting the features based on a selective ranking function, and then by considering a value as threshold, only the features that can increase classification accuracy more than the threshold value are selected. Due to its similarities to Forward selection algorithm, it is compared with this selection. The comparison results showed improvement in terms of the selected features.","PeriodicalId":439113,"journal":{"name":"2015 5th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127138882","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
Metamorphic malware detection using Linear Discriminant Analysis and Graph Similarity 基于线性判别分析和图相似度的变形恶意软件检测
2015 5th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2015-12-28 DOI: 10.1109/ICCKE.2015.7365862
R. Mirzazadeh, M. Moattar, M. V. Jahan
{"title":"Metamorphic malware detection using Linear Discriminant Analysis and Graph Similarity","authors":"R. Mirzazadeh, M. Moattar, M. V. Jahan","doi":"10.1109/ICCKE.2015.7365862","DOIUrl":"https://doi.org/10.1109/ICCKE.2015.7365862","url":null,"abstract":"The most common malware detection approaches which are based on signature matching and are not sufficient for metamorphic malware detection, since virus kits and metamorphic engines can produce variants with no resemblance to one another. Metamorphism provides an efficient way for eluding malware detection software kits. Code obfuscation methods like dead-code insertion are also widely used in metamorphic malware. In order to address the problem of detecting mutated generations, we propose a method based on Opcode Graph Similarity (OGS). OGS tries to detect metamorphic malware using the similarity of opcode graphs. In this method, all nodes and edges have a respective effect on classification, but in the proposed method, edges of graphs are pruned using Linear Discriminant Analysis (LDA). LDA is based on the concept of searching for a linear combination of predictors that best separates two or more classes. Most distinctive edges are identified with LDA and the rest of edges are removed. The metamorphic malware families considered here are NGVCK and metamorphic worms that we denote these worms as MWOR. The results show that our approach is capable of classifying metamorphosed instances with no or minimum false alarms. Also, our proposed method can detect NGVCK and MWOR with high accuracy rate.","PeriodicalId":439113,"journal":{"name":"2015 5th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131394189","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}
引用次数: 13
Cross Split Decision Trees for pattern classification 交叉分割决策树用于模式分类
2015 5th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2015-12-28 DOI: 10.1109/ICCKE.2015.7365834
Z. Mirzamomen, Mohammad Navid Fekri, M. Kangavari
{"title":"Cross Split Decision Trees for pattern classification","authors":"Z. Mirzamomen, Mohammad Navid Fekri, M. Kangavari","doi":"10.1109/ICCKE.2015.7365834","DOIUrl":"https://doi.org/10.1109/ICCKE.2015.7365834","url":null,"abstract":"One of the most important problems of decision trees is instability. It means that small changes in the dataset can result in different trees and different predictions. In this paper we introduce Cross Split Decision Tree (CSDT) which is a new decision tree learning algorithm with improved stability. This new algorithm uses multiple attributes as the split test in the internal nodes, in spite of the classical decision tree learning algorithms which use a single attribute. We have employed a heuristic based on the hoeffding bound to select the best attributes in the internal nodes. The experimental results show that in comparison with the well-known C4.5 decision tree learning algorithm, the proposed algorithm creates shallower decision trees with comparable accuracy.","PeriodicalId":439113,"journal":{"name":"2015 5th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"427 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116538489","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 fuzzy-PI rate controller for video broadcasting applications of HEVC 一种用于HEVC视频广播应用的新型模糊pi速率控制器
2015 5th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2015-12-28 DOI: 10.1109/ICCKE.2015.7365839
Davoud Fani, M. Rezaei
{"title":"A new fuzzy-PI rate controller for video broadcasting applications of HEVC","authors":"Davoud Fani, M. Rezaei","doi":"10.1109/ICCKE.2015.7365839","DOIUrl":"https://doi.org/10.1109/ICCKE.2015.7365839","url":null,"abstract":"A fuzzy-proportional-integral (PI) rate control algorithm (RCA) for broadcasting applications of the high efficiency video coding (HEVC) standard is proposed in this paper. In this application controlled variable bit rate video bit streams are preferred to constant bit rate streams. A fuzzy-PI controller and a virtual buffer are used in our algorithm to calculate a base quantization parameter (QP) for each group of picture without using any rate-distortion model that leads to a low level of computational complexity. Fulfilled buffering constraint and high visual quality with damped unnecessary QP fluctuations must be reached at the same time. It is obvious from experimental results that these necessities are fully maintained by the proposed RCA.","PeriodicalId":439113,"journal":{"name":"2015 5th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127366551","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
Identification of gene signatures for classifying of breast cancer subtypes using protein interaction database and support vector machines 基于蛋白质相互作用数据库和支持向量机的乳腺癌亚型基因特征识别
2015 5th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2015-12-28 DOI: 10.1109/ICCKE.2015.7365826
Ashin Gharibi, Alireza Vard, M. Sehhati, M. Mohebian
{"title":"Identification of gene signatures for classifying of breast cancer subtypes using protein interaction database and support vector machines","authors":"Ashin Gharibi, Alireza Vard, M. Sehhati, M. Mohebian","doi":"10.1109/ICCKE.2015.7365826","DOIUrl":"https://doi.org/10.1109/ICCKE.2015.7365826","url":null,"abstract":"Many studies have used the microarray gene expression data in order to classifying breast cancer subtypes. However, the classification accuracy was not acceptable in many cases even by applying the algorithms to only a single set of data. In this regard, using appropriate algorithm in every step of whole procedure, applying useful bioinformatics databases, considering the interaction among genes, and properly combining analytical steps are the main challenging problems. In this study a solution was proposed which followed a three step process. In the first step a filter feature selection method was used to produce a small set of informative genes. In the second step, the primary selected genes were mapped on the protein-protein interaction network to extend the gene set according to the linking among corresponding proteins. Thus, a portion of genes that was pruned in the first stage is added again to the primary set of selected genes. In the final stage, by using support vector machine-based recursive feature elimination (SVMRFE) method, the final set of informative genes was identified. After that, we compared our proposed algorithm with decision tree methods in the same datasets. The proposed procedure was evaluated on two publicly available DNA microarray dataset, including 456 samples on breast cancer. The proposed algorithm reached to 100% accuracy for predicting Luminal B by using the JMI method in the first step. In conclusion the proposed method showed an appealing improvement in classification accuracy for a multiclass prediction problem. We can predict subtypes with greater than 91.2% overall accuracy by proposed algorithm. However, the accuracy of prediction subtypes in tree decision method is 78.6%.","PeriodicalId":439113,"journal":{"name":"2015 5th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127663361","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
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学术官方微信
小红书