Treebank is one of important resources in the natural language processing. Compared with the rich and mature Chinese corpus, Vietnamese Syntactic Analysis is much more difficult. This paper presents a new approach which uses Chinese-Vietnamese bilingual word alignment corpus to build Vietnamese Dependency Treebank. Firstly, the aligned word processing was made by Chinese-Vietnamese sentence alignment; Secondly, the dependency parsing was done with Chinese sentences. Finally, Vietnamese Dependency Parsing Treebank was generated by Chinese-Vietnamese Languages align relationship and Chinese Dependency Tree, At the same time, The Vietnamese phrase tree converted into dependency Treebank can significantly improve the accuracy of dependency analysis. Experimental results show that this approach can simplify the process of manual collection and annotation of Vietnamese Treebank, and it can save manpower and time to build the Vietnamese Treebank. Experimental results show that the accuracy of this method compared to machine learning methods has improved significantly.
{"title":"Building vietnamese dependency treebank based on Chinese-Vietnamese bilingual word alignment","authors":"Ying Li, Jianyi Guo, Zhengtao Yu, Hongbin Wang, Yonghua Wen","doi":"10.1109/FSKD.2016.7603371","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603371","url":null,"abstract":"Treebank is one of important resources in the natural language processing. Compared with the rich and mature Chinese corpus, Vietnamese Syntactic Analysis is much more difficult. This paper presents a new approach which uses Chinese-Vietnamese bilingual word alignment corpus to build Vietnamese Dependency Treebank. Firstly, the aligned word processing was made by Chinese-Vietnamese sentence alignment; Secondly, the dependency parsing was done with Chinese sentences. Finally, Vietnamese Dependency Parsing Treebank was generated by Chinese-Vietnamese Languages align relationship and Chinese Dependency Tree, At the same time, The Vietnamese phrase tree converted into dependency Treebank can significantly improve the accuracy of dependency analysis. Experimental results show that this approach can simplify the process of manual collection and annotation of Vietnamese Treebank, and it can save manpower and time to build the Vietnamese Treebank. Experimental results show that the accuracy of this method compared to machine learning methods has improved significantly.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114157600","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 : 2016-08-01DOI: 10.1109/FSKD.2016.7603490
Tang Liang-rui, Lou Jia, He Yuan
In the electrical power system, there is a wide range of communication services and service needs, and the realization of differentiated services of different types is quite necessary. Thus, based on the combination of characters and requirements of electric power communication business, this paper makes an argument for a routing and wavelength assignment algorithm based on prediction and layered graph model (PLGMRWA). Through the wavelength number prediction mechanism, it realizes the distribution of wavelength resource according to the needs, and uses the layered graph model to wholly solve the problems of route and wavelength assignment in comprehensive considerations of hops and the usage of wavelength. The simulation results indicate that, algorithm PLGMRWA has advantages of blocking capacity and wavelength resource utilization over algorithms GWAS (Grouped wavelength assignment strategy) and DPWA (Dynamic and priority-based wavelength assignment algorithm) for all levels of business in electrical power communication network.
{"title":"Electrical optical network RWA algorithm based on prediction and layered graph model","authors":"Tang Liang-rui, Lou Jia, He Yuan","doi":"10.1109/FSKD.2016.7603490","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603490","url":null,"abstract":"In the electrical power system, there is a wide range of communication services and service needs, and the realization of differentiated services of different types is quite necessary. Thus, based on the combination of characters and requirements of electric power communication business, this paper makes an argument for a routing and wavelength assignment algorithm based on prediction and layered graph model (PLGMRWA). Through the wavelength number prediction mechanism, it realizes the distribution of wavelength resource according to the needs, and uses the layered graph model to wholly solve the problems of route and wavelength assignment in comprehensive considerations of hops and the usage of wavelength. The simulation results indicate that, algorithm PLGMRWA has advantages of blocking capacity and wavelength resource utilization over algorithms GWAS (Grouped wavelength assignment strategy) and DPWA (Dynamic and priority-based wavelength assignment algorithm) for all levels of business in electrical power communication network.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"217 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116527063","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 : 2016-08-01DOI: 10.1109/FSKD.2016.7603258
Xiaohonag Zhng, Bin Zhang, Changsheng Zhang, Anxiang Ma
Communities detection algorithm based on GA is attracting common interest. To solve the shortcomings of traditional single objective Genetic Algorithms based “modularity”, which tend to find a community of similar size, according the character of the problem, the corresponding optimization model is built and a multi-objective density driven genetic algorithm called MOHGA is present. So as to avoid the population of prematurity and enhance the global search ability, the concept of individual density is designed and combined with the selection strategy of genetic operators, meanwhile, a initial method based on most neighbors is adopted to produce the accurate and diverse initial population, which can further improve the search efficiency of MOHGA. Experimental results show that the result got by our algorithm is better than that of related algorithms.
{"title":"A multi-objective hybrid genetic algorithm for detecting communities in complex networks","authors":"Xiaohonag Zhng, Bin Zhang, Changsheng Zhang, Anxiang Ma","doi":"10.1109/FSKD.2016.7603258","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603258","url":null,"abstract":"Communities detection algorithm based on GA is attracting common interest. To solve the shortcomings of traditional single objective Genetic Algorithms based “modularity”, which tend to find a community of similar size, according the character of the problem, the corresponding optimization model is built and a multi-objective density driven genetic algorithm called MOHGA is present. So as to avoid the population of prematurity and enhance the global search ability, the concept of individual density is designed and combined with the selection strategy of genetic operators, meanwhile, a initial method based on most neighbors is adopted to produce the accurate and diverse initial population, which can further improve the search efficiency of MOHGA. Experimental results show that the result got by our algorithm is better than that of related algorithms.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"120-121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124012898","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 : 2016-08-01DOI: 10.1109/FSKD.2016.7603459
Q. Zheng, C. Zheng
Photo-realistic image synthesis using full lens model provides us with realistic lens effects, but it suffers from low rendering efficiency when many light paths are obstructed by lens stops and lens barrel. This paper proposes a novel method to generate light paths, along which rays can propagate through the lens system. As a first step, a light passage function is defined as the objective function for sampling light paths. The sampling is implemented in a hypercube space, by means of both adaptive Markov chain sampling and interacting Markov chain Monte Carlo. Then light paths are constructed based on these samples. This approach can be easily incorporated in existing rendering methods to trace rays through a full lens model. Experimental results show that this approach can effectively increase the number of valid rays which can go through the lens system, therefore improving the rendering efficiency.
{"title":"Adaptive light paths generation through full lens model","authors":"Q. Zheng, C. Zheng","doi":"10.1109/FSKD.2016.7603459","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603459","url":null,"abstract":"Photo-realistic image synthesis using full lens model provides us with realistic lens effects, but it suffers from low rendering efficiency when many light paths are obstructed by lens stops and lens barrel. This paper proposes a novel method to generate light paths, along which rays can propagate through the lens system. As a first step, a light passage function is defined as the objective function for sampling light paths. The sampling is implemented in a hypercube space, by means of both adaptive Markov chain sampling and interacting Markov chain Monte Carlo. Then light paths are constructed based on these samples. This approach can be easily incorporated in existing rendering methods to trace rays through a full lens model. Experimental results show that this approach can effectively increase the number of valid rays which can go through the lens system, therefore improving the rendering efficiency.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123212721","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 : 2016-08-01DOI: 10.1109/FSKD.2016.7603219
Baoxian Jia, Yong Wang, Jinhai Yuan, Jun-qing Li
The classical harmony search (HS) algorithm has been improved. The algorithm effectively prevents it from becoming trapped by a local optimal solution. It allows to be used to deale the shortest-path issue. To solve the shortest route problem, we improved the classical harmony algorithm and seek the optimal solution in the global scope. Second, by the application of the dynamic priority value encoding scheme, we constructed the path based on the priority value of correspondent nodes of variables in the harmonic vector. Through the iterative update of the harmony memory banks, we finally obtained the shortest route. Finally the simulation experiments show us that the proposed algorithm is better than PSO algorithm and HS algorithm on the performance.
{"title":"Solving the shortest-path problem in logistics distribution for vehicle-routing optimization","authors":"Baoxian Jia, Yong Wang, Jinhai Yuan, Jun-qing Li","doi":"10.1109/FSKD.2016.7603219","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603219","url":null,"abstract":"The classical harmony search (HS) algorithm has been improved. The algorithm effectively prevents it from becoming trapped by a local optimal solution. It allows to be used to deale the shortest-path issue. To solve the shortest route problem, we improved the classical harmony algorithm and seek the optimal solution in the global scope. Second, by the application of the dynamic priority value encoding scheme, we constructed the path based on the priority value of correspondent nodes of variables in the harmonic vector. Through the iterative update of the harmony memory banks, we finally obtained the shortest route. Finally the simulation experiments show us that the proposed algorithm is better than PSO algorithm and HS algorithm on the performance.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125144716","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 : 2016-08-01DOI: 10.1109/FSKD.2016.7603479
H. Wang
Separating the high resolution remote sensing images is a difficult problem in the relative research field of image processing and remote sensing. A novel model of separating the high resolution remote sensing images is proposed based on sparse representation, different dictionary which has an efficient indication of different content of remote sensing image is obtained based on dictionary learning algorithm according to the characteristics of the high spatial resolution remote sensing images, separating by SSF algorithm. After experimental, it is showed that the algorithm can separate features of remote sensing images better, and it is more robust.
{"title":"The separation of high resolution remote sensing images based on dictionary learning","authors":"H. Wang","doi":"10.1109/FSKD.2016.7603479","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603479","url":null,"abstract":"Separating the high resolution remote sensing images is a difficult problem in the relative research field of image processing and remote sensing. A novel model of separating the high resolution remote sensing images is proposed based on sparse representation, different dictionary which has an efficient indication of different content of remote sensing image is obtained based on dictionary learning algorithm according to the characteristics of the high spatial resolution remote sensing images, separating by SSF algorithm. After experimental, it is showed that the algorithm can separate features of remote sensing images better, and it is more robust.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125394881","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 : 2016-08-01DOI: 10.1109/FSKD.2016.7603486
Hanwu Wang, Liang An, Beibei Yang, Tao Yu
The IEEE 802.16m based broadband wireless access is a promising technology to provide high speed and wide coverage communications for wireless users. However, how to achieve the desired utilization of the radio frequency bandwidth resource in such networks is an open issue as it covers the radio channel capacity exploitation, channel transmission bandwidth utilization optimization and resource utilization scheme performance analysis. In this regarding, we first propose a novel scheme to exploit the maximal channel transmission rate with respect to the time-varying state of each communication channel. Then we construct an efficient channel utilization scheme to fully utilize the channel transmission bandwidth according to the user's performance requirements. Next we also present an analytical scheme to analyze the performance of the channel usage scheme regarding various performance metrics. Experiment results validate the superiority of the proposed utilization scheme.
{"title":"An optimal bandwidth resource utilization scheme in IEEE 802.16m communication networks","authors":"Hanwu Wang, Liang An, Beibei Yang, Tao Yu","doi":"10.1109/FSKD.2016.7603486","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603486","url":null,"abstract":"The IEEE 802.16m based broadband wireless access is a promising technology to provide high speed and wide coverage communications for wireless users. However, how to achieve the desired utilization of the radio frequency bandwidth resource in such networks is an open issue as it covers the radio channel capacity exploitation, channel transmission bandwidth utilization optimization and resource utilization scheme performance analysis. In this regarding, we first propose a novel scheme to exploit the maximal channel transmission rate with respect to the time-varying state of each communication channel. Then we construct an efficient channel utilization scheme to fully utilize the channel transmission bandwidth according to the user's performance requirements. Next we also present an analytical scheme to analyze the performance of the channel usage scheme regarding various performance metrics. Experiment results validate the superiority of the proposed utilization scheme.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125302244","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 : 2016-08-01DOI: 10.1109/FSKD.2016.7603295
Haitao Lin, Xiaobin Yang, Xiaopeng Yang
The system of max-product fuzzy relation inequalities(FRI) has been studied when it is consistent. In this paper, we study max-product FRI system when it is inconsistent. Based on some new concepts and theorems of approximate solutions, we provide an algorithm to solve its approximate solutions of the inconsistent FRI system. Also, we give an example to demonstrate the efficiency of the algorithm.
{"title":"Approximate solution to inconsistent system of max-product fuzzy relation inequalities","authors":"Haitao Lin, Xiaobin Yang, Xiaopeng Yang","doi":"10.1109/FSKD.2016.7603295","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603295","url":null,"abstract":"The system of max-product fuzzy relation inequalities(FRI) has been studied when it is consistent. In this paper, we study max-product FRI system when it is inconsistent. Based on some new concepts and theorems of approximate solutions, we provide an algorithm to solve its approximate solutions of the inconsistent FRI system. Also, we give an example to demonstrate the efficiency of the algorithm.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125482737","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 : 2016-08-01DOI: 10.1109/FSKD.2016.7603442
Humaid Alshamsi, H. Meng, Maozhen Li
Facial expression has made significant progress in recent years with many commercial systems are available for real-world applications. It gains strong interest to implement a facial expression system on a portable device such as tablet and smart phone device using the camera already integrated in the devices. It is very common to see face recognition phone unlocking app in new smart phones which are proven to be hassle free way to unlock a phone. Implementation a facial expression system in a smart phone would provide fun applications that can be used to measure the mood of the user in their daily life or as a tool for their daily monitoring of the motion in phycology studies. However, traditional facial expression algorithms are normally computing extensive and can only be implemented offline at a computer. In this paper, a novel automatic system has been proposed to recognize emotions from face images on a smart phone in real-time. In our system, the camera of the smart phone is used to capture the face image, BRIEF features are extracted and k-nearest neighbor algorithm is implemented for the classification. The experimental results demonstrate that the proposed facial expression recognition on mobile phone is successful and it gives up to 89.5% recognition accuracy.
{"title":"Real time facial expression recognition app development on mobile phones","authors":"Humaid Alshamsi, H. Meng, Maozhen Li","doi":"10.1109/FSKD.2016.7603442","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603442","url":null,"abstract":"Facial expression has made significant progress in recent years with many commercial systems are available for real-world applications. It gains strong interest to implement a facial expression system on a portable device such as tablet and smart phone device using the camera already integrated in the devices. It is very common to see face recognition phone unlocking app in new smart phones which are proven to be hassle free way to unlock a phone. Implementation a facial expression system in a smart phone would provide fun applications that can be used to measure the mood of the user in their daily life or as a tool for their daily monitoring of the motion in phycology studies. However, traditional facial expression algorithms are normally computing extensive and can only be implemented offline at a computer. In this paper, a novel automatic system has been proposed to recognize emotions from face images on a smart phone in real-time. In our system, the camera of the smart phone is used to capture the face image, BRIEF features are extracted and k-nearest neighbor algorithm is implemented for the classification. The experimental results demonstrate that the proposed facial expression recognition on mobile phone is successful and it gives up to 89.5% recognition accuracy.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129723652","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 : 2016-08-01DOI: 10.1109/FSKD.2016.7603289
C. Yu, Pin Wan, Yonghua Wang, Ting-Jung Liang
The maximum and minimum eigenvalue (MME) spectrum sensing algorithm with features such as low complexity, no need of the prior information of authorized users, etc. However, because of its detection distribution function is not clear, researchers have improved the MME spectrum sensing algorithm from the point of view of the distribution function, but cannot solve the insufficient detection performance issues of these algorithms in low signal noise ratio (SNR). To solve this problem, this paper proposes two joint spectrum sensing algorithms based on two improved MME algorithms and cyclic stationary feature detection algorithm. Simulation results show that the performance of these two kinds of joint spectrum sensing algorithms is superior to both individual performance. At the same time, its performance is better than the performance of the simple MME-cyclic stationary feature joint spectrum sensing algorithm.
{"title":"Spectrum sensing algorithm based on improved MME-Cyclic stationary feature","authors":"C. Yu, Pin Wan, Yonghua Wang, Ting-Jung Liang","doi":"10.1109/FSKD.2016.7603289","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603289","url":null,"abstract":"The maximum and minimum eigenvalue (MME) spectrum sensing algorithm with features such as low complexity, no need of the prior information of authorized users, etc. However, because of its detection distribution function is not clear, researchers have improved the MME spectrum sensing algorithm from the point of view of the distribution function, but cannot solve the insufficient detection performance issues of these algorithms in low signal noise ratio (SNR). To solve this problem, this paper proposes two joint spectrum sensing algorithms based on two improved MME algorithms and cyclic stationary feature detection algorithm. Simulation results show that the performance of these two kinds of joint spectrum sensing algorithms is superior to both individual performance. At the same time, its performance is better than the performance of the simple MME-cyclic stationary feature joint spectrum sensing algorithm.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130907830","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
扫码关注我们
求助内容：
应助结果提醒方式：