{"title":"A Phase and intensity preserved image denoising technique","authors":"J. Peter, V. Govindan","doi":"10.1109/ADCOM.2006.4289900","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289900","url":null,"abstract":"This paper explores the issues of denoising methodology by non-orthogonal, complex valued, log-Gabor wavelets, rather than the more usual orthogonal or bi-orthogonal wavelets. Thresholding of wavelet responses in the complex domain allows one to ensure that perceptually important phase information in the image is not corrupted. And to preserve the intensity information, the preprocessed image is given into the process of image registration with the same object of its atlas image. This method used the locally affine but globally smooth warping techniques.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129657257","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}
{"title":"Design and Development of Proactive Solutions for Mitigating Denial-of-Service Attacks","authors":"H. Nagesh, K. Sekaran","doi":"10.1109/ADCOM.2006.4289874","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289874","url":null,"abstract":"Denial of Service attacks, orchestrated by a single host or multiple hosts in a coordinated manner, has become an increasingly frequent disturbance in today's Internet. Generally, attackers launch DDoS attacks by directing a massive number of attack sources to send useless traffic to the victim. The victim's services are disrupted when its host or network resources are occupied by the attack traffic. The threat of DDoS attacks has become even more severe as attackers can compromise a huge number of computers using vulnerabilities in popular operating systems.This paper deals with Denial of service (DoS) and Distributed DoS (DDoS) attacks. In the first part, we categorize existing defense mechanisms, and analyze their strengths and weaknesses. In the second part of our investigation, we develop and evaluate two defense models for DoS attacks: the Secure Overlay Services (SOS) Model and the Server Hopping Model using distributed firewalls. Each of these models provide defense in a different part of the network, and has different resource requirements. In the third part of our investigation, we assess the effectiveness of our defense models for different types of DoS attack.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122496035","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}
K. Raju, M. V. Kartikeyan, R. C. Joshi, C. Shekhar
{"title":"Design of Architecture and Instruction-set of RASIP for SDR","authors":"K. Raju, M. V. Kartikeyan, R. C. Joshi, C. Shekhar","doi":"10.1109/ADCOM.2006.4289942","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289942","url":null,"abstract":"In this paper, a novel methodology has been presented for designing the architecture and its instruction-set for Reconfigurable Application Specific Instruction-set Processor (RASIP) for Software Defined Radio (SDR). We have described the architectural aspects by giving complete functionality of different modules present in the architecture. Instruction set design for the RASIP for achieving SDR functionality has been described and modeled for proposed architecture. We have introduced new concept of the user-defined instructions that are used for upgradation and modification of existing instruction set after designing the RASIP to incorporate new functionality. This flexibility is essential for any SDR to incorporate new standards in future. The complete system has been modeled in SystemC, which will allow simulation of hardware and software in a single environment. Simulated results of partial instructions of Instruction-Set and complete architecture are presented.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123014392","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}
{"title":"Design and Implementation of Peer-to-Peer E-Mail System","authors":"K. Ramesh, K. Venkateswarlu, R.C. Sekharam","doi":"10.1109/ADCOM.2006.4289855","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289855","url":null,"abstract":"E-mail has become the most widely used communication facility for all institutions and individuals in the present era. Existing E-mail systems employ a server-centric design in which the user is critically dependent on the mail server. Insecurity due to mail sever failures is a major problem faced by many users. Design and implementation of a secure Peer-to-Peer E-mail facility is addressed in this work. Locating the specific computer that stores the emails of a specific user is the critical design requirement for which a solution is offered through the implementation of Chord protocol, which maps an E-mail entity onto a specific node. The architectural design and implementation also provides for better confidentiality. The prototype implementation has been observed to provide a good scope for improved anonymity. We present our prototype implementation and discuss the scope of future extensions.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115866595","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}
{"title":"Analysis and Design of GPS based Target tracking system and MIL-STD-1553B Radar Target data","authors":"P. RamakanthKumar, G. Prabhushankar, S. Ilavarasu","doi":"10.1109/ADCOM.2006.4289974","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289974","url":null,"abstract":"The proposed system entitled \"Analysis and Design of GPS based Target tracking system and Radar Target data\" will help the pilot, test engineers and radar evaluation team in real time and during offline by means of analyzing the path of the target aircraft and HACK aircraft in desired map and will provide navigation specific parameters such as latitude, longitude, altitude, speed, range etc. The system will save the target information during flight. The system will work in both online and offline mode. In this system the data is received from two independent systems (i) GTTS: Target information is received from the data modem and (ii) RADAR: Target information tracked by the RADAR available on MIL-STD-1553Bus. Using GTTS and RADAR data, the flight position of the targets is calculated and the path of the flight is shown on the map. This system also provides different zoom in and zoom out features for different map selection.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131198864","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}
N.B. Kothari, Sudarshan TSB, S. Gurunarayanan, Chandrasekhar
{"title":"SOC design of a Low Power Wireless Sensor network node for Zigbee Systems","authors":"N.B. Kothari, Sudarshan TSB, S. Gurunarayanan, Chandrasekhar","doi":"10.1109/ADCOM.2006.4289936","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289936","url":null,"abstract":"We present a SoC architecture of a wireless sensor network node for the zigbee protocol which can both serve as an independent chip or also be incorporated as a component of a larger system. We describe the attributes that a design must possess in order to function effectively in a densely populated sensor network and then discuss the proposed architecture design adhering to these attributes. We draw comparisons between proposed architecture and some already existing ones and finally highlight the advantages of using the proposed SoC design.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126571562","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}
{"title":"Clickstream Intelligent Clustering using Accelerated Ant Colony Algorithm","authors":"H. Inbarani, K. Thangavel","doi":"10.1109/ADCOM.2006.4289869","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289869","url":null,"abstract":"Web Mining is the extraction of interesting and potentially useful patterns and implicit information from artifacts or activity related to the Worldwide Web. There are three knowledge discovery domains that pertain to web mining: Web Content Mining, Web Structure Mining, and Web Usage Mining. Web usage mining is the process of extracting interesting patterns from web access logs. Categorizing visitors based on their interactions with a website is a key problem in Web usage mining. The clickstreams generated by various users often follow distinct patterns, the knowledge of which may help in providing customized content. In this paper, we focus on clickstream clustering based on their navigation behavior and the time spent at each page and we propose an accelerated ant based clustering algorithm (ACCANTCLUST) which is based on chemical recognition system of ants and this algorithm finds the number of clusters automatically. A comparative analysis is performed with ant colony clustering algorithm (ANTCLUST) by taking different session data sets of a Web site. Empirical results clearly show that the proposed ACCANTCLUST performs well when compared ANTCLUST.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115705911","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}
{"title":"EfficientTreeMiner: Mining Frequent Induced Substructures from XML Documents without Candidate Generation","authors":"P. S. Thilagam, V. S. Ananthanarayana","doi":"10.1109/ADCOM.2006.4289951","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289951","url":null,"abstract":"Tree structures are used extensively in domains such as XML databases, computational biology, pattern recognition, computer networks, Web mining, multi-relational data mining and so on. In this paper, we present an EfficientTreeMiner, a computationally efficient algorithm that discovers all frequently occurring induced subtrees in a database of labeled rooted unordered trees. The proposed algorithm mines frequent subtrees without generating any candidate subtrees. Efficiency is achieved by compressing the large database into a condensed data structure, namely prefix string representation, which reduces space complexity and by adopting a frequent immediate descendents method that avoids the costly generation of candidate sets. Experimental results show that our algorithm has less time complexity when compared to existing approaches and is also scalable for mining both long and short frequent subtrees.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"74 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120922966","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}
{"title":"Adaptive Overlays for Event Based Middleware: A case for Chordal Reliability Rings","authors":"S. D. Madhu Kumar, U. Bellur, V. Govindan","doi":"10.1109/ADCOM.2006.4289852","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289852","url":null,"abstract":"Distributed, event based applications executing on publish-subscribe middleware (a.k.a. event based middleware or EBM) are subject to many disruptive changes at runtime. These changes can be caused either by a change in environmental conditions such as the failure of an event broker node or can be caused by dynamically evolving application needs such as the sudden need to route events securely from a specific publisher to a set of subscribers. Ideally, the middleware should facilitate uninterrupted execution of applications without costly redeployment in the face of these changes. We formally study the requirements of such an \"adaptive\" middleware infrastructure and analyze adaptation in existing efforts. An adaptive overlay for a core level adaptive middleware with a chordal reliability ring is proposed on the basis of the study. We illustrate and prove that two of the adaptation triggers -node and link failures can be handled by the middleware in O(log n) time with the help of the chordal reliability ring.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121602888","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}
{"title":"Impact of IPSec Overhead on Web Application Servers","authors":"S. Meenakshi, S. Raghavan","doi":"10.1109/ADCOM.2006.4289981","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289981","url":null,"abstract":"IPSec provides Maturity solutions to various network based applications i.e., web applications. Implementing the, IPSec in network layer includes significant bandwidth and processing time, overhead to application traffic. The upperlayer protocols such as TCP and UDP behaviour is also influenced by these overheads. In war work, we have studied the impact of IPSee on the metrics: Round Trip Time, Average Burst Size and Available Bandwidth for IPv4 and IPv6 network traffic.HMAC-MD5 authentication algorithm, advanced encryption standard encryption algorithm, and deflate comperession algorithm are used for the protocols of IPSec. From the characterized metrics and computed overheads we analyze tile impact of IPSec on connection handling capacity of web application servers by considering the user behaviour on web page requests.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"296 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126377192","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}