2014 International Conference on Recent Trends in Information Technology最新文献_第4页

Analysis of acoustic signals from rotating machines for wear detection 用于磨损检测的旋转机械声信号分析

2014 International Conference on Recent Trends in Information Technology Pub Date : 2014-04-10 DOI: 10.1109/ICRTIT.2014.6996206

N. Iyer, Suresh R. Norman

引用次数: 2

CORDIC iterations based architecture for low power and high quality DCT 基于CORDIC迭代的低功耗高质量DCT体系结构

2014 International Conference on Recent Trends in Information Technology Pub Date : 2014-04-10 DOI: 10.1109/ICRTIT.2014.6996195

E. Leavline, S. Megala, D. A. A. G. Singh

引用次数: 3

Semi - Markov based node behavior model for isolating selfish neighbors in MANETs 基于半马尔可夫节点行为模型的自利邻居隔离

2014 International Conference on Recent Trends in Information Technology Pub Date : 2014-04-10 DOI: 10.1109/ICRTIT.2014.6996155

J. Sengathir, R. Manoharan, R. Raja Kumar

引用次数: 1

EmoMeter: Measuring mixed emotions using weighted combinational model 情绪测量:使用加权组合模型测量混合情绪

2014 International Conference on Recent Trends in Information Technology Pub Date : 2014-04-10 DOI: 10.1109/ICRTIT.2014.6996192

S. Kanagaraj, A. Shahina, M. Devosh, N. Kamalakannan

引用次数: 5

Peak: Power efficiency analysis for key distribution in Wireless Sensor Network 峰值:无线传感器网络中密钥分配的功率效率分析

2014 International Conference on Recent Trends in Information Technology Pub Date : 2014-04-10 DOI: 10.1109/ICRTIT.2014.6996202

M. Raghini, N. Maheswari, R. Venkatesh

引用次数: 0

Dynamic secure storage system in cloud services 云服务中的动态安全存储系统

2014 International Conference on Recent Trends in Information Technology Pub Date : 2014-04-10 DOI: 10.1109/ICRTIT.2014.6996175

G. J. Rathanam, M. Sumalatha

引用次数: 5

Graph based resource recommender system 基于图的资源推荐系统

2014 International Conference on Recent Trends in Information Technology Pub Date : 2014-04-10 DOI: 10.1109/ICRTIT.2014.6996187

P. Pabitha, G. Amirthavalli, C. Vasuki, J. Mridhula

