2006 International Conference on Advanced Computing and Communications最新文献

{"title":"Distributed Traffic Adaptive Wavelength Routing in IP-Over-WDM networks","authors":"B. Palanisamy, T. Prasad, N. Sreenath","doi":"10.1109/ADCOM.2006.4289928","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289928","url":null,"abstract":"In wavelength routed wavelength division multiplexing (WR-WDM) networks, a set of lightpaths (all-optical communication paths) defines the virtual topology. Internet protocol (IP) makes use of virtual topology to route its traffic in the optical form. The virtual topology is designed with an aim of minimizing certain objective function value. In the event of changes in traffic demand at the IP layer, the objective function value of the network (virtual topology) may be affected leading to decreased network performance. Thus, the underlying virtual topology needs to be changed in response to the changing traffic patterns in the IP layer. This process of changing the virtual topology to meet the traffic requirement is called as reconfiguration. As distributed networks like IP over WDM networks demand a fully distributed process for reconfiguration, we view the reconfiguration as an on-line distributed process that provides a trade-off between the objective function value and the number of changes committed to the virtual topology. The objective function value decides how best the topology is suited for the given traffic demand. The number of changes decides the extent of traffic disruption in the network while making a transition to the new virtual topology. The performance of the proposed methodology is studied through extensive simulation experiments in terms of objective function value of reconfigured topology and the number of changes performed to get the reconfigured topology.","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":"130440415","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 Weather Forecasting System using concept of Soft Computing: A new approach","authors":"A. Sharma, M. Manoria","doi":"10.1109/ADCOM.2006.4289915","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289915","url":null,"abstract":"Weather forecasting and warnings are the major services provided by the meteorological profession.. Many government and private agencies are working on its behavior but still it is challenging and incomplete. We propose a new technique to construct the learning set of images, which represents the actual data. We relate this data to the forthcoming weather events based on their previous records and history or whatever recognized by our system. Our work presents a new approach where the data explanation is performed with soft computing technique i.e. a neuro-fuzzy system is used to predict meteorological position on the basis of measurements by a weather system designed by us. This model can help us in making forecast of different weather conditions like rain and thunderstorm, sunshine and dry day, and perhaps a cloudy weather i.e. purpose of this model is to represent a warning system for likely adverse conditions. Our model is designed with a concept of Adaptive Forecasting Model(AFD) in the mind. The simple meaning of this term is that our model has potential to capture the complex relationships between many factors that contribute to certain weather conditions. The results are compared with actual working of meteorological department and these results confirm that our model which is based on soft computing have the potential for successful application to weather forecasting. We considered atmospheric pressure a primary key parameter and atmospheric temperature and relative humidity secondary type. We will, however, examine temperature as signature of weather conditions in some typical cases where we could observe the effect of temperature. As an example, the estimations produced by the proposed methodology were applied on different weather forecasting data provided by the Gwalior meteorology center to make the result more practical and believable. The forecasts are always current are based on neuro-fuzzy[2] systems that utilize the concept of soft computing. Real time processing of weather data indicate that the neuro-fuzzy based weather forecast have shown improvement not only over guidance forecasts from numerical models, but over official local weather service forecasts as well.Adaptive Forecasting Model(AFD)","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"42 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":"134102820","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":"Postfix Hardware Evaluation Unit for Genetic Algorithms: Application in Fuzzy Clustering","authors":"M. K. Pakhira","doi":"10.1109/ADCOM.2006.4289916","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289916","url":null,"abstract":"Genetic algorithms are a class of stochastic optimization techniques inspired by biological evolution processes. The power of GAs for solving complex problems is highly used in the design of parallel problem solving machines. High parallelism needs higher number of parallel processors to be used simultaneously. This approach may be costly in terms of efficiency and utilization of processors. GAs are time costly processes mainly because of their time consuming evaluation operations. Development of a low cost hardware evaluation unit may help reducing time complexities of GAs. In this paper, an attempt is made to show how the fitness evaluation operation of any genetically encoded problem can be performed by using a simple hardware. Our hardware uses a postfix notation of the fitness expression. Since, in GAs, the same function is evaluated for a fairly large number of times, we need to compile a postfix expression only once at the beginning of the genetic optimization process. We performed some simulation experiments on function optimization problems, in general. As an example of combinatorial optimization, we considered the fuzzy clustering problem.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"68 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":"129955530","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":"Evolutionary Selection of Kernels in Support Vector Machines","authors":"K. Thadani, Ashutosh, V. Jayaraman, V. Sundararajan","doi":"10.1109/ADCOM.2006.4289849","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289849","url":null,"abstract":"A machine learning algorithm using evolutionary algorithms and Support Vector Machines is presented. The kernel function of support vector machines are evolved using recently introduced Gene Expression Programming algorithms. This technique trains a support vector machine with the kernel function most suitable for the training data set rather than pre-specifying the kernel function. The fitness of the kernel is measured by calculating cross validation accuracy. SVM trained with the fittest kernels is then used to classify previously unseen data. The algorithm is elucidated using preliminary case studies for classification of cancer data and bank transaction data set. It is shown that the Evolutionary Support Vector Machine has good generalization properties when compared with Support Vector Machines using standard (polynomial and radial basis) kernel functions.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"3 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":"132247874","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":"An efficient approach to Salt & Pepper Impulse Noise Reduction using Iterative Impulse Detection and Correction Phases","authors":"K. Nallaperumal, J. Varghese, S. Saudia, D. Murugan, K. Rajalakshmi, S. Alwinallwin","doi":"10.1109/ADCOM.2006.4289957","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289957","url":null,"abstract":"The paper presents an improved median filter for salt & pepper impulse noise removal. The computationally efficient filtering technique is implemented as a two pass algorithm involving identification of corrupted pixels that are to be filtered are perfectly detected into a flag image using an iterative fixed sized smaller window approach and modification of them by a valid median. Experimental results have shown that the proposed algorithm performs far more superior than many of the median filtering techniques reported in terms of retaining the fidelity of the image highly corrupted by impulse noises even to the tune of ninety percent impulse noise.","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":"123775422","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":"Natural Histogram Partitioning based on Invariant Multi-phase Level Set","authors":"V. Sandeep, S. Kulkarni","doi":"10.1109/ADCOM.2006.4289906","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289906","url":null,"abstract":"Conventional image partitioning is commonly based on the histogram of the image. It is based on modal distribution and is generally modeled using the mixture of Gaussian distributions. This approach has couple of limitations. Firstly for the Gaussian, if large variance is used, then the partition may include more than one perceivable region. Secondly, if the two adjacent modal partitions are overlapped and are marginally discriminable, it may be difficult to partition. Thirdly, conventional histogram cannot be partitioned into predefined number of regions. This paper attempts to address all the three limitations using multi-phase level set functions. Here n-phase level set functions are used to partition an image into a maximum of 2\" perception-based regions, i.e. if the number of perceivable regions is less than 2\", then some of the regions are allowed to be empty.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"35 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":"125162581","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":"Preemption-Based Buffer Allocation in Video-on-Demand System","authors":"D. Sujatha, K. Girish, K. Rajesh, K. Venugopal, L. Patnaik","doi":"10.1109/ADCOM.2006.4289948","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289948","url":null,"abstract":"Present research focus is to explore several alternatives to improve the performance of a video-on-demand (VoD) system. The challenge in VoD application is to stream uninterrupted, synchronous and good quality multimedia data from a video server to a user over a high-speed network. Large number of concurrent users accessing a VoD system present a generic problem because of the load imposed on the video server. In this context, buffer management plays a critical role in retrieval and transfer of data. It also ensures that all the requests are guaranteed a sufficient amount of the buffer in order to improve the efficiency of the video server by reducing the initial latency. We have performed extensive analysis of the buffer requirements and conducted several runs of simulation experiment. The results show that preemption-based buffer allocation (PBBA) scheme reduces initial latency (over the number of user requests in service from one to maximum capacity) to twice that of the conventional scheme and the reneging probability is 5% to 6% with the mean reneging time of 30 seconds. The results demonstrate a significant improvement in the performance of the video-on-demand system.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"102 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":"125198143","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":"Energy Based Scheduling Algorithm for Real Time System","authors":"N. Sharma, R.S. Yadav","doi":"10.1109/ADCOM.2006.4289944","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289944","url":null,"abstract":"Energy based algorithm focuss to minimization the energy required in a given time period whereas maximization of number of task complete is mainly considered in deadline based scheme. The modified scheduling algorithm receive minimizing of energy requirement, enlarging the operation time period, more number of task complete services, higher level of reward received through the exploitation of reduce functionalities, varying the speed of processor dynamic voltage scaling, multi-version concept. The performance of modified algorithm is being measured through simulation studies. It has be an observed that proposed scheme perform will over range of application.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"101 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":"122026660","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 Process Variation Induced Transistor Mismatch on Sense Amplifier Performance","authors":"S. Rodrigues, M. S. Bhat","doi":"10.1109/ADCOM.2006.4289943","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289943","url":null,"abstract":"Sense amplifier is a very critical peripheral circuit in memories as its performance strongly affects both memory access time, and overall memory power dissipation. As the device dimensions scale below 100nm, the process variations are increasing and are impacting the circuit design significantly. The circuit yield loss caused by the process and device parameter variation has been more pronounced than before [1]. In this paper, effects of process variation induced transistor mismatch on sense amplifier performance are studied. A comparative study of the effect of mismatch on delay and yield for different sense amplifier configurations at 90 nm technology is presented.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"104 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":"127936796","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":"Some Investigations on ATM Congestion Control Mechanisms","authors":"R. Deshpande, P. Vyavahare","doi":"10.1109/ADCOM.2006.4289969","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289969","url":null,"abstract":"This research work address the fundamental issue of providing the desired quality of service (QoS) to the users of ABR service class in ATM networks by providing efficient flow control and congestion control scheme. A centralized flow control scheme (CFCS) is proposed which is simple to implement and has several added features than other flow control schemes reported in the literature. It is robust, scalable, achieves fairness, utilizes resources efficiently and also yields better performance in wireless environment. It also achieves high performance for today's realistic traffic patterns like bursty traffic, TCP/IP traffic, self-similar traffic etc. We show the effectiveness of our scheme by extensive computer simulation experiments.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"12 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":"127948530","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}