Pub Date : 2014-12-08DOI: 10.1109/ICNC.2014.6975943
Y. Liu, TianJiu Xiao
English person names are translated into Chinese person names using the combined method-dictionary, entropy alignment model and web mining. Entropy alignment model makes use of the dictionary of person names and surnames, bidirectional conditional probability and transliteration similarity. Web mining makes use of rules, clue words, transliteration similarity and conditional probability. The experimental results show word name dictionary combined with entropy alignment model can achieve high precision and recall rate for large scale of parallel corpus. Web mining helps to improve the precision of name translation especially for those wrong alignments and nonaligned names of entropy alignment model.
{"title":"Translation of English-Chinese person name based on dictionary, bilingual corpus and web mining","authors":"Y. Liu, TianJiu Xiao","doi":"10.1109/ICNC.2014.6975943","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975943","url":null,"abstract":"English person names are translated into Chinese person names using the combined method-dictionary, entropy alignment model and web mining. Entropy alignment model makes use of the dictionary of person names and surnames, bidirectional conditional probability and transliteration similarity. Web mining makes use of rules, clue words, transliteration similarity and conditional probability. The experimental results show word name dictionary combined with entropy alignment model can achieve high precision and recall rate for large scale of parallel corpus. Web mining helps to improve the precision of name translation especially for those wrong alignments and nonaligned names of entropy alignment model.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115228088","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 : 2014-12-08DOI: 10.1109/ICNC.2014.6975945
Zhuoqi Wang, Youxun Lei, Tan Yang
With the development of new technology and new media, traditional mainstream media is no longer the only protagonist of emergency reporting, microblog has played an irreplaceable role in emergency reporting, topic transmission and public opinion spread. In order to find out the topological characteristics of emergency transmission in microblog, in this paper, we measured the most popular microblog system in China - Sina Microblog, and compared our experiment results with the existing online social networks, found that the network topology of Sina Microblog network of emergency topic has following characteristics: 1) 77% of users who participate in emergency topic discussion follow each other; 2) Distribution of outdegree and indegree of the network is approximate to the power-law distribution; 3) The network has small-world properties; 4) The outdegree and indegree of the network have no correlation; 5) The network has no assortativity. These measurement result are very important for further study on the propagation rules of emergencies in the microblog network, and provide important basis and foundation for the prediction of topic trend.
{"title":"Measurement and analysis on microblog network of emergency topic","authors":"Zhuoqi Wang, Youxun Lei, Tan Yang","doi":"10.1109/ICNC.2014.6975945","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975945","url":null,"abstract":"With the development of new technology and new media, traditional mainstream media is no longer the only protagonist of emergency reporting, microblog has played an irreplaceable role in emergency reporting, topic transmission and public opinion spread. In order to find out the topological characteristics of emergency transmission in microblog, in this paper, we measured the most popular microblog system in China - Sina Microblog, and compared our experiment results with the existing online social networks, found that the network topology of Sina Microblog network of emergency topic has following characteristics: 1) 77% of users who participate in emergency topic discussion follow each other; 2) Distribution of outdegree and indegree of the network is approximate to the power-law distribution; 3) The network has small-world properties; 4) The outdegree and indegree of the network have no correlation; 5) The network has no assortativity. These measurement result are very important for further study on the propagation rules of emergencies in the microblog network, and provide important basis and foundation for the prediction of topic trend.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116775698","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 : 2014-12-08DOI: 10.1109/ICNC.2014.6975956
Jia-jia Jiang, F. Duan, Yan-chao Li
An accurate direction-of-arrival (DOA) estimation algorithm is proposed with a uniform linear array (ULA) when coherent and uncorrelated signals coexist. By selecting the rank from the covariance matrix of array output, we first reconstruct a Toeplitz matrix so as to achieve the objective of decorrelation similar to reference [2]. And then we proposed a spectrum of improved MUSIC (named as SI-MUSIC) method to achieve a super-resolution angular estimation. Moreover, the angular resolution of the I-MUSIC method can be adjust according to the practical requirement. Simulation results demonstrate the effectiveness and performance of the proposed algorithm.
{"title":"Accurate direction-of-arrival estimation for coherent signals","authors":"Jia-jia Jiang, F. Duan, Yan-chao Li","doi":"10.1109/ICNC.2014.6975956","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975956","url":null,"abstract":"An accurate direction-of-arrival (DOA) estimation algorithm is proposed with a uniform linear array (ULA) when coherent and uncorrelated signals coexist. By selecting the rank from the covariance matrix of array output, we first reconstruct a Toeplitz matrix so as to achieve the objective of decorrelation similar to reference [2]. And then we proposed a spectrum of improved MUSIC (named as SI-MUSIC) method to achieve a super-resolution angular estimation. Moreover, the angular resolution of the I-MUSIC method can be adjust according to the practical requirement. Simulation results demonstrate the effectiveness and performance of the proposed algorithm.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123300525","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 : 2014-12-08DOI: 10.1109/ICNC.2014.6975865
Mingyue Wang, Na Wang, Chi Zhang, Dehong Ma, Zhanshan Li
The study of constraint satisfaction problems touches many aspects of artificial intelligence. It is the premise of dominant interactive constraint satisfaction algorithms that users' preference has complete order. To accord more with practical situation, Haijiao Shen [3] did some research on the situation in which users' preferences have partial order and put forward the related algorithm in 2011. By introducing a constraint set M to decrease the spread of redundancy, we optimize her algorithm. We also prove the validity of our new algorithm and test it on some benchmarks. It is indicated by test result that the optimized algorithm MulExp can save up to 18% of examine times and up to 12% of solving time, which greatly increases the efficiency of solving process.
{"title":"An optimal algorithm to compute maximal relaxations in parallel","authors":"Mingyue Wang, Na Wang, Chi Zhang, Dehong Ma, Zhanshan Li","doi":"10.1109/ICNC.2014.6975865","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975865","url":null,"abstract":"The study of constraint satisfaction problems touches many aspects of artificial intelligence. It is the premise of dominant interactive constraint satisfaction algorithms that users' preference has complete order. To accord more with practical situation, Haijiao Shen [3] did some research on the situation in which users' preferences have partial order and put forward the related algorithm in 2011. By introducing a constraint set M to decrease the spread of redundancy, we optimize her algorithm. We also prove the validity of our new algorithm and test it on some benchmarks. It is indicated by test result that the optimized algorithm MulExp can save up to 18% of examine times and up to 12% of solving time, which greatly increases the efficiency of solving process.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122733094","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 : 2014-12-08DOI: 10.1109/ICNC.2014.6975935
Woo-Hyun Rho, Sung-Bae Cho
The number of applications available since the late 2010's, and the number of smartphone user sharply increasing. However, not all applications are not useful or helpful. In other words, to obtain satisfactory results in the search can be difficult means. Users to find what they want to search for a many times. To solve this problem, previous studies have proposed the use of recommender systems. Most of the system uses age, gender, preference based collaborative filtering. Collaborative filtering has the problem that data sparsity, cold-start or needs lots of users' personal data. In this paper, we propose a smartphone context-aware application category recommendation. We use Bayesian-network to inference context and recommend the category when inference context and we have set the probability of using category from collected data. We tested our proposed system with F1 measure, accuracy of inference context.
{"title":"Context-aware smartphone application category recommender system with modularized Bayesian networks","authors":"Woo-Hyun Rho, Sung-Bae Cho","doi":"10.1109/ICNC.2014.6975935","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975935","url":null,"abstract":"The number of applications available since the late 2010's, and the number of smartphone user sharply increasing. However, not all applications are not useful or helpful. In other words, to obtain satisfactory results in the search can be difficult means. Users to find what they want to search for a many times. To solve this problem, previous studies have proposed the use of recommender systems. Most of the system uses age, gender, preference based collaborative filtering. Collaborative filtering has the problem that data sparsity, cold-start or needs lots of users' personal data. In this paper, we propose a smartphone context-aware application category recommendation. We use Bayesian-network to inference context and recommend the category when inference context and we have set the probability of using category from collected data. We tested our proposed system with F1 measure, accuracy of inference context.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128213614","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 : 2014-12-08DOI: 10.1109/ICNC.2014.6975874
Jiangshao Gu, Kunmei Wen
Since the original Glowworm Swarm Optimization (GSO) contains the defects of being caught in local optima potentially and slow convergence rate, we analyze the superiority of quantum system and introduce this technique into the behavior of glowworms according to local conditions, to propose Quantum-behaved Glowworm Swarm Optimization (QGSO). By a series of improvements, the diversity of swarms is enhanced and the oscillation caused by constant step length is eliminated. Large experiments were conducted and it is illustrated that QGSO performs consistently to keep a better balance between exploration and exploitation, and evolves faster compared with the existing competitors.
{"title":"Glowworm swarm optimization algorithm with Quantum-behaved properties","authors":"Jiangshao Gu, Kunmei Wen","doi":"10.1109/ICNC.2014.6975874","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975874","url":null,"abstract":"Since the original Glowworm Swarm Optimization (GSO) contains the defects of being caught in local optima potentially and slow convergence rate, we analyze the superiority of quantum system and introduce this technique into the behavior of glowworms according to local conditions, to propose Quantum-behaved Glowworm Swarm Optimization (QGSO). By a series of improvements, the diversity of swarms is enhanced and the oscillation caused by constant step length is eliminated. Large experiments were conducted and it is illustrated that QGSO performs consistently to keep a better balance between exploration and exploitation, and evolves faster compared with the existing competitors.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128306988","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 : 2014-12-08DOI: 10.1109/ICNC.2014.6975915
Qingsheng Liu, Yushan Guo, Gaohuan Liu, Jun Zhao
Landsat acquires the longest space-based moderate-resolution land remote sensing images continuously. Compared with the other earlier Landsat satellites, Landsat 8 has several new characteristics in spectral bands, spectral range and radiometric resolution. Therefore, there is a strong requirement to analyze the characteristics of the Landsat 8 for land cover classification, global change research. In this paper, Landsat 8 OLI image was used with Support Vector Machine (SVM) and Tasseled Cap Transformation (TCT) for land cover classification. Firstly, the Top of Atmospheric (TOA) reflectance based TCT was developed based on Landsat 8 OLI images. Then comparison of ISODATA, K-Means and SVM of all original eight Landsat 8 OLI bands and both of TCT Greenness and Wetness in land use and land cover classification was done. The present results indicated that compared with using the original 8 Landsat 8 OLI bands, the classification results from ISODATA and K-Means based on both of TCT Greenness and Wetness had better robustness and accuracy, and the classification using SVM with TCT had better efficiency and accuracy.
{"title":"Classification of Landsat 8 OLI image using support vector machine with Tasseled Cap Transformation","authors":"Qingsheng Liu, Yushan Guo, Gaohuan Liu, Jun Zhao","doi":"10.1109/ICNC.2014.6975915","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975915","url":null,"abstract":"Landsat acquires the longest space-based moderate-resolution land remote sensing images continuously. Compared with the other earlier Landsat satellites, Landsat 8 has several new characteristics in spectral bands, spectral range and radiometric resolution. Therefore, there is a strong requirement to analyze the characteristics of the Landsat 8 for land cover classification, global change research. In this paper, Landsat 8 OLI image was used with Support Vector Machine (SVM) and Tasseled Cap Transformation (TCT) for land cover classification. Firstly, the Top of Atmospheric (TOA) reflectance based TCT was developed based on Landsat 8 OLI images. Then comparison of ISODATA, K-Means and SVM of all original eight Landsat 8 OLI bands and both of TCT Greenness and Wetness in land use and land cover classification was done. The present results indicated that compared with using the original 8 Landsat 8 OLI bands, the classification results from ISODATA and K-Means based on both of TCT Greenness and Wetness had better robustness and accuracy, and the classification using SVM with TCT had better efficiency and accuracy.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130297664","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 : 2014-12-08DOI: 10.1109/ICNC.2014.6975980
Yun-yun Du, Hong-yun Ning, Ping Yang, Yan-xia Cui
We begin with overviews of the existing defects of the current Kerberos protocol and the shortage of the current improvement, and then we focus on the new method of the dynamic password and public key. On the basis of the original Kerberos protocol, firstly, we propose the usage of the Diffie-Hellman algorithm, and put the password in the token, then take the key which has added the dynamic factor as the sharing key between Client and AS, this improvement can fundamentally solve the password guessing attack. Secondly, we use the method of the ElGamal algorithm. For one thing, it will generate a new public key in each authentication, and put the new public key as the secret key of the information transmission between client and resource server, this method basically guarantees security of the information transmission; For another we use the random number, which is associated with the public key, to take the place of the time-stamp to prevent replay attack, it puts the random number and our key together to increase the ability of preventing replay attack. Finally, we analyze the example of the improvement which has been carried out. And the results show that the improved Kerberos protocol can ensure the security of the information and password.
{"title":"Improvement of Kerberos protocol based on dynamic password and “One-time public key”","authors":"Yun-yun Du, Hong-yun Ning, Ping Yang, Yan-xia Cui","doi":"10.1109/ICNC.2014.6975980","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975980","url":null,"abstract":"We begin with overviews of the existing defects of the current Kerberos protocol and the shortage of the current improvement, and then we focus on the new method of the dynamic password and public key. On the basis of the original Kerberos protocol, firstly, we propose the usage of the Diffie-Hellman algorithm, and put the password in the token, then take the key which has added the dynamic factor as the sharing key between Client and AS, this improvement can fundamentally solve the password guessing attack. Secondly, we use the method of the ElGamal algorithm. For one thing, it will generate a new public key in each authentication, and put the new public key as the secret key of the information transmission between client and resource server, this method basically guarantees security of the information transmission; For another we use the random number, which is associated with the public key, to take the place of the time-stamp to prevent replay attack, it puts the random number and our key together to increase the ability of preventing replay attack. Finally, we analyze the example of the improvement which has been carried out. And the results show that the improved Kerberos protocol can ensure the security of the information and password.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129193581","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 : 2014-12-08DOI: 10.1109/ICNC.2014.6975817
Longlong Liu, Maojuan Liu, M. Ma
The purpose of analyzing gene network structure is to identify and understand some unknown related functions and the regulatory mechanisms at molecular level in organisms. Traditional model of the gene regulatory networks often lack an effective method of solving with gene expression profiling data because of high time and space complexity. In this study, a new model of gene regulatory network based on linear feedforward neural network is proposed. The new model combines the advantages of linear neural network including fast convergence, no existence of local minimum value, high precision and easy operation. It maps the linear neural network into complex network. Through statistics and comparison of network parameters, the differentially expressed genes related to the sample background can be identified. The numerical experiment in the latter part of the study verified the validity of the model.
{"title":"Construction of linear dynamic gene regulatory network based on feedforward neural network","authors":"Longlong Liu, Maojuan Liu, M. Ma","doi":"10.1109/ICNC.2014.6975817","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975817","url":null,"abstract":"The purpose of analyzing gene network structure is to identify and understand some unknown related functions and the regulatory mechanisms at molecular level in organisms. Traditional model of the gene regulatory networks often lack an effective method of solving with gene expression profiling data because of high time and space complexity. In this study, a new model of gene regulatory network based on linear feedforward neural network is proposed. The new model combines the advantages of linear neural network including fast convergence, no existence of local minimum value, high precision and easy operation. It maps the linear neural network into complex network. Through statistics and comparison of network parameters, the differentially expressed genes related to the sample background can be identified. The numerical experiment in the latter part of the study verified the validity of the model.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"2023 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114098662","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 : 2014-12-08DOI: 10.1109/ICNC.2014.6975924
Qingyu Zhai, D. Yuan, Haixia Zhang, K. Gao
To improve the searching performance to find better initial cluster centers and the calculating performance to process massive data in high dimensions, for PSO K-means, a brand new hybrid data clustering algorithm named Parallelization of OBL based PSO K-means Algorithm with the OpenCL Architecture (POPK) is introduced in this paper. In POPK, Opposition-based Learning (OBL) is applied to improve the global searching ability of Particle Swarm Optimization (PSO) in search of better initial centers of clusters for K-means while Open Computing Language (OpenCL) is introduced to parallelize the OBL-based PSO K-means and to enhance the calculating ability such that an obvious speed-up is obtained. Experimental results indicate that both effectiveness and efficiency of POPK is acceptably improved compared with standard PSO K-means.
{"title":"Parallelization of OBL based PSO K-means algorithm using OpenCL architecture","authors":"Qingyu Zhai, D. Yuan, Haixia Zhang, K. Gao","doi":"10.1109/ICNC.2014.6975924","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975924","url":null,"abstract":"To improve the searching performance to find better initial cluster centers and the calculating performance to process massive data in high dimensions, for PSO K-means, a brand new hybrid data clustering algorithm named Parallelization of OBL based PSO K-means Algorithm with the OpenCL Architecture (POPK) is introduced in this paper. In POPK, Opposition-based Learning (OBL) is applied to improve the global searching ability of Particle Swarm Optimization (PSO) in search of better initial centers of clusters for K-means while Open Computing Language (OpenCL) is introduced to parallelize the OBL-based PSO K-means and to enhance the calculating ability such that an obvious speed-up is obtained. Experimental results indicate that both effectiveness and efficiency of POPK is acceptably improved compared with standard PSO K-means.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114613576","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
扫码关注我们
求助内容：
应助结果提醒方式：