Pub Date : 2012-05-19DOI: 10.1109/ICSAI.2012.6223387
N. Fatima, T. Zheng
The impact of Short Utterances in Speaker Recognition is of significant importance. Despite the advancements in short utterance speaker recognition (SUSR), text dependence and the role of phonemes in carrying speaker information needs further investigation. This paper presents a novel method of using vowel categories for SUSR. We define Vowel Categories (VC's) considering Chinese and English languages. After recognition and extraction of phonemes, the obtained vowels are divided into VC's, which are then used to develop Universal Background VC Models (UBVCM) for each VC. Conventional GMM-UBM system is used for training and testing. The proposed categories give minimum EERs of 13.76%, 14.03% and 16.18% for 3, 2 and 1 second respectively. Experimental results show that in text dependent SUSR, significant speaker-specific information is present at phoneme level. The similar properties of phonemes can be used such that accurate speech recognition is not required, rather Phoneme Categories can be used effectively for SUSR. Also, it is shown that vowels contain large amount of speaker information, which remains undisturbed when VC are employed.
{"title":"Vowel-category based Short Utterance Speaker Recognition","authors":"N. Fatima, T. Zheng","doi":"10.1109/ICSAI.2012.6223387","DOIUrl":"https://doi.org/10.1109/ICSAI.2012.6223387","url":null,"abstract":"The impact of Short Utterances in Speaker Recognition is of significant importance. Despite the advancements in short utterance speaker recognition (SUSR), text dependence and the role of phonemes in carrying speaker information needs further investigation. This paper presents a novel method of using vowel categories for SUSR. We define Vowel Categories (VC's) considering Chinese and English languages. After recognition and extraction of phonemes, the obtained vowels are divided into VC's, which are then used to develop Universal Background VC Models (UBVCM) for each VC. Conventional GMM-UBM system is used for training and testing. The proposed categories give minimum EERs of 13.76%, 14.03% and 16.18% for 3, 2 and 1 second respectively. Experimental results show that in text dependent SUSR, significant speaker-specific information is present at phoneme level. The similar properties of phonemes can be used such that accurate speech recognition is not required, rather Phoneme Categories can be used effectively for SUSR. Also, it is shown that vowels contain large amount of speaker information, which remains undisturbed when VC are employed.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116993567","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 : 2012-05-19DOI: 10.1109/ICSAI.2012.6223399
C. Chen, Jian Wang, Lei Zou, Jun Fu, Cong Ma
A novel algorithm is introduced for the deficiencies of underwater dam image crack detection. The algorithm makes use of the intensity values of 2D image to generate a 3D spatial surface, which is regarded as a concave-convex ground with “pits” and “ditches”. The “pits” represent the noise pixels and the “ditches” represent the crack pixels. The cracks that are difficult to describe in 2D image can be regarded well as ditches in the 3D spatial surface. Then by analyzing the characteristics of ditches space curvatures, the space detected method is used to get the ditches information, which is mapped to 2D surface as the crack. Because the detected result contains some noise and fake cracks, so BP neural network is adopted to identify crack object. As a result, the crack information is detected successfully.
{"title":"A novel crack detection algorithm of underwater dam image","authors":"C. Chen, Jian Wang, Lei Zou, Jun Fu, Cong Ma","doi":"10.1109/ICSAI.2012.6223399","DOIUrl":"https://doi.org/10.1109/ICSAI.2012.6223399","url":null,"abstract":"A novel algorithm is introduced for the deficiencies of underwater dam image crack detection. The algorithm makes use of the intensity values of 2D image to generate a 3D spatial surface, which is regarded as a concave-convex ground with “pits” and “ditches”. The “pits” represent the noise pixels and the “ditches” represent the crack pixels. The cracks that are difficult to describe in 2D image can be regarded well as ditches in the 3D spatial surface. Then by analyzing the characteristics of ditches space curvatures, the space detected method is used to get the ditches information, which is mapped to 2D surface as the crack. Because the detected result contains some noise and fake cracks, so BP neural network is adopted to identify crack object. As a result, the crack information is detected successfully.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124483068","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 : 2012-05-19DOI: 10.1109/ICSAI.2012.6223606
Xiangen Chen, Zhitao Hu, B. Yao, Xue Zhao
Results on graph coloring can be used to draw conclusions about scheduling. Graph theory is a sort of models which can be applied in various science fields such as computer science, physics, biology, chemistry, strategy etc. And graph coloring is one of the chief topics in graph research. Suppose G(V,E) is a connect graph with order at least 2, k is a positive integer and f is the mapping from V(G)∪E(G) to {1, 2, ⋯, k}. If (1) for any uv, vw ∈ E(G), u≠w, we have f(uv)≠f(vw); (2) for any uv∈E(G), u≠v, we have f(u) ≠ f(v), f(u) ≠ f(uv), f(v) ≠ f(uv), then f is called a k-total coloring of graph G(denoted by k - TC of G). The total chromatic number, denoted by χt(G), is the least number of colors in a total coloring of graph G. Suppose G and H are two simple graphs, (V(G)∪E(G))∩(V (H)∪E(H)) = θ. Let V (G⋁H) = V(G)∪V(H), E(G⋁H) = E(G)∪E(H)∪{uv|u ∈V(G), v∈V(H)}, then G⋁H is called the join-graph of G and H. The total chromatic number of the join graph of two fans with orders m + 1 and n + 1 respectively is obtained in this paper.
{"title":"The total coloring of Fm ∨ Fn","authors":"Xiangen Chen, Zhitao Hu, B. Yao, Xue Zhao","doi":"10.1109/ICSAI.2012.6223606","DOIUrl":"https://doi.org/10.1109/ICSAI.2012.6223606","url":null,"abstract":"Results on graph coloring can be used to draw conclusions about scheduling. Graph theory is a sort of models which can be applied in various science fields such as computer science, physics, biology, chemistry, strategy etc. And graph coloring is one of the chief topics in graph research. Suppose G(V,E) is a connect graph with order at least 2, k is a positive integer and f is the mapping from V(G)∪E(G) to {1, 2, ⋯, k}. If (1) for any uv, vw ∈ E(G), u≠w, we have f(uv)≠f(vw); (2) for any uv∈E(G), u≠v, we have f(u) ≠ f(v), f(u) ≠ f(uv), f(v) ≠ f(uv), then f is called a k-total coloring of graph G(denoted by k - TC of G). The total chromatic number, denoted by <sub>χt</sub>(G), is the least number of colors in a total coloring of graph G. Suppose G and H are two simple graphs, (V(G)∪E(G))∩(V (H)∪E(H)) = θ. Let V (G⋁H) = V(G)∪V(H), E(G⋁H) = E(G)∪E(H)∪{uv|u ∈V(G), v∈V(H)}, then G⋁H is called the join-graph of G and H. The total chromatic number of the join graph of two fans with orders m + 1 and n + 1 respectively is obtained in this paper.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126134835","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 : 2012-05-19DOI: 10.1109/ICSAI.2012.6223180
Shuang Wang, Huiyang Zhao
Experimental equipments are less in high education school and we can't perform an experiment remotely by an existing simulator. To solve these problems, the paper propose a plan of designing and implementing a remote virtual network lab. By this lab, teachers can arrange and manage kinds of experiments remotely and students can access the lab to finish their tasks remotely at any time and place. The experimental teaching will not be limited by amount of equipments, time and space. The teaching effect will be improved significantly.
{"title":"Design and implementation of remote virtual network lab","authors":"Shuang Wang, Huiyang Zhao","doi":"10.1109/ICSAI.2012.6223180","DOIUrl":"https://doi.org/10.1109/ICSAI.2012.6223180","url":null,"abstract":"Experimental equipments are less in high education school and we can't perform an experiment remotely by an existing simulator. To solve these problems, the paper propose a plan of designing and implementing a remote virtual network lab. By this lab, teachers can arrange and manage kinds of experiments remotely and students can access the lab to finish their tasks remotely at any time and place. The experimental teaching will not be limited by amount of equipments, time and space. The teaching effect will be improved significantly.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128479091","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 : 2012-05-19DOI: 10.1109/ICSAI.2012.6223231
Shun-yi Li, Wenwu Liu
A three stage-structured prey-predator model with hunting delay is studied. The characteristic equations of the boundary and positive equilibrium are analyzed and the conditions of the positive equilibrium occurring Hopf bifurcation are given by applying the theorem of Hopf bifurcation. By using Nyquist criterion, the estimation of the length of delay to preserve stability is obtained. Finally, numerical simulation and brief conclusion are given.
{"title":"Hopf bifurcation in a three stage-structured prey-predator model with hunting delay","authors":"Shun-yi Li, Wenwu Liu","doi":"10.1109/ICSAI.2012.6223231","DOIUrl":"https://doi.org/10.1109/ICSAI.2012.6223231","url":null,"abstract":"A three stage-structured prey-predator model with hunting delay is studied. The characteristic equations of the boundary and positive equilibrium are analyzed and the conditions of the positive equilibrium occurring Hopf bifurcation are given by applying the theorem of Hopf bifurcation. By using Nyquist criterion, the estimation of the length of delay to preserve stability is obtained. Finally, numerical simulation and brief conclusion are given.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128539117","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 : 2012-05-19DOI: 10.1109/ICSAI.2012.6223359
Jianhua Nie, Jianguo Shen
Ultrasonic signal attenuator is a component of acoustic logging instruments. It is designed to eliminate the direct wave which arrives at receiving probe directly through drill collar without passing through the formation. Wave function is derived from the model of the sound waves propagating in the one-dimensional discontinuous interfaces. The Ultrasonic signal attenuator consists of three units which are composed by five different materials with big wave impedance difference. These three units have good wave filtering effects on different frequency bands because the thickness of five materials is changed. After stacking the three units, an ultrasonic signal attenuator with better wave filtering effects on the whole frequency band is obtained. The design is verified to be feasible through the MATLAB simulation.
{"title":"A method for new type ultrasonic signal attenuator design using one-dimensional discontinuous interfaces model","authors":"Jianhua Nie, Jianguo Shen","doi":"10.1109/ICSAI.2012.6223359","DOIUrl":"https://doi.org/10.1109/ICSAI.2012.6223359","url":null,"abstract":"Ultrasonic signal attenuator is a component of acoustic logging instruments. It is designed to eliminate the direct wave which arrives at receiving probe directly through drill collar without passing through the formation. Wave function is derived from the model of the sound waves propagating in the one-dimensional discontinuous interfaces. The Ultrasonic signal attenuator consists of three units which are composed by five different materials with big wave impedance difference. These three units have good wave filtering effects on different frequency bands because the thickness of five materials is changed. After stacking the three units, an ultrasonic signal attenuator with better wave filtering effects on the whole frequency band is obtained. The design is verified to be feasible through the MATLAB simulation.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128651098","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 : 2012-05-19DOI: 10.1109/ICSAI.2012.6223350
B. Yao, Xiangqian Zhou, Jiajuan Zhang, Xiangen Chen, Xiao-Min Zhang, Jianmin Xie, Ming Yao, Mogang Li
Graph labelings related with communication networks have been extensively investigated because their applications to real problems. Some results on graph labellings are obtained here. Scale-free graphs are coming from scale-free networks a few years ago. We use spanning trees to study some important characteristics of scale-free networks, and obtain some results related with scale-free networks. Furthermore, we provide some connections between invariants of graphs in order to apply graph-theoretical methods to network problems.
{"title":"Labellings and invariants of models from complex networks","authors":"B. Yao, Xiangqian Zhou, Jiajuan Zhang, Xiangen Chen, Xiao-Min Zhang, Jianmin Xie, Ming Yao, Mogang Li","doi":"10.1109/ICSAI.2012.6223350","DOIUrl":"https://doi.org/10.1109/ICSAI.2012.6223350","url":null,"abstract":"Graph labelings related with communication networks have been extensively investigated because their applications to real problems. Some results on graph labellings are obtained here. Scale-free graphs are coming from scale-free networks a few years ago. We use spanning trees to study some important characteristics of scale-free networks, and obtain some results related with scale-free networks. Furthermore, we provide some connections between invariants of graphs in order to apply graph-theoretical methods to network problems.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128660739","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 : 2012-05-19DOI: 10.1109/ICSAI.2012.6223239
Min Sun, Ji Chen, Daoliang Li
Water temperature is considered as one of the most important parameters which influence the growth rate and development of sea cucumbers as well as their distribution within the pond environment. As the change process of water temperature is dependent on the complicated meteorological and geophysical conditions, artificial neural network with specific features such as non-linearity, adaptivity, generalization, and model independence will be a proper method for solving this problem. This paper presents a Radial Basis Function (RBF) neural network model based on nearest neighbor clustering algorithm and puts forward some improved methods aiming at looking for the defects of original algorithm, then integrated them into an optimization model and verified it on matlab platform. Finally, a comparison between RBF model and 1-D vertical model was made to confirm the excellent predictive performance of optimized RBF neural network model.
{"title":"Water temperature prediction in sea cucumber aquaculture ponds by RBF neural network model","authors":"Min Sun, Ji Chen, Daoliang Li","doi":"10.1109/ICSAI.2012.6223239","DOIUrl":"https://doi.org/10.1109/ICSAI.2012.6223239","url":null,"abstract":"Water temperature is considered as one of the most important parameters which influence the growth rate and development of sea cucumbers as well as their distribution within the pond environment. As the change process of water temperature is dependent on the complicated meteorological and geophysical conditions, artificial neural network with specific features such as non-linearity, adaptivity, generalization, and model independence will be a proper method for solving this problem. This paper presents a Radial Basis Function (RBF) neural network model based on nearest neighbor clustering algorithm and puts forward some improved methods aiming at looking for the defects of original algorithm, then integrated them into an optimization model and verified it on matlab platform. Finally, a comparison between RBF model and 1-D vertical model was made to confirm the excellent predictive performance of optimized RBF neural network model.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127139404","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 : 2012-05-19DOI: 10.1109/ICSAI.2012.6223593
Zhenglin Liu, Qingchun Zhu, Wenjie Huo, X. Zou, Lian Huai
Memory integrity verification has been widely used to protect off-chip memory from the tamper attacks. In this paper, we propose a new hash mechanism, multi-grained hash tree (MGT), to optimize the run-time performance of memory integrity verification. This new scheme adopts variable granularities to hash the nodes on different levels, and caches these nodes in a split hash cache. The experimental results indicate that our new multi-grained scheme has 10.8% performance speedup even with a small hash cache, and reduces 53.69% initialization latency on average.
{"title":"MGT: A multi-grained memory hash mechanism for embedded processor","authors":"Zhenglin Liu, Qingchun Zhu, Wenjie Huo, X. Zou, Lian Huai","doi":"10.1109/ICSAI.2012.6223593","DOIUrl":"https://doi.org/10.1109/ICSAI.2012.6223593","url":null,"abstract":"Memory integrity verification has been widely used to protect off-chip memory from the tamper attacks. In this paper, we propose a new hash mechanism, multi-grained hash tree (MGT), to optimize the run-time performance of memory integrity verification. This new scheme adopts variable granularities to hash the nodes on different levels, and caches these nodes in a split hash cache. The experimental results indicate that our new multi-grained scheme has 10.8% performance speedup even with a small hash cache, and reduces 53.69% initialization latency on average.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128889273","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 : 2012-05-19DOI: 10.1109/ICSAI.2012.6223297
Hann-Tzong Chern, H. Kuo, So-Tsung Chou
In recent years, IEEE 802.11 Wireless Local Area Networks (WLANs) have emerged as one of the prevailing technologies for the broadband wireless access. Although IEEE802.16 wireless network has become a newer generation of wireless network, it will be used as wireless metropolitan area network in the beginning because of its price. IEEE 802.11 network will continue to be the most important wireless local area network (WLAN) because of inexpensive price and easy installation. There are increasing number of applications found for WLAN which include real time traffic like Voice over IP and others. This causes more and more intensive research efforts on the quality of service (QoS) issues in “carrier sense multiple access/ collision avoidance (CSMA/CA)” for WLAN. Until now, the standard of IEEE 802.11e has stated some scenarios for this problem. In this paper, we focus on the adjustment of contention window of CSMA/CA after successful transmission of frame and the collision of multiple frames. In IEEE 802.11e, different contention window is given to different class of traffic. This will give higher priority to real traffic in a contention protocol. However, several researches have shown this method does not work very well in high load situation. For this, we propose a method to adjust the minimum contention window (CWmin) for different class of traffic according the number of stations and the collision rate of this class. Also, we propose a method to find the new contention window after collision. Simulation shows our protocol will have a good result under both light and heavy load situations.
{"title":"Enhanced distribution channel access — Modification of the intial & thereafter CW (EDCA-MITCW)","authors":"Hann-Tzong Chern, H. Kuo, So-Tsung Chou","doi":"10.1109/ICSAI.2012.6223297","DOIUrl":"https://doi.org/10.1109/ICSAI.2012.6223297","url":null,"abstract":"In recent years, IEEE 802.11 Wireless Local Area Networks (WLANs) have emerged as one of the prevailing technologies for the broadband wireless access. Although IEEE802.16 wireless network has become a newer generation of wireless network, it will be used as wireless metropolitan area network in the beginning because of its price. IEEE 802.11 network will continue to be the most important wireless local area network (WLAN) because of inexpensive price and easy installation. There are increasing number of applications found for WLAN which include real time traffic like Voice over IP and others. This causes more and more intensive research efforts on the quality of service (QoS) issues in “carrier sense multiple access/ collision avoidance (CSMA/CA)” for WLAN. Until now, the standard of IEEE 802.11e has stated some scenarios for this problem. In this paper, we focus on the adjustment of contention window of CSMA/CA after successful transmission of frame and the collision of multiple frames. In IEEE 802.11e, different contention window is given to different class of traffic. This will give higher priority to real traffic in a contention protocol. However, several researches have shown this method does not work very well in high load situation. For this, we propose a method to adjust the minimum contention window (CWmin) for different class of traffic according the number of stations and the collision rate of this class. Also, we propose a method to find the new contention window after collision. Simulation shows our protocol will have a good result under both light and heavy load situations.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130792483","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
扫码关注我们
求助内容：
应助结果提醒方式：