Cluster and grid computing are becoming very popular, particularly for scientific and engineering applications. Higher bandwidth of computer networks has further boosted development of cluster computing. Local and geographically dispersed deployment of computing resources is the most prominent differentiating issue between a cluster and grid computing based setups. Cluster necessarily requires deployment of multiple nodes at a single location connected via a high speed switch, while grid computing is based on access to remote computing resources, which may be a cluster. Integrating software with multi-layer integration has been the main thrust of research and development in the field of cluster and grid computing. In this paper a novel idea of building a virtual grid over a local area network, deploying resources by pooling has been suggested. The system uses one monitoring server to keep track of various parameters pertaining to the pooled resources and tasks deployed on the system. Software module for integrating the pooled resource has been developed and a prototype model of virtual computing grid using resource pooling (VCGuRP) has been deployed. The paper describes various design and implementation details of the system and also discusses performance issues and their evaluation.
{"title":"Virtual Computing Grid Using Resource Pooling","authors":"A. Rajan, A. Rawat, R. Verma","doi":"10.1109/ICIT.2008.55","DOIUrl":"https://doi.org/10.1109/ICIT.2008.55","url":null,"abstract":"Cluster and grid computing are becoming very popular, particularly for scientific and engineering applications. Higher bandwidth of computer networks has further boosted development of cluster computing. Local and geographically dispersed deployment of computing resources is the most prominent differentiating issue between a cluster and grid computing based setups. Cluster necessarily requires deployment of multiple nodes at a single location connected via a high speed switch, while grid computing is based on access to remote computing resources, which may be a cluster. Integrating software with multi-layer integration has been the main thrust of research and development in the field of cluster and grid computing. In this paper a novel idea of building a virtual grid over a local area network, deploying resources by pooling has been suggested. The system uses one monitoring server to keep track of various parameters pertaining to the pooled resources and tasks deployed on the system. Software module for integrating the pooled resource has been developed and a prototype model of virtual computing grid using resource pooling (VCGuRP) has been deployed. The paper describes various design and implementation details of the system and also discusses performance issues and their evaluation.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121306639","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}
None of the processing models in the software development has explained the software systems performance evaluation and modeling; likewise, there exist uncertainty in the information systems because of the natural essence of requirements and this may cause other challenges in the processing of software development. By the definition of UML extended version (fuzzy UML), software functionality requirements that are stated in an uncertain way are supported; moreover, the concrete model is converted to formal model for modeling and performance evaluation of the software systems. This paper describes a methodology to develop a fuzzy coloured Petri net (F-CPN) model of a system. The F-CPN model can be analyzed by formal Petri net analysis techniques.
{"title":"A Novel Method for Modeling and Evaluation of Uncertain Information Systems","authors":"A. Haroonabadi, M. Teshnehlab, A. Movaghar","doi":"10.1109/ICIT.2008.24","DOIUrl":"https://doi.org/10.1109/ICIT.2008.24","url":null,"abstract":"None of the processing models in the software development has explained the software systems performance evaluation and modeling; likewise, there exist uncertainty in the information systems because of the natural essence of requirements and this may cause other challenges in the processing of software development. By the definition of UML extended version (fuzzy UML), software functionality requirements that are stated in an uncertain way are supported; moreover, the concrete model is converted to formal model for modeling and performance evaluation of the software systems. This paper describes a methodology to develop a fuzzy coloured Petri net (F-CPN) model of a system. The F-CPN model can be analyzed by formal Petri net analysis techniques.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127531301","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 CLARA algorithm is one of the popular clustering algorithms in use nowadays. This algorithm works on a randomly selected subset of the original data and produces near accurate results at a faster rate than other clustering algorithms. CLARA is basically used in data mining applications. We have used this algorithm for color image segmentation.The original CLARA is modified for producing better outputs. We used a technique of averaging of simulation results to reduce error due to sampling. We applied this algorithm for segmentation of color images due to the large amount of spatial coherency present in the image. The modified algorithm is also suitable for general data mining applications. From experimental results,we see that the suggested modification is a faster version of CLARA as well as able to produce better results.
{"title":"Fast Image Segmentation Using Modified CLARA Algorithm","authors":"M. K. Pakhira","doi":"10.1109/ICIT.2008.22","DOIUrl":"https://doi.org/10.1109/ICIT.2008.22","url":null,"abstract":"The CLARA algorithm is one of the popular clustering algorithms in use nowadays. This algorithm works on a randomly selected subset of the original data and produces near accurate results at a faster rate than other clustering algorithms. CLARA is basically used in data mining applications. We have used this algorithm for color image segmentation.The original CLARA is modified for producing better outputs. We used a technique of averaging of simulation results to reduce error due to sampling. We applied this algorithm for segmentation of color images due to the large amount of spatial coherency present in the image. The modified algorithm is also suitable for general data mining applications. From experimental results,we see that the suggested modification is a faster version of CLARA as well as able to produce better results.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127007328","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}
IEEE 802.11 lacks of the capability to support quality of services such as multimedia and real-time traffic properly. This paper presents a simple approach to enhance the multimedia real-time performance over the 802.11 WLAN by implementing a Quality Of Service Manager (QoSM) for differentiating services with two queues on top of the 802.11 medium access controller. With slow decrease of contention window (SD) and reservation based packet forwarding. The proposed scheme is verified with the help of ns-2 and an improved performance for multimedia real-time service in the infrastructure-based WLAN with the coexistence of the non-real time traffic.
{"title":"Modified MAC for Priority Traffic with Slow Decrease of Contention Window and Reservation Based Packet Forwarding in IEEE 802.11 for QoS Provisioning","authors":"D. K. Puthal, B. Sahoo, A. K. Turuk, Mrinal Nandi","doi":"10.1109/ICIT.2008.44","DOIUrl":"https://doi.org/10.1109/ICIT.2008.44","url":null,"abstract":"IEEE 802.11 lacks of the capability to support quality of services such as multimedia and real-time traffic properly. This paper presents a simple approach to enhance the multimedia real-time performance over the 802.11 WLAN by implementing a Quality Of Service Manager (QoSM) for differentiating services with two queues on top of the 802.11 medium access controller. With slow decrease of contention window (SD) and reservation based packet forwarding. The proposed scheme is verified with the help of ns-2 and an improved performance for multimedia real-time service in the infrastructure-based WLAN with the coexistence of the non-real time traffic.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117239830","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}
We have developed a Web based integrated platform for the identification of genomic islands in which various measures that capture bias in nucleotide compositions have been implemented, viz., GC content (both at the whole genome and at three codon positions in genes), genomic signature, k-mer distribution (k=2-6), codon usage bias and amino acid usage bias. The analysis carried out in sliding windows (default size 10 Kb) is compared with the genomic average for each measure. The output is displayed in a tabular format for each window which may be filtered if the values of the measures differ by 1.5 s (standard deviations) from the genomic average.
{"title":"Integrated Genomic Island Prediction Tool (IGIPT)","authors":"Ruchi Jain, Sandeep Ramineni, N. Parekh","doi":"10.1109/ICIT.2008.42","DOIUrl":"https://doi.org/10.1109/ICIT.2008.42","url":null,"abstract":"We have developed a Web based integrated platform for the identification of genomic islands in which various measures that capture bias in nucleotide compositions have been implemented, viz., GC content (both at the whole genome and at three codon positions in genes), genomic signature, k-mer distribution (k=2-6), codon usage bias and amino acid usage bias. The analysis carried out in sliding windows (default size 10 Kb) is compared with the genomic average for each measure. The output is displayed in a tabular format for each window which may be filtered if the values of the measures differ by 1.5 s (standard deviations) from the genomic average.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114203097","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}
Position based routing protocols are becoming popular over topology based routing protocols due to advancement and availability of GPS devices. Most of the existing position based routing protocols depends upon the beacon interval to collect its current position due to limitations of GPS systems. Delay in collecting the current position forces the routing protocol to use inaccurate position information in highly mobile network that leads to low throughput and high overhead. So in this paper we propose a directional greedy routing protocol (DGRP) which predicts the position of it neighboring nodes during the beacon interval, using the speed and direction information provided in beacon packets. Simulation result in ns2.31 shows that DGRP achieves the better packet delivery ratio, throughput, and overhead compared to the existing GPSR protocol.
{"title":"Directional Greedy Routing Protocol (DGRP) in Mobile Ad-Hoc Networks","authors":"Rupesh Kumar, Seela Veerabhadreswara Rao","doi":"10.1109/ICIT.2008.28","DOIUrl":"https://doi.org/10.1109/ICIT.2008.28","url":null,"abstract":"Position based routing protocols are becoming popular over topology based routing protocols due to advancement and availability of GPS devices. Most of the existing position based routing protocols depends upon the beacon interval to collect its current position due to limitations of GPS systems. Delay in collecting the current position forces the routing protocol to use inaccurate position information in highly mobile network that leads to low throughput and high overhead. So in this paper we propose a directional greedy routing protocol (DGRP) which predicts the position of it neighboring nodes during the beacon interval, using the speed and direction information provided in beacon packets. Simulation result in ns2.31 shows that DGRP achieves the better packet delivery ratio, throughput, and overhead compared to the existing GPSR protocol.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124811871","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 propose a scalable failure detection service for large scale ad hoc networks using an efficient cluster based communication architecture. Our failure detection service adapts the detection parameter to the current load of the wireless ad hoc network. The proposed approach uses a heartbeat based testing mechanism to detect failure in each cluster and take the advantage of cluster based architecture to forward the failure report to other cluster and their respective members. The simulation results show that this approach is linearly scalable in terms of message complexity and consensus time.
{"title":"Design and Evaluation of a Failure Detection Algorithm for Large Scale Ad Hoc Networks Using Cluster Based Approach","authors":"P. M. Khilar, J. Singh, S. Mahapatra","doi":"10.1109/ICIT.2008.17","DOIUrl":"https://doi.org/10.1109/ICIT.2008.17","url":null,"abstract":"In this paper we propose a scalable failure detection service for large scale ad hoc networks using an efficient cluster based communication architecture. Our failure detection service adapts the detection parameter to the current load of the wireless ad hoc network. The proposed approach uses a heartbeat based testing mechanism to detect failure in each cluster and take the advantage of cluster based architecture to forward the failure report to other cluster and their respective members. The simulation results show that this approach is linearly scalable in terms of message complexity and consensus time.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124157143","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}
Models for healthcare processes could be complex like the processes observed in business domains. Modeling healthcare activities in one level could be complex and cognitively loaded. Hence we propose a modular approach to healthcare process specification. We have defined several operators to facilitate modular composition. Using these operators a medical practitioner can specify a treatment plan in an expression. We have also proposed rewriting rules to generate alternate equivalent treatment plans to facilitate decision making by doctors, patients as well as healthcare managers.
{"title":"On Specification of Treatment Modules","authors":"Sumagna Patnaik, H. Mohanty","doi":"10.1109/ICIT.2008.57","DOIUrl":"https://doi.org/10.1109/ICIT.2008.57","url":null,"abstract":"Models for healthcare processes could be complex like the processes observed in business domains. Modeling healthcare activities in one level could be complex and cognitively loaded. Hence we propose a modular approach to healthcare process specification. We have defined several operators to facilitate modular composition. Using these operators a medical practitioner can specify a treatment plan in an expression. We have also proposed rewriting rules to generate alternate equivalent treatment plans to facilitate decision making by doctors, patients as well as healthcare managers.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121546844","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 present paper proposes a segmentation-based approach to handwritten Devanagari word recognition. On the basis of the head line, a word image is segmented in to pseudo characters. Hidden Markov models are proposed to recognize the pseudo characters. The word level recognition is done on the basis of a string edit distance.
{"title":"A Segmentation Based Approach to Offline Handwritten Devanagari Word Recognition","authors":"Bikash Shaw, S. K. Parui, M. Shridhar","doi":"10.1109/ICIT.2008.32","DOIUrl":"https://doi.org/10.1109/ICIT.2008.32","url":null,"abstract":"The present paper proposes a segmentation-based approach to handwritten Devanagari word recognition. On the basis of the head line, a word image is segmented in to pseudo characters. Hidden Markov models are proposed to recognize the pseudo characters. The word level recognition is done on the basis of a string edit distance.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115050184","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}
An axis-parallel box in b-dimensional space is a Cartesian product R1×R2×...×Rb where Ri (for 1⩽i⩽b) is a closed interval of the form [ai, bi] on the real line. For a graph G, its boxicity is the minimum dimension b, such that G is representable as the intersection graph of (axis-parallel) boxes in b-dimensional space. The concept of boxicity finds application in various areas of research like ecology, operation research etc. Chandran, Francis and Sivadasan gave an O(Δn2ln2n) randomized algorithm to construct a box representation for any graph G on n vertices in [(Δ+2)lnn] dimensions, where ¿ is the maximum degree of the graph. They also came up with a deterministic algorithm that runs in O(n4Δ) time. Here, we present an O(n2Δ2lnn) deterministic algorithm that constructs the box representation for any graph in [(Δ+2)lnn] dimensions.
{"title":"Finding a Box Representation for a Graph in O(n2Δ2lnn) Time","authors":"L. Chandran, Mathew C. Francis, Rogers Mathew","doi":"10.1109/ICIT.2008.36","DOIUrl":"https://doi.org/10.1109/ICIT.2008.36","url":null,"abstract":"An axis-parallel box in b-dimensional space is a Cartesian product R<sub>1</sub>×R<sub>2</sub>×...×R<sub>b</sub> where R<sub>i</sub> (for 1⩽i⩽b) is a closed interval of the form [a<sub>i</sub>, b<sub>i</sub>] on the real line. For a graph G, its boxicity is the minimum dimension b, such that G is representable as the intersection graph of (axis-parallel) boxes in b-dimensional space. The concept of boxicity finds application in various areas of research like ecology, operation research etc. Chandran, Francis and Sivadasan gave an O(Δn<sup>2</sup>ln<sup>2</sup>n) randomized algorithm to construct a box representation for any graph G on n vertices in [(Δ+2)lnn] dimensions, where ¿ is the maximum degree of the graph. They also came up with a deterministic algorithm that runs in O(n<sup>4</sup>Δ) time. Here, we present an O(n<sup>2</sup>Δ<sup>2</sup>lnn) deterministic algorithm that constructs the box representation for any graph in [(Δ+2)lnn] dimensions.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128235837","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
扫码关注我们
求助内容：
应助结果提醒方式：