Pub Date : 2020-08-26DOI: 10.1504/ijcse.2020.10031610
J. Dantas, Eltton Araujo, P. Maciel, Rúbens de Souza Matos Júnior, Jean Teixeira
Over the years, many companies have employed cloud computing to support their services and optimise their infrastructure utilisation. The provisioning of high availability and high processing capacity is a significant challenge when planning a cloud computing infrastructure. Even when the system is available, a part of the resources may not be offered due to partial failures in just a few of the many components in an IaaS cloud. The dynamic behaviour of virtualised resources requires special attention to the effective amount of capacity that is available to users, so the system can be correctly sized. Therefore, the estimation of capacity-oriented availability (COA) is an important activity for cloud infrastructure providers to analyse the cost-benefit tradeoff among distinct architectures and deployment sizes. This paper presents a strategy to evaluate the capacity-oriented availability of virtual machines combined to servers availability on a private cloud infrastructure. The proposed strategy aims to provide an efficient and accurate computation of COA and availability by means of closed-form equations. We compare our approach to the use of models such as continuous time Markov chains and SPN simulation model, considering execution time and values of metrics obtained with both approaches.
{"title":"Estimating capacity-oriented availability in cloud systems","authors":"J. Dantas, Eltton Araujo, P. Maciel, Rúbens de Souza Matos Júnior, Jean Teixeira","doi":"10.1504/ijcse.2020.10031610","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10031610","url":null,"abstract":"Over the years, many companies have employed cloud computing to support their services and optimise their infrastructure utilisation. The provisioning of high availability and high processing capacity is a significant challenge when planning a cloud computing infrastructure. Even when the system is available, a part of the resources may not be offered due to partial failures in just a few of the many components in an IaaS cloud. The dynamic behaviour of virtualised resources requires special attention to the effective amount of capacity that is available to users, so the system can be correctly sized. Therefore, the estimation of capacity-oriented availability (COA) is an important activity for cloud infrastructure providers to analyse the cost-benefit tradeoff among distinct architectures and deployment sizes. This paper presents a strategy to evaluate the capacity-oriented availability of virtual machines combined to servers availability on a private cloud infrastructure. The proposed strategy aims to provide an efficient and accurate computation of COA and availability by means of closed-form equations. We compare our approach to the use of models such as continuous time Markov chains and SPN simulation model, considering execution time and values of metrics obtained with both approaches.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126170807","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}
Pub Date : 2020-05-30DOI: 10.1504/IJCSE.2020.110201
G. Platt, F. S. Lobato, G. Libotte, F. D. M. Neto
Many engineering problems are described by systems of nonlinear equations, which may exhibit multiple solutions, in a challenging situation for root-finding algorithms. The existence of several solutions may give rise to complex basins of attraction for the solutions in the algorithms, with severe influence in their convergence behavior. In this work, we explore the relationship of the basins of attractions with the critical curves (the locus of the singular points of the Jacobian of the system of equations) in a phase equilibrium problem in the plane with two solutions, namely the calculation of a double azeotrope in a binary mixture. The results indicate that the conjoint use of the basins of attraction and critical curves can be a useful tool to select the most suitable algorithm for a specific problem.
{"title":"Basins of attraction and critical curves for Newton-type methods in a phase equilibrium problem","authors":"G. Platt, F. S. Lobato, G. Libotte, F. D. M. Neto","doi":"10.1504/IJCSE.2020.110201","DOIUrl":"https://doi.org/10.1504/IJCSE.2020.110201","url":null,"abstract":"Many engineering problems are described by systems of nonlinear equations, which may exhibit multiple solutions, in a challenging situation for root-finding algorithms. The existence of several solutions may give rise to complex basins of attraction for the solutions in the algorithms, with severe influence in their convergence behavior. In this work, we explore the relationship of the basins of attractions with the critical curves (the locus of the singular points of the Jacobian of the system of equations) in a phase equilibrium problem in the plane with two solutions, namely the calculation of a double azeotrope in a binary mixture. The results indicate that the conjoint use of the basins of attraction and critical curves can be a useful tool to select the most suitable algorithm for a specific problem.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"299 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134349832","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}
Pub Date : 2020-05-08DOI: 10.1504/ijcse.2020.10029393
Wen Gu, Cao Yang, Ying Yi
Concepts such as virtualisation, elasticity, and multi-tenancy have been embedded in cloud computing environments. Thus, the traditional access control model is no longer applicable to cloud computing environments, and designing a new access control model specific to the features of cloud computing environments is necessary. The software as a service (SaaS) pattern has gradually emerged as a type of cloud computing model that can address the information management requirements of small- and medium-sized enterprises. Given the features of SaaS application platforms, this study proposes a multi-tenant access control model called ST-RBAC under the SaaS pattern on the basis of a discussion of the current situation of access control models. The proposed model successfully deals with relationships among elements such as tenants, users, roles, and permissions. Hence, it can effectively guarantee user data safety and user permission management.
{"title":"An access model under cloud computing environment","authors":"Wen Gu, Cao Yang, Ying Yi","doi":"10.1504/ijcse.2020.10029393","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10029393","url":null,"abstract":"Concepts such as virtualisation, elasticity, and multi-tenancy have been embedded in cloud computing environments. Thus, the traditional access control model is no longer applicable to cloud computing environments, and designing a new access control model specific to the features of cloud computing environments is necessary. The software as a service (SaaS) pattern has gradually emerged as a type of cloud computing model that can address the information management requirements of small- and medium-sized enterprises. Given the features of SaaS application platforms, this study proposes a multi-tenant access control model called ST-RBAC under the SaaS pattern on the basis of a discussion of the current situation of access control models. The proposed model successfully deals with relationships among elements such as tenants, users, roles, and permissions. Hence, it can effectively guarantee user data safety and user permission management.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114898766","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}
Pub Date : 2020-05-08DOI: 10.1504/ijcse.2020.10029348
Ping He, Zheng Huo
Multi-antennae data retrieval problem refers that finds an access pattern (to retrieve multiple requests by using multiple antennae, where each request has multiple data items) such that the access latency of some requests retrieved by each antenna is minimised and the total access latency of all requests retrieved by all antennae keeps balance. So it is very important that these requests are divided into multiple groups for achieving the retrieval by using each antenna in MIMO wireless communication, called data grouping problem. There are few studies focused on data grouping scheme applied in data retrieval problem when the clients equipped with multi-antennae send multiple requests. Therefore, this paper proposes two data grouping algorithms (HOG and HEG) that are applied in data retrieval such that the requests can be reasonably classified into multiple groups. Through experiments, the proposed schemes have better efficiency compared with some existing schemes.
{"title":"Data grouping scheme for multi-request retrieval in MIMO wireless communication","authors":"Ping He, Zheng Huo","doi":"10.1504/ijcse.2020.10029348","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10029348","url":null,"abstract":"Multi-antennae data retrieval problem refers that finds an access pattern (to retrieve multiple requests by using multiple antennae, where each request has multiple data items) such that the access latency of some requests retrieved by each antenna is minimised and the total access latency of all requests retrieved by all antennae keeps balance. So it is very important that these requests are divided into multiple groups for achieving the retrieval by using each antenna in MIMO wireless communication, called data grouping problem. There are few studies focused on data grouping scheme applied in data retrieval problem when the clients equipped with multi-antennae send multiple requests. Therefore, this paper proposes two data grouping algorithms (HOG and HEG) that are applied in data retrieval such that the requests can be reasonably classified into multiple groups. Through experiments, the proposed schemes have better efficiency compared with some existing schemes.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128742918","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}
Pub Date : 2020-05-08DOI: 10.1504/ijcse.2020.10029349
Na Liu, Ying Lu, Xiao-Jun Tang, Ming-Xia Li, Chunli Wang
Collaborative filtering algorithms make use of interaction rates between users and items for generating recommendations. Similarity among users is calculated based on rating mostly, without considering explicit properties of users involved. Considering the number of tags of a user can direct response the user preference to some extent, we propose a collaborative filtering algorithm using topic model called user-item-tag latent Dirichlet allocation (UITLDA) in this paper. UITLDA model consists of two parts. The first part is active user with its item. The second part is active user with its tag. We form topic model from these two parts respectively. The two topics constrain each other and integrate into a new topic distribution. This model not only increases the user's similarity, but also reduces the density of the matrix. In prediction computation, we also introduce time delay function to increase the precision. The experiments showed that the proposed algorithm achieved better performance compared with baseline on MovieLens datasets.
{"title":"Improved user-based collaborative filtering algorithm with topic model and time tag","authors":"Na Liu, Ying Lu, Xiao-Jun Tang, Ming-Xia Li, Chunli Wang","doi":"10.1504/ijcse.2020.10029349","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10029349","url":null,"abstract":"Collaborative filtering algorithms make use of interaction rates between users and items for generating recommendations. Similarity among users is calculated based on rating mostly, without considering explicit properties of users involved. Considering the number of tags of a user can direct response the user preference to some extent, we propose a collaborative filtering algorithm using topic model called user-item-tag latent Dirichlet allocation (UITLDA) in this paper. UITLDA model consists of two parts. The first part is active user with its item. The second part is active user with its tag. We form topic model from these two parts respectively. The two topics constrain each other and integrate into a new topic distribution. This model not only increases the user's similarity, but also reduces the density of the matrix. In prediction computation, we also introduce time delay function to increase the precision. The experiments showed that the proposed algorithm achieved better performance compared with baseline on MovieLens datasets.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132334428","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}
Institute of Computing Technology, Chinese Lexical Analysis System (ICTCLAS) is a common tool for Chinese word segmentation and named entity recognition. With this tool, the F1 value of person name recognition from Chinese texts in Tibetan culture is only 40%. We propose a method for transliteration recognition of Tibetan person name based on Tibetan cultural knowledge. Firstly, we leverage Tibetan cultural dictionary to improve the word segmentation performance of ICTCLAS. Then, special contextual features and naming rules of Tibetan person name in their culture are adopted to determine the boundary of Chinese transliteration of Tibetan person name. Finally, the transliteration candidates of Tibetan person name are filtered based on discrimination and reliability. Experiments on a 1.2 M Tibetan text in Tibetan culture show that the method can increase the F1 value of Chinese transliteration recognition of Tibetan person name from 40.08% to 87.92% in ICTCLAS.
{"title":"Transliteration recognition of Tibetan person name based on Tibetan cultural knowledge","authors":"Zhijuan Wang, Wenguang Fang, Xiaobing Zhao, Wei Song, Yinghui Feng, Yining Chang","doi":"10.1504/ijcse.2020.10029390","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10029390","url":null,"abstract":"Institute of Computing Technology, Chinese Lexical Analysis System (ICTCLAS) is a common tool for Chinese word segmentation and named entity recognition. With this tool, the F1 value of person name recognition from Chinese texts in Tibetan culture is only 40%. We propose a method for transliteration recognition of Tibetan person name based on Tibetan cultural knowledge. Firstly, we leverage Tibetan cultural dictionary to improve the word segmentation performance of ICTCLAS. Then, special contextual features and naming rules of Tibetan person name in their culture are adopted to determine the boundary of Chinese transliteration of Tibetan person name. Finally, the transliteration candidates of Tibetan person name are filtered based on discrimination and reliability. Experiments on a 1.2 M Tibetan text in Tibetan culture show that the method can increase the F1 value of Chinese transliteration recognition of Tibetan person name from 40.08% to 87.92% in ICTCLAS.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129707403","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}
Pub Date : 2020-05-08DOI: 10.1504/ijcse.2020.10029381
Keyao Chen, Guizhi Wang, Jibo Chen, Shuai Yuan, Guo Wei
In order to explore the impact of climate change on manufacturing outputs in Nanjing, China, this paper first adopts a polynomial function to retrieve trend values of manufacturing output, and then elaborates to manipulate the Hodrick-Prescott (HP) filtering to isolate the parts of manufacturing outputs that are caused by the climate factors. Subsequently, the paper attempts to construct a partial least squares regression (PLSR) model covering meteorological factors (e.g., average annual temperature, precipitation, sunshine hours and four quarters' average temperatures) and manufacturing meteorological outputs. The results show that an increased average temperature and average precipitation yield negative impacts on manufacturing and production; while in winter, higher temperature offers benefits to manufacturing on the contrary. Finally, this paper studied the changes of manufacturing outputs in Nanjing for different climate scenarios.
{"title":"Impact of climate changes on manufacturing: Hodrick-Prescott filtering and a partial least squares regression model","authors":"Keyao Chen, Guizhi Wang, Jibo Chen, Shuai Yuan, Guo Wei","doi":"10.1504/ijcse.2020.10029381","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10029381","url":null,"abstract":"In order to explore the impact of climate change on manufacturing outputs in Nanjing, China, this paper first adopts a polynomial function to retrieve trend values of manufacturing output, and then elaborates to manipulate the Hodrick-Prescott (HP) filtering to isolate the parts of manufacturing outputs that are caused by the climate factors. Subsequently, the paper attempts to construct a partial least squares regression (PLSR) model covering meteorological factors (e.g., average annual temperature, precipitation, sunshine hours and four quarters' average temperatures) and manufacturing meteorological outputs. The results show that an increased average temperature and average precipitation yield negative impacts on manufacturing and production; while in winter, higher temperature offers benefits to manufacturing on the contrary. Finally, this paper studied the changes of manufacturing outputs in Nanjing for different climate scenarios.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"500 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132971840","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}
Pub Date : 2020-05-08DOI: 10.1504/ijcse.2020.10028357
Xue Lu, Dezhi Han, Letian Duan, Qiuting Tian
The sensor nodes of wireless sensor networks (WSNs) are deployed to an open and unsupervised region, and they are vulnerable to various types of attacks. Intrusion detection system can detect network attacks that nodes suffer from. This paper combines improved particle swarm optimisation (IPSO) algorithm and back-propagation neural network (BPNN), named IPSO-BPNN. We propose an intrusion detection model of WSNs based on a hierarchical structure. First, we use IPSO algorithm to optimise the initial parameters of BPNN to avoid falling into the local optimum. Then, we apply IPSO-BPNN to the intrusion detection of WSNs. Finally, we use benchmark NSL-KDD and UNSW-NB15 datasets to verify the performance of the IPSO-BPNN. The simulation results show that IPSO-BPNN has faster convergence speed, higher detection accuracy rate and lower false positive rate compared with BPNN and BPNN optimised by PSO algorithm, which can meet the WSNs intrusion detection requirements.
{"title":"Intrusion detection of wireless sensor networks based on IPSO algorithm and BP neural network","authors":"Xue Lu, Dezhi Han, Letian Duan, Qiuting Tian","doi":"10.1504/ijcse.2020.10028357","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10028357","url":null,"abstract":"The sensor nodes of wireless sensor networks (WSNs) are deployed to an open and unsupervised region, and they are vulnerable to various types of attacks. Intrusion detection system can detect network attacks that nodes suffer from. This paper combines improved particle swarm optimisation (IPSO) algorithm and back-propagation neural network (BPNN), named IPSO-BPNN. We propose an intrusion detection model of WSNs based on a hierarchical structure. First, we use IPSO algorithm to optimise the initial parameters of BPNN to avoid falling into the local optimum. Then, we apply IPSO-BPNN to the intrusion detection of WSNs. Finally, we use benchmark NSL-KDD and UNSW-NB15 datasets to verify the performance of the IPSO-BPNN. The simulation results show that IPSO-BPNN has faster convergence speed, higher detection accuracy rate and lower false positive rate compared with BPNN and BPNN optimised by PSO algorithm, which can meet the WSNs intrusion detection requirements.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123436917","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}
Pub Date : 2020-05-08DOI: 10.1504/ijcse.2020.10029352
Iulia Ştirb
Extending compilers like LLVM with NUMA-aware optimisations significantly improves runtime performance and energy consumption on NUMA systems. The paper presents NUMA-BTDM algorithm, which is a compile-time thread-type dependent mapping algorithm that performs the mapping uniformly based on the type of each thread given by NUMA-BTLP algorithm following a static analysis on the code. First, the compiler inserts in the program code architecture dependent code that detects at runtime the characteristics of the underlying architecture for Intel processors, and then the mapping is performed at runtime (using specific functions calls from the PThreads library) depending on these characteristics following a compile-time mapping analysis which gives the CPU affinity of each thread. NUMA-BTDM allows the application to customise, control and optimise the thread mapping and achieves balanced data locality on NUMA systems for C parallel code that combine PThreads based task parallelism with OpenMP based loop parallelism.
{"title":"Improving runtime performance and energy consumption through balanced data locality with NUMA-BTLP and NUMA-BTDM static algorithms for thread classification and thread type-aware mapping","authors":"Iulia Ştirb","doi":"10.1504/ijcse.2020.10029352","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10029352","url":null,"abstract":"Extending compilers like LLVM with NUMA-aware optimisations significantly improves runtime performance and energy consumption on NUMA systems. The paper presents NUMA-BTDM algorithm, which is a compile-time thread-type dependent mapping algorithm that performs the mapping uniformly based on the type of each thread given by NUMA-BTLP algorithm following a static analysis on the code. First, the compiler inserts in the program code architecture dependent code that detects at runtime the characteristics of the underlying architecture for Intel processors, and then the mapping is performed at runtime (using specific functions calls from the PThreads library) depending on these characteristics following a compile-time mapping analysis which gives the CPU affinity of each thread. NUMA-BTDM allows the application to customise, control and optimise the thread mapping and achieves balanced data locality on NUMA systems for C parallel code that combine PThreads based task parallelism with OpenMP based loop parallelism.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131515290","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 introduces a Tibetan multi-dialect data resource for multitask speech research. It can be used for Tibetan multi-dialect speech recognition, Tibetan speaker recognition, Tibetan dialect identification, and Tibetan speech synthesis. The resource consists of 30 hours Lhasa-U-Tsang dialect; 8.7 hours Kham dialect, including 3.4 hours Yushu dialect, 3.3 hours Dege dialect and 2 hours Changdu dialect; 10 hours Amdo pastoral dialect. Other resources are also provided for Lhasa-U-Tsang dialect including phoneme set, pronunciation dictionary and the codes for constructing the Lhasa-U-Tsang speech recognition baseline system. Meanwhile, for Tibetan multi-dialect and multitask speech recognition, the codes and recognition results based on WaveNet-connectionist temporal classification (WaveNet-CTC) are provided. All the resources are free for researchers and publicly available, which effectively compensates for the shortage of public Tibetan multi-dialect speech resources in order to promote the development of Tibetan multi-dialect speech processing technology.
{"title":"An open speech resource for Tibetan multi-dialect and multitask recognition","authors":"Yue Zhao, Xiaona Xu, Jianjian Yue, Wei Song, Xiali Li, Licheng Wu, Q. Ji","doi":"10.1504/ijcse.2020.10029389","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10029389","url":null,"abstract":"This paper introduces a Tibetan multi-dialect data resource for multitask speech research. It can be used for Tibetan multi-dialect speech recognition, Tibetan speaker recognition, Tibetan dialect identification, and Tibetan speech synthesis. The resource consists of 30 hours Lhasa-U-Tsang dialect; 8.7 hours Kham dialect, including 3.4 hours Yushu dialect, 3.3 hours Dege dialect and 2 hours Changdu dialect; 10 hours Amdo pastoral dialect. Other resources are also provided for Lhasa-U-Tsang dialect including phoneme set, pronunciation dictionary and the codes for constructing the Lhasa-U-Tsang speech recognition baseline system. Meanwhile, for Tibetan multi-dialect and multitask speech recognition, the codes and recognition results based on WaveNet-connectionist temporal classification (WaveNet-CTC) are provided. All the resources are free for researchers and publicly available, which effectively compensates for the shortage of public Tibetan multi-dialect speech resources in order to promote the development of Tibetan multi-dialect speech processing technology.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130843409","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
扫码关注我们
求助内容：
应助结果提醒方式：