ICCKE 2013 Pub Date : 2013-12-16 DOI: 10.1109/ICCKE.2013.6682810

M. Jafari, Alireza Mohammad shahri, S. H. Elyas

引用次数: 21

Scheduling hard real-time tasks on multi-core using intelligent rate-monotonic 基于智能速率单调的多核硬实时任务调度

ICCKE 2013 Pub Date : 2013-12-16 DOI: 10.1109/ICCKE.2013.6682836

Amin Rezaeian, Mahmoud Naghibzadeh, Peyman Neamatollahi

引用次数: 0

A low complexity and high speed gradient descent based secure localization in Wireless Sensor Networks 基于低复杂度和高速梯度下降的无线传感器网络安全定位

ICCKE 2013 Pub Date : 2013-12-16 DOI: 10.1109/ICCKE.2013.6682841

Mostafa Mofarreh-Bonab, S. Ghorashi

{"title":"A low complexity and high speed gradient descent based secure localization in Wireless Sensor Networks","authors":"Mostafa Mofarreh-Bonab, S. Ghorashi","doi":"10.1109/ICCKE.2013.6682841","DOIUrl":"https://doi.org/10.1109/ICCKE.2013.6682841","url":null,"abstract":"In many applications of Wireless Sensor Networks (WSNs) such as monitoring applications or routing, localization is one of the important issues that affect directly the network quality of operation. Secure localization in WSNs needs to detect malicious nodes and exclude them in order to avoid deception by attackers. Accurate and appropriate methods that are usually iterative algorithms such as gradient descent, least median square (LMdS) and voting based secure localization have been introduced in the recent literature. Gradient descent based secure localization has better performance in terms of convergence speed and accuracy while have the minimum complexity compared to the other methods, however, still more convergence speed is needed for real-time applications. In this paper, a new gradient based method has been introduced which has higher convergence speed among all existing algorithms and the probability of fault for this algorithm is less than other algorithms. The other advantage of the proposed method is its low complexity in comparison to the other methods and its capability to be implemented in hardware. Simulation results show that the introduced algorithm's convergence speed is about 10 times more than the gradient descent algorithm with same localization error.","PeriodicalId":321117,"journal":{"name":"ICCKE 2013","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129938905","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

Immunization of complex networks using stochastic hill-climbing algorithm 基于随机爬坡算法的复杂网络免疫

ICCKE 2013 Pub Date : 2013-12-16 DOI: 10.1109/ICCKE.2013.6682858

Bita Shams, M. Khansari

引用次数: 17

Fuzzy high-order sliding-mode control of blood glucose concentration 模糊高阶滑模控制血糖浓度

ICCKE 2013 Pub Date : 2013-12-16 DOI: 10.1109/ICCKE.2013.6682818

Soudabeh Taghian Dinani, M. Zekri, B. Nazari

引用次数: 9

Parasitic-aware Optimization of a 2.4GHz Cross-Coupled LC VCO using IPO compared to PSO 2.4GHz交叉耦合LC压控振荡器的寄生感知优化

ICCKE 2013 Pub Date : 2013-12-16 DOI: 10.1109/ICCKE.2013.6682812

M. Vakili, S. Zahiri

引用次数: 5

Pasokh: A standard corpus for the evaluation of Persian text summarizers 一个标准语料库，用于评估波斯语文本摘要器

ICCKE 2013 Pub Date : 2013-12-16 DOI: 10.1109/ICCKE.2013.6682873

Behdad Behmadi Moghaddas, M. Kahani, Seyyed Ahmad Toosi, Asef Pourmasoumi, Ahmad Estiri

引用次数: 16

Feature selection using modified imperialist competitive algorithm 利用改进的帝国主义竞争算法进行特征选择

ICCKE 2013 Pub Date : 2013-12-16 DOI: 10.1109/ICCKE.2013.6682833

S. J. Mousavirad, H. Ebrahimpour-Komleh

引用次数: 16

VHDLSFI: A simulation-based multi-bit fault injection for dependability analysis VHDLSFI:基于仿真的多比特故障注入可靠性分析方法

ICCKE 2013 Pub Date : 2013-12-16 DOI: 10.1109/ICCKE.2013.6682846

Faezeh Pournaghdali, Amir Rajabzadeh, M. Ahmadi

{"title":"VHDLSFI: A simulation-based multi-bit fault injection for dependability analysis","authors":"Faezeh Pournaghdali, Amir Rajabzadeh, M. Ahmadi","doi":"10.1109/ICCKE.2013.6682846","DOIUrl":"https://doi.org/10.1109/ICCKE.2013.6682846","url":null,"abstract":"Decreasing technology sizing makes the CMOS devices more error prone to alpha particles and cosmic radiation. Therefore, the probability of occurring multi faults in such devices is increasing. This paper presents a simulation-based multi-bit fault injection tool, named VHDLSFI, aiming at conducting multi-bit fault injection campaign to analyze the dependability of digital systems modeled by VHDL description language. This fault injection tool utilizes the Force and Release statements which are features in the VHDL 2008 standard to inject transient and permanent single and multi-bit faults. Different fault models are developed using force and release statements. A VHDL model of DP32 processor is evaluated by this fault injection tool to demonstrate its functionality. A total of 2000 single faults and 7000 double faults have been injected into the ALU, Register File, General Registers, and different Buses in the processor using VHDLSFI fault injection tool. Only one single or one double fault is injected in each run. The results show that the percentages of errors propagation vary between 7% and 89% depending on single or double faults, the different workload programs, and location of the injected faults in the processor. The error propagation latency is much lower when the double faults in injected in DP32 processor.","PeriodicalId":321117,"journal":{"name":"ICCKE 2013","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115425659","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}

引用次数: 7

A novel reputation system to detect DGA-based botnets 一种检测基于dga的僵尸网络的新型信誉系统

ICCKE 2013 Pub Date : 2013-12-16 DOI: 10.1109/ICCKE.2013.6682860

Reza Sharifnya, M. Abadi

{"title":"A novel reputation system to detect DGA-based botnets","authors":"Reza Sharifnya, M. Abadi","doi":"10.1109/ICCKE.2013.6682860","DOIUrl":"https://doi.org/10.1109/ICCKE.2013.6682860","url":null,"abstract":"A botnet is a network of compromised hosts (bots) remotely controlled by a so-called bot herder through one or more command and control (C&C) servers. New generation botnets, such as Conficker and Murofet, tend to use a form of domain fluxing for command and control. Each domain fluxing bot generates a list of domain names using a domain name generation algorithm (DGA) and queries each of them until one of them is resolved to a C&C server. Since the bot herder registers only a few of these domain names, the domain fluxing bots generate many failed DNS queries. Even though some efforts have been focused on the detection of DGA-based botnets, but none of them consider the history of suspicious activities. This makes the detection system has a potentially high false alarm rate. In this paper, we propose a novel reputation system to detect DGA-based botnets. Our main goal is to automatically assign a high negative reputation score to each host that is involved in suspicious bot activities. To achieve this goal, we first choose DNS queries with similar characteristics at the end of each time window. We then identify hosts that algorithmically generated a large set of suspicious domain names and add them to a so-called suspicious group activity matrix. We also identify hosts with high numbers of failed DNS queries and add them to a so called suspicious failure matrix. We finally calculate the negative reputation score of each host in these two matrices and detect hosts with high negative reputation scores as bot-infected. We evaluate our reputation system using DNS queries collected from the campus network. The experimental results show that it can successfully detect DGA-based botnets with a high detection rate and a low false alarm rate while providing real-time monitoring in large-scale networks.","PeriodicalId":321117,"journal":{"name":"ICCKE 2013","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129654212","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}

引用次数: 34

ICCKE 2013最新文献