Aiming at the problems of high randomness and low prediction accuracy of power load data, a power load prediction model is formed by integrating Singular Spectrum Analysis(SSA) and a Gated Recurrent Unit(GRU) network with a feature mapping layer added, which can effectively improve the power load prediction accuracy. The method takes historical load data as input, uses nonlinear time series processing technology SSA to extract features reflecting complex dynamic changes of load, constructs the extracted feature vector into a time series form as the input of the FL-GRU network, and superimposes the prediction results of each subsequence. get the final prediction result. To avoid the loss of effective information in the data during the noise reduction process, the method performs non-noise reduction processing. Experiments are carried out with a household power load data set in the UK and a data set provided by ISO New England, the method achieved 98.86% and 97.31% prediction accuracy on both datasets.
{"title":"Power load forecasting based on SSA non-noise reduction processing","authors":"Yindong Jin, He Xiao, Chengui Fu","doi":"10.1145/3569966.3569999","DOIUrl":"https://doi.org/10.1145/3569966.3569999","url":null,"abstract":"Aiming at the problems of high randomness and low prediction accuracy of power load data, a power load prediction model is formed by integrating Singular Spectrum Analysis(SSA) and a Gated Recurrent Unit(GRU) network with a feature mapping layer added, which can effectively improve the power load prediction accuracy. The method takes historical load data as input, uses nonlinear time series processing technology SSA to extract features reflecting complex dynamic changes of load, constructs the extracted feature vector into a time series form as the input of the FL-GRU network, and superimposes the prediction results of each subsequence. get the final prediction result. To avoid the loss of effective information in the data during the noise reduction process, the method performs non-noise reduction processing. Experiments are carried out with a household power load data set in the UK and a data set provided by ISO New England, the method achieved 98.86% and 97.31% prediction accuracy on both datasets.","PeriodicalId":145580,"journal":{"name":"Proceedings of the 5th International Conference on Computer Science and Software Engineering","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122463315","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}
Cuicui Cai, Yao Nie, Huan Wu, Maosheng Fu, Xianmeng Meng
Synthesizing antenna arrays is an important issue in antenna design, which directly determines the performance of the antenna. In this letter, a novel improved flower pollination algorithm (IFPA) is proposed for the synthesis of antenna arrays. To enhance the search ability, the IFPA with Cauchy mutation, Elite strategy, and the dynamic conversion probability is presented. Firstly, Cauchy mutation is applied to the global pollination of the FPA, which increases the diversity of the population. Secondly, elite strategy is used for the local pollination of the FPA, which increases the search range of the optimal individual. Finally, the dynamic switch probability is used to improve the convergence speed of the algorithm. The antenna pattern synthesis is chosen to demonstrate the effectiveness and superiority of IFPA compared with other optimization algorithms. The results show that IFPA achieves the lowest maximum side-lobe level and deepest null depth level than particle swarm optimization (PSO) and FPA.
{"title":"Pattern Synthesis of Antenna Array Based on Improved Flower Pollination Algorithm","authors":"Cuicui Cai, Yao Nie, Huan Wu, Maosheng Fu, Xianmeng Meng","doi":"10.1145/3569966.3570080","DOIUrl":"https://doi.org/10.1145/3569966.3570080","url":null,"abstract":"Synthesizing antenna arrays is an important issue in antenna design, which directly determines the performance of the antenna. In this letter, a novel improved flower pollination algorithm (IFPA) is proposed for the synthesis of antenna arrays. To enhance the search ability, the IFPA with Cauchy mutation, Elite strategy, and the dynamic conversion probability is presented. Firstly, Cauchy mutation is applied to the global pollination of the FPA, which increases the diversity of the population. Secondly, elite strategy is used for the local pollination of the FPA, which increases the search range of the optimal individual. Finally, the dynamic switch probability is used to improve the convergence speed of the algorithm. The antenna pattern synthesis is chosen to demonstrate the effectiveness and superiority of IFPA compared with other optimization algorithms. The results show that IFPA achieves the lowest maximum side-lobe level and deepest null depth level than particle swarm optimization (PSO) and FPA.","PeriodicalId":145580,"journal":{"name":"Proceedings of the 5th International Conference on Computer Science and Software Engineering","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122825460","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 rapid development of deep learning, a variety of neural network models emerge in endlessly, which leads to a huge demand for computing resources. For the intensive numerical computation of neural networks, various computing devices represented by GPUs are favored by researchers. Heterogeneous computing is a kind of technology that can integrate a variety of computing devices with different architectures, and it will be further developed. Therefore, this paper reviews research on some key technologies of heterogeneous computing, including the architecture of heterogeneous computing, the programming language of heterogeneous computing, and the scheduling algorithm for heterogeneous systems. Then, we focus on the research of heterogeneous computing in deep learning, including the parallel technology of neural networks and optimization technology based on heterogeneous systems. Finally, the present research situation is discussed and analyzed, and the future research direction is prospected, aiming to provide some basis for related research.
{"title":"Heterogeneous Computing and Applications in Deep Learning: A Survey","authors":"Qiong Wu, Yuefeng Shen, Mingqing Zhang","doi":"10.1145/3569966.3570075","DOIUrl":"https://doi.org/10.1145/3569966.3570075","url":null,"abstract":"With the rapid development of deep learning, a variety of neural network models emerge in endlessly, which leads to a huge demand for computing resources. For the intensive numerical computation of neural networks, various computing devices represented by GPUs are favored by researchers. Heterogeneous computing is a kind of technology that can integrate a variety of computing devices with different architectures, and it will be further developed. Therefore, this paper reviews research on some key technologies of heterogeneous computing, including the architecture of heterogeneous computing, the programming language of heterogeneous computing, and the scheduling algorithm for heterogeneous systems. Then, we focus on the research of heterogeneous computing in deep learning, including the parallel technology of neural networks and optimization technology based on heterogeneous systems. Finally, the present research situation is discussed and analyzed, and the future research direction is prospected, aiming to provide some basis for related research.","PeriodicalId":145580,"journal":{"name":"Proceedings of the 5th International Conference on Computer Science and Software Engineering","volume":"151 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131096463","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}
Xiya Yu, Xuetao Zhang, Yuanyuan Shi, Chang-Chung Wu, Xianhe Li
C programming is a compulsory general education course for science and technology majors in colleges and universities, and its importance is self-evident. At present, the teaching mode of C language in colleges and universities generally has the code lecture according to the text, teachers usually use PowerPoint to explain classroom knowledge, code demonstration needs to operate several software at the same time, the operation process is tedious, the performance of teaching computer is a great challenge, the classroom efficiency is affected. In order to solve the above teaching problems, it is necessary to develop a system based on VSTO's PowerPoint technology development and Spring Boot framework for C online compilation and running. The system enables PowerPoint to compile and run online in C language, which can effectively solve the problem of complicated operation of C language compiler in classroom. The system design uses Spring Boot framework to write the interaction logic, MySQL database for the data layer, Docker container for system resource virtualization and program isolation, and Nginx for front-end load balancing to improve the concurrent processing capability. The design and operation of the C online compilation system embedded in PowerPoint is studied and analyzed to achieve the goal of security and high concurrency, which will positively contribute to the progress of teaching programming courses.
{"title":"Design and Implementation of VSTO-based Online Compilation Teaching System for C Language","authors":"Xiya Yu, Xuetao Zhang, Yuanyuan Shi, Chang-Chung Wu, Xianhe Li","doi":"10.1145/3569966.3570094","DOIUrl":"https://doi.org/10.1145/3569966.3570094","url":null,"abstract":"C programming is a compulsory general education course for science and technology majors in colleges and universities, and its importance is self-evident. At present, the teaching mode of C language in colleges and universities generally has the code lecture according to the text, teachers usually use PowerPoint to explain classroom knowledge, code demonstration needs to operate several software at the same time, the operation process is tedious, the performance of teaching computer is a great challenge, the classroom efficiency is affected. In order to solve the above teaching problems, it is necessary to develop a system based on VSTO's PowerPoint technology development and Spring Boot framework for C online compilation and running. The system enables PowerPoint to compile and run online in C language, which can effectively solve the problem of complicated operation of C language compiler in classroom. The system design uses Spring Boot framework to write the interaction logic, MySQL database for the data layer, Docker container for system resource virtualization and program isolation, and Nginx for front-end load balancing to improve the concurrent processing capability. The design and operation of the C online compilation system embedded in PowerPoint is studied and analyzed to achieve the goal of security and high concurrency, which will positively contribute to the progress of teaching programming courses.","PeriodicalId":145580,"journal":{"name":"Proceedings of the 5th International Conference on Computer Science and Software Engineering","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121775854","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 rapid development of the current informatization construction in campus, this paper discusses the situation and stages in Data Governance which are the Data Migration of transaction databases, the construction of public data platforms, and the establishment of Data Warehouses. In the step of Data Migration, this paper explores the application path of a flexible management constructed on the basis of oracle multi-tenant architecture with fast I/O and high availability that depended on the Oracle Database Appliance, so as to achieves a highly centralized management platform of the database and brings the convenience of benefit for college education reform and innovation.
{"title":"Research on Data Governance and Data Migration based on Oracle Database Appliance in campus","authors":"Mingxiu. Tong, Ying Xia","doi":"10.1145/3569966.3571273","DOIUrl":"https://doi.org/10.1145/3569966.3571273","url":null,"abstract":"With the rapid development of the current informatization construction in campus, this paper discusses the situation and stages in Data Governance which are the Data Migration of transaction databases, the construction of public data platforms, and the establishment of Data Warehouses. In the step of Data Migration, this paper explores the application path of a flexible management constructed on the basis of oracle multi-tenant architecture with fast I/O and high availability that depended on the Oracle Database Appliance, so as to achieves a highly centralized management platform of the database and brings the convenience of benefit for college education reform and innovation.","PeriodicalId":145580,"journal":{"name":"Proceedings of the 5th International Conference on Computer Science and Software Engineering","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114248511","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}
Tiequan Liu, J. Sun, Lei Chen, Hanxiao Zhang, Fujian Pi
This essay studied various aspects of evaluating airborne software supplier development capability and built an evaluation model by analysis of the influencing factors. The model consists of evaluation indicators, check items, and scores considering different design assurance levels of embedded airborne software development requirements. As a result, the model can efficiently conduct supplier software ability evaluation to reduce the software project risk.
{"title":"Study on the Evaluation Model of Airborne Software Supplier Development Capability","authors":"Tiequan Liu, J. Sun, Lei Chen, Hanxiao Zhang, Fujian Pi","doi":"10.1145/3569966.3569976","DOIUrl":"https://doi.org/10.1145/3569966.3569976","url":null,"abstract":"This essay studied various aspects of evaluating airborne software supplier development capability and built an evaluation model by analysis of the influencing factors. The model consists of evaluation indicators, check items, and scores considering different design assurance levels of embedded airborne software development requirements. As a result, the model can efficiently conduct supplier software ability evaluation to reduce the software project risk.","PeriodicalId":145580,"journal":{"name":"Proceedings of the 5th International Conference on Computer Science and Software Engineering","volume":"1999 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121075172","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}
Wei Guo, Zhongjun Fu, Jiang Sun, Lei Wang, Jing Zhang
Amazon Mechanical Turk (Mturk), as the world's largest micro-task crowdsourcing platform, provides task search services to thousands of users every day. However, the lack of navigation panel in the platform's existing user interface makes task searching difficult and tedious, resulting in users rarely finding acceptable tasks among the countless crowdsourced assignments. To lower the task search threshold of Mturk, this study creates an automated task navigation structure by combining the unsupervised task clustering algorithm and the topic recognition algorithm, which can be fine-tuned according to task characteristics and help users focus on the task type quickly and precisely. Since the navigation panel is a non-existent element of Mturk, this paper develops a well-designed questionnaire to investigate users' perceptions of the improved interface. The results show that users were dissatisfied with Mturk's current UI, preferring the navigation interface outlined in this study. In conclusion, this work provides theoretical guidance for building similar automated task navigation panels for other crowdsourcing platforms while addressing the practical problems of Mturk.
Amazon Mechanical Turk (Mturk)作为全球最大的微任务众包平台，每天为成千上万的用户提供任务搜索服务。然而，平台现有的用户界面缺少导航面板，使得任务搜索困难且繁琐，导致用户在无数的众包任务中很少能找到可接受的任务。为了降低Mturk的任务搜索阈值，本研究将无监督任务聚类算法与主题识别算法相结合，创建了一个自动化的任务导航结构，该结构可以根据任务特征进行微调，帮助用户快速准确地关注任务类型。由于导航面板是Mturk不存在的元素，本文开发了一个精心设计的问卷调查，以调查用户对改进界面的看法。结果表明，用户对Mturk目前的UI不满意，更喜欢本研究中概述的导航界面。综上所述，本文在解决Mturk的实际问题的同时，为其他众包平台构建类似的自动化任务导航面板提供了理论指导。
{"title":"Task navigation panel for Amazon Mechanical Turk","authors":"Wei Guo, Zhongjun Fu, Jiang Sun, Lei Wang, Jing Zhang","doi":"10.1145/3569966.3570108","DOIUrl":"https://doi.org/10.1145/3569966.3570108","url":null,"abstract":"Amazon Mechanical Turk (Mturk), as the world's largest micro-task crowdsourcing platform, provides task search services to thousands of users every day. However, the lack of navigation panel in the platform's existing user interface makes task searching difficult and tedious, resulting in users rarely finding acceptable tasks among the countless crowdsourced assignments. To lower the task search threshold of Mturk, this study creates an automated task navigation structure by combining the unsupervised task clustering algorithm and the topic recognition algorithm, which can be fine-tuned according to task characteristics and help users focus on the task type quickly and precisely. Since the navigation panel is a non-existent element of Mturk, this paper develops a well-designed questionnaire to investigate users' perceptions of the improved interface. The results show that users were dissatisfied with Mturk's current UI, preferring the navigation interface outlined in this study. In conclusion, this work provides theoretical guidance for building similar automated task navigation panels for other crowdsourcing platforms while addressing the practical problems of Mturk.","PeriodicalId":145580,"journal":{"name":"Proceedings of the 5th International Conference on Computer Science and Software Engineering","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125665960","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}
Part segmentation is one of the important tasks in 3D shape analysis. Prior works mostly rely on complex local modeling to learn features directly from raw mesh or point cloud. We proposed a simple, fast and robust approach for 3D shape part segmentation without sophisticated local geometric modeling and ingenious networks. Our main idea is to learn more discriminative features from different geometric descriptors by sparse convolution and attention mechanism. Specifically, an effective shape representation block, consists of a features embedding module, two attention module. The coordinates are fed into the features embedding module to produce embedding vectors. The attention head to learn the intrinsic relations between different descriptors and produce more informative feature maps. In the lower branch, We use some geometric descriptors as local features. And a classification head predicts the corresponding label. Conditional Random Field (CRF) is applied to optimize the segmentation of the network. The experiment results on Princeton Shape Benchmark(PSB) demonstrate that our architecture outperforms different methods, with higher accuracy, lower complexity and faster speed.
{"title":"A light and efficient attention model for 3D shape part-segmentation","authors":"W. Shi, Zhongyi Li","doi":"10.1145/3569966.3570055","DOIUrl":"https://doi.org/10.1145/3569966.3570055","url":null,"abstract":"Part segmentation is one of the important tasks in 3D shape analysis. Prior works mostly rely on complex local modeling to learn features directly from raw mesh or point cloud. We proposed a simple, fast and robust approach for 3D shape part segmentation without sophisticated local geometric modeling and ingenious networks. Our main idea is to learn more discriminative features from different geometric descriptors by sparse convolution and attention mechanism. Specifically, an effective shape representation block, consists of a features embedding module, two attention module. The coordinates are fed into the features embedding module to produce embedding vectors. The attention head to learn the intrinsic relations between different descriptors and produce more informative feature maps. In the lower branch, We use some geometric descriptors as local features. And a classification head predicts the corresponding label. Conditional Random Field (CRF) is applied to optimize the segmentation of the network. The experiment results on Princeton Shape Benchmark(PSB) demonstrate that our architecture outperforms different methods, with higher accuracy, lower complexity and faster speed.","PeriodicalId":145580,"journal":{"name":"Proceedings of the 5th International Conference on Computer Science and Software Engineering","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121642852","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}
Node breakdown is very common in distributed storage systems, which will result in data loss or damage. Regenerating codes can reduce the network bandwidth cost by broken data recovery. Interference Alignment (IA) code is a type of regenerating code that can minimize the required network bandwidth for data regeneration. The original IA code could only recover a single breakdown node. In this work, we shall propose a solution based on the IA code that can jointly repair multiple breakdown nodes. We will derive the Repair Matrix that can regenerate multiple lost data blocks through simple multiplication. Based on this scheme, a multi-failure recovery algorithm based on IA code will be put forward. Moreover, the network bandwidth required for data recovery under different scenarios will be studied through both theoretical and numerical analysis.
{"title":"An Effective Data Recovery Approach for Distributed Storage based on Interference Alignment","authors":"Jingyao Zhang","doi":"10.1145/3569966.3569971","DOIUrl":"https://doi.org/10.1145/3569966.3569971","url":null,"abstract":"Node breakdown is very common in distributed storage systems, which will result in data loss or damage. Regenerating codes can reduce the network bandwidth cost by broken data recovery. Interference Alignment (IA) code is a type of regenerating code that can minimize the required network bandwidth for data regeneration. The original IA code could only recover a single breakdown node. In this work, we shall propose a solution based on the IA code that can jointly repair multiple breakdown nodes. We will derive the Repair Matrix that can regenerate multiple lost data blocks through simple multiplication. Based on this scheme, a multi-failure recovery algorithm based on IA code will be put forward. Moreover, the network bandwidth required for data recovery under different scenarios will be studied through both theoretical and numerical analysis.","PeriodicalId":145580,"journal":{"name":"Proceedings of the 5th International Conference on Computer Science and Software Engineering","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125471778","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}
For the military manufacturing field, through a detailed analysis of ERP business processes and finance, a business-financial integration scheme is proposed, which opens the data link between ERP and business finance platform by establishing synchronous update of business and financial information data, and realizes the financial accounting of manufacturing business from sales to delivery, procurement to payment, demand to manufacturing, etc., which includes scientific research and trial production and mass production. The integrated integration improves the efficiency of accounting and the accuracy of data.
{"title":"Research and application of business finance integration solution for military manufacturing","authors":"Lu Jia, Pu Zhao, Qian Li","doi":"10.1145/3569966.3570042","DOIUrl":"https://doi.org/10.1145/3569966.3570042","url":null,"abstract":"For the military manufacturing field, through a detailed analysis of ERP business processes and finance, a business-financial integration scheme is proposed, which opens the data link between ERP and business finance platform by establishing synchronous update of business and financial information data, and realizes the financial accounting of manufacturing business from sales to delivery, procurement to payment, demand to manufacturing, etc., which includes scientific research and trial production and mass production. The integrated integration improves the efficiency of accounting and the accuracy of data.","PeriodicalId":145580,"journal":{"name":"Proceedings of the 5th International Conference on Computer Science and Software Engineering","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127779075","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
扫码关注我们
求助内容：
应助结果提醒方式：