In this paper packet transmission performance of USCH has been investigated. Throughput, delay, collision probability and blocking probability are obtained as function of network load for varied number of users. Effect of various other parameters such as retransmission limit, number of resources etc has been investigated. Two enhancements of the protocol are proposed and results are compared with the standard MAC protocol.
{"title":"Uplink Shared Channel in 3rd Generation (UMTS) Cellular System: Performance Analysis and Enhancement","authors":"M. Sarvagya","doi":"10.1109/ICIT.2006.88","DOIUrl":"https://doi.org/10.1109/ICIT.2006.88","url":null,"abstract":"In this paper packet transmission performance of USCH has been investigated. Throughput, delay, collision probability and blocking probability are obtained as function of network load for varied number of users. Effect of various other parameters such as retransmission limit, number of resources etc has been investigated. Two enhancements of the protocol are proposed and results are compared with the standard MAC protocol.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128884269","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}
D. Gopinath, J. D. Sree, Reshmi Mathew, S. J. Rekhila, A. Nair
Naturalness can be achieved in a text-to-speech (TTMP) by incorporating prosodic features which include duration of basic units, intonation patterns and stress. This paper presents the preliminary duration analysis required for a speech synthesis system for Malayalam, one among the 17 languages spoken in India. The statistical analysis of the duration of phonemes has yielded results, which can effectively be used for developing a duration model for the language. The durational patterns of vowels and consonants are compared. The study shows that, it is the duration of vowels that get significantly modified and hence duration modelling has to focus primarily on vowels. For vowels, the positional factors have more effect on duration than the contextual factors. The results obtained in this study can simplify a rather complex task of framing rules for duration variation.
{"title":"Duration Analysis for Malayalam Text-To-Speech Systems","authors":"D. Gopinath, J. D. Sree, Reshmi Mathew, S. J. Rekhila, A. Nair","doi":"10.1109/ICIT.2006.48","DOIUrl":"https://doi.org/10.1109/ICIT.2006.48","url":null,"abstract":"Naturalness can be achieved in a text-to-speech (TTMP) by incorporating prosodic features which include duration of basic units, intonation patterns and stress. This paper presents the preliminary duration analysis required for a speech synthesis system for Malayalam, one among the 17 languages spoken in India. The statistical analysis of the duration of phonemes has yielded results, which can effectively be used for developing a duration model for the language. The durational patterns of vowels and consonants are compared. The study shows that, it is the duration of vowels that get significantly modified and hence duration modelling has to focus primarily on vowels. For vowels, the positional factors have more effect on duration than the contextual factors. The results obtained in this study can simplify a rather complex task of framing rules for duration variation.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"204 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132937126","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 present an efficient fault-tolerant token-based algorithm for achieving mutual exclusion (ME) in distributed systems. Nishio et al's fault-tolerant mutual exclusion algorithm requires feedbacks from every other site to recover from token loss. This results in considerable amount of waiting time and false token loss detection. Though Manivannan et al's algorithm solves the problems in Nishio et al's, their algorithm cannot work if a failed site is not repaired within a finite time. This paper proposes an approach to remove the drawback of Manivannan et al's method for achieving fault-tolerance. Our algorithm gives better performance in terms of message complexity (MC), Synchronization delay (SD), response time (RT) and degree of fault- tolerance in comparison with Manivannan et al's algorithm.
{"title":"Enhancing Fault-Tolerance in a Distributed Mutual Exclusion Algorithm","authors":"P. Reddy, N. Sarma, R. Das","doi":"10.1109/ICIT.2006.51","DOIUrl":"https://doi.org/10.1109/ICIT.2006.51","url":null,"abstract":"In this paper, we present an efficient fault-tolerant token-based algorithm for achieving mutual exclusion (ME) in distributed systems. Nishio et al's fault-tolerant mutual exclusion algorithm requires feedbacks from every other site to recover from token loss. This results in considerable amount of waiting time and false token loss detection. Though Manivannan et al's algorithm solves the problems in Nishio et al's, their algorithm cannot work if a failed site is not repaired within a finite time. This paper proposes an approach to remove the drawback of Manivannan et al's method for achieving fault-tolerance. Our algorithm gives better performance in terms of message complexity (MC), Synchronization delay (SD), response time (RT) and degree of fault- tolerance in comparison with Manivannan et al's algorithm.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116534692","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}
A spanning tree T of a graph G is called a tree t-spanner if the distance between any two vertices in T is at most t-times their distance in G. A graph that has a tree t- spanner is called a tree t-spanner admissible graph. Given a graph G and an integer t, the tree t-spanner problem asks whether G admits a tree t-spanner. It is known that the tree t-spanner problem is NP-complete for chordal bipartite graphs for t ges 5 whereas the complexity status of the cases t = 3 and t = 4 are open. In this paper, we study the tree 3- spanner problem in simple chordal bipartite graphs which is a subclass of chordal bipartite graphs. We have shown that this class need not admit tree 3-spanner in general. First, we present a structural characterization of tree 3- spanner admissible simple chordal bipartite graphs. Based on this characterization, we propose a linear time algorithm to recognize tree 3-spanner admissible simple chordal bipartite graphs. Finally, we present a linear time algorithm to construct a tree 3-spanner of a tree 3-spanner admissible simple chordal bipartite graph.
{"title":"A linear time algorithm for constructing tree 3-spanner in simple chordal bipartite graphs","authors":"Anita Das, B. S. Panda, R. Lal","doi":"10.1109/ICIT.2006.12","DOIUrl":"https://doi.org/10.1109/ICIT.2006.12","url":null,"abstract":"A spanning tree T of a graph G is called a tree t-spanner if the distance between any two vertices in T is at most t-times their distance in G. A graph that has a tree t- spanner is called a tree t-spanner admissible graph. Given a graph G and an integer t, the tree t-spanner problem asks whether G admits a tree t-spanner. It is known that the tree t-spanner problem is NP-complete for chordal bipartite graphs for t ges 5 whereas the complexity status of the cases t = 3 and t = 4 are open. In this paper, we study the tree 3- spanner problem in simple chordal bipartite graphs which is a subclass of chordal bipartite graphs. We have shown that this class need not admit tree 3-spanner in general. First, we present a structural characterization of tree 3- spanner admissible simple chordal bipartite graphs. Based on this characterization, we propose a linear time algorithm to recognize tree 3-spanner admissible simple chordal bipartite graphs. Finally, we present a linear time algorithm to construct a tree 3-spanner of a tree 3-spanner admissible simple chordal bipartite graph.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123625908","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 advent of various real-time multimedia applications in high-speed networks prompt the necessity of quality of service (QoS) based multicast routing and the constrained Steiner tree as the mathematical structure behind it which is a well- known NP-complete problem. Two important QoS constraints are the bandwidth constraint and the end-to-end delay constraint. In this paper, an algorithm is proposed to solve the bandwidth-delay- constrained least-cost multicast routing problem based on Tabu Search (TS). Computational results for various random generated networks show that the proposed algorithm outperforms other existing TS-based algorithms and heuristics.
{"title":"A Tabu Search Based Algorithm for Multicast Routing with QoS Constraints","authors":"N. Ghaboosi, A. Haghighat","doi":"10.1109/ICIT.2006.22","DOIUrl":"https://doi.org/10.1109/ICIT.2006.22","url":null,"abstract":"The advent of various real-time multimedia applications in high-speed networks prompt the necessity of quality of service (QoS) based multicast routing and the constrained Steiner tree as the mathematical structure behind it which is a well- known NP-complete problem. Two important QoS constraints are the bandwidth constraint and the end-to-end delay constraint. In this paper, an algorithm is proposed to solve the bandwidth-delay- constrained least-cost multicast routing problem based on Tabu Search (TS). Computational results for various random generated networks show that the proposed algorithm outperforms other existing TS-based algorithms and heuristics.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129250557","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 present a multiple class model for Web servers when the request to be served are prioritized based on domains from which requests are originated. We evaluate the impact of assigning different priorities to different domains for a single server as well as for multiple servers. The main parameters considered for evaluation are the average waiting time and the standing ratio.
{"title":"A Domain Based Prioritized Model forWeb Servers","authors":"A. Abbas, V. Sharma, A. Jain","doi":"10.1109/ICIT.2006.7","DOIUrl":"https://doi.org/10.1109/ICIT.2006.7","url":null,"abstract":"In this paper, we present a multiple class model for Web servers when the request to be served are prioritized based on domains from which requests are originated. We evaluate the impact of assigning different priorities to different domains for a single server as well as for multiple servers. The main parameters considered for evaluation are the average waiting time and the standing ratio.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"30 20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117112777","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 proposes a hybrid transform coding technique, where the intraframes of video sequence are coded by discrete wavelet transform and the interframes are coded with discrete cosine transform technique. It also proposes the selection of sequence of frames predicted from the reference intraframes. This proposal consistently minimizes the prediction error for the predicted frame for further processing. The experimental results show that the proposed hybrid transformation coding technique outperforms over conventional transformation coding technique in terms of encoding time and prediction errors.
{"title":"A Hybrid Transform Coding for Video Codec","authors":"M. Ezhilarasan, P. Thambidurai","doi":"10.1109/ICIT.2006.11","DOIUrl":"https://doi.org/10.1109/ICIT.2006.11","url":null,"abstract":"This paper proposes a hybrid transform coding technique, where the intraframes of video sequence are coded by discrete wavelet transform and the interframes are coded with discrete cosine transform technique. It also proposes the selection of sequence of frames predicted from the reference intraframes. This proposal consistently minimizes the prediction error for the predicted frame for further processing. The experimental results show that the proposed hybrid transformation coding technique outperforms over conventional transformation coding technique in terms of encoding time and prediction errors.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121499728","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 propose a novel static slicing algorithm for inter-procedural programs. We use the system dependence graph (SDG) as the intermediate representation. We have implemented our algorithm by using file structures to handle all the statements that compute the static slice.
{"title":"A Novel Approach for Static Slicing of Inter-Procedural Programs","authors":"S. Mohanty, D. Mohapatra, Himansu Sekhar Behara","doi":"10.1109/ICIT.2006.16","DOIUrl":"https://doi.org/10.1109/ICIT.2006.16","url":null,"abstract":"We propose a novel static slicing algorithm for inter-procedural programs. We use the system dependence graph (SDG) as the intermediate representation. We have implemented our algorithm by using file structures to handle all the statements that compute the static slice.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127776431","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}
Simulation is a widely used technique in networking research and a practice that has suffered loss of credibility in recent years due to doubts about its reliability. In this paper, we conduct a simple Ethernet experiment on a test-bed, and try to reproduce the results using three popular network simulators: ns-2, QualNet and OPNET Modeler. We find that after careful simulation we are able to approximate test-bed performance in all three simulators, and we document the simulation process for each one. We also identify blocking socket calls as a behavioral attribute of applications that affects performance, but cannot be set in any of the three simulators used.
{"title":"Bridging the Gap Between Reality and Simulations: An Ethernet Case Study","authors":"P. Rathod, Srinath Perur, R. Rangarajan","doi":"10.1109/ICIT.2006.33","DOIUrl":"https://doi.org/10.1109/ICIT.2006.33","url":null,"abstract":"Simulation is a widely used technique in networking research and a practice that has suffered loss of credibility in recent years due to doubts about its reliability. In this paper, we conduct a simple Ethernet experiment on a test-bed, and try to reproduce the results using three popular network simulators: ns-2, QualNet and OPNET Modeler. We find that after careful simulation we are able to approximate test-bed performance in all three simulators, and we document the simulation process for each one. We also identify blocking socket calls as a behavioral attribute of applications that affects performance, but cannot be set in any of the three simulators used.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125049381","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}
Gregory M. Cooper, Eric A. Stone, G. Asimenos, Eric D. Green, S. Batzoglou, Michael Brudno, A. Sidow
Comparative sequence analyses on a collection of carefully chosen mammalian genomes could facilitate identification of functional elements within the human genome and allow quantification of evolutionary constraint at the single nucleotide level. High-resolution quantification would be informative for determining the distribution of important positions within functional elements and for evaluating the relative importance of nucleotide sites that carry single nucleotide polymorphisms (SNPs). The level of resolution in comparative sequence analyses is a direct function of sequence diversity, so the information content of a candidate mammalian genome can be defined as the sequence divergence it would add relative to already- sequenced genomes. Our study involves sequences from 29 mammals and we compute total neutral divergence present in set of mammals. Our results of how different mammals add to neutral divergence to the already fully sequenced mammals would increases the effectiveness of comparative genomics with mammalian scope.
{"title":"Notice of Violation of IEEE Publication PrinciplesEstimating neutral divergence amongst Mammals for Comparative Genomics with Mammalian scope","authors":"Gregory M. Cooper, Eric A. Stone, G. Asimenos, Eric D. Green, S. Batzoglou, Michael Brudno, A. Sidow","doi":"10.1109/ICIT.2006.52","DOIUrl":"https://doi.org/10.1109/ICIT.2006.52","url":null,"abstract":"Comparative sequence analyses on a collection of carefully chosen mammalian genomes could facilitate identification of functional elements within the human genome and allow quantification of evolutionary constraint at the single nucleotide level. High-resolution quantification would be informative for determining the distribution of important positions within functional elements and for evaluating the relative importance of nucleotide sites that carry single nucleotide polymorphisms (SNPs). The level of resolution in comparative sequence analyses is a direct function of sequence diversity, so the information content of a candidate mammalian genome can be defined as the sequence divergence it would add relative to already- sequenced genomes. Our study involves sequences from 29 mammals and we compute total neutral divergence present in set of mammals. Our results of how different mammals add to neutral divergence to the already fully sequenced mammals would increases the effectiveness of comparative genomics with mammalian scope.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"53 24","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131875064","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
扫码关注我们
求助内容：
应助结果提醒方式：