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

筛选
英文 中文
Masking wrong-successor Control Flow Errors employing data redundancy 利用数据冗余掩盖错误后继控制流错误
2015 5th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2015-12-28 DOI: 10.1109/ICCKE.2015.7365827
Javad Yousefi, Yasser Sedaghat, M. Rezaee
{"title":"Masking wrong-successor Control Flow Errors employing data redundancy","authors":"Javad Yousefi, Yasser Sedaghat, M. Rezaee","doi":"10.1109/ICCKE.2015.7365827","DOIUrl":"https://doi.org/10.1109/ICCKE.2015.7365827","url":null,"abstract":"Advancements of CMOS technology lead to reduction of the transistor size and operating voltage levels that cause transistors to become more sensitive to cosmic rays. Therefore CMOS devices like memory (i.e., RAMs) are more likely to be hit by transient faults. Up to 77% of the transient faults cause Control Flow Errors (CFEs). One type of CFEs is wrong-successor CFE which is caused by faults in data variables resident in RAM. Previous control flow checking techniques neither detect nor correct this type of errors. A technique with the ability of masking wrong-successor CFEs is proposed in this paper. Since occurrence of these errors is induced by faults in data variables which affect the program execution flow (control variables), in the proposed technique, the control variables are being distinguished from other variables. This step is being followed by a traditional fault masking technique that is applied on the control variables. To evaluate the proposed technique, it was applied on five various benchmarks of the MiBench package. The experimental results demonstrated that the proposed technique is able to mask all 50,000 injected faults in control variables; while it had almost 21% performance overhead with 6% memory overhead. It is reasonable and feasible to apply this technique on the former control flow checking techniques due to its perfect wrong-successor CFE correction coverage and low overheads.","PeriodicalId":439113,"journal":{"name":"2015 5th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"5 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":"116764825","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
WS-TWSVM: Weighted Structural Twin Support Vector Machine by local and global information WS-TWSVM:基于局部和全局信息的加权结构双支持向量机
2015 5th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2015-12-28 DOI: 10.1109/ICCKE.2015.7365822
Ramin Rezvani-KhorashadiZadeh, Monsefi Reza
{"title":"WS-TWSVM: Weighted Structural Twin Support Vector Machine by local and global information","authors":"Ramin Rezvani-KhorashadiZadeh, Monsefi Reza","doi":"10.1109/ICCKE.2015.7365822","DOIUrl":"https://doi.org/10.1109/ICCKE.2015.7365822","url":null,"abstract":"Recently many researches have published their papers on training a classifier based on the structural information of data. A Structural Twin Support Vector Machine (S-TWSVM) was proposed to introduce and balance all structural information of both intra-class and inter-class into its optimization problems. In fact, this method neither consider the structural information conflicting between clusters of one class nor the noise data points that can influence on the structure of the data distribution. In this paper, we propose a new Weighted Structural Twin Support Vector Machine (WS-TWSVM) by its local and global information. In our proposed method, we use a weighted (rather than a simple) summing of structural information to sufficiently exploit class's distribution information, so that, applying the density information of data points, the effects of the noise points on the data structure can be handled. Thus, our proposed method, WS-TWSVM can fully exploit the prior knowledge more efficiently than S-TWSVM leads to improve the model's generalization capacity. As been shown in the experiments, WS-TWSVM is superior to S-TWSVM in term of classification accuracy.","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":"131205877","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
High Level Synthesis as a service 高级综合即服务
2015 5th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2015-12-28 DOI: 10.1109/ICCKE.2015.7365851
Majid Dashtbani, Amir Rajabzadeh, M. Asghari
{"title":"High Level Synthesis as a service","authors":"Majid Dashtbani, Amir Rajabzadeh, M. Asghari","doi":"10.1109/ICCKE.2015.7365851","DOIUrl":"https://doi.org/10.1109/ICCKE.2015.7365851","url":null,"abstract":"Emerging cloud computing has improved computing performance and optimized usage of resources. One of the other elements that can improve computing performance is using acceleration resources. FPGA is a computing resource that is attractive attention due to its functionalities in many processes. High level programs which are designed for execution on CPU are not able to execute on FPGA and should be converted to HDL representation that is executable with FPGA. Many programmers do not have programming skill of HDL languages but the trend shows to using FPGA advantages or comparison and analysis their program execution on different computing resources. High Level Synthesis (HLS) is a tool to translate high level language representation to HDL language. In this paper, high level synthesis is proposed as a service in cloud computing infrastructure. User can order his requested service by OpenStack platform and interconnect to HLS as a Service (HLSaaS) via transparent and direct modes. The strong point of this paper is executing the High Level Synthesis as a Service (HLSaaS) for the first time in real environment of cloud computing infrastructure of the Razi Campus. It is useful in providing the services to users. The experiments are evaluated by CHStone benchmark. The evaluation of results shows that VMs' resources do not have the significant effect in HLS elapsed time. This issue shows weakness of current HLS tools.","PeriodicalId":439113,"journal":{"name":"2015 5th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"13 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":"133456762","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
Applying Grey Wolf Optimizer-based decision tree classifer for cancer classification on gene expression data 应用基于灰狼优化器的决策树分类器对基因表达数据进行癌症分类
2015 5th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2015-12-28 DOI: 10.1109/ICCKE.2015.7365818
Mahtab Vosooghifard, H. Ebrahimpour
{"title":"Applying Grey Wolf Optimizer-based decision tree classifer for cancer classification on gene expression data","authors":"Mahtab Vosooghifard, H. Ebrahimpour","doi":"10.1109/ICCKE.2015.7365818","DOIUrl":"https://doi.org/10.1109/ICCKE.2015.7365818","url":null,"abstract":"One of the most important research topics in bioinformatics is classification of cancer and in this topic, one of major concepts is using of microarray data. There are lots of methods ranging from analytical and computational intelligence methods for using gene expression data such as Back Propagation Neural Network (BPNN), Self-Organizing Map (SOM), Support Vector Machine (SVM) and Particle Swarm Optimization (PSO). In this paper, a hybrid method of Grey Wolf Optimizer (GWO) combined with decision tree as a classifier for selecting a small number of useful genes from the lots of genes to identify cancer is proposed. Proposed method and other famous classifiers such as BPNN, SOM, SVM, C4.5 and PSOC4.5 applied to experiments on 10 gene expression cancer datasets and results show proposed method outperforms others.","PeriodicalId":439113,"journal":{"name":"2015 5th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"15 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":"114266713","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}
引用次数: 27
CAPTCHAs, are those needed anymore? 验证码还需要吗?
2015 5th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2015-12-28 DOI: 10.1109/ICCKE.2015.7365816
Mohammad Moradi, M. Keyvanpour
{"title":"CAPTCHAs, are those needed anymore?","authors":"Mohammad Moradi, M. Keyvanpour","doi":"10.1109/ICCKE.2015.7365816","DOIUrl":"https://doi.org/10.1109/ICCKE.2015.7365816","url":null,"abstract":"For more than a decade, CAPTCHAs are around to enhance the security level of a broad range of web-based activities such as ecommerce, online polls, etc. Although, the literature of the topic is a fertile one and there are many studies in which different types of such tests presented; there are several issues that greatly question the efficiency of CAPTCHAs, such as usability and accessibility problems. In this regard, efforts made to improve different aspects of CAPTCHAs and even some alternatives have been proposed. Nonetheless, it can be said that the CAPTCHA, despite its applications and benefits, is not a popular phenomena among the web users. Moreover, in some cases the disadvantages of using CAPTCHAs surpasses its advantages. Such issues prompt a critical question that perhaps this is the time for retiring CAPTCHAs. This is what is studied in this paper from different aspects to provide a current status report of the CAPTCHA and its alternative solutions.","PeriodicalId":439113,"journal":{"name":"2015 5th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"33 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":"127732369","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
Sequence Based Feature Selection using ant colony optimization 基于序列的蚁群特征选择
2015 5th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2015-12-28 DOI: 10.1109/ICCKE.2015.7365867
Hossein Yeganeh Markid, Behrouz Zamani Dadaneh, M. Moghaddam
{"title":"Sequence Based Feature Selection using ant colony optimization","authors":"Hossein Yeganeh Markid, Behrouz Zamani Dadaneh, M. Moghaddam","doi":"10.1109/ICCKE.2015.7365867","DOIUrl":"https://doi.org/10.1109/ICCKE.2015.7365867","url":null,"abstract":"Feature selection is a process with the aim of diminishing irrelevant and redundant features from original set. Some of features which are called irrelevant not only provide no useful information to classifier but also put it in pitfalls. Some other are neutral means no conducting and no misleading. This group is called redundant features. In this paper, we introduced a new algorithm based on ant colony optimization (ACO) with the aid of statistical information from training dataset to cut down mentioned groups of features. The proposed algorithm is called Sequence Based Feature Selection (SFS) able to get target subset cardinality as an input or not. In this paper ants are applying two factors related to statistical information as heuristic desirability to remove irrelevant and redundant groups of features. These information are well-known Fisher-Score and Correlation respectively. Our algorithm utilizes a fully connected graph of nodes to model the problem and put the pheromone on nodes rather than edges. In addition it uses a dynamic desirability rather than a pre-calculated static one. In each iteration every ant comes up with a sequence of features which is passed to the next step for choosing a subsequence of it starting from beginning. The proposed algorithm has been tested against some well-known datasets and its performance compared with recently represented algorithms. The results indicates that using dynamic two factors desirability in fully connected graph is more effective in removing redundant features than Binary approaches.","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":"129626954","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
A longest prefix matching method using Rectangular-Tree 一种基于矩形树的最长前缀匹配方法
2015 5th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2015-12-28 DOI: 10.1109/ICCKE.2015.7365829
F. Bahrami, M. Ahmadi, Bahram Bahrambeigy
{"title":"A longest prefix matching method using Rectangular-Tree","authors":"F. Bahrami, M. Ahmadi, Bahram Bahrambeigy","doi":"10.1109/ICCKE.2015.7365829","DOIUrl":"https://doi.org/10.1109/ICCKE.2015.7365829","url":null,"abstract":"With the rapid growth of Internet traffic as well as the employment of new complex applications, e.g. multimedia, online gaming and social networks, the high-performance devices and routers have become essential requirements in todays computer networks. One of the major bottlenecks in nowadays routers is the lookup of routing tables and finding the appropriate output port for packet forwarding. Because of arbitrary length of Classless Inter-Domain Routing (CIDR) addresses, the packets must be forwarded to the corresponding output port using longest prefix matching (LPM) methods. In recent years, various software and hardware solutions for finding longest prefix matching are proposed. This paper presents a method to implement the IP lookup of the routing table using Rectangle Tree (R-Tree). In this method, prefixes are converted to two-dimensional data in order to be inserted into the R-Tree. Subsequently, searching is performed on R-Tree to find the matched prefixes especially the LPM. The results show that this method reduces the number of memory accesses, significantly.","PeriodicalId":439113,"journal":{"name":"2015 5th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"77 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":"114538206","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
Parallel RANSAC: Speeding up plane extraction in RGBD image sequences using GPU 并行RANSAC:利用GPU加速RGBD图像序列的平面提取
2015 5th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2015-12-28 DOI: 10.1109/ICCKE.2015.7365845
Mahdi Alehdaghi, M. A. Esfahani, A. Harati
{"title":"Parallel RANSAC: Speeding up plane extraction in RGBD image sequences using GPU","authors":"Mahdi Alehdaghi, M. A. Esfahani, A. Harati","doi":"10.1109/ICCKE.2015.7365845","DOIUrl":"https://doi.org/10.1109/ICCKE.2015.7365845","url":null,"abstract":"One of the most significant capabilities of a mobile robot is to understand the environment at least at some level to know how to behave and reach the goal. RGBD images, popularized during past few years, provide rich information about the appearance and the geometry of the environment at the same time; hence, they are quite useful for photo realistic scene reconstruction. However, most of scene reconstruction approaches are offline algorithms and very far from realtime as many use a variant of Iterative Closest Point (ICP) algorithm at their core to match correspondences. Using more abstract geometrical features such as planes enhance the precision of this process but needs a fast plane extraction technique to catch up with frame rate of the camera. In this paper, we propose a parallel extension to famous Random Sample Consensus (RANSAC) algorithm which uses GPU cores to speedup extraction of planes out of point clouds obtained from a Kinect sensor. A graph cut segmentation of the surface normal vectors is used to guide parallel RANSAC toward more efficient sampling. Surface normal calculation is also accelerated with utilization of integral images. Experimental results using real data shows our approach is able to run in realtime and orders of magnitude faster than traditional RANSAC while achieving similar precision.","PeriodicalId":439113,"journal":{"name":"2015 5th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"15 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":"114631741","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}
引用次数: 23
Optimization of budgeting type 2 diabetes through modeling disease burden 通过疾病负担模型优化2型糖尿病预算
2015 5th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2015-12-28 DOI: 10.1109/ICCKE.2015.7365821
M. Teimouri, Donya Rooein, M. Ebrahimi
{"title":"Optimization of budgeting type 2 diabetes through modeling disease burden","authors":"M. Teimouri, Donya Rooein, M. Ebrahimi","doi":"10.1109/ICCKE.2015.7365821","DOIUrl":"https://doi.org/10.1109/ICCKE.2015.7365821","url":null,"abstract":"Diabetes is one of the deadliest non-communicable diseases that imposes huge costs on societies. The imposed cost, which is a direct consequence of the incidence of this disease, is known as the burden of disease that is commonly quantified by a summarized health indicator known as DALY (Disability Adjusted Life Years). Due to the limitation of financial resources, in order to minimize the burden of the disease an optimized policy is required for budget distribution among the different fields associated with this disease, i.e. monitoring and treatment. In this research, by exploring the existing models, a Markov chain model is developed for modeling the burden of type 2 diabetes. Simulation of 10-year DALY on this model shows that the usual 50/50 budget distribution policy between monitoring and treatment, which is generally used in developing countries, is not an appropriate strategy for the current status of this disease. In fact, a better policy is to focus more on monitoring in initial years in order to discover undiagnosed diabetic people.","PeriodicalId":439113,"journal":{"name":"2015 5th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"80 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":"122410834","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
Improving the performance of PV grid interface inverter using the adaptive hysteresis band current controller 采用自适应磁滞带电流控制器改善光伏并网接口逆变器的性能
2015 5th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2015-12-28 DOI: 10.1109/ICCKE.2015.7365858
Sinaee Vahid, S. Fathi, H. Rastegar, G. Gharehpetian
{"title":"Improving the performance of PV grid interface inverter using the adaptive hysteresis band current controller","authors":"Sinaee Vahid, S. Fathi, H. Rastegar, G. Gharehpetian","doi":"10.1109/ICCKE.2015.7365858","DOIUrl":"https://doi.org/10.1109/ICCKE.2015.7365858","url":null,"abstract":"In this paper, an adaptive-hysteresis band current controller is compared with a fixed-hysteresis band controller for a photovoltaic systems (PV) grid interface inverter. The inverter utilization is maximized by adding the task of an active power filter (APF) to it with a specific control method so that the inverter can be used whether or not the PV generates power. The inverter is able to perform: 1) transferring the harvested power from PV to the grid; and 2) active filtering (load harmonic elimination, reactive power compensation and load balancing) individually or simultaneously. Both controllers do not let the THD of the grid currents to surpass the limit that is set by the IEEE-519 standard. The simulation results show that not only does the adaptive controller have all the benefits of the fixed controller, but it also alleviates the drawbacks of the adaptive controller. Maximizing the inverter utilization and applying the adaptive-hysteresis band current controller come at no additional hardware cost. All studies are carried out using MATLAB/Simulink. Simulations suggest that the adaptive controller leads to a more efficient performance of the inverter compared to the traditional method.","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":"130102613","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
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学术官方微信
小红书