Pub Date : 2014-12-08DOI: 10.1109/ICNC.2014.6975981
Diao Hailun, Wang Shuyi, Zhang Guorui
As a newly popularized online social network, micro-blog has been facilitating numerous social interactions and communications in our daily life. Websites serving as micro-blog share certain characteristics of scale-free network with a fractal dimension macroscopically, and a faster spread of information has emerged by the hand of the least entropy generation principle through this complex system. False information, however, has impacted this new form of media to a noticeable extent. This paper is thus dedicated to finding the best way to discern false information amid the classical methods, a directed scale-free network is realized, whence a Micro-blog Central False information Discerning Model (MCFDM) including six different combinations of three user levels is proposed. After analyzing the outputs from Multi-Agent simulations on NetLogo, a constructive assessment of various methods will be conclusively rendered.
{"title":"Multi-agent based research of centralized false information discerning model of micro-blog network","authors":"Diao Hailun, Wang Shuyi, Zhang Guorui","doi":"10.1109/ICNC.2014.6975981","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975981","url":null,"abstract":"As a newly popularized online social network, micro-blog has been facilitating numerous social interactions and communications in our daily life. Websites serving as micro-blog share certain characteristics of scale-free network with a fractal dimension macroscopically, and a faster spread of information has emerged by the hand of the least entropy generation principle through this complex system. False information, however, has impacted this new form of media to a noticeable extent. This paper is thus dedicated to finding the best way to discern false information amid the classical methods, a directed scale-free network is realized, whence a Micro-blog Central False information Discerning Model (MCFDM) including six different combinations of three user levels is proposed. After analyzing the outputs from Multi-Agent simulations on NetLogo, a constructive assessment of various methods will be conclusively rendered.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"516 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":"116229367","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.6975804
Yan He, Jue Wang
Frequency component is critical for the brain to execute cognitive function by way of and cooperation of electrical signals. Complex network could visualize the neural system quantitatively and objectively based on graph theory. In this paper, we would focus on the study of broadband electroencephalogram recordings and combine phase locking value with resilience test to uncover frequency dependent network flexibility in the epileptic brain network. Phase locking value is efficient in detecting phase relationships in narrow band EEG waves by incorporating wavelet transform. Resilience test plays a role in the evaluating network's fragility by eliminating single node and its links randomly as well as in order. These methods are then applied on EEG signals recorded from the brain of human beings with four kinds of epilepsy disease. Results demonstrated that hierarchical order of network characteristic metrics are different in distinctive types of epilepsy disease; besides, the network's resilience are frequency sensitive in these pathological brain networks. Frequency dependent information transition and integration could be uncovered by these tools. Further research should pay attention to the evolution principle of these frequency reliance brain network, thereby promoting underlying working mechanism of these EEG signals in the brain.
{"title":"Frequency dependent network flexibility analysis in epileptic brain based on phase locking value and resilience test: Analysis of frequency dependent information integration based on complex network","authors":"Yan He, Jue Wang","doi":"10.1109/ICNC.2014.6975804","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975804","url":null,"abstract":"Frequency component is critical for the brain to execute cognitive function by way of and cooperation of electrical signals. Complex network could visualize the neural system quantitatively and objectively based on graph theory. In this paper, we would focus on the study of broadband electroencephalogram recordings and combine phase locking value with resilience test to uncover frequency dependent network flexibility in the epileptic brain network. Phase locking value is efficient in detecting phase relationships in narrow band EEG waves by incorporating wavelet transform. Resilience test plays a role in the evaluating network's fragility by eliminating single node and its links randomly as well as in order. These methods are then applied on EEG signals recorded from the brain of human beings with four kinds of epilepsy disease. Results demonstrated that hierarchical order of network characteristic metrics are different in distinctive types of epilepsy disease; besides, the network's resilience are frequency sensitive in these pathological brain networks. Frequency dependent information transition and integration could be uncovered by these tools. Further research should pay attention to the evolution principle of these frequency reliance brain network, thereby promoting underlying working mechanism of these EEG signals in the brain.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"23 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":"116582654","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.6975997
Jianxing Zhang, Qin Yang, Xianhai Meng, Jigang Li
The Residual Move Out (RMO) provides crucial information for updating velocity model in Pre-stack tomography. The accuracy and precision of picking result significantly determine the efficiency of the scheme. Two methods are produced respectively to warrant the requirements. The first method, namely energy spectrum based method, is conducted in a fully automatic way to ensure tomographic efficiency, and is very adapted to implement at the early iterative process of the tomography. The other method, which acts as a semi-automatic pickup based on the estimation of fourth-order cumulants, is executed to guarantee the accuracy for the late tomographic iterations. Practical applications witness the good effect of the two introduced approaches.
{"title":"Automatic RMO picking in seismic travel time tomography","authors":"Jianxing Zhang, Qin Yang, Xianhai Meng, Jigang Li","doi":"10.1109/ICNC.2014.6975997","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975997","url":null,"abstract":"The Residual Move Out (RMO) provides crucial information for updating velocity model in Pre-stack tomography. The accuracy and precision of picking result significantly determine the efficiency of the scheme. Two methods are produced respectively to warrant the requirements. The first method, namely energy spectrum based method, is conducted in a fully automatic way to ensure tomographic efficiency, and is very adapted to implement at the early iterative process of the tomography. The other method, which acts as a semi-automatic pickup based on the estimation of fourth-order cumulants, is executed to guarantee the accuracy for the late tomographic iterations. Practical applications witness the good effect of the two introduced approaches.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"25 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":"121728472","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.6975965
Xiaoyan Qian, Lei Han
This paper proposes a new fast dehazing method based on multiple filtering methods. We firstly estimate an initial airlight map through its characteristics, then refine it by bilateral filter and guided filter to generate a new one which removes the abundant texture information and recovers the depth edge information. And, the correct atmosphere light is generated by a hierarchical searching method based on the quad-tree subdivision. Finally, the scene radiance is produced by the atmosphere attenuation model. Comparing experiments show that the proposed algorithm can get a good dehazing effect and is sufficiently fast for realtime applications.
{"title":"Fast image dehazing algorithm based on multiple filters","authors":"Xiaoyan Qian, Lei Han","doi":"10.1109/ICNC.2014.6975965","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975965","url":null,"abstract":"This paper proposes a new fast dehazing method based on multiple filtering methods. We firstly estimate an initial airlight map through its characteristics, then refine it by bilateral filter and guided filter to generate a new one which removes the abundant texture information and recovers the depth edge information. And, the correct atmosphere light is generated by a hierarchical searching method based on the quad-tree subdivision. Finally, the scene radiance is produced by the atmosphere attenuation model. Comparing experiments show that the proposed algorithm can get a good dehazing effect and is sufficiently fast for realtime applications.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"8 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":"122520247","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.6975881
Meiyi Li, Rong Lv
There are many Contradictory Weak-Constrained Optimization Problems (CWCOPs) in the application fields, but rarely researched. One key of solving CWCOPs is finding the Best Weak-Constraints (BWCs), so the Binary Algorithm for finding the BWCs (BWCs-BA) in CWCOPs was proposed. BWCs-BA first determines the number of weak-constraints in BWCs, then uses the number for solving the BWCs. Because the general constrained optimization test functions have no weak-constraint, one 2-D and five n-D (based on 24 well-known benchmark test functions) test functions of CWCOPs were constructed, and the performance of BWCs-BA is tested on them. The experimental results show, compared with some other existing methods, the BWCs-BA reduces the test times while finding all of the BWCs.
{"title":"The Binary Algorithm for finding the best weak-constraints in contradictory weak-constrained optimization problems","authors":"Meiyi Li, Rong Lv","doi":"10.1109/ICNC.2014.6975881","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975881","url":null,"abstract":"There are many Contradictory Weak-Constrained Optimization Problems (CWCOPs) in the application fields, but rarely researched. One key of solving CWCOPs is finding the Best Weak-Constraints (BWCs), so the Binary Algorithm for finding the BWCs (BWCs-BA) in CWCOPs was proposed. BWCs-BA first determines the number of weak-constraints in BWCs, then uses the number for solving the BWCs. Because the general constrained optimization test functions have no weak-constraint, one 2-D and five n-D (based on 24 well-known benchmark test functions) test functions of CWCOPs were constructed, and the performance of BWCs-BA is tested on them. The experimental results show, compared with some other existing methods, the BWCs-BA reduces the test times while finding all of the BWCs.","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":"131217644","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.6975803
Ru Wang, Y. Wang, Chengxu Ye, Dongsheng Guo, Yunong Zhang
A novel concept, uniqueness logic represented via decimal numbers (UL-D), is proposed and defined in this paper. Aiming at achieving the UL-D, we construct a neural network (i.e., NN) based on weights-and-structure-determination algorithm (i.e., the resultant WASD-NN). Differing from the back-propagation neural network (BP-NN) adjusting weights by lengthy iterative process and being unable to acquire the optimal structure adaptively, the WASD-NN can determine the optimal weights directly and the optimal structure automatically. Note that the UL-D is a nonlinear discontinuous mapping, of which the approximation has rarely been investigated before. In this paper, we firstly investigate the WASD-NN activated by commonly used continuous power functions, with corresponding numerical experiment results less satisfactory. By understanding the nature of the UL-D, the WASD-NN activated by discontinuous signum function is thus creatively built up, and the numerical experiment studies demonstrate well the efficient and superior approximating ability of the signum-function activated WASD-NN in achieving the UL-D.
{"title":"Uniqueness logic represented via decimal numbers with WASD neural network","authors":"Ru Wang, Y. Wang, Chengxu Ye, Dongsheng Guo, Yunong Zhang","doi":"10.1109/ICNC.2014.6975803","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975803","url":null,"abstract":"A novel concept, uniqueness logic represented via decimal numbers (UL-D), is proposed and defined in this paper. Aiming at achieving the UL-D, we construct a neural network (i.e., NN) based on weights-and-structure-determination algorithm (i.e., the resultant WASD-NN). Differing from the back-propagation neural network (BP-NN) adjusting weights by lengthy iterative process and being unable to acquire the optimal structure adaptively, the WASD-NN can determine the optimal weights directly and the optimal structure automatically. Note that the UL-D is a nonlinear discontinuous mapping, of which the approximation has rarely been investigated before. In this paper, we firstly investigate the WASD-NN activated by commonly used continuous power functions, with corresponding numerical experiment results less satisfactory. By understanding the nature of the UL-D, the WASD-NN activated by discontinuous signum function is thus creatively built up, and the numerical experiment studies demonstrate well the efficient and superior approximating ability of the signum-function activated WASD-NN in achieving the UL-D.","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":"131522122","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.6975970
N. Nguyen, Dong-Min Woo, Seungwoo Kim, Minkee Park
Terrain segmentation is still a challenging issue in pattern recognition, especially in the application of high resolution satellite images. Among the various segmentation approaches are those based on graph partitioning, which present some drawbacks such as high processing time, low accuracy on detection of targets on the large scaled images such as high resolution satellite images. In this paper, we focus on the computational intelligence approach to classify and detect building, foliage, grass, bare-ground, and road of land cover. We propose a method, which has a high accuracy on classification and object detection by using multi-class AdaBoost algorithm based on a combination of two extracted features, which are cooccurrence and Haar-like features. With all features, multi-class Adaboost selects only critical features and performs as an extremely efficient classifier. Experimental results show that the classification accuracy is over 91% with a high resolution satellite image.
{"title":"Terrain segmentation of high resolution satellite images using multi-class AdaBoost algorithm","authors":"N. Nguyen, Dong-Min Woo, Seungwoo Kim, Minkee Park","doi":"10.1109/ICNC.2014.6975970","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975970","url":null,"abstract":"Terrain segmentation is still a challenging issue in pattern recognition, especially in the application of high resolution satellite images. Among the various segmentation approaches are those based on graph partitioning, which present some drawbacks such as high processing time, low accuracy on detection of targets on the large scaled images such as high resolution satellite images. In this paper, we focus on the computational intelligence approach to classify and detect building, foliage, grass, bare-ground, and road of land cover. We propose a method, which has a high accuracy on classification and object detection by using multi-class AdaBoost algorithm based on a combination of two extracted features, which are cooccurrence and Haar-like features. With all features, multi-class Adaboost selects only critical features and performs as an extremely efficient classifier. Experimental results show that the classification accuracy is over 91% with a high resolution satellite image.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"53 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":"128004074","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.6975966
Shuqun Zhang, Jianyang Zhou
3D information processing based on digital holography has been suffered from the problems of low-resolution image sensor that could undersample holographic images and small size of image sensor that limits the achievable reconstruction resolution. The existing solutions to these problems employ iterative algorithms to enhance the resolution of holographic images and increase effective size of image sensor, which are computationally expensive. This paper proposes to use fast noniterative multiframe image reconstruction technique for increasing the spatial resolution of digital holograms by combining multiple shifted low-resolution holographic images. The proposed method enhances the resolution with low computational cost and improves the reconstruction performance. Image stitching is also proposed to increase the effective size of image sensor and enhance the achievable resolution during reconstruction. Simulation results are presented to demonstrate the effectiveness of the proposed methods.
{"title":"Image resolution enhancement in digital holography","authors":"Shuqun Zhang, Jianyang Zhou","doi":"10.1109/ICNC.2014.6975966","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975966","url":null,"abstract":"3D information processing based on digital holography has been suffered from the problems of low-resolution image sensor that could undersample holographic images and small size of image sensor that limits the achievable reconstruction resolution. The existing solutions to these problems employ iterative algorithms to enhance the resolution of holographic images and increase effective size of image sensor, which are computationally expensive. This paper proposes to use fast noniterative multiframe image reconstruction technique for increasing the spatial resolution of digital holograms by combining multiple shifted low-resolution holographic images. The proposed method enhances the resolution with low computational cost and improves the reconstruction performance. Image stitching is also proposed to increase the effective size of image sensor and enhance the achievable resolution during reconstruction. Simulation results are presented to demonstrate the effectiveness of the proposed methods.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"86 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":"132714096","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.6975983
Kang Wang, Yonghui Hu, Jian-Feng Wu, Dang-Li Zhao
With the development of 3G/LTE, the high precise time synchronization application used the IEEE1588v2 standard become a great demand in telecommunication. This paper firstly introduces the principle and architecture of IEEE1588v2 and the structure of Optical Transport Network (OTN). According the characters of OTN, The platform used the timing clock module is designed and analysis. Finally the practical test is made and the results show the time synchronization accuracies can reach nanosecond range.
{"title":"Research on application of IEEE1588v2 in optical transport network","authors":"Kang Wang, Yonghui Hu, Jian-Feng Wu, Dang-Li Zhao","doi":"10.1109/ICNC.2014.6975983","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975983","url":null,"abstract":"With the development of 3G/LTE, the high precise time synchronization application used the IEEE1588v2 standard become a great demand in telecommunication. This paper firstly introduces the principle and architecture of IEEE1588v2 and the structure of Optical Transport Network (OTN). According the characters of OTN, The platform used the timing clock module is designed and analysis. Finally the practical test is made and the results show the time synchronization accuracies can reach nanosecond range.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"2016 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":"133229860","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}
In the multiple protocol label-switched (MPLS) networks, the commodities (packets) are transmitted by the label-switched paths (LSPs). For the sake of reducing the total cost and strengthening the central management, the MPLS networks restrict the number of paths that a commodity can use. For maintaining the quality of service (QoS) of the users, the demand of each commodity must be satisfied. Under the above conditions, some links of the network may be too much loaded, which affecting the performance of the whole network drastically. For this problem, we first establish two mathematical models, namely the arc-path and arc-flow model. Second, we design a heuristic algorithm which quickly finds paths for each commodity, and then allocate demands for them. In the last, the computational results are tested on a set of medium-sized instances to show the effectiveness of our approach.
{"title":"The k-splittable flow model and a heuristic algorithm for minimizing congestion in the MPLS networks","authors":"Chengwen Jiao, Wenguo Yang, Suixiang Gao, Yinben Xia, Mingming Zhu","doi":"10.1109/ICNC.2014.6975985","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975985","url":null,"abstract":"In the multiple protocol label-switched (MPLS) networks, the commodities (packets) are transmitted by the label-switched paths (LSPs). For the sake of reducing the total cost and strengthening the central management, the MPLS networks restrict the number of paths that a commodity can use. For maintaining the quality of service (QoS) of the users, the demand of each commodity must be satisfied. Under the above conditions, some links of the network may be too much loaded, which affecting the performance of the whole network drastically. For this problem, we first establish two mathematical models, namely the arc-path and arc-flow model. Second, we design a heuristic algorithm which quickly finds paths for each commodity, and then allocate demands for them. In the last, the computational results are tested on a set of medium-sized instances to show the effectiveness of our approach.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"57 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":"133904589","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
扫码关注我们
求助内容：
应助结果提醒方式：