The problem of selecting features for a data set with a small number of objects is one of the most complex ones. Significant features selected for such data sets can vary quite a lot depending on how sub-sampling was performed during validation. This effect is called low feature set stability and signals on low reliability of the selected features. We propose a feature selection algorithm that is based on bagging procedure of feature selection filters quality measures ensemble and allows to obtain more stable feature sets, than would be obtained by running conventional algorithms, called BagMeLiF. This algorithm is based on MeLiF algorithm and will outperform original algorithm both in F1 score and stability with hyperparameter k around 0.7–0.9 if the dataset is well-balanced, but if it is not, then k around 0.1–0.2 will the best which is a quite straightforwardly applicable result.
{"title":"BagMeLiF: stable boosting-based hybrid-ensemble feature selection algorithm for high-dimensional data","authors":"Nikita Pilnenskiy, I. Smetannikov","doi":"10.1145/3437802.3437835","DOIUrl":"https://doi.org/10.1145/3437802.3437835","url":null,"abstract":"The problem of selecting features for a data set with a small number of objects is one of the most complex ones. Significant features selected for such data sets can vary quite a lot depending on how sub-sampling was performed during validation. This effect is called low feature set stability and signals on low reliability of the selected features. We propose a feature selection algorithm that is based on bagging procedure of feature selection filters quality measures ensemble and allows to obtain more stable feature sets, than would be obtained by running conventional algorithms, called BagMeLiF. This algorithm is based on MeLiF algorithm and will outperform original algorithm both in F1 score and stability with hyperparameter k around 0.7–0.9 if the dataset is well-balanced, but if it is not, then k around 0.1–0.2 will the best which is a quite straightforwardly applicable result.","PeriodicalId":429866,"journal":{"name":"Proceedings of the 2020 1st International Conference on Control, Robotics and Intelligent System","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128247651","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}
Delin Dang, Qihong Liu, Weiguang Li, Jiaxiang Dong, Xuehuan Ji, Hao Wan
Aiming at the problem that traditional target tracking algorithms cannot detect and track specific targets in the real environment (such as airports) due to the given initial frame target position, this article proposes a target tracking algorithm that combines improved Grid-based Motion Statistics (GMS) matching algorithm and correlation filtering tracking algorithm. First of all, for the problem that GMS cannot adapt to the detection of specific targets in realistic monitoring environment, a template size expansion method is proposed to disperse the centrally gathered feature points and Random Sample Consensus (RANSAC) is introduced to remove outliers in the center of similar areas. Second, the initial template of the tracking algorithm is the target detected by the improved GMS method, and it is used to extract features to train the correlation filter to determine the target position of the video sequence. Finally, two groups of comparative experiments show that not only the improved GMS algorithm has better target detection performance, but also the fusion algorithm has better reliability and robustness for target tracking.
{"title":"Target Tracking Algorithm Combining Improved GMS and Correlation Filtering","authors":"Delin Dang, Qihong Liu, Weiguang Li, Jiaxiang Dong, Xuehuan Ji, Hao Wan","doi":"10.1145/3437802.3437807","DOIUrl":"https://doi.org/10.1145/3437802.3437807","url":null,"abstract":"Aiming at the problem that traditional target tracking algorithms cannot detect and track specific targets in the real environment (such as airports) due to the given initial frame target position, this article proposes a target tracking algorithm that combines improved Grid-based Motion Statistics (GMS) matching algorithm and correlation filtering tracking algorithm. First of all, for the problem that GMS cannot adapt to the detection of specific targets in realistic monitoring environment, a template size expansion method is proposed to disperse the centrally gathered feature points and Random Sample Consensus (RANSAC) is introduced to remove outliers in the center of similar areas. Second, the initial template of the tracking algorithm is the target detected by the improved GMS method, and it is used to extract features to train the correlation filter to determine the target position of the video sequence. Finally, two groups of comparative experiments show that not only the improved GMS algorithm has better target detection performance, but also the fusion algorithm has better reliability and robustness for target tracking.","PeriodicalId":429866,"journal":{"name":"Proceedings of the 2020 1st International Conference on Control, Robotics and Intelligent System","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128389076","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}
Ngo Tung Son, Bui Ngoc Anh, Kieu Quoc Tuan, Son Ba Nguyen, S. H. Nguyen, J. Jaafar
In this paper, we describe the emergency distance teaching at FPT University in Vietnam to deal with emergency social isolation orders due to the outbreak of the COVID-19 virus. There are many theories as well as guidelines for implementing distance learning in recent years. However, applying them in a short time is not easy, for many factors even impossible such as revise the curriculum, prepare materials, train lecturers and students, prepare the related infrastructure. Therefore, we make many customizations to adapt to the current situation as well as reuse the most available resources. Emergency distance learning is an effective way to deal with diseases. However, exploring its affections to overcome in further phases is necessary. In this study, we analyze the student feedbacks and student achievements after one semester of emergence distance learning. The results show some information about the impact of emergency changes in teaching and examining methods on students.
{"title":"An Analysis of the Effectiveness of Emergency Distance Learning under COVID-19","authors":"Ngo Tung Son, Bui Ngoc Anh, Kieu Quoc Tuan, Son Ba Nguyen, S. H. Nguyen, J. Jaafar","doi":"10.1145/3437802.3437826","DOIUrl":"https://doi.org/10.1145/3437802.3437826","url":null,"abstract":"In this paper, we describe the emergency distance teaching at FPT University in Vietnam to deal with emergency social isolation orders due to the outbreak of the COVID-19 virus. There are many theories as well as guidelines for implementing distance learning in recent years. However, applying them in a short time is not easy, for many factors even impossible such as revise the curriculum, prepare materials, train lecturers and students, prepare the related infrastructure. Therefore, we make many customizations to adapt to the current situation as well as reuse the most available resources. Emergency distance learning is an effective way to deal with diseases. However, exploring its affections to overcome in further phases is necessary. In this study, we analyze the student feedbacks and student achievements after one semester of emergence distance learning. The results show some information about the impact of emergency changes in teaching and examining methods on students.","PeriodicalId":429866,"journal":{"name":"Proceedings of the 2020 1st International Conference on Control, Robotics and Intelligent System","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133524952","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}
Background subtraction algorithm is essential for video processing. such as target tracing, gesture recognition and gait recognition. ViBe has been widely used because of easy implementation and high efficiency. However, the algorithm would produce a ghost imaging when the speed of the moving target changes. On the other hand, ViBe is challenged to adapt to the change of environment and by misjudge the shadow as the foreground target. Moreover, it is also inability to handle well the interference caused by camera jitter. Aiming to the deficiencies of ViBe, we propose a new algorithm Gc_IViBe, which takes advantages from both Grabcut and Improved ViBe (IViBe). Based on the ability of IViBe to eliminate ghost imaging, the proposed algorithm utilizes mask in HSV space to remove background shadows. A further improvement of the algorithm in handling cavity problem and camera jitter is achieved by combinating IViBe and Grabcut. The experimental results show that Gc_IViBe performs better than ViBe in Pixel-level measure Precision, Structural measures S-measure and E-measure. This paper also discusses the evaluation methods. The evaluation results of Precision and S-measure in some cases are apparently different from the truth. while E-measure performs relatively better consistent, which capable to accurately evaluate the problems raised in this article.
{"title":"Background Subtraction Algorithm Based on Combination of Grabcut and Improved ViBe","authors":"Shuihan Jiang, Yunqi Gao, Changying Wang, Junting Qi, Li Cheng, Xiaojuan Zhang","doi":"10.1145/3437802.3437811","DOIUrl":"https://doi.org/10.1145/3437802.3437811","url":null,"abstract":"Background subtraction algorithm is essential for video processing. such as target tracing, gesture recognition and gait recognition. ViBe has been widely used because of easy implementation and high efficiency. However, the algorithm would produce a ghost imaging when the speed of the moving target changes. On the other hand, ViBe is challenged to adapt to the change of environment and by misjudge the shadow as the foreground target. Moreover, it is also inability to handle well the interference caused by camera jitter. Aiming to the deficiencies of ViBe, we propose a new algorithm Gc_IViBe, which takes advantages from both Grabcut and Improved ViBe (IViBe). Based on the ability of IViBe to eliminate ghost imaging, the proposed algorithm utilizes mask in HSV space to remove background shadows. A further improvement of the algorithm in handling cavity problem and camera jitter is achieved by combinating IViBe and Grabcut. The experimental results show that Gc_IViBe performs better than ViBe in Pixel-level measure Precision, Structural measures S-measure and E-measure. This paper also discusses the evaluation methods. The evaluation results of Precision and S-measure in some cases are apparently different from the truth. while E-measure performs relatively better consistent, which capable to accurately evaluate the problems raised in this article.","PeriodicalId":429866,"journal":{"name":"Proceedings of the 2020 1st International Conference on Control, Robotics and Intelligent System","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132139542","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}
With the development of cloud computing, artificial intelligence, big data and other technologies, network systems are facing more and more security risks and threats. The traditional security architecture based on border protection cannot meet the increasing security protection requirements. The zero-trust security architecture which has the characteristics of continuous identity authentication and minimized authority allocation can adapt to the security protection requirements of most current network systems. Based on the zero-trust security architecture, a dynamic access control and authorization system is proposed. User portraits and user trust are generated according to user behavior. Real-time hierarchical control in different scenarios is used in the system to achieve dynamic and fine-grained access control and authorization.
{"title":"Dynamic Access Control and Authorization System based on Zero-trust architecture","authors":"Qigui Yao, Qi Wang, Xiaojian Zhang, Jiaxuan Fei","doi":"10.1145/3437802.3437824","DOIUrl":"https://doi.org/10.1145/3437802.3437824","url":null,"abstract":"With the development of cloud computing, artificial intelligence, big data and other technologies, network systems are facing more and more security risks and threats. The traditional security architecture based on border protection cannot meet the increasing security protection requirements. The zero-trust security architecture which has the characteristics of continuous identity authentication and minimized authority allocation can adapt to the security protection requirements of most current network systems. Based on the zero-trust security architecture, a dynamic access control and authorization system is proposed. User portraits and user trust are generated according to user behavior. Real-time hierarchical control in different scenarios is used in the system to achieve dynamic and fine-grained access control and authorization.","PeriodicalId":429866,"journal":{"name":"Proceedings of the 2020 1st International Conference on Control, Robotics and Intelligent System","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128676420","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}
Previous approaches to generate fill in the blanks (FITB) questions for English learning mostly are limited to corpus-based approaches that generate Cloze collocates or most frequent co-occurring words. In this study, we propose a Natural Language Processing based approach to generate Fill In The Blank English learning exercises. First, we classify the nature of the problem, and second, we look into the generation of learning exercises. We limited the scope of this research to verb conjugation exercises but it can be extended to other types of learning exercises as well. We looked into the generation of English learning exercises as two types of problems, a sequence labeling problem where we label each token from a sentence whether it could be a potential blank or not and as a sequence to sequence generation problem where we measure its effectiveness in generating such English learning exercises. Generation of FITB for English grammar through these approaches can be useful in the field of Education and can act as a baseline for future work on this problem.
{"title":"Finding the Blank with Sequence Labeling for English Learning","authors":"Shivam Mehta, I. Smetannikov","doi":"10.1145/3437802.3437834","DOIUrl":"https://doi.org/10.1145/3437802.3437834","url":null,"abstract":"Previous approaches to generate fill in the blanks (FITB) questions for English learning mostly are limited to corpus-based approaches that generate Cloze collocates or most frequent co-occurring words. In this study, we propose a Natural Language Processing based approach to generate Fill In The Blank English learning exercises. First, we classify the nature of the problem, and second, we look into the generation of learning exercises. We limited the scope of this research to verb conjugation exercises but it can be extended to other types of learning exercises as well. We looked into the generation of English learning exercises as two types of problems, a sequence labeling problem where we label each token from a sentence whether it could be a potential blank or not and as a sequence to sequence generation problem where we measure its effectiveness in generating such English learning exercises. Generation of FITB for English grammar through these approaches can be useful in the field of Education and can act as a baseline for future work on this problem.","PeriodicalId":429866,"journal":{"name":"Proceedings of the 2020 1st International Conference on Control, Robotics and Intelligent System","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124590203","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 process of engraving three-dimensional (3D) complex shape using manipulators, there are many inflection points and many start-stop operation, which cause shock easily. To resolve these problems, an adaptive NURBS curve interpolation algorithm combined symmetrical sine function acceleration/deceleration (ACC/DEC) control (S-A-NURBS) is designed. 3D information is adaptively interpolated by adjusting knot vector of NURBS curve ensuring smooth transition of complex contours. And in order to modify feed rate and interpolation step size of the machining, the ACC/DEC strategy considered symmetrical sine function is discussed ensuring motion smoothness and accuracy, reducing manipulator's shock and chord error at the same time. At last, to evaluate the proposed approach, the simulation verification on the model of KUKA manipulator KR240-R2900 in SimMechanics environment is conducted to follow a 3D NURBS curve. Numerical simulations demonstrate the effectiveness of the proposed scheme.
{"title":"Research on Adaptive NURBS Interpolation Algorithm for 3D Engraving of Manipulators","authors":"J. Dang, Tingting Xie, Hui Shao, Haixia Song","doi":"10.1145/3437802.3437808","DOIUrl":"https://doi.org/10.1145/3437802.3437808","url":null,"abstract":"In the process of engraving three-dimensional (3D) complex shape using manipulators, there are many inflection points and many start-stop operation, which cause shock easily. To resolve these problems, an adaptive NURBS curve interpolation algorithm combined symmetrical sine function acceleration/deceleration (ACC/DEC) control (S-A-NURBS) is designed. 3D information is adaptively interpolated by adjusting knot vector of NURBS curve ensuring smooth transition of complex contours. And in order to modify feed rate and interpolation step size of the machining, the ACC/DEC strategy considered symmetrical sine function is discussed ensuring motion smoothness and accuracy, reducing manipulator's shock and chord error at the same time. At last, to evaluate the proposed approach, the simulation verification on the model of KUKA manipulator KR240-R2900 in SimMechanics environment is conducted to follow a 3D NURBS curve. Numerical simulations demonstrate the effectiveness of the proposed scheme.","PeriodicalId":429866,"journal":{"name":"Proceedings of the 2020 1st International Conference on Control, Robotics and Intelligent System","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123477430","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 addition to bringing us knowledge, books also bring us emotional experiences. How do the emotional fluctuations brought by books affect readers’ evaluation of them? What is the difference in emotional fluctuations between books of different popularity? In this paper, we model and analyse the emotional fluctuations of different fiction books with different popularity and study the feasibility of predicting the popularity of fiction books using emotional fluctuations and recurrent neural networks. A new dataset is also generated to support this research and other related researches. Our proposed method obtained the best accuracy of 73.4% for predicting the popularity of fiction books and 41.4% for predicting genres. Some interesting data insights are also extracted from the dataset.
{"title":"Fiction Popularity Prediction Based on Emotion Analysis","authors":"Xing Wang, Shouhua Zhang, I. Smetannikov","doi":"10.1145/3437802.3437831","DOIUrl":"https://doi.org/10.1145/3437802.3437831","url":null,"abstract":"In addition to bringing us knowledge, books also bring us emotional experiences. How do the emotional fluctuations brought by books affect readers’ evaluation of them? What is the difference in emotional fluctuations between books of different popularity? In this paper, we model and analyse the emotional fluctuations of different fiction books with different popularity and study the feasibility of predicting the popularity of fiction books using emotional fluctuations and recurrent neural networks. A new dataset is also generated to support this research and other related researches. Our proposed method obtained the best accuracy of 73.4% for predicting the popularity of fiction books and 41.4% for predicting genres. Some interesting data insights are also extracted from the dataset.","PeriodicalId":429866,"journal":{"name":"Proceedings of the 2020 1st International Conference on Control, Robotics and Intelligent System","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129333666","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}
Xianyu Qi, Wei Wang, Ziwei Liao, Xiaoyu Zhang, Lin Xue, Xu Zhang, Jing Li, Tong Fang, Ran Wei
This paper proposes a programming class for young children. In order to reduce the burden on teachers and attract students' interest, a robot teaching assistant is used to explain programming knowledge, verify and run programs. Different from writing programs on a computer, the physical board programming is employed to develop logical thinking of young children and prevent them from the vision harm of facing computer screens for a long time and the lack of reality from immersion in the virtual world. Based on the knowledge points of programming, we have designed a course with 16 lessons. The course has been successfully applied in many kindergartens and elementary schools. We use the questionnaires for students and teachers to evaluate the course and the experimental results show that it is effective.
{"title":"Robot teaching assistant and physical programming class for programming education of young children","authors":"Xianyu Qi, Wei Wang, Ziwei Liao, Xiaoyu Zhang, Lin Xue, Xu Zhang, Jing Li, Tong Fang, Ran Wei","doi":"10.1145/3437802.3437812","DOIUrl":"https://doi.org/10.1145/3437802.3437812","url":null,"abstract":"This paper proposes a programming class for young children. In order to reduce the burden on teachers and attract students' interest, a robot teaching assistant is used to explain programming knowledge, verify and run programs. Different from writing programs on a computer, the physical board programming is employed to develop logical thinking of young children and prevent them from the vision harm of facing computer screens for a long time and the lack of reality from immersion in the virtual world. Based on the knowledge points of programming, we have designed a course with 16 lessons. The course has been successfully applied in many kindergartens and elementary schools. We use the questionnaires for students and teachers to evaluate the course and the experimental results show that it is effective.","PeriodicalId":429866,"journal":{"name":"Proceedings of the 2020 1st International Conference on Control, Robotics and Intelligent System","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115136387","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}
Aiming at the problem that the existing network security situation prediction (NSSP) can only provide the network situation predicted values but not the specific information such as threat sources, this paper proposes a hierarchical NSSP method and uses the Belief Rule Base (BRB). The hierarchical NSSP method first predicts the development trend of the state of network security elements, and then evaluates the predicted network security elements to obtain the situation predicted value. Through experimental analysis, the hierarchical NSSP method can accurately predict the network security situation and provide more reference information for network security management.
{"title":"Hierarchical Network Security Situation Prediction Based on Belief Rule Base","authors":"Qingshuang Hu, Yibiao Fang, Yimeng Li, Chenghai Li, Zilong Wang, Yanqiang Tang, Yu Yang","doi":"10.1145/3437802.3437837","DOIUrl":"https://doi.org/10.1145/3437802.3437837","url":null,"abstract":"Aiming at the problem that the existing network security situation prediction (NSSP) can only provide the network situation predicted values but not the specific information such as threat sources, this paper proposes a hierarchical NSSP method and uses the Belief Rule Base (BRB). The hierarchical NSSP method first predicts the development trend of the state of network security elements, and then evaluates the predicted network security elements to obtain the situation predicted value. Through experimental analysis, the hierarchical NSSP method can accurately predict the network security situation and provide more reference information for network security management.","PeriodicalId":429866,"journal":{"name":"Proceedings of the 2020 1st International Conference on Control, Robotics and Intelligent System","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133832817","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
扫码关注我们
求助内容：
应助结果提醒方式：