In this paper a fuzzy logic based control scheme has been proposed for distillation column. Fuzzy Inference Systems (FIS) is proposed to adjust the manipulated variables to get the desired composition of products for a binary distillation column. To control the top and bottom product composition two separate fuzzy inference systems has been designed. The scheme uses fuzzy rules and reasoning to determine the desired outputs based on the error signal and its first difference
{"title":"Fuzzy rule-based controller for binary distillation column","authors":"Ashutosh Kumar Singh, B. Tyagi, Vishal Kumar","doi":"10.1145/2007052.2007086","DOIUrl":"https://doi.org/10.1145/2007052.2007086","url":null,"abstract":"In this paper a fuzzy logic based control scheme has been proposed for distillation column. Fuzzy Inference Systems (FIS) is proposed to adjust the manipulated variables to get the desired composition of products for a binary distillation column. To control the top and bottom product composition two separate fuzzy inference systems has been designed. The scheme uses fuzzy rules and reasoning to determine the desired outputs based on the error signal and its first difference","PeriodicalId":348804,"journal":{"name":"International Conference on Advances in Computing and Artificial Intelligence","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122667815","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}
With rapid growth in internet traffic over last couple of years due to the usage of large number of internet applications, IP traffic classification becomes very necessary for various internet service providers to optimize their network performance and for governmental intelligence organizations. Today, traditional IP traffic classification techniques such as port number and payload based direct packet inspection techniques are rarely used because of use of dynamic port number instead of well-known port number in packet headers and various cryptographic techniques which inhibit inspection of packet payload. Current trends are use of machine learning (ML) techniques for IP traffic classification. In this research paper, two different real time internet traffic datasets has been developed using packet capturing tool for 2 minute and 2 second packet capturing duration. After that, five ML algorithms MLP, RBF, C4.5, Bayes Net and Naïve Bayes are employed for internet traffic classification with these datasets. This experimental analysis shows that Bayes Net and C4.5 are effective ML techniques for IP traffic classification with accuracy in the range of 88% with reduction in packet capturing duration.
{"title":"Feature extraction based IP traffic classification using machine learning","authors":"Kuldeep Singh, S. Agrawal","doi":"10.1145/2007052.2007095","DOIUrl":"https://doi.org/10.1145/2007052.2007095","url":null,"abstract":"With rapid growth in internet traffic over last couple of years due to the usage of large number of internet applications, IP traffic classification becomes very necessary for various internet service providers to optimize their network performance and for governmental intelligence organizations. Today, traditional IP traffic classification techniques such as port number and payload based direct packet inspection techniques are rarely used because of use of dynamic port number instead of well-known port number in packet headers and various cryptographic techniques which inhibit inspection of packet payload. Current trends are use of machine learning (ML) techniques for IP traffic classification. In this research paper, two different real time internet traffic datasets has been developed using packet capturing tool for 2 minute and 2 second packet capturing duration. After that, five ML algorithms MLP, RBF, C4.5, Bayes Net and Naïve Bayes are employed for internet traffic classification with these datasets. This experimental analysis shows that Bayes Net and C4.5 are effective ML techniques for IP traffic classification with accuracy in the range of 88% with reduction in packet capturing duration.","PeriodicalId":348804,"journal":{"name":"International Conference on Advances in Computing and Artificial Intelligence","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128588184","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}
The wireless communication has earned much popularity, in the recent past. The discipline has been able to grab the focus of academia and the attention of industry. Specifically, the variants of wireless communication, like MANET, BAN, PAN, VANET, etc, are scoring more as they are highly adaptive in nature and light in installation. However, the coordination among the nodes, of such networks, stands still as a challenge. In the context of MANET, a wide range of coordination protocols exist for fault free as well as faulty scenario. Some of them provide very limited failure resiliency by electing vice-leader whereas others exhibit slightly better failure tolerance by having more than one passive (stand by) leaders. Unfortunately, in the worst case, when both, leader and possible alternatives crash, these protocols initiate a completely new instance of the protocol. In this paper, we propose a best node based election protocol. Also, we provide a simple and proactive approach to make the protocol fault tolerant. Moreover, the fault tolerant approach provided in the article can be implemented in most of the leader election protocols, specifically, used in wireless communication. However, we have considered mobile ad hoc environment to show case the strength of our proactive approach. The proposal has been substantiated by efficiency analysis and exhaustive simulation.
{"title":"Trivial solution for a non-trivial problem in MANETs","authors":"Awadhesh Kumar Singh, Shantanu Sharma","doi":"10.1145/2007052.2007075","DOIUrl":"https://doi.org/10.1145/2007052.2007075","url":null,"abstract":"The wireless communication has earned much popularity, in the recent past. The discipline has been able to grab the focus of academia and the attention of industry. Specifically, the variants of wireless communication, like MANET, BAN, PAN, VANET, etc, are scoring more as they are highly adaptive in nature and light in installation. However, the coordination among the nodes, of such networks, stands still as a challenge. In the context of MANET, a wide range of coordination protocols exist for fault free as well as faulty scenario. Some of them provide very limited failure resiliency by electing vice-leader whereas others exhibit slightly better failure tolerance by having more than one passive (stand by) leaders. Unfortunately, in the worst case, when both, leader and possible alternatives crash, these protocols initiate a completely new instance of the protocol. In this paper, we propose a best node based election protocol. Also, we provide a simple and proactive approach to make the protocol fault tolerant. Moreover, the fault tolerant approach provided in the article can be implemented in most of the leader election protocols, specifically, used in wireless communication. However, we have considered mobile ad hoc environment to show case the strength of our proactive approach. The proposal has been substantiated by efficiency analysis and exhaustive simulation.","PeriodicalId":348804,"journal":{"name":"International Conference on Advances in Computing and Artificial Intelligence","volume":"330 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133433828","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}
Cloud computing is an emerging model of business computing. It is basically a model that helps to provide on-demand network access from a shared pool that consists of client computers, distributed servers, cloud storage, applications and cloud services to the consumers. Cloud computing is definitely more than the internet. It is touching the new heights in the modern era. Cloud computing is making the computer industry more fashionable than the women's fashion. This paper basically tells about cloud components, cloud services and discusses about pros & cons of cloud computing.
{"title":"Contemporary study of cloud computing environment","authors":"V. Kukreja, Jaiteg Singh, Anju Sharma","doi":"10.1145/2007052.2007101","DOIUrl":"https://doi.org/10.1145/2007052.2007101","url":null,"abstract":"Cloud computing is an emerging model of business computing. It is basically a model that helps to provide on-demand network access from a shared pool that consists of client computers, distributed servers, cloud storage, applications and cloud services to the consumers. Cloud computing is definitely more than the internet. It is touching the new heights in the modern era. Cloud computing is making the computer industry more fashionable than the women's fashion. This paper basically tells about cloud components, cloud services and discusses about pros & cons of cloud computing.","PeriodicalId":348804,"journal":{"name":"International Conference on Advances in Computing and Artificial Intelligence","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121178840","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}
This paper presents the performance evaluation of different segmentation algorithms for medical images. Accuracy and clarity are very important issues for medical imaging and same in the case with segmentation. In this paper, we have proposed a level set method without reinitialization with some specific shapes for segmentation and compared our proposed approach for segmentation with three other approaches where the first approach is based on region splitting based region growing category, second is based on region merging based region growing category and third is based on level set. This comparison is based on six different performance parameters namely Mean Square Error (MSE), Peak Signal to Noise Ratio (PSNR), Maximum Difference (MD), Normalized Cross Correlation (NCC), Normalized Absolute Error (NAE) and Structural Content (SC). We have compared the proposed approach with three above mentioned approaches for several images, out of which results for four images are provided in this paper, and we find that the approach is better than the other one.
{"title":"Performance evaluation on segmentation methods for medical images","authors":"M. Khare, R. Srivastava, A. Khare","doi":"10.1145/2007052.2007062","DOIUrl":"https://doi.org/10.1145/2007052.2007062","url":null,"abstract":"This paper presents the performance evaluation of different segmentation algorithms for medical images. Accuracy and clarity are very important issues for medical imaging and same in the case with segmentation. In this paper, we have proposed a level set method without reinitialization with some specific shapes for segmentation and compared our proposed approach for segmentation with three other approaches where the first approach is based on region splitting based region growing category, second is based on region merging based region growing category and third is based on level set. This comparison is based on six different performance parameters namely Mean Square Error (MSE), Peak Signal to Noise Ratio (PSNR), Maximum Difference (MD), Normalized Cross Correlation (NCC), Normalized Absolute Error (NAE) and Structural Content (SC). We have compared the proposed approach with three above mentioned approaches for several images, out of which results for four images are provided in this paper, and we find that the approach is better than the other one.","PeriodicalId":348804,"journal":{"name":"International Conference on Advances in Computing and Artificial Intelligence","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129904570","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}
There are various methods to estimate the scene flow. Most of the methods use motion estimation with stereo re-construction. This paper describes an interesting way to fuse the video from two camera's and create a 3D reconstruction. The proposed algorithm incorporates probabilistic distributions for optical flow and disparity. Multiple such re-created renderings can be put together to create re-timed movies of the event, with the resulting visual experience richer than that of a regular video clip, or switching between images from multiple cameras, do a head tracking of the viewer and change the view angle accordingly or view it on a mobile device using the accelerometer for camera tilting for the 3D effect.
{"title":"Scene flow estimation from stereo video source","authors":"Aniket Bera","doi":"10.1145/2007052.2007058","DOIUrl":"https://doi.org/10.1145/2007052.2007058","url":null,"abstract":"There are various methods to estimate the scene flow. Most of the methods use motion estimation with stereo re-construction. This paper describes an interesting way to fuse the video from two camera's and create a 3D reconstruction. The proposed algorithm incorporates probabilistic distributions for optical flow and disparity. Multiple such re-created renderings can be put together to create re-timed movies of the event, with the resulting visual experience richer than that of a regular video clip, or switching between images from multiple cameras, do a head tracking of the viewer and change the view angle accordingly or view it on a mobile device using the accelerometer for camera tilting for the 3D effect.","PeriodicalId":348804,"journal":{"name":"International Conference on Advances in Computing and Artificial Intelligence","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117137975","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}
In this paper, we are considering transient MHD free convective flow through an isothermal semi-infinite vertical porous plate with temperature dependent heat source. The governing equations have been solved by using Crank-Nicolson scheme. The non-dimensional form of velocity profiles, temperature profiles, local and average skin-friction and Nusselt number are depicted graphically for different values of the parameter entering into the problem.
{"title":"Crank-Nicolson scheme to transient MHD free convective flow through semi-infinite vertical porous plate with constant suction and temperature dependent heat source","authors":"Anil Kumar, C. Varshney, S. Lal","doi":"10.1145/2007052.2007070","DOIUrl":"https://doi.org/10.1145/2007052.2007070","url":null,"abstract":"In this paper, we are considering transient MHD free convective flow through an isothermal semi-infinite vertical porous plate with temperature dependent heat source. The governing equations have been solved by using Crank-Nicolson scheme. The non-dimensional form of velocity profiles, temperature profiles, local and average skin-friction and Nusselt number are depicted graphically for different values of the parameter entering into the problem.","PeriodicalId":348804,"journal":{"name":"International Conference on Advances in Computing and Artificial Intelligence","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124220035","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}
Human activity recognition is a challenging area of research because of its various potential applications in visual surveillance. A spatio-temporal template matching based approach for activity recognition is proposed in this paper. We model the background in a scene using a simple statistical model and extract the foreground objects in a scene. Spatio-temporal templates are constructed using the motion history images (MHI) and object shape information for different human activities in a video like walking, standing, bending, sleeping and jumping. Experimental results show that the method can recognize these multiple activities for multiple objects with accuracy and speed.
人类活动识别是一个具有挑战性的研究领域，因为它在视觉监控中有各种潜在的应用。提出了一种基于时空模板匹配的活动识别方法。我们使用简单的统计模型对场景中的背景进行建模，并提取场景中的前景对象。利用运动历史图像(motion history images, MHI)和物体形状信息构建视频中不同人类活动的时空模板，如行走、站立、弯曲、睡眠和跳跃。实验结果表明，该方法可以准确、快速地识别多个目标的多个活动。
{"title":"Automatic human activity recognition in video using background modeling and spatio-temporal template matching based technique","authors":"C. M. Sharma, A. Kushwaha, S. Nigam, A. Khare","doi":"10.1145/2007052.2007072","DOIUrl":"https://doi.org/10.1145/2007052.2007072","url":null,"abstract":"Human activity recognition is a challenging area of research because of its various potential applications in visual surveillance. A spatio-temporal template matching based approach for activity recognition is proposed in this paper. We model the background in a scene using a simple statistical model and extract the foreground objects in a scene. Spatio-temporal templates are constructed using the motion history images (MHI) and object shape information for different human activities in a video like walking, standing, bending, sleeping and jumping. Experimental results show that the method can recognize these multiple activities for multiple objects with accuracy and speed.","PeriodicalId":348804,"journal":{"name":"International Conference on Advances in Computing and Artificial Intelligence","volume":"328 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116441326","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}
Grid computing has made substantial advances during the last decade. A major concern in Grid environments is dealing with the high degree of heterogeneity of resources that can range from laptops and PCs to supercomputers. The unified virtual view of Grid systems and the efficient and transparent access to computational resources is achieved by Grid middleware. The research paper has also discussed the role of grid middlewares in grid computing. Grid middlewares designed by different organizations e.g. Globus Toolkit, Alchemi, Condor etc are also discussed in the paper. However, the development and use of applications in high performance and distributed computing in practice is very difficult and time consuming, because of the need to deal with complex and highly heterogeneous systems. The Globus toolkit is a widely accepted tool for building computational grid. The Globus grid programming toolkit is designed to help application developers and tool builders overcome these obstacles to the construction of "grid-enabled" scientific and engineering applications. The paper includes the main reasons for the strength and popularity of the Globus toolkit. The objective of the paper is to explain a practical introduction to programming for high-performance distributed computing systems, or "computational grids," the capabilities and the use of the Globus grid toolkit to optimize the running time of search applications. We have also describe and compare the functionality and performance of the GRAM2 and GRAM4 job execution services included in Globus Toolkit version 4 (GT4).
{"title":"MGC middleware for grid computing: the Globus Toolkit","authors":"Deepti Malhotra, Devanand","doi":"10.1145/2007052.2007099","DOIUrl":"https://doi.org/10.1145/2007052.2007099","url":null,"abstract":"Grid computing has made substantial advances during the last decade. A major concern in Grid environments is dealing with the high degree of heterogeneity of resources that can range from laptops and PCs to supercomputers. The unified virtual view of Grid systems and the efficient and transparent access to computational resources is achieved by Grid middleware. The research paper has also discussed the role of grid middlewares in grid computing. Grid middlewares designed by different organizations e.g. Globus Toolkit, Alchemi, Condor etc are also discussed in the paper. However, the development and use of applications in high performance and distributed computing in practice is very difficult and time consuming, because of the need to deal with complex and highly heterogeneous systems. The Globus toolkit is a widely accepted tool for building computational grid. The Globus grid programming toolkit is designed to help application developers and tool builders overcome these obstacles to the construction of \"grid-enabled\" scientific and engineering applications. The paper includes the main reasons for the strength and popularity of the Globus toolkit. The objective of the paper is to explain a practical introduction to programming for high-performance distributed computing systems, or \"computational grids,\" the capabilities and the use of the Globus grid toolkit to optimize the running time of search applications. We have also describe and compare the functionality and performance of the GRAM2 and GRAM4 job execution services included in Globus Toolkit version 4 (GT4).","PeriodicalId":348804,"journal":{"name":"International Conference on Advances in Computing and Artificial Intelligence","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130043715","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}
Grid computing is a high performance computing environment to solve larger scale computational demands. Grid computing contains resource management, task scheduling, security problems, information management and so on. Task scheduling in an important aspect of distributed computing. As grid computing is a form of distributed computing with heterogeneous resources working in a shared environment with no central control. The main aim of Grid scheduling is to increase the system throughput and to satisfy the job requirements from the available resources. In this paper we introduce a new resource requirement (RR) based task-scheduling algorithm for grid computing. The new algorithm is based on the resource requirement of the jobs. It has been tested in simulated grid environment. The experimental results showed a significant improvement in terms of a smaller makespan time in various applications.
{"title":"RR based grid scheduling algorithm","authors":"M. Bhatia","doi":"10.1145/2007052.2007076","DOIUrl":"https://doi.org/10.1145/2007052.2007076","url":null,"abstract":"Grid computing is a high performance computing environment to solve larger scale computational demands. Grid computing contains resource management, task scheduling, security problems, information management and so on. Task scheduling in an important aspect of distributed computing. As grid computing is a form of distributed computing with heterogeneous resources working in a shared environment with no central control. The main aim of Grid scheduling is to increase the system throughput and to satisfy the job requirements from the available resources. In this paper we introduce a new resource requirement (RR) based task-scheduling algorithm for grid computing. The new algorithm is based on the resource requirement of the jobs. It has been tested in simulated grid environment. The experimental results showed a significant improvement in terms of a smaller makespan time in various applications.","PeriodicalId":348804,"journal":{"name":"International Conference on Advances in Computing and Artificial Intelligence","volume":"6 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130440045","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：