{"title":"Modelling Search, Availability, and Parallel Download in P2P File Sharing Applications with Fluid Model","authors":"D. Manini, M. Gribaudo","doi":"10.1109/ADCOM.2006.4289934","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289934","url":null,"abstract":"File transfer using peer-to-peer file sharing applications is usually divided into two steps: resource search and resource download. Depending on the file size and its popularity, either of the two phases can become the bottleneck. In this paper we describe both the location and download phases of a generic peer-to-peer file sharing application using a fluid model. The proposed model allows the computation of the transfer time distribution, and it is capable of considering some advanced characteristic such as parallel downloads and on-off peer behavior. Model parameters reflect network, application, resource and user characteristics, and can be tuned to analyze a large number of different real peer-to-peer implementations file transfer using peer-to-peer file sharing applications is usually divided into two steps: resource search and resource download. Depending on the file size and its popularity, either of the two phases can become the bottleneck. In this paper we describe both the location and download phases of a generic peer-to-peer file sharing application using a fluid model. The proposed model allows the computation of the transfer time distribution, and it is capable of considering some advanced characteristic such as parallel downloads and on-off peer behavior. Model parameters reflect network, application, resource and user characteristics, and can be tuned to analyze a large number of different real peer-to-peer implementations.","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":"129388312","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}
B. S. Shajeemohan, Dr. V. K. Govindan, Baby Vijilin
{"title":"A Scheme for Image Classification and Adaptive Mother Wavelet Selection","authors":"B. S. Shajeemohan, Dr. V. K. Govindan, Baby Vijilin","doi":"10.1109/ADCOM.2006.4289905","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289905","url":null,"abstract":"Wavelet based image coders are gaining popularity. The performances of such image coders are highly depend up on the selection of an appropriate wavelet for a particular image. There are many suggestions to classify images in to classes. In this paper, we are introducing classification of the images based on their statistical properties. Once the image is assigned to a particular class based on their statistical properties, then an appropriate wavelet is to be selected for the compression. A technique called adaptive mother wavelet selection scheme is proposed. The approach is based on the classification of images into different groups and associating each of the groups with the best wavelet that provides best quality images for a given amount of compression. Performance quality measures like PQS, bit rate, PSNR are used for judging the best wavelet for a class of images. Image properties like mean, standard deviation, and skewness are used for classifying images into groups such as texture, human, and aerial. Implementation results on test images demonstrate the superiority of the proposed technique.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"164 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":"131123287","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":"Scheduling Parallel Job on Param Padma with Mpich","authors":"N. Seetharamakrishna, G. Misra, A. Sarkar","doi":"10.1109/ADCOM.2006.4289848","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289848","url":null,"abstract":"We have implemented a job scheduling system for massively parallel system with Mpich that supports different scheduling policies for execution of parallel jobs. The system is available on C-DAC HPC cluster Param Padma. It is highly modular scalable and can easily be adapted to variety of other MPP systems. Conventional job scheduler daemons take a part of resources continuously for its own activity that reduces the overall computational metric of the cluster. The scheduler minimized this resource usage by eliminating scheduler acceptor and resource monitoring daemons on the each compute nodes. This idea provides better utilization of resources on the cluster.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"95 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":"132430663","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}
S. Tarannum, B. Aravinda, L. Nalini, K. Venugopal, L. Patnaik
{"title":"Routing Protocol for Lifetime Maximization of Wireless Sensor Networks","authors":"S. Tarannum, B. Aravinda, L. Nalini, K. Venugopal, L. Patnaik","doi":"10.1109/ADCOM.2006.4289925","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289925","url":null,"abstract":"Wireless sensor networks (WSNs) consist of a large population of sensor nodes capable of computation, communication and sensing. Such a network will enable the reliable monitoring of a variety of environments for both civil and military applications. The wireless sensor node, being a microelectronic device, can only be equipped with a limited power source (0.5 Ah, 1.2 V). In some application scenarios, replenishment of power resources might be impossible. The lifetime of a sensor node shows a strong dependence on battery lifetime. Starting from the basic idea of classical directed diffusion, we introduce some innovations in the algorithm giving rise to energy efficient routing protocol (EERP). EERP communication routing protocol can have significant impact on the overall energy consumption and hence on the performance of these networks. Simulation results show a considerable performance improvement and energy saving leading to an overall improvement in network lifetime over classical directed diffusion.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"1245 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":"115003891","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":"Image Segmentation using Gabor Transform and S- Transform","authors":"G. Jena, R. Baliarsingh, S.K. Jena, G. Prasad","doi":"10.1109/ADCOM.2006.4289967","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289967","url":null,"abstract":"In this paper we have taken the Gabor Transform (GT) and S Transformation (ST) to carryout the image segmentation of an acquired image. In GT the spectrum of the windowed segment of image i(x,y) centered at nx0 and ny0 and it suffers from variable resolution in the spatial domain where the limit is determined by the width of the localized window. Here signals of period longer than the window width are not represented. This resolution problem has been taken care by the Wavelet Transform (WT) by the introduction of a dilation parameter, d. Here the image segmentation using GT and S Transform is compared. From the result it is evident that the ST is superior to GT.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"34 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":"117012650","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":"Qualitative Parametric Comparison of Load Balancing Algorithms in Distributed Computing Environment","authors":"A. Chhabra, G. Singh","doi":"10.1109/ADCOM.2006.4289856","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289856","url":null,"abstract":"Substantive research in the field of distributed computing has shown that in a multi-processor system the probability of one of the processor being idle while other processor has multiple jobs queued up can be very high. Such imbalances in system load suggest that performance can be improved by either transferring jobs from the currently heavily loaded processors to the lightly loaded ones or distributing load evenly or fairly among the processors. The algorithms known as load balancing algorithms, helps to achieve the above said goal(s). These algorithms come into two basic categories -static and dynamic. While static load balancing algorithms (SLB) take decisions regarding assignment of tasks to processors based on the average estimated values of process execution times and communication delays at compile time, Dynamic load balancing algorithms (DLB) are adaptive to changing situations and take decisions at run time. The objective of this paper work is Firstly, to identify qualitative parameters for the comparison of above said algorithms and Secondly, to carry out comparison between SLB and DLB algorithms based on these identified parameters. In future this work can be extended to develop a virtual experimental environment to study these load balancing algorithms based on identified comparative parameters quantitatively.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"297 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":"116318455","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":"A Two-stage Hybrid Model for Intrusion Detection","authors":"Krishnamoorthi, N. Reddy, U. D. Acharya","doi":"10.1109/ADCOM.2006.4289875","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289875","url":null,"abstract":"As the number of networked computers grows, intrusion detection is an essential component in keeping networks secure. Various approaches to intrusion detection are currently being in use with each one has its own merits and demerits. This paper presents a hybrid approach for modeling intrusion detection system (IDS). Rule based classifier and simple K-means clustering are combined as a hybrid intelligent system. The initial prototype developed by the rule base classifier improves the performance of K-means clustering. The results show that the developed hybrid model provides better IDS.","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":"125034236","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":"Enhancement in ARM Code Optimization for Memory Constrained Embedded Systems","authors":"S. Thangaraj, S. Gummadi, S. Radhakrishnan","doi":"10.1109/ADCOM.2006.4289940","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289940","url":null,"abstract":"In recent years the supremacy of embedded system has increased tremendously in such a way that it has impinged into all the mobile and multimedia applications. While designing an embedded system application, apart from execution speed, the most important factor that has to be considered is the total cost of the system. Most of the application that run on embedded platform faces a common problem with the availability of restricted or very small memory area available for storing the application program. The cost of the embedded system mostly depends on the amount of memory used. Reducing the code size is a straight forward solution to minimize the memory used by the application program. In this paper we propose a new unique method which will reduce the code size to approximately 5% of a code which has already passed through all the levels of optimization embedded in the Keil compiler.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"25 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":"127379047","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":"A novel data structure for efficient representation of large data sets in data mining","authors":"R. Pai, V. S. Ananthanarayana","doi":"10.1109/ADCOM.2006.4289952","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289952","url":null,"abstract":"An important goal in data mining is to generate an abstraction of the data. Such an abstraction helps in reducing the time and space requirements of the overall decision making process. It is also important that the abstraction be generated from the data in small number of scans. In this paper, we propose a novel data structure called prefix-postfix structure(PP-structure), which is an abstraction of the data that can be built by scanning the database only once. We prove that this structure is compact, complete and incremental and therefore is suitable to represent dynamic databases. Further, we propose a clustering algorithm using this structure. The proposed algorithm is tested on different real world datasets and is shown that the algorithm is both space efficient and time efficient for large datasets without sacrificing for the accuracy. We compare our algorithm with other algorithms and show the effectiveness of our algorithm.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"38 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":"127533520","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}
T. Somasundaram, R. Balachandar, Vyas Swaminathan, Ashwin Kumar, Venkatesh Paramasivan
{"title":"Semantic Description and Discovery of Grid Services using WSDL-S and QoS based Matchmaking Algorithm","authors":"T. Somasundaram, R. Balachandar, Vyas Swaminathan, Ashwin Kumar, Venkatesh Paramasivan","doi":"10.1109/ADCOM.2006.4289866","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289866","url":null,"abstract":"This paper addresses the problem of describing and discovering grid services semantically in a heterogeneous grid environment. We propose a matchmaking system that enables semantic descriptions of grid services using WSDL-S. Also, the matchmaking algorithm proposed in our system uses weighted QoS factors to match requests with service advertisements. The semantic similarity between the requested capability and that of the advertised ones is determined using the respective domain ontology. We also propose ontology clustering to group similar categories of advertisements so that service discovery becomes fast and accurate.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"2271 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":"130249936","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}