Pub Date : 2020-11-01DOI: 10.1109/CIS52066.2020.00016
Yijian Zhang, Zhou Yuan, Jianwei Yang
Recently, several fractional-order orthogonal moments have been proposed. But functions used for the construction of these moments are restricted to fractional-order polynomials. In this paper, orthogonal moments are further generalized to generalized orthogonal moments (GOMs). A general framework is proposed for the construction of functions used in GOMs. Orthogonal polynomials used in traditional orthogonal moments and fractional-order polynomials used in fractional-order orthogonal moments are all special cases of the proposed framework. Properties of the proposed GOMs have been proven. New set of orthogonal moments have also been constructed by choosing several particular functions. Experimental results show the superiority of these moments.
{"title":"Generalized orthogonal moment","authors":"Yijian Zhang, Zhou Yuan, Jianwei Yang","doi":"10.1109/CIS52066.2020.00016","DOIUrl":"https://doi.org/10.1109/CIS52066.2020.00016","url":null,"abstract":"Recently, several fractional-order orthogonal moments have been proposed. But functions used for the construction of these moments are restricted to fractional-order polynomials. In this paper, orthogonal moments are further generalized to generalized orthogonal moments (GOMs). A general framework is proposed for the construction of functions used in GOMs. Orthogonal polynomials used in traditional orthogonal moments and fractional-order polynomials used in fractional-order orthogonal moments are all special cases of the proposed framework. Properties of the proposed GOMs have been proven. New set of orthogonal moments have also been constructed by choosing several particular functions. Experimental results show the superiority of these moments.","PeriodicalId":106959,"journal":{"name":"2020 16th International Conference on Computational Intelligence and Security (CIS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123371389","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}
Integrated with various electronic control units (ECUs), vehicles are becoming more intelligent with the assistance of essential connections. However, the interaction with the outside world raises great concerns on cyber-attacks. As a main standard for in-vehicle network, Controller Area Network (CAN) does not have any built-in security mechanisms to guarantee a secure communication. This increases risks of denial of service, remote control attacks by an attacker, posing serious threats to underlying vehicles, property and human lives. As a result, it is urgent to develop an effective in-vehicle network intrusion detection system (IDS) for better security. In this paper, we propose a Feature-based Sliding Window (FSW) to extract the feature of CAN Data Field and CAN IDs. Then we construct a convolutional encoder network (CEN) to detect network intrusion of CAN networks. The proposed FSW-CEN method is evaluated on real-world datasets. The experimental results show that compared to traditional data processing methods and convolutional neural networks, our method is able to detect attacks with a higher accuracy in terms of detection accuracy and false negative rate.
{"title":"A Convolutional Encoder Network for Intrusion Detection in Controller Area Networks","authors":"Xing Zhang, Xiaotong Cui, Kefei Cheng, Liang Zhang","doi":"10.1109/CIS52066.2020.00084","DOIUrl":"https://doi.org/10.1109/CIS52066.2020.00084","url":null,"abstract":"Integrated with various electronic control units (ECUs), vehicles are becoming more intelligent with the assistance of essential connections. However, the interaction with the outside world raises great concerns on cyber-attacks. As a main standard for in-vehicle network, Controller Area Network (CAN) does not have any built-in security mechanisms to guarantee a secure communication. This increases risks of denial of service, remote control attacks by an attacker, posing serious threats to underlying vehicles, property and human lives. As a result, it is urgent to develop an effective in-vehicle network intrusion detection system (IDS) for better security. In this paper, we propose a Feature-based Sliding Window (FSW) to extract the feature of CAN Data Field and CAN IDs. Then we construct a convolutional encoder network (CEN) to detect network intrusion of CAN networks. The proposed FSW-CEN method is evaluated on real-world datasets. The experimental results show that compared to traditional data processing methods and convolutional neural networks, our method is able to detect attacks with a higher accuracy in terms of detection accuracy and false negative rate.","PeriodicalId":106959,"journal":{"name":"2020 16th International Conference on Computational Intelligence and Security (CIS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123141084","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 : 2020-11-01DOI: 10.1109/CIS52066.2020.00051
Kai Li, Chang Liu, Yang Hu, Changshuan Wang, Wei Peng, Qiang Gao, Yun Zhang, Tongsheng Shu, Wensheng Wang, Chengwen Lei, Lin Liu, Junfeng Chen
Aiming at the problem that the gates of old reservoirs cannot be lifted normally, a gate energy concentrating cutting device was designed, which mainly studied the structure design of the cutting device, the structure design of the charge cover, the selection of the charge, the structure design of the detonation device, and the fixing method. The linear energy concentrating cutting technology is applied to the accident treatment after the reservoir gate is stuck, and realizes the rapid opening of the reservoir gate. The water outside the gate is diverted by the diversion tunnel so that the water pressure inside and outside the gate is balanced, and the stuck gate can be lifted smoothly. This technology can effectively solve the problem that the gates of old reservoirs cannot be lifted normally, and greatly reduce the construction difficulty and construction period. Through the ground cutting simulation test, it is verified that the designed energy concentrating cutting device can be reliably fixed on the gate steel plate, and its operation is simple and the construction is safe.
{"title":"Energy Accumulating Cutting Technology in Steel Plate Cutting of Reservoir Gate","authors":"Kai Li, Chang Liu, Yang Hu, Changshuan Wang, Wei Peng, Qiang Gao, Yun Zhang, Tongsheng Shu, Wensheng Wang, Chengwen Lei, Lin Liu, Junfeng Chen","doi":"10.1109/CIS52066.2020.00051","DOIUrl":"https://doi.org/10.1109/CIS52066.2020.00051","url":null,"abstract":"Aiming at the problem that the gates of old reservoirs cannot be lifted normally, a gate energy concentrating cutting device was designed, which mainly studied the structure design of the cutting device, the structure design of the charge cover, the selection of the charge, the structure design of the detonation device, and the fixing method. The linear energy concentrating cutting technology is applied to the accident treatment after the reservoir gate is stuck, and realizes the rapid opening of the reservoir gate. The water outside the gate is diverted by the diversion tunnel so that the water pressure inside and outside the gate is balanced, and the stuck gate can be lifted smoothly. This technology can effectively solve the problem that the gates of old reservoirs cannot be lifted normally, and greatly reduce the construction difficulty and construction period. Through the ground cutting simulation test, it is verified that the designed energy concentrating cutting device can be reliably fixed on the gate steel plate, and its operation is simple and the construction is safe.","PeriodicalId":106959,"journal":{"name":"2020 16th International Conference on Computational Intelligence and Security (CIS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116743055","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 : 2020-11-01DOI: 10.1109/CIS52066.2020.00035
Yalin Chen, Zhijun Li, Bin Dong, Shuangyang Zuo
using sliding mode control and genetic algorithms, in this paper, a new optimal active control strategy is presented for truss bridge structure installed with giant magnetostrictive material actuators (GMMAs). The precise location information of GMMAs is determined using genetic algorithm, an active sliding control law is proposed based on the Lyapunov function method, and the real control force is provided by the GMMA via input current. A 32m span steel truss bridge structure subjected to El Centro earthquake record is provided to testify the effectiveness of the proposed control strategy. Simulation results show that (a) the GMMA is an effective vibration absorber and (b) the optimal active control strategy presented in the paper is feasible and effective for the reduction of vibration response quantities of the truss bridge structure subjected to ground motion.
{"title":"Sliding Mode Control of Truss Bridge Structure with GMMAs","authors":"Yalin Chen, Zhijun Li, Bin Dong, Shuangyang Zuo","doi":"10.1109/CIS52066.2020.00035","DOIUrl":"https://doi.org/10.1109/CIS52066.2020.00035","url":null,"abstract":"using sliding mode control and genetic algorithms, in this paper, a new optimal active control strategy is presented for truss bridge structure installed with giant magnetostrictive material actuators (GMMAs). The precise location information of GMMAs is determined using genetic algorithm, an active sliding control law is proposed based on the Lyapunov function method, and the real control force is provided by the GMMA via input current. A 32m span steel truss bridge structure subjected to El Centro earthquake record is provided to testify the effectiveness of the proposed control strategy. Simulation results show that (a) the GMMA is an effective vibration absorber and (b) the optimal active control strategy presented in the paper is feasible and effective for the reduction of vibration response quantities of the truss bridge structure subjected to ground motion.","PeriodicalId":106959,"journal":{"name":"2020 16th International Conference on Computational Intelligence and Security (CIS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122263295","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 : 2020-11-01DOI: 10.1109/CIS52066.2020.00086
Yang Chen, Xiaoyong Li
Domain Name System (DNS) is a key protocol and service used on the Internet. It is responsible for converting domain names into IP addresses. DNS tunnel is a method of encoding data of other programs or protocols in DNS query and response. Previous studies usually need to extract a large number of features manually and train the classifier of DNS tunnel detection by feature engineering. In this paper, a new framework for DNS tunnel detection is proposed, which can automatically extract features, including long short-term memory (LSTM) language model with attention mechanism and gated recurrent unit (GRU) language model with attention mechanism. Finally, a single-level classifier based on a character-level convolutional neural network (Char-CNN) is proposed. The results show that the LSTM and GRU language models based on attention mechanism and the algorithm of character-level convolution neural network achieve high accuracy and near-zero false positives.
{"title":"A High Accuracy DNS Tunnel Detection Method Without Feature Engineering","authors":"Yang Chen, Xiaoyong Li","doi":"10.1109/CIS52066.2020.00086","DOIUrl":"https://doi.org/10.1109/CIS52066.2020.00086","url":null,"abstract":"Domain Name System (DNS) is a key protocol and service used on the Internet. It is responsible for converting domain names into IP addresses. DNS tunnel is a method of encoding data of other programs or protocols in DNS query and response. Previous studies usually need to extract a large number of features manually and train the classifier of DNS tunnel detection by feature engineering. In this paper, a new framework for DNS tunnel detection is proposed, which can automatically extract features, including long short-term memory (LSTM) language model with attention mechanism and gated recurrent unit (GRU) language model with attention mechanism. Finally, a single-level classifier based on a character-level convolutional neural network (Char-CNN) is proposed. The results show that the LSTM and GRU language models based on attention mechanism and the algorithm of character-level convolution neural network achieve high accuracy and near-zero false positives.","PeriodicalId":106959,"journal":{"name":"2020 16th International Conference on Computational Intelligence and Security (CIS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129023697","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 : 2020-11-01DOI: 10.1109/CIS52066.2020.00063
Cuo Wanma, Hecheng Li, Erping Song
Constndned optimization problems are widely used in real-world applications as optimization models. Due to the complexity of the objective itself as well as too tight constraints, it is difficult to obtain the global optimal solution to these problems. In this manuscript, an improved differential evolutionary algorithm is proposed from the perspective of operator design and constraint handling. Firstly, in order to enhance the exploration ability of the algorithm, a heuristic mutation operator with better point information is constructed. Secondly, an improved dynamic epsilon constraint handling method is developed, in which the value of the epsilon decreases as the iteration number increases. The method can increase effectively the feasible individual in populations. Finally, the simulation results on 10 benchmark functions show that the proposed algorithm is effective and robust when compared with similar algorithms.
{"title":"A Differential Evolution Algorithm with Adaptive Strategies for Constrained Optimization Problem","authors":"Cuo Wanma, Hecheng Li, Erping Song","doi":"10.1109/CIS52066.2020.00063","DOIUrl":"https://doi.org/10.1109/CIS52066.2020.00063","url":null,"abstract":"Constndned optimization problems are widely used in real-world applications as optimization models. Due to the complexity of the objective itself as well as too tight constraints, it is difficult to obtain the global optimal solution to these problems. In this manuscript, an improved differential evolutionary algorithm is proposed from the perspective of operator design and constraint handling. Firstly, in order to enhance the exploration ability of the algorithm, a heuristic mutation operator with better point information is constructed. Secondly, an improved dynamic epsilon constraint handling method is developed, in which the value of the epsilon decreases as the iteration number increases. The method can increase effectively the feasible individual in populations. Finally, the simulation results on 10 benchmark functions show that the proposed algorithm is effective and robust when compared with similar algorithms.","PeriodicalId":106959,"journal":{"name":"2020 16th International Conference on Computational Intelligence and Security (CIS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127672431","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 : 2020-11-01DOI: 10.1109/CIS52066.2020.00076
Lei Yang, N. Li, Yitian Chen, Haoran Chen, Zhihao Chen, Decai Liang
The covariance matrix adaptive evolution strategy (CMA-ES) is a random search evolution strategy with superior performance and high accuracy. However, when faced with multimodal complex functions, it also has the shortcomings of converging too fast and easily falling into local optimization. Matrix operations in high dimensions also greatly reduce the performance of the algorithm. This paper proposes an improved CMA-ES algorithm based on the cloud model and Cholesky factor update. The cloud model has a good ability to deal with uncertain problems, and the step size is controlled by cloud reasoning, which can better avoid falling into problems such as local optimization and premature convergence. At the same time, the Cholesky factor greatly reduces the computational cost of the algorithm by effectively updating the covariance, especially in high dimensions. Through multiple function tests, multiple experimental verifications and compared with CMA-ES and its Cholesky variant algorithm, the algorithm has the advantages of higher efficiency and more accurate convergence.
{"title":"The Covariance Matrix Evolution Strategy Algorithm Based On Cloud Model And Cholesky Factor","authors":"Lei Yang, N. Li, Yitian Chen, Haoran Chen, Zhihao Chen, Decai Liang","doi":"10.1109/CIS52066.2020.00076","DOIUrl":"https://doi.org/10.1109/CIS52066.2020.00076","url":null,"abstract":"The covariance matrix adaptive evolution strategy (CMA-ES) is a random search evolution strategy with superior performance and high accuracy. However, when faced with multimodal complex functions, it also has the shortcomings of converging too fast and easily falling into local optimization. Matrix operations in high dimensions also greatly reduce the performance of the algorithm. This paper proposes an improved CMA-ES algorithm based on the cloud model and Cholesky factor update. The cloud model has a good ability to deal with uncertain problems, and the step size is controlled by cloud reasoning, which can better avoid falling into problems such as local optimization and premature convergence. At the same time, the Cholesky factor greatly reduces the computational cost of the algorithm by effectively updating the covariance, especially in high dimensions. Through multiple function tests, multiple experimental verifications and compared with CMA-ES and its Cholesky variant algorithm, the algorithm has the advantages of higher efficiency and more accurate convergence.","PeriodicalId":106959,"journal":{"name":"2020 16th International Conference on Computational Intelligence and Security (CIS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127775605","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 : 2020-11-01DOI: 10.1109/CIS52066.2020.00048
Bizhong Wei, Jian Dai, Liqiang Deng, Haiyan Huang
Elasticsearch, as an open source distributed data search and analysis engine, has been widely used in recent years due to its characteristics. But in a wide range of utilization and deployment, it is not suitable for all scenarios and requirements. Therefore, this paper proposes a method to optimize the number of Elasticsearch index shard based on Elasticsearch full-text retrieval technology and data features in practical application. This method can comprehensively analyze and calculate Elasticsearch remaining storage space and index shard size of each node in distributed cluster to determine the optimal number of index shard in the system, which can improve the efficiency of data retrieval. Experimental results show that, compare with traditional methods, the proposed method can improve the system performance in data distribution, data writing efficiency and data query delay.
{"title":"An Optimization Method for Elasticsearch Index Shard Number","authors":"Bizhong Wei, Jian Dai, Liqiang Deng, Haiyan Huang","doi":"10.1109/CIS52066.2020.00048","DOIUrl":"https://doi.org/10.1109/CIS52066.2020.00048","url":null,"abstract":"Elasticsearch, as an open source distributed data search and analysis engine, has been widely used in recent years due to its characteristics. But in a wide range of utilization and deployment, it is not suitable for all scenarios and requirements. Therefore, this paper proposes a method to optimize the number of Elasticsearch index shard based on Elasticsearch full-text retrieval technology and data features in practical application. This method can comprehensively analyze and calculate Elasticsearch remaining storage space and index shard size of each node in distributed cluster to determine the optimal number of index shard in the system, which can improve the efficiency of data retrieval. Experimental results show that, compare with traditional methods, the proposed method can improve the system performance in data distribution, data writing efficiency and data query delay.","PeriodicalId":106959,"journal":{"name":"2020 16th International Conference on Computational Intelligence and Security (CIS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134604287","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 : 2020-11-01DOI: 10.1109/CIS52066.2020.00033
Lingling Li, Xianlong Chen, Yiling Xu
This study presents a domain adaptive language model based on adjustable parameters and domain interpolation. Meanwhile, a method of automatically determining test data domain by language model is proposed. Results show that the perplexity of the proposed language model is significantly lower than that of the baseline of KN smoothing language model on the cross-domain test set. In Chinese-English translation, the BLEU value of machine translation evaluation is also significantly higher than that of baseline model.
{"title":"Machine Translation Based on Domain Adaptive Language Model","authors":"Lingling Li, Xianlong Chen, Yiling Xu","doi":"10.1109/CIS52066.2020.00033","DOIUrl":"https://doi.org/10.1109/CIS52066.2020.00033","url":null,"abstract":"This study presents a domain adaptive language model based on adjustable parameters and domain interpolation. Meanwhile, a method of automatically determining test data domain by language model is proposed. Results show that the perplexity of the proposed language model is significantly lower than that of the baseline of KN smoothing language model on the cross-domain test set. In Chinese-English translation, the BLEU value of machine translation evaluation is also significantly higher than that of baseline model.","PeriodicalId":106959,"journal":{"name":"2020 16th International Conference on Computational Intelligence and Security (CIS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126058210","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 : 2020-11-01DOI: 10.1109/CIS52066.2020.00017
Changqing Lu, Xiaochun Lei, Junlin Xie, Xiaolong Wang, XiangBoge Mu
Intelligenta transportation is an important part of urban development. The core of realizing intelligent transportation is to master the urban road condition. This system processes the video of dashcam based on the Panoptic Segmentation network and adds a tracking module based on the comparison of front and rear frames and KM algorithm. The system mainly includes the following parts: embedded device, Panoptic Feature Pyramid Network, cloud server and Web site.
{"title":"Panoptic Feature Pyramid Network Applications In Intelligent Traffic","authors":"Changqing Lu, Xiaochun Lei, Junlin Xie, Xiaolong Wang, XiangBoge Mu","doi":"10.1109/CIS52066.2020.00017","DOIUrl":"https://doi.org/10.1109/CIS52066.2020.00017","url":null,"abstract":"Intelligenta transportation is an important part of urban development. The core of realizing intelligent transportation is to master the urban road condition. This system processes the video of dashcam based on the Panoptic Segmentation network and adds a tracking module based on the comparison of front and rear frames and KM algorithm. The system mainly includes the following parts: embedded device, Panoptic Feature Pyramid Network, cloud server and Web site.","PeriodicalId":106959,"journal":{"name":"2020 16th International Conference on Computational Intelligence and Security (CIS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127012065","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}