Promoter recognition is based upon two complementary methods, a motif based method and a global signal based method. The literature is abound with motif search methods. But as the motifs of a promoter are consensus patterns of very short length and the chance of finding putative promoters is high, global feature methods gain importance. In this paper a simple global feature extraction method is proposed for the recognition of sigma-70 promoters in E.coli. It is shown that a simple feed forward neural network classifier achieves a precision of nearly 80% in contrast to the high end classifiers and heavy features proposed in the literature achieving a similar performance. Additionally, a scheme is proposed for locating promoter regions in a given DNA segment.
{"title":"Promoter recognition using dinucleotide features : a case study for E.Coli","authors":"T. Rani, S. Bhavani, R. Bapi","doi":"10.1109/ICIT.2006.75","DOIUrl":"https://doi.org/10.1109/ICIT.2006.75","url":null,"abstract":"Promoter recognition is based upon two complementary methods, a motif based method and a global signal based method. The literature is abound with motif search methods. But as the motifs of a promoter are consensus patterns of very short length and the chance of finding putative promoters is high, global feature methods gain importance. In this paper a simple global feature extraction method is proposed for the recognition of sigma-70 promoters in E.coli. It is shown that a simple feed forward neural network classifier achieves a precision of nearly 80% in contrast to the high end classifiers and heavy features proposed in the literature achieving a similar performance. Additionally, a scheme is proposed for locating promoter regions in a given DNA segment.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"37 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":"121438168","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}
Secure and efficient group communication in ad hoc networks is a very challenging task. Due to resource constraints in ad hoc networks, the group key agreement protocols must be efficient in various parameters such as number of rounds, number of messages exchanged, exponential computation performed etc. This paper presents various group key agreement protocols, and compares them for their suitability for ad hoc networks.
{"title":"Complexity Analysis of Group Key Agreement Protocols for Ad Hoc Networks","authors":"R. C. Gangwar, A. Sarje","doi":"10.1109/ICIT.2006.39","DOIUrl":"https://doi.org/10.1109/ICIT.2006.39","url":null,"abstract":"Secure and efficient group communication in ad hoc networks is a very challenging task. Due to resource constraints in ad hoc networks, the group key agreement protocols must be efficient in various parameters such as number of rounds, number of messages exchanged, exponential computation performed etc. This paper presents various group key agreement protocols, and compares them for their suitability for ad hoc networks.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"6 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":"127848331","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 Self Adaptive Hybrid Channel Assignment (SA-HCA) scheme for cellular wireless communication system is proposed. It uses history of traffic data of the cells to predict most probable future estimation of the communication loads. Using the predicted load patterns, the channel assignments to the cells are adjusted.
{"title":"A Self-Adaptive Hybrid Channel Assignment Scheme forWireless Communication Systems","authors":"A. Prajapati, R. K. Ghosh, H. Mohanty","doi":"10.1109/ICIT.2006.19","DOIUrl":"https://doi.org/10.1109/ICIT.2006.19","url":null,"abstract":"A Self Adaptive Hybrid Channel Assignment (SA-HCA) scheme for cellular wireless communication system is proposed. It uses history of traffic data of the cells to predict most probable future estimation of the communication loads. Using the predicted load patterns, the channel assignments to the cells are adjusted.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"107 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":"127177315","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 the size and increasing complexity of telecom networks, there is a need to interconnect management systems at different levels. This requires information flow across many applications in a domain independent way. XML is a widely deployed standard which is being used for integration of network management system(NMS) with other applications. We examine the performance of different transport mechanisms, JMS, CORBA, HTTP and RMI for an XML message based event Notification Service. To improve the performance of XML message based event notifications, event grouping is examined and is found to perform well.
{"title":"An Event Notification Service based on XML Messaging on Different Transport Technologies","authors":"Ravinder Thirumala, N. Rani, T. Gonsalves","doi":"10.1109/ICIT.2006.28","DOIUrl":"https://doi.org/10.1109/ICIT.2006.28","url":null,"abstract":"With the size and increasing complexity of telecom networks, there is a need to interconnect management systems at different levels. This requires information flow across many applications in a domain independent way. XML is a widely deployed standard which is being used for integration of network management system(NMS) with other applications. We examine the performance of different transport mechanisms, JMS, CORBA, HTTP and RMI for an XML message based event Notification Service. To improve the performance of XML message based event notifications, event grouping is examined and is found to perform well.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"75 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":"130744519","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}
Mutual authentication between a service provider and its users is essential to prevent unauthorized adversaries from misutilizing system resources. The traditional method of password table lookups is not scalable and is susceptible to overloading. Therefore this paper proposes a cellular automata based remote-mutual authentication (CARMA) Scheme to reduce the complexity of encryption and hash-based cryptosystems, as well as avoid table lookups. CARMA also uses cache-based nonces to avoid synchronization problems and thwart replay attacks. The inherent parallelism of cellular automata provides for its fast implementation.
{"title":"CARMA: Cellular Automata Based Remote Mutual Authentication Scheme","authors":"S. Tripathy, Sukumar Nandi, A. Chowdhury","doi":"10.1109/ICIT.2006.35","DOIUrl":"https://doi.org/10.1109/ICIT.2006.35","url":null,"abstract":"Mutual authentication between a service provider and its users is essential to prevent unauthorized adversaries from misutilizing system resources. The traditional method of password table lookups is not scalable and is susceptible to overloading. Therefore this paper proposes a cellular automata based remote-mutual authentication (CARMA) Scheme to reduce the complexity of encryption and hash-based cryptosystems, as well as avoid table lookups. CARMA also uses cache-based nonces to avoid synchronization problems and thwart replay attacks. The inherent parallelism of cellular automata provides for its fast implementation.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"29 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":"132096905","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}
Amir Kaivani, A. Zakerolhosseini, S. Gorgin, M. Fazlali
The binary coded decimal (BCD) encoding has always dominated the decimal arithmetic algorithms and their hardware implementation. Due to importance of decimal arithmetic, the decimal format defined in IEEE 754 floating point standard has been revisited. It uses densely packed decimal (DPD) encoding to store significant part of a decimal floating point number. Furthermore in recent years reversible logic has attracted the attention of engineers for designing low power CMOS circuits, as it is not possible to realize quantum computing without reversible logic implementation. This paper derives the reversible implementation of DPD converter to and from conventional BCD format using in IEEE754R.
{"title":"Reversible Implementation of Densely-Packed-Decimal Converter to and from Binary-Coded-Decimal Format Using in IEEE-754R","authors":"Amir Kaivani, A. Zakerolhosseini, S. Gorgin, M. Fazlali","doi":"10.1109/ICIT.2006.78","DOIUrl":"https://doi.org/10.1109/ICIT.2006.78","url":null,"abstract":"The binary coded decimal (BCD) encoding has always dominated the decimal arithmetic algorithms and their hardware implementation. Due to importance of decimal arithmetic, the decimal format defined in IEEE 754 floating point standard has been revisited. It uses densely packed decimal (DPD) encoding to store significant part of a decimal floating point number. Furthermore in recent years reversible logic has attracted the attention of engineers for designing low power CMOS circuits, as it is not possible to realize quantum computing without reversible logic implementation. This paper derives the reversible implementation of DPD converter to and from conventional BCD format using in IEEE754R.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"212 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":"134513744","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}
One of the major conceptual analyses in analytical CRM is customer loyalty. Current methods use user defined and statistical methods for loyalty analysis. One of the major limitations of these methods is that they assign every customer into exactly one segment, which may be counter intuitive. In this paper a novel approach using fuzzy logic has been discussed. The proposed method uses fuzzy context model to extract the customer membership to a segment of interest. A real life case study shows promising results for the proposed approach.
{"title":"Fuzzy data mining for customer loyalty analysis","authors":"J. B. Simha, S. S. Iyengar","doi":"10.1109/ICIT.2006.55","DOIUrl":"https://doi.org/10.1109/ICIT.2006.55","url":null,"abstract":"One of the major conceptual analyses in analytical CRM is customer loyalty. Current methods use user defined and statistical methods for loyalty analysis. One of the major limitations of these methods is that they assign every customer into exactly one segment, which may be counter intuitive. In this paper a novel approach using fuzzy logic has been discussed. The proposed method uses fuzzy context model to extract the customer membership to a segment of interest. A real life case study shows promising results for the proposed approach.","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":"133328700","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}
Searching and comparing products satisfying buyer's preferences is one of the essential activities in e-commerce. It is difficult when product space is large and multiple criteria on the product features are to be considered. Furthermore, the matchmaking becomes a challenging problem if buyer's preferences are fuzzy. In this paper, we present a linguistic approach to compare and rank products based on fuzzy preferences, thus making e-commerce more pleasurable for both the buyer and the seller in a marketplace. Our experimental results show the approach approximates human reasoning and is very encouraging.
{"title":"Fuzzy Linguistic Approach to Matchmaking in E-Commerce","authors":"A. Ojha, S. Pradhan","doi":"10.1109/ICIT.2006.56","DOIUrl":"https://doi.org/10.1109/ICIT.2006.56","url":null,"abstract":"Searching and comparing products satisfying buyer's preferences is one of the essential activities in e-commerce. It is difficult when product space is large and multiple criteria on the product features are to be considered. Furthermore, the matchmaking becomes a challenging problem if buyer's preferences are fuzzy. In this paper, we present a linguistic approach to compare and rank products based on fuzzy preferences, thus making e-commerce more pleasurable for both the buyer and the seller in a marketplace. Our experimental results show the approach approximates human reasoning and is very encouraging.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"92 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":"128460464","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}
Search for a Web-page using Crawler based Search Engine depends on its Ranking Mechanism. Search Engine sorts through millions of Web-pages and present the significant Web-pages through Ranking method. A new approach is proposed here adopting Cellular Automata.
{"title":"An Alternate Way to Rank Hyper-linked Web-Pages","authors":"A. Kundu, R. Dutta, Debajyoti Mukhopadhyay","doi":"10.1109/ICIT.2006.26","DOIUrl":"https://doi.org/10.1109/ICIT.2006.26","url":null,"abstract":"Search for a Web-page using Crawler based Search Engine depends on its Ranking Mechanism. Search Engine sorts through millions of Web-pages and present the significant Web-pages through Ranking method. A new approach is proposed here adopting Cellular Automata.","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":"115368327","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 proposed some flexible methods, which are useful in the process of voice conversion. The proposed methods modify the shape of the vocal tract system and the characteristics of the prosody according to the desired requirement. The shape of the vocal tract system is modified by shifting the major resonant frequencies (formants) of the short term spectrum, and altering their band- widths accordingly. In the case of prosody modification, the required durational and intonational characteristics are imposed on the given speech signal. In the proposed method, the prosodic characteristics are manipulated using instants of significant excitation. The instants of significant excitation correspond to the instants of glottal closure (epochs) in the case of voiced speech, and to some random excitations like onset of burst in the case of nonvoiced speech. Instants of significant excitation are computed from the linear prediction (LP) residual of the speech signals by using the property of average group delay of minimum phase signals. The manipulations of durational characteristics and pitch contour (intonation pattern) are achieved by manipulating the LP residual with the help of the knowledge of the instants of significant excitation. The modified LP residual is used to excite the time varying filter. The filter parameters are updated according to the desired vocal tract characteristics. The proposed methods are evaluated using listening tests.
{"title":"Voice Conversion by Prosody and Vocal Tract Modification","authors":"K. S. Rao, B. Yegnanarayana","doi":"10.1109/ICIT.2006.92","DOIUrl":"https://doi.org/10.1109/ICIT.2006.92","url":null,"abstract":"In this paper we proposed some flexible methods, which are useful in the process of voice conversion. The proposed methods modify the shape of the vocal tract system and the characteristics of the prosody according to the desired requirement. The shape of the vocal tract system is modified by shifting the major resonant frequencies (formants) of the short term spectrum, and altering their band- widths accordingly. In the case of prosody modification, the required durational and intonational characteristics are imposed on the given speech signal. In the proposed method, the prosodic characteristics are manipulated using instants of significant excitation. The instants of significant excitation correspond to the instants of glottal closure (epochs) in the case of voiced speech, and to some random excitations like onset of burst in the case of nonvoiced speech. Instants of significant excitation are computed from the linear prediction (LP) residual of the speech signals by using the property of average group delay of minimum phase signals. The manipulations of durational characteristics and pitch contour (intonation pattern) are achieved by manipulating the LP residual with the help of the knowledge of the instants of significant excitation. The modified LP residual is used to excite the time varying filter. The filter parameters are updated according to the desired vocal tract characteristics. The proposed methods are evaluated using listening tests.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"71 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":"114473376","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}