首页 > 最新文献

9th International Conference on Information Technology (ICIT'06)最新文献

英文 中文
Promoter recognition using dinucleotide features : a case study for E.Coli 利用二核苷酸特征识别启动子:大肠杆菌的案例研究
Pub Date : 2006-12-18 DOI: 10.1109/ICIT.2006.75
T. Rani, S. Bhavani, R. Bapi
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.
启动子识别基于两种互补的方法,基于基序的方法和基于全局信号的方法。文献中有大量的母题搜索方法。但由于启动子的基序是非常短的长度的共识模式,并且发现假定启动子的机会很高,因此全局特征方法变得重要。本文提出了一种简单的全局特征提取方法来识别大肠杆菌中的sigma-70启动子。研究表明,与文献中提出的高端分类器和重特征相比,简单的前馈神经网络分类器的准确率接近80%。此外,还提出了一种在给定DNA片段中定位启动子区域的方案。
{"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}
引用次数: 0
Complexity Analysis of Group Key Agreement Protocols for Ad Hoc Networks Ad Hoc网络组密钥协商协议的复杂性分析
Pub Date : 2006-12-18 DOI: 10.1109/ICIT.2006.39
R. C. Gangwar, A. Sarje
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}
引用次数: 1
A Self-Adaptive Hybrid Channel Assignment Scheme forWireless Communication Systems 一种无线通信系统自适应混合信道分配方案
Pub Date : 2006-12-18 DOI: 10.1109/ICIT.2006.19
A. Prajapati, R. K. Ghosh, H. Mohanty
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.
提出了一种用于蜂窝无线通信系统的自适应混合信道分配(SA-HCA)方案。它使用蜂窝的流量历史数据来预测最可能的未来通信负载估计。使用预测的负载模式,对单元的信道分配进行调整。
{"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}
引用次数: 7
An Event Notification Service based on XML Messaging on Different Transport Technologies 基于不同传输技术的XML消息传递的事件通知服务
Pub Date : 2006-12-18 DOI: 10.1109/ICIT.2006.28
Ravinder Thirumala, N. Rani, T. Gonsalves
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.
随着电信网络的规模和复杂性的增加,需要将不同层次的管理系统互连起来。这需要以独立于域的方式在许多应用程序之间进行信息流。XML是一种广泛部署的标准,用于网络管理系统(NMS)与其他应用程序的集成。我们研究了基于XML消息的事件通知服务的不同传输机制(JMS、CORBA、HTTP和RMI)的性能。为了提高基于XML消息的事件通知的性能,对事件分组进行了研究,发现其性能良好。
{"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}
引用次数: 0
CARMA: Cellular Automata Based Remote Mutual Authentication Scheme 基于元胞自动机的远程相互认证方案
Pub Date : 2006-12-18 DOI: 10.1109/ICIT.2006.35
S. Tripathy, Sukumar Nandi, A. Chowdhury
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.
服务提供者与其用户之间的相互身份验证对于防止未经授权的攻击者滥用系统资源至关重要。传统的密码表查找方法是不可扩展的,并且容易超载。因此,本文提出了一种基于元胞自动机的远程相互认证(CARMA)方案,以降低加密和基于哈希的密码系统的复杂性,并避免表查找。CARMA还使用基于缓存的随机数来避免同步问题并阻止重放攻击。元胞自动机固有的并行性为其快速实现提供了条件。
{"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}
引用次数: 1
Reversible Implementation of Densely-Packed-Decimal Converter to and from Binary-Coded-Decimal Format Using in IEEE-754R 在IEEE-754R中实现二进制-编码-十进制格式的密集十进制转换
Pub Date : 2006-12-18 DOI: 10.1109/ICIT.2006.78
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.
二进制编码的十进制(BCD)编码一直主导着十进制算法及其硬件实现。由于十进制算术的重要性,IEEE 754浮点标准中定义的十进制格式已被重新审视。它使用密集压缩十进制(DPD)编码来存储十进制浮点数的有效部分。此外,近年来可逆逻辑在设计低功耗CMOS电路时引起了工程师们的注意,因为没有可逆逻辑的实现就不可能实现量子计算。本文推导了在IEEE754R中实现传统BCD格式与DPD格式转换的可逆实现。
{"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}
引用次数: 8
Fuzzy data mining for customer loyalty analysis 基于模糊数据挖掘的顾客忠诚度分析
Pub Date : 2006-12-18 DOI: 10.1109/ICIT.2006.55
J. B. Simha, S. S. Iyengar
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.
在分析型CRM中,客户忠诚度是一个重要的概念分析。目前的方法使用用户定义和统计方法进行忠诚度分析。这些方法的主要限制之一是,它们将每个客户精确地分配到一个细分市场,这可能是违反直觉的。本文讨论了一种利用模糊逻辑的新方法。该方法利用模糊上下文模型提取客户对感兴趣的段的隶属关系。一个实际案例研究显示了该方法的良好效果。
{"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}
引用次数: 9
Fuzzy Linguistic Approach to Matchmaking in E-Commerce 模糊语言方法在电子商务中的应用
Pub Date : 2006-12-18 DOI: 10.1109/ICIT.2006.56
A. Ojha, S. Pradhan
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}
引用次数: 4
An Alternate Way to Rank Hyper-linked Web-Pages 对超链接网页进行排名的另一种方法
Pub Date : 2006-12-18 DOI: 10.1109/ICIT.2006.26
A. Kundu, R. Dutta, Debajyoti Mukhopadhyay
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}
引用次数: 16
Voice Conversion by Prosody and Vocal Tract Modification 通过韵律和声道修改来转换声音
Pub Date : 2006-12-18 DOI: 10.1109/ICIT.2006.92
K. S. Rao, B. Yegnanarayana
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.
在本文中,我们提出了一些灵活的方法,这些方法在语音转换过程中是有用的。所提出的方法根据期望的要求修改声道系统的形状和韵律的特征。声道系统的形状是通过改变短期频谱的主要共振频率(共振峰),并相应地改变其频带宽度来改变的。在韵律修饰的情况下,对给定的语音信号施加所需的时程和语调特征。在所提出的方法中,使用显著激励的瞬间来控制韵律特性。在发声的情况下,显著兴奋的时刻对应于声门关闭的时刻(epoch),而在非发声的情况下,则对应于一些随机的兴奋,如爆发的开始。利用最小相位信号的平均群延迟特性,从语音信号的线性预测残差中计算出显著激励时刻。持续时间特征和音高轮廓(音准模式)的操纵是通过在显著激励时刻的知识的帮助下操纵LP残差来实现的。利用改进的LP残差激励时变滤波器。根据期望的声道特征更新滤波器参数。采用听力测试对提出的方法进行评估。
{"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}
引用次数: 33
期刊
9th International Conference on Information Technology (ICIT'06)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1