2014 Sixth International Conference on Advanced Computing (ICoAC)最新文献

Combined additive and multiplicative modulo encryption and transformation approach for finger print template security 指纹模板安全的加性与乘性模组合加密与转换方法

2014 Sixth International Conference on Advanced Computing (ICoAC) Pub Date : 2014-12-01 DOI: 10.1109/ICOAC.2014.7229724

C. Balaji, R. Ashoka Rajan, P. Anandha Kumar

引用次数: 0

Shape based approach for detecting Musa Species in fruit industry 基于形状的果业木沙种检测方法

2014 Sixth International Conference on Advanced Computing (ICoAC) Pub Date : 2014-12-01 DOI: 10.1109/ICOAC.2014.7229765

M. Senthilarasi, S. M. Roomi, M. Prasanna

引用次数: 2

Enhancing the precision of phishing classification accuracy using reduced feature set and boosting algorithm 利用约简特征集和提升算法提高网络钓鱼分类精度

2014 Sixth International Conference on Advanced Computing (ICoAC) Pub Date : 2014-12-01 DOI: 10.1109/ICOAC.2014.7229752

R. Rakesh, A. Kannan, S. Muthurajkumar, Pandiyaraju, L. Sairamesh

引用次数: 4

Non-Naive Bayesian classifier for Farmer Advisory System 农民咨询系统的非朴素贝叶斯分类器

2014 Sixth International Conference on Advanced Computing (ICoAC) Pub Date : 2014-12-01 DOI: 10.1109/ICOAC.2014.7229720

D. Santhosh, V. Pandiyaraju, A. Kannan

引用次数: 1

Job scheduling using Minimum Variation First algorithm in cloud computing 云计算中基于最小方差优先算法的作业调度

2014 Sixth International Conference on Advanced Computing (ICoAC) Pub Date : 2014-12-01 DOI: 10.1109/ICOAC.2014.7229708

Dinesh Komarasamy, V. Muthuswamy

