Pub Date : 2016-10-01DOI: 10.1109/COMPCOMM.2016.7925125
Jia-Lin He, Duanbing Chen, Chongjing Sun
Many complex networks display community structure—group of nodes within which connections are dense but between which they are sparser. A quantitative measure called modularity (Q) has been proposed to effectively assess the quality of community structure. Many community detection methods based on Q have been proposed. However, they have low accuracy or time consuming. In this paper, we suggest a fast simulated annealing method (FSA) to detect communities. An initial community partition is first obtained accord to similarity metric and then the FSA method is used to optimize the Q. Experimental results on real and synthetic networks show that compared with the existing simulated annealing method (SA), FSA method can not only maintain the quality of community but also improve the efficiency greatly.
{"title":"A fast simulated annealing strategy for community detection in complex networks","authors":"Jia-Lin He, Duanbing Chen, Chongjing Sun","doi":"10.1109/COMPCOMM.2016.7925125","DOIUrl":"https://doi.org/10.1109/COMPCOMM.2016.7925125","url":null,"abstract":"Many complex networks display community structure—group of nodes within which connections are dense but between which they are sparser. A quantitative measure called modularity (Q) has been proposed to effectively assess the quality of community structure. Many community detection methods based on Q have been proposed. However, they have low accuracy or time consuming. In this paper, we suggest a fast simulated annealing method (FSA) to detect communities. An initial community partition is first obtained accord to similarity metric and then the FSA method is used to optimize the Q. Experimental results on real and synthetic networks show that compared with the existing simulated annealing method (SA), FSA method can not only maintain the quality of community but also improve the efficiency greatly.","PeriodicalId":210833,"journal":{"name":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131605665","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-10-01DOI: 10.1109/COMPCOMM.2016.7924999
Gong Chen, Qiang Liu, Yunkai Wei, Qin Yu
This paper proposes an indoor location system in WLAN based on fingerprint Database Partition and Euclidean Distance-Weighted Pearson Correlation Coefficient which use a new method of partitioning the fingerprint database is PWNN(Nearest Neighbors based on Pearson correlation coefficient and Distance-weighted). This system includes three stages: offline data collection and pretreatment; Online positioning; Fixed positioning. The first stage partitions the fingerprint database in accordance with the maximum signal strength AP (Access Point) to improve the speed of matching. The second stage uses Pearson correlation coefficient to match the signal fingerprint and select the probability of the collection points, then applies NN algorithm and weighted Euclidean distance to estimate the position. The actual system test proves that the fusion algorithm can effectively improve positioning accuracy and greatly shorten positioning time. Thus, it is an effective and valid indoor positioning method.
{"title":"An efficient indoor location system in WLAN based on Database Partition and Euclidean Distance-Weighted Pearson Correlation Coefficient","authors":"Gong Chen, Qiang Liu, Yunkai Wei, Qin Yu","doi":"10.1109/COMPCOMM.2016.7924999","DOIUrl":"https://doi.org/10.1109/COMPCOMM.2016.7924999","url":null,"abstract":"This paper proposes an indoor location system in WLAN based on fingerprint Database Partition and Euclidean Distance-Weighted Pearson Correlation Coefficient which use a new method of partitioning the fingerprint database is PWNN(Nearest Neighbors based on Pearson correlation coefficient and Distance-weighted). This system includes three stages: offline data collection and pretreatment; Online positioning; Fixed positioning. The first stage partitions the fingerprint database in accordance with the maximum signal strength AP (Access Point) to improve the speed of matching. The second stage uses Pearson correlation coefficient to match the signal fingerprint and select the probability of the collection points, then applies NN algorithm and weighted Euclidean distance to estimate the position. The actual system test proves that the fusion algorithm can effectively improve positioning accuracy and greatly shorten positioning time. Thus, it is an effective and valid indoor positioning method.","PeriodicalId":210833,"journal":{"name":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132956614","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-10-01DOI: 10.1109/COMPCOMM.2016.7924750
Lin Zhecheng, He Xin, Xu Li
Laser welding robots usually adopt the method of “teach and playback”. Practically, if the weldment is placed inaccurately, it will have to be taught again. In order to solve this problem, we establish a high efficient system to revise welding trajectory automatically, which adopt improved SIFT algorithm to get the mapping relationship between standard weldments and on-line weldments. Firstly, we calibrate camera parameters based on planar constraint. Secondly, we adopt the improved SIFT algorithm to calculate the feature points, which can raise matching ratio and decrease the computing complexity. Next, we match key points of standard weldments and on-line weldments through kNN algorithm. Thirdly, we use the homography matrix to map the matched points from image coordinate to world coordinate so as to get affine matrix. Finally, we can achieve the goal of translating the welding trajectory between standard weldment and on-line weldment.
{"title":"A feature matching algorithm applied to welding trajectory revising","authors":"Lin Zhecheng, He Xin, Xu Li","doi":"10.1109/COMPCOMM.2016.7924750","DOIUrl":"https://doi.org/10.1109/COMPCOMM.2016.7924750","url":null,"abstract":"Laser welding robots usually adopt the method of “teach and playback”. Practically, if the weldment is placed inaccurately, it will have to be taught again. In order to solve this problem, we establish a high efficient system to revise welding trajectory automatically, which adopt improved SIFT algorithm to get the mapping relationship between standard weldments and on-line weldments. Firstly, we calibrate camera parameters based on planar constraint. Secondly, we adopt the improved SIFT algorithm to calculate the feature points, which can raise matching ratio and decrease the computing complexity. Next, we match key points of standard weldments and on-line weldments through kNN algorithm. Thirdly, we use the homography matrix to map the matched points from image coordinate to world coordinate so as to get affine matrix. Finally, we can achieve the goal of translating the welding trajectory between standard weldment and on-line weldment.","PeriodicalId":210833,"journal":{"name":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131078225","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-10-01DOI: 10.1109/COMPCOMM.2016.7924706
Jing Li, Yongbin Qin, Ruizhang Huang
Topic modeling has been widely used to mine topics. However, users' individual needs are seldom considered, which is against the trend that individuation becomes more and more important. In this work, we propose a user-oriented probabilistic topic model based on Latent Dirichlet Allocation. Interested and uninterested words are used as supervised information to take users' preferences into account. A self-learning algorithm increasing the quantity of supervised information effectively are also presented. As a semi-supervised model, data with or without supervised information attached are treated differently. In the parameters inference, we integrate the Pólya urn model into the Gibbs sampling process to utilize different kinds of supervised information efficiently. Experiments conducted on real datasets show the model outperforms the state-of-the-art models.
{"title":"A user-oriented semi-supervised probabilistic topic model","authors":"Jing Li, Yongbin Qin, Ruizhang Huang","doi":"10.1109/COMPCOMM.2016.7924706","DOIUrl":"https://doi.org/10.1109/COMPCOMM.2016.7924706","url":null,"abstract":"Topic modeling has been widely used to mine topics. However, users' individual needs are seldom considered, which is against the trend that individuation becomes more and more important. In this work, we propose a user-oriented probabilistic topic model based on Latent Dirichlet Allocation. Interested and uninterested words are used as supervised information to take users' preferences into account. A self-learning algorithm increasing the quantity of supervised information effectively are also presented. As a semi-supervised model, data with or without supervised information attached are treated differently. In the parameters inference, we integrate the Pólya urn model into the Gibbs sampling process to utilize different kinds of supervised information efficiently. Experiments conducted on real datasets show the model outperforms the state-of-the-art models.","PeriodicalId":210833,"journal":{"name":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130955887","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-10-01DOI: 10.1109/COMPCOMM.2016.7924657
Yuan Gao, Hong Ao, Quan Zhou, Weigui Zhou, Yi Li, Shaochi Cheng, Xiangyang Li
The 5th generation wireless communication system has become popular in recent industry and academic studies. The 5G wireless communication system has advantages in spectrum efficiency, energy efficiency, transmission speed, latency, etc. However, current key techniques could not satisfy the gradually increased service on-demand requirements. In this work, we summarize the utilization of physical layer, link layer, network layer and application layer (upper layer) using big data related technology, and propose the advantages and further possible advances in such areas. Big data technology will help the network to perform operations more precise and effectively, from historical data, environmental data, transmission and user behaviors, etc. Suggestions that how to make big data and 5G system together are concluded.
{"title":"Review of wireless big data in 5G: From physical layer to application layer","authors":"Yuan Gao, Hong Ao, Quan Zhou, Weigui Zhou, Yi Li, Shaochi Cheng, Xiangyang Li","doi":"10.1109/COMPCOMM.2016.7924657","DOIUrl":"https://doi.org/10.1109/COMPCOMM.2016.7924657","url":null,"abstract":"The 5th generation wireless communication system has become popular in recent industry and academic studies. The 5G wireless communication system has advantages in spectrum efficiency, energy efficiency, transmission speed, latency, etc. However, current key techniques could not satisfy the gradually increased service on-demand requirements. In this work, we summarize the utilization of physical layer, link layer, network layer and application layer (upper layer) using big data related technology, and propose the advantages and further possible advances in such areas. Big data technology will help the network to perform operations more precise and effectively, from historical data, environmental data, transmission and user behaviors, etc. Suggestions that how to make big data and 5G system together are concluded.","PeriodicalId":210833,"journal":{"name":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130964603","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-10-01DOI: 10.1109/COMPCOMM.2016.7924955
W. Jiang, Songhua Huang, Jing Zhao
With high-speed nodes, dynamic topology, insufficient wireless bandwidth and variable path quality, new IP based applications across intra-flight ad hoc networks are always blocked by the lack of availability assurance. After analyzing the topology model, protocol stack model of intra-flight ad hoc networks and Qos requirements, as well as challenges, this paper proposes a comprehensive model of QoS provision and the corresponding method of path optimization based on service classification for intra-flight ad hoc networks. The simulation results indicate that compared with OLSR, this method increases the volume of whole concurrent flows in current networks while satisfying the bandwidth and delay required.
{"title":"Research on QoS optimization for intra-flight ad hoc networks","authors":"W. Jiang, Songhua Huang, Jing Zhao","doi":"10.1109/COMPCOMM.2016.7924955","DOIUrl":"https://doi.org/10.1109/COMPCOMM.2016.7924955","url":null,"abstract":"With high-speed nodes, dynamic topology, insufficient wireless bandwidth and variable path quality, new IP based applications across intra-flight ad hoc networks are always blocked by the lack of availability assurance. After analyzing the topology model, protocol stack model of intra-flight ad hoc networks and Qos requirements, as well as challenges, this paper proposes a comprehensive model of QoS provision and the corresponding method of path optimization based on service classification for intra-flight ad hoc networks. The simulation results indicate that compared with OLSR, this method increases the volume of whole concurrent flows in current networks while satisfying the bandwidth and delay required.","PeriodicalId":210833,"journal":{"name":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133507645","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-10-01DOI: 10.1109/COMPCOMM.2016.7925230
Hongjian Li, Yuyan Zhao, Guofeng Zhu, Y. Dou, G. Lo
In dynamic environments, dynamic load balancing plays an important role in improving the performance of large-scale parallel computer systems. It can reduce the response time of the calculations and maximize the resources utilization of system. To improve the parallel efficiency in dynamic systems, a dynamic load balancing method with a prediction and dynamic time step feedback was developed. The feedback is varied dynamically by using a time step and processing capability prediction algorithm combined with a dynamic programming algorithm for task redistribution. Apply this method in ab initio molecular dynamics simulation, this algorithm showed significantly better adaptability and scalability compared to one that employs a static time step feedback.
{"title":"A load balancing method based on dynamic time step feedback","authors":"Hongjian Li, Yuyan Zhao, Guofeng Zhu, Y. Dou, G. Lo","doi":"10.1109/COMPCOMM.2016.7925230","DOIUrl":"https://doi.org/10.1109/COMPCOMM.2016.7925230","url":null,"abstract":"In dynamic environments, dynamic load balancing plays an important role in improving the performance of large-scale parallel computer systems. It can reduce the response time of the calculations and maximize the resources utilization of system. To improve the parallel efficiency in dynamic systems, a dynamic load balancing method with a prediction and dynamic time step feedback was developed. The feedback is varied dynamically by using a time step and processing capability prediction algorithm combined with a dynamic programming algorithm for task redistribution. Apply this method in ab initio molecular dynamics simulation, this algorithm showed significantly better adaptability and scalability compared to one that employs a static time step feedback.","PeriodicalId":210833,"journal":{"name":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132673763","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-10-01DOI: 10.1109/COMPCOMM.2016.7924977
Jihong Yan, Yuqing Ma, Zishu He
Digital array radar (DAR) is an important tendency of phased array radar (PAR). Since the DAR is equipped with many transmitting and receiving channels, the effectiveness of digital beam-forming (DBF) is affected by the channel performance. Thus, it is important to test the channel performance and calibrate the possible channel mismatch of each digital T/R modules before assembling. In this paper, a CPCI interface based on the channel performance measurement is introduced. In the hardware design of the system, FPGA is employed as a core for data accusation and storage through optical interface. The CPCI chip is used as the interface between the data acquisition board and PC. Under the control of computer application programs, the collected data are transferred back to the computer, in which the waveform analysis in both time and frequency domain and the calculation of the channel performance metrics are performed. The test results show the effectiveness and feasibility of the proposed design method.
{"title":"Digital array receiving channel performance measurement system","authors":"Jihong Yan, Yuqing Ma, Zishu He","doi":"10.1109/COMPCOMM.2016.7924977","DOIUrl":"https://doi.org/10.1109/COMPCOMM.2016.7924977","url":null,"abstract":"Digital array radar (DAR) is an important tendency of phased array radar (PAR). Since the DAR is equipped with many transmitting and receiving channels, the effectiveness of digital beam-forming (DBF) is affected by the channel performance. Thus, it is important to test the channel performance and calibrate the possible channel mismatch of each digital T/R modules before assembling. In this paper, a CPCI interface based on the channel performance measurement is introduced. In the hardware design of the system, FPGA is employed as a core for data accusation and storage through optical interface. The CPCI chip is used as the interface between the data acquisition board and PC. Under the control of computer application programs, the collected data are transferred back to the computer, in which the waveform analysis in both time and frequency domain and the calculation of the channel performance metrics are performed. The test results show the effectiveness and feasibility of the proposed design method.","PeriodicalId":210833,"journal":{"name":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131265606","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-10-01DOI: 10.1109/COMPCOMM.2016.7924756
Zhengzheng Liu, Nan Yang, Sanxing Cao
With the rapid development of big data technology, the application of online micro video has been improved greatly. This paper provides a method of analyzing the sentiment of the review text for online micro video. By crawling, processing and analyzing of review text based on more than 20 domestic Internet video platforms, finally we get the sentimental value of each micro video by comprehensive evaluation. The algorithm is mainly contrast positive words and negative words contained in the text by the number, with the proportion of degree adverbs in the positive and negative evaluation and the degree value, finally come to sentiment value. The algorithm of sentiment-analysis described in this paper which based on the sentimental dictionary is proved to be effective.
{"title":"Sentiment-analysis of review text for micro-video","authors":"Zhengzheng Liu, Nan Yang, Sanxing Cao","doi":"10.1109/COMPCOMM.2016.7924756","DOIUrl":"https://doi.org/10.1109/COMPCOMM.2016.7924756","url":null,"abstract":"With the rapid development of big data technology, the application of online micro video has been improved greatly. This paper provides a method of analyzing the sentiment of the review text for online micro video. By crawling, processing and analyzing of review text based on more than 20 domestic Internet video platforms, finally we get the sentimental value of each micro video by comprehensive evaluation. The algorithm is mainly contrast positive words and negative words contained in the text by the number, with the proportion of degree adverbs in the positive and negative evaluation and the degree value, finally come to sentiment value. The algorithm of sentiment-analysis described in this paper which based on the sentimental dictionary is proved to be effective.","PeriodicalId":210833,"journal":{"name":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124233829","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-10-01DOI: 10.1109/COMPCOMM.2016.7925194
Haitao Hu, Hongyan Wang
In recent years, cloud computing has gained more and more attention. Task and resource scheduling becomes one of the key problems in cloud computing. This paper refers to a new prediction-based algorithm based on Ant Colony Optimization which combines the available computing resources (referred as Virtual Machines, VMs) with arriving jobs with various Quality of Service constraints (QoS, defined by users). The traditional Ant Colony Optimization algorithms usually contain properties of computing resources but without taking users' constraints into consideration and ignore the heterogeneity of cloud resources. Therefore, an algorithm in this paper is proposed which classifies the jobs into two species. And then users' QoS constraints are sorted as well as computing resources according to their computing capabilities. This paper aims at proposing an ant colony optimization (ACO) algorithm to schedule jobs with various QoS parameters on VMs with different resource parameters. Experiment results show that the proposed prediction-based algorithm outperforms the ACO algorithm to some extent in finding the best dispatch of tasks to VMs.
{"title":"A prediction-based ACO algorithm to dynamic tasks scheduling in cloud environment","authors":"Haitao Hu, Hongyan Wang","doi":"10.1109/COMPCOMM.2016.7925194","DOIUrl":"https://doi.org/10.1109/COMPCOMM.2016.7925194","url":null,"abstract":"In recent years, cloud computing has gained more and more attention. Task and resource scheduling becomes one of the key problems in cloud computing. This paper refers to a new prediction-based algorithm based on Ant Colony Optimization which combines the available computing resources (referred as Virtual Machines, VMs) with arriving jobs with various Quality of Service constraints (QoS, defined by users). The traditional Ant Colony Optimization algorithms usually contain properties of computing resources but without taking users' constraints into consideration and ignore the heterogeneity of cloud resources. Therefore, an algorithm in this paper is proposed which classifies the jobs into two species. And then users' QoS constraints are sorted as well as computing resources according to their computing capabilities. This paper aims at proposing an ant colony optimization (ACO) algorithm to schedule jobs with various QoS parameters on VMs with different resource parameters. Experiment results show that the proposed prediction-based algorithm outperforms the ACO algorithm to some extent in finding the best dispatch of tasks to VMs.","PeriodicalId":210833,"journal":{"name":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124414019","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
扫码关注我们
求助内容：
应助结果提醒方式：