{"title":"Graph based resource recommender system","authors":"P. Pabitha, G. Amirthavalli, C. Vasuki, J. Mridhula","doi":"10.1109/ICRTIT.2014.6996187","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996187","url":null,"abstract":"As technology improves day by day communication and browsing has become very much easier. However lots of information floods over the internet every moment thereby confusing the user as to select what or make decisions. To assist the user in identifying their interests and provide suggestions, recommendation systems came into existence. These systems filter the necessary content from large volumes of data to predict resources to the user. Common techniques used to implement recommender systems are content based approach or collaborative approach. However there are few limitations like data not being available for new users, ratings very sparse for resources. A graph based recommender system is proposed that makes useful recommendations by exploiting the significant content available. Clustering technique is used to identify the neighbourhood of the current user so that relevant resources are suggested. A weight based approach is used to calculate the ratings for the resources. This method is adopted to make the system less prone to data sparsity problem. This system is a web based client side application which makes recommendations by constructing user-resource graph and ranking the resources by a new method designed similar to that of search algorithms.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125738541","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

Flow and rank correlation based detection against Distributed Reflection Denial of Service attack 基于流量和等级相关性的分布式反射拒绝服务攻击检测

2014 International Conference on Recent Trends in Information Technology Pub Date : 2014-04-10 DOI: 10.1109/ICRTIT.2014.6996117

P. Revathi

{"title":"Flow and rank correlation based detection against Distributed Reflection Denial of Service attack","authors":"P. Revathi","doi":"10.1109/ICRTIT.2014.6996117","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996117","url":null,"abstract":"Denial of service attack in computing involves blocking of resources to particular user. This kind of blocking may be temporary or indefinite blocking to access web server in the network. This attack is usually done by a victim web server. Distributed denial of service attacks is given by more than two web servers. The flood of incoming network flows to the victim web server forces it to shut down. Although the attack's individual internet packets may be completely not dangerous and flood of such type of packets can overwhelm the victim server's internet connection or other packet-processing resources in the network. The result is that valid traffic, unable to compete with malicious flood, has little chance for obtaining useful service to legitimate users. This paper mainly concentrates on flow and rank correlation based algorithm (FRCD). With rank correlation we can check if there is any attack in the network or not. And having this as the base we could calculate flow correlation to check if this attack is legitimate or not. The proposed system is highly efficient and is a protocol independent method. The computational cost involved does not affect the network's throughput thereby increasing the possibilities of Distributed Reflection Denial of Service attack detection.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124653387","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}

引用次数: 4

An impact analysis: Real time DDoS attack detection and mitigation using machine learning 影响分析:使用机器学习进行实时DDoS攻击检测和缓解

2014 International Conference on Recent Trends in Information Technology Pub Date : 2014-04-10 DOI: 10.1109/ICRTIT.2014.6996133

B. Kiruthika, Devi, G. Preetha, G. Selvaram, S. Mercy, Shalinie Corresponding

{"title":"An impact analysis: Real time DDoS attack detection and mitigation using machine learning","authors":"B. Kiruthika, Devi, G. Preetha, G. Selvaram, S. Mercy, Shalinie Corresponding","doi":"10.1109/ICRTIT.2014.6996133","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996133","url":null,"abstract":"Distributed Denial of service (DDoS) attacks is the most devastating attack which tampers the normal functionality of critical services in internet community. DDoS cyber weapon is highly motivated by several aspects including hactivitism, personal revenge, anti-government force, disgruntled employers/customers, ideological and political cause, cyber espionage and so on. IP spoofing is the powerful technique used by attackers to disrupt the availability of services in the internet network by impersonating as a trusted source. Since the spoofed traffic shares the same resources as that of the legitimate one's detection and filtering becomes very essential. The proposed model consists of online monitoring system (OMS), spoofed traffic detection module and interface based rate limiting (IBRL) algorithm. OMS provides DDoS impact measurements in real time by monitoring the degradation in host and network performance metrics. The spoofed traffic detection module incorporates hop count inspection algorithm (HCF) to check the authenticity of incoming packet by means of source IP address and its corresponding hops to destined victim. HCF coupled with support vector machine (SVM) provides 98.99% accuracy with reduced false positive. Followed with, IBRL algorithm restricts the traffic aggregates at victim router when exceeding system limits in order to provide sufficient bandwidth for remaining flows.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128792697","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}

引用次数: 20

Distributing jobs in Delay-Tolerant Networks: Is optimization worth it? 在延迟容忍网络中分配作业:优化是否值得?

2014 International Conference on Recent Trends in Information Technology Pub Date : 2014-04-10 DOI: 10.1109/ICRTIT.2014.6996205

Akhilesh Jain, Prem Nath Suman, Kapil Tawar, Mayank Jain

{"title":"Distributing jobs in Delay-Tolerant Networks: Is optimization worth it?","authors":"Akhilesh Jain, Prem Nath Suman, Kapil Tawar, Mayank Jain","doi":"10.1109/ICRTIT.2014.6996205","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996205","url":null,"abstract":"Delay-Tolerant Networks (DTNs) refer to mobile wireless networks that lack continuous network connectivity among the nodes. To deal with such intermittent characteristics, DTNs use store-carry-and-forward based routing protocols instead of instantaneous end-to-end path transmissions. Many real-life applications of such networks have been identified and some of them pose complex computational challenges. DTN nodes, however, do not necessarily possess high degree of computational power and are also limited by their energy constraints. Distributed computing has the ability to solve computationally complex and lengthy problems by dividing them into many tasks, which are then spread over the network to be solved simultaneously, resulting in faster execution and significantly lower costs. In this paper, we study the prospect of distributed computing techniques in DTNs. We investigate different job distribution algorithms and their performance across multiple DTN scenarios. We simulate a distributed job processing system on top of a DTN for various scenarios and analyze the effect of node density, job slicing, and mobility models on their performance.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"09 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129916931","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