{"title":"Job scheduling using Minimum Variation First algorithm in cloud computing","authors":"Dinesh Komarasamy, V. Muthuswamy","doi":"10.1109/ICOAC.2014.7229708","DOIUrl":"https://doi.org/10.1109/ICOAC.2014.7229708","url":null,"abstract":"Nowadays, the problems are becoming more complicated due to the development of fields related to science and engineering. Cloud computing plays a major role to figure out these complicated problems. Cloud computing is generally categorized into computation intensive and storage intensive model. Cloud collects congregate myriad number of requests from the user (i.e. treated as batch jobs). Hence, scheduling algorithm plays a major role for effectively scheduling of the jobs to the underlying resources scattered in and around the universe. The resources are linked through high speed network. This paper posits Minimum Variation First algorithm (MVF) for effective scheduling of batch jobs. The difference between the expected execution time on the job and its corresponding deadline is recognized as a necessary parameter for allocating the resource for a job. The involvement of this paper is considered as twofold. First, the deadline based jobs are scheduled using the proposed MVF algorithm that will schedule with uniform and non-uniform deadline based jobs. Second, the jobs are scheduled using improved MVF (iMVF) algorithm for avoiding starvation. The experimental results show the performance of these algorithms (MVF and iMVF algorithm) is better compared to other algorithms using CloudSim.","PeriodicalId":325520,"journal":{"name":"2014 Sixth International Conference on Advanced Computing (ICoAC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114796595","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

Public audit on dynamic data preserving user identity and data freshness 对动态数据进行公开审计，保证用户身份和数据的新鲜度

2014 Sixth International Conference on Advanced Computing (ICoAC) Pub Date : 2014-12-01 DOI: 10.1109/ICOAC.2014.7229741

K. Swathy, N. Velvizhi

引用次数: 0

DSP architecture with folded tree for power constraint devices 功率约束器件的折叠树DSP结构

2014 Sixth International Conference on Advanced Computing (ICoAC) Pub Date : 2014-12-01 DOI: 10.1109/ICOAC.2014.7229757

K. Ranjithkumar, T. Anandharajan

{"title":"DSP architecture with folded tree for power constraint devices","authors":"K. Ranjithkumar, T. Anandharajan","doi":"10.1109/ICOAC.2014.7229757","DOIUrl":"https://doi.org/10.1109/ICOAC.2014.7229757","url":null,"abstract":"Energy consumption in Digital Signal Processing (DSP) application is a vital parameter of consideration. Mostly DSP applications deplete power. Battery constraint is important in many mobiles, processors, and sensor-related devices. The major critical operations in DSP architecture are multiplication and addition. Multiplication process is performed using repetitive addition. Hence, adder is the basic component used in digital signal processor. DSP architecture is proposed with the energy-efficient goal. Traditional carry select adder contains ripple carry adder block is replaced by parallel prefix adder. By replacing that block and introducing folded tree, we can reduce power used by DSP processors. This architecture can be used in all power constrained DSP applications. In the existing system, folded tree is used in architecture to reduce the number of processing elements, and they used carry look-ahead adder to perform the internal processing element operations. In the proposed system, carry look-ahead adder is replaced by LFA and PA to harness the energy depleted in an application (e.g., DSP application). Power consumption is reduced by 12-15% as compared with the existing algorithms using Cyclone III (EP3C16F484C6).","PeriodicalId":325520,"journal":{"name":"2014 Sixth International Conference on Advanced Computing (ICoAC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115769000","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

Modified RPCA with Hessian matrix for object detection in video surveillance on highways 基于Hessian矩阵的改进RPCA高速公路视频监控目标检测

2014 Sixth International Conference on Advanced Computing (ICoAC) Pub Date : 2014-12-01 DOI: 10.1109/ICOAC.2014.7229719

K. Kiruba, P. Sathiya, P. Anandhakumar

{"title":"Modified RPCA with Hessian matrix for object detection in video surveillance on highways","authors":"K. Kiruba, P. Sathiya, P. Anandhakumar","doi":"10.1109/ICOAC.2014.7229719","DOIUrl":"https://doi.org/10.1109/ICOAC.2014.7229719","url":null,"abstract":"Video surveillance is an active research topic in computer vision research area to detect the abnormal behavior of vehicle and pedestrian on the highways in order to reduce the collision between them. Statistical methods are helpful in identifying the abnormal behavior of vehicle and human in order to avoid the accident on the highways. To build an effective automatic system that should determine the number of pedestrian and vehicles, if there are any, then their distance and speed needs to be calculated. Detecting object and calculating their speed and distance is challenging task because objects are moving fast on highways, and appear at different scales. In this paper, we propose a Modified RPCA with Hessian matrix for vehicle and pedestrian detection. By using an SVM classifier, it will be able to classify the objects in the current frame. Distance is calculated between the vehicle and pedestrian, speed and their locations. If the distance value is below the defined coverage (50 meters) their performance is evaluated and compared between RPCA and Modified RPCA. The modified RPCA is more efficient than RPCA.","PeriodicalId":325520,"journal":{"name":"2014 Sixth International Conference on Advanced Computing (ICoAC)","volume":"18 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123574729","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

Intelligent stealthy attack on MAODV in mobile ad hoc networks 移动自组网中MAODV的智能隐身攻击

2014 Sixth International Conference on Advanced Computing (ICoAC) Pub Date : 2014-12-01 DOI: 10.1109/ICOAC.2014.7229740

A. Pushpa, K. Kathiravan

{"title":"Intelligent stealthy attack on MAODV in mobile ad hoc networks","authors":"A. Pushpa, K. Kathiravan","doi":"10.1109/ICOAC.2014.7229740","DOIUrl":"https://doi.org/10.1109/ICOAC.2014.7229740","url":null,"abstract":"Nowadays, common interest in an information grows rapidly that evolves, many application areas like share market, e- agribusiness and on-demand services. In these applications, delivering information to multiple receivers at the same time makes multicast communication is the next generation dominated data transmission mechanism in mobile ad hoc networks. In spite of efficient bandwidth utilization, multicast is most vulnerable against various types of internal and Byzantine attacks. Existing Intrusion Detection Systems and attacker prevention techniques act too smart to defend these attacking strategies. Accordingly adversaries also update their attacking strategy intelligently to intervene the successful defending schemes. In our work, we present a novel intelligent internal attack on a tree-based multicast routing protocol in MANET. Intelligent adversary launches it's attacking strategy on MAC layer against collision avoidance mechanism only when it can gain more in an attack's success rate. Our simulation study observes the robustness of MAODV against this internal attacking approach. Multicast session's performance metrics such as PDR, throughput and packets drop ratio are analyzed with the presence of adversaries in the multicast group. We also examine the impact of attacker's location in the multicast tree. We design an analytical model that shows the impact of internal attack on multicast group through empirical study. Analytical results compare with NS2 simulation results that prove the validity of analytical models. This empirical study illustrates the importance of designing smarter internal attacker detection mechanism to protect multicast routing protocols from the above-mentioned intelligent internal attacks.","PeriodicalId":325520,"journal":{"name":"2014 Sixth International Conference on Advanced Computing (ICoAC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117236017","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

Vertical handover performance investigation with discrete event system simulation in next generation wireless network 基于离散事件系统仿真的下一代无线网络垂直切换性能研究

2014 Sixth International Conference on Advanced Computing (ICoAC) Pub Date : 2014-12-01 DOI: 10.1109/ICOAC.2014.7229714

E. Malathy, V. Muthuswamy

引用次数: 1