Hanqing Jiang, Shaopei Ji, Chengchao Zha, Yanhong Liu
Nowadays, the scale of software is getting larger and more complex. The forms of vulnerability also tend to be more diversified. Traditional vulnerability detection methods have the disadvantages of high manual participation and weak ability to detect unknown vulnerabilities. It can no longer meet the detection requirements of diversified vulnerabilities. In order to improve the detection effect of unknown vulnerabilities, A large number of machine learning methods have been applied to the field of software vulnerability detection. Because the existing methods have high loss of syntax and semantic information in the process of code representation, Lead to high false alarm rate and false alarm rate. To solve this problem, this paper presents a software vulnerability detection method based on code attribute graph and Bi-LSTM (Long Short-Term Memory), in which abstract syntax tree sequence and control flow graph sequence are extracted from the code attribute graph of function, Reduce the loss of information in the process of code representation, Bi-LSTM is selected to build a feature extraction model, Experimental results show that, compared with the method based on abstract syntax tree, this method can greatly improve the accuracy and recall of vulnerability detection, improve the vulnerability detection effect for real data sets mixed with multiple software source codes, and effectively reduce the false positive rate and false negative rate.
{"title":"Software vulnerability detection method based on code attribute graph presentation and Bi-LSTM neural network extraction","authors":"Hanqing Jiang, Shaopei Ji, Chengchao Zha, Yanhong Liu","doi":"10.1117/12.3032032","DOIUrl":"https://doi.org/10.1117/12.3032032","url":null,"abstract":"Nowadays, the scale of software is getting larger and more complex. The forms of vulnerability also tend to be more diversified. Traditional vulnerability detection methods have the disadvantages of high manual participation and weak ability to detect unknown vulnerabilities. It can no longer meet the detection requirements of diversified vulnerabilities. In order to improve the detection effect of unknown vulnerabilities, A large number of machine learning methods have been applied to the field of software vulnerability detection. Because the existing methods have high loss of syntax and semantic information in the process of code representation, Lead to high false alarm rate and false alarm rate. To solve this problem, this paper presents a software vulnerability detection method based on code attribute graph and Bi-LSTM (Long Short-Term Memory), in which abstract syntax tree sequence and control flow graph sequence are extracted from the code attribute graph of function, Reduce the loss of information in the process of code representation, Bi-LSTM is selected to build a feature extraction model, Experimental results show that, compared with the method based on abstract syntax tree, this method can greatly improve the accuracy and recall of vulnerability detection, improve the vulnerability detection effect for real data sets mixed with multiple software source codes, and effectively reduce the false positive rate and false negative rate.","PeriodicalId":198425,"journal":{"name":"Other Conferences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141376948","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}
This paper addresses the issue of low parallel efficiency resulting from fixed thread allocation in automatic parallelization compilation technology. The authors employ a genetic algorithm to determine the optimal number of threads for individual parallelizable loops. They then utilize iterative compilation techniques to produce the suitable number of threads for each parallelizable loop structure, thereby enhancing the efficiency of automatic parallelization compilation. The proposed method demonstrated an average performance enhancement of 26% across ten benchmarks in the SPEC CPU2006 test suite and an overall performance improvement of 3.7% in the NPB3.4.2 test suite, thereby indicating the viability and efficacy of the approach. The approach outlined in this paper can be utilized as a benchmark for enhancing the effectiveness of automated parallel computing and promoting the progression of automated parallel computing technology.
{"title":"Optimization of parallel compilation techniques using genetic algorithms","authors":"Lin Han, Pengyan Yan","doi":"10.1117/12.3031912","DOIUrl":"https://doi.org/10.1117/12.3031912","url":null,"abstract":"This paper addresses the issue of low parallel efficiency resulting from fixed thread allocation in automatic parallelization compilation technology. The authors employ a genetic algorithm to determine the optimal number of threads for individual parallelizable loops. They then utilize iterative compilation techniques to produce the suitable number of threads for each parallelizable loop structure, thereby enhancing the efficiency of automatic parallelization compilation. The proposed method demonstrated an average performance enhancement of 26% across ten benchmarks in the SPEC CPU2006 test suite and an overall performance improvement of 3.7% in the NPB3.4.2 test suite, thereby indicating the viability and efficacy of the approach. The approach outlined in this paper can be utilized as a benchmark for enhancing the effectiveness of automated parallel computing and promoting the progression of automated parallel computing technology.","PeriodicalId":198425,"journal":{"name":"Other Conferences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141377852","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}
Deep Neural Networks (DNNs) have been found to be vulnerable to adversarial attacks. Numerous prior studies aim to address vulnerabilities in trained models, either by patching these weaknesses or by introducing measures to make it challenging or resource-intensive to compute adversarial examples exploiting them. In our research, we take a distinctive approach by exploring and developing a "honeypot" (DMZ-enabled) strategy for Deep Neural Networks (DNNs) to safeguard against adversarial attacks, setting our work apart from existing methods in the protection of DNN models. Unlike other methods, instead of modifying the original model, we split this high dimensional space to get DMZ (demilitarized zone). We intentionally keep weaknesses like traditional honeypot do in the classification model that allow adversaries to search for adversarial examples. The adversary's optimization algorithms gravitate towards DMZ, the examples they generate in the feature space will eventually fall into the DMZ. Then, by checking if the input example falls into the DMZ, we can pick out the adversarial example. More specifically, in this paper, we introduce DMZ in DNN classifiers and show an implementation of a DMZ-enabled defense named zHoneypot. We integrate the current SOTA (state-of-the-art) adversarial example defense methods, i.e., mitigation and detection, into a single approach zHoneypot, we show experimentally that DMZ-protected models can proper handling adversarial examples which generated by state-of-the-art white-box attacks (such as FGSM, PGD, CW, OnePixel and DeepFool) with high accuracy, and with negligible impact on normal benign model. In the end, our defense method achieved a score of 97.66 on MNIST, 86.1 on CIFAR10, and 90.94 on SVHN.
{"title":"A new zhoneypot defence for deep neural networks","authors":"Zhou Zhou","doi":"10.1117/12.3031913","DOIUrl":"https://doi.org/10.1117/12.3031913","url":null,"abstract":"Deep Neural Networks (DNNs) have been found to be vulnerable to adversarial attacks. Numerous prior studies aim to address vulnerabilities in trained models, either by patching these weaknesses or by introducing measures to make it challenging or resource-intensive to compute adversarial examples exploiting them. In our research, we take a distinctive approach by exploring and developing a \"honeypot\" (DMZ-enabled) strategy for Deep Neural Networks (DNNs) to safeguard against adversarial attacks, setting our work apart from existing methods in the protection of DNN models. Unlike other methods, instead of modifying the original model, we split this high dimensional space to get DMZ (demilitarized zone). We intentionally keep weaknesses like traditional honeypot do in the classification model that allow adversaries to search for adversarial examples. The adversary's optimization algorithms gravitate towards DMZ, the examples they generate in the feature space will eventually fall into the DMZ. Then, by checking if the input example falls into the DMZ, we can pick out the adversarial example. More specifically, in this paper, we introduce DMZ in DNN classifiers and show an implementation of a DMZ-enabled defense named zHoneypot. We integrate the current SOTA (state-of-the-art) adversarial example defense methods, i.e., mitigation and detection, into a single approach zHoneypot, we show experimentally that DMZ-protected models can proper handling adversarial examples which generated by state-of-the-art white-box attacks (such as FGSM, PGD, CW, OnePixel and DeepFool) with high accuracy, and with negligible impact on normal benign model. In the end, our defense method achieved a score of 97.66 on MNIST, 86.1 on CIFAR10, and 90.94 on SVHN.","PeriodicalId":198425,"journal":{"name":"Other Conferences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141380776","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}
This paper designs a flow detection system for marine high-pressure pressure reducing valves, focusing on the hardware selection and inspection methods of the system. The detection system software is completed according to the design requirements to achieve the function of the flow detection system.
{"title":"Design of a flow detection system for high pressure reducing valves in ships","authors":"Jing Rui, Lidong Zhang","doi":"10.1117/12.3031899","DOIUrl":"https://doi.org/10.1117/12.3031899","url":null,"abstract":"This paper designs a flow detection system for marine high-pressure pressure reducing valves, focusing on the hardware selection and inspection methods of the system. The detection system software is completed according to the design requirements to achieve the function of the flow detection system.","PeriodicalId":198425,"journal":{"name":"Other Conferences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141379076","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 field of telematics, the nature of traffic data leads to its scattering, involving numerous traffic objects with individual sensitive information. Consequently, sharing a large amount of data becomes difficult, resulting in the existence of "data silos". To address this issue, this paper proposes a scheme that combines coalition learning and blockchain for the purpose of data sharing and privacy protection. The scheme involves modeling multi-source vehicle data using federated learning and storing the trained model parameters and reputation values of participating vehicles on the blockchain. Furthermore, a reputation value calculation method based on the double subjective logic model is proposed, which analyzes the impact of data source quality on the performance of the federated learning algorithm. This calculation method helps in the selection of the client for federated learning, ensuring efficient screening of data sources, improving sharing efficiency, and achieving privacy protection in data sharing. Finally, a simulation analysis is conducted to evaluate the proposed scheme, and the results demonstrate its capability to filter high-quality data sources in real-time dynamic data exchange scenarios of telematics, thereby enhancing the accuracy of federated learning training.
{"title":"On-chain federated learning approach for Internet of Vehicles","authors":"Chen Fang, Wenkai Di, Mengqi Cao","doi":"10.1117/12.3031889","DOIUrl":"https://doi.org/10.1117/12.3031889","url":null,"abstract":"In the field of telematics, the nature of traffic data leads to its scattering, involving numerous traffic objects with individual sensitive information. Consequently, sharing a large amount of data becomes difficult, resulting in the existence of \"data silos\". To address this issue, this paper proposes a scheme that combines coalition learning and blockchain for the purpose of data sharing and privacy protection. The scheme involves modeling multi-source vehicle data using federated learning and storing the trained model parameters and reputation values of participating vehicles on the blockchain. Furthermore, a reputation value calculation method based on the double subjective logic model is proposed, which analyzes the impact of data source quality on the performance of the federated learning algorithm. This calculation method helps in the selection of the client for federated learning, ensuring efficient screening of data sources, improving sharing efficiency, and achieving privacy protection in data sharing. Finally, a simulation analysis is conducted to evaluate the proposed scheme, and the results demonstrate its capability to filter high-quality data sources in real-time dynamic data exchange scenarios of telematics, thereby enhancing the accuracy of federated learning training.","PeriodicalId":198425,"journal":{"name":"Other Conferences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141381107","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}
The code repository stores all the code, configuration files, and historical versions of the enterprise, which is an essential tool in the software development process. However, it also brings unprecedented security threats to enterprises, and the traditional network security architecture has been unable to satisfy the high-security and high-reliability management requirements of the code assets of research institutions. To this end, based on the Zero Trust (ZT) security paradigm, we propose a code repository federated autonomous technology, build a decentralized and distributed autonomous security protection mechanism, realize bidirectional identity authentication and dynamic trust evaluation mechanism for the authorization management of code resources, improve the security and protection level of the code repository, and effectively solve the security protection shortcomings of the existing collaborative research and development environment.
{"title":"Zero trust-based federated autonomous technology for code repository","authors":"Fuxi Wang, Bo Shen, Xi Zhao, Jian Huang","doi":"10.1117/12.3031893","DOIUrl":"https://doi.org/10.1117/12.3031893","url":null,"abstract":"The code repository stores all the code, configuration files, and historical versions of the enterprise, which is an essential tool in the software development process. However, it also brings unprecedented security threats to enterprises, and the traditional network security architecture has been unable to satisfy the high-security and high-reliability management requirements of the code assets of research institutions. To this end, based on the Zero Trust (ZT) security paradigm, we propose a code repository federated autonomous technology, build a decentralized and distributed autonomous security protection mechanism, realize bidirectional identity authentication and dynamic trust evaluation mechanism for the authorization management of code resources, improve the security and protection level of the code repository, and effectively solve the security protection shortcomings of the existing collaborative research and development environment.","PeriodicalId":198425,"journal":{"name":"Other Conferences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141378921","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}
Multiparty Private Set Intersection (MPSI) protocols afford protection of set data privacy but concurrently introduce substantial computational overhead. While this overhead is tolerable when dealing with modest-sized sets and a limited number of participants, it becomes burdensome as set cardinality and participant count escalate. Consequently, these protocols exhibit constraints regarding set size or participant quantity, thereby diminishing their practical feasibility in scenarios involving extensive sets and numerous participants. To address these challenges, this paper introduces a novel MPSI protocol based on function secret sharing. Our protocol effectively computes the intersection elements while ensuring the confidentiality of set data, rendering it well-suited for scenarios characterized by a considerable number of candidates and large-scale sets. Extensive testing and comparative analysis against other MPSI protocols are conducted to evaluate the proposed protocol's performance and effectiveness.
{"title":"Efficient multiparty private set intersection protocol based on function secret sharing","authors":"Zhen Sun","doi":"10.1117/12.3031902","DOIUrl":"https://doi.org/10.1117/12.3031902","url":null,"abstract":"Multiparty Private Set Intersection (MPSI) protocols afford protection of set data privacy but concurrently introduce substantial computational overhead. While this overhead is tolerable when dealing with modest-sized sets and a limited number of participants, it becomes burdensome as set cardinality and participant count escalate. Consequently, these protocols exhibit constraints regarding set size or participant quantity, thereby diminishing their practical feasibility in scenarios involving extensive sets and numerous participants. To address these challenges, this paper introduces a novel MPSI protocol based on function secret sharing. Our protocol effectively computes the intersection elements while ensuring the confidentiality of set data, rendering it well-suited for scenarios characterized by a considerable number of candidates and large-scale sets. Extensive testing and comparative analysis against other MPSI protocols are conducted to evaluate the proposed protocol's performance and effectiveness.","PeriodicalId":198425,"journal":{"name":"Other Conferences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141377273","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}
Risk management is a critical factor that influences the success or failure of project management in the development of civil aircraft models. At present, research on project management capability assessment of civil aircraft models is mostly based on qualitative analysis and lacks analysis based on quantitative indicators, which leads to certain limitations in capability assessment. This article uses the Delphi method to obtain the weights of 8 indicators that affect project management ability in the form of a questionnaire. The Analytic Hierarchy Process (AHP) based Analytic Hierarchy Process (YAAHP) software is used to model and calculate the level of project management ability, and suggestions for improving project management ability are proposed.
{"title":"Evaluation of civil aircraft project management capability based on improved analytic hierarchy process algorithm","authors":"Zhuo Chen","doi":"10.1117/12.3032036","DOIUrl":"https://doi.org/10.1117/12.3032036","url":null,"abstract":"Risk management is a critical factor that influences the success or failure of project management in the development of civil aircraft models. At present, research on project management capability assessment of civil aircraft models is mostly based on qualitative analysis and lacks analysis based on quantitative indicators, which leads to certain limitations in capability assessment. This article uses the Delphi method to obtain the weights of 8 indicators that affect project management ability in the form of a questionnaire. The Analytic Hierarchy Process (AHP) based Analytic Hierarchy Process (YAAHP) software is used to model and calculate the level of project management ability, and suggestions for improving project management ability are proposed.","PeriodicalId":198425,"journal":{"name":"Other Conferences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141380474","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 order to study the change of wax deposition thickness with time, an improved DGM (1,1) model was established based on the grey theory model. Taking indoor loop experiment and field pipeline data as examples, the weakening buffer operator and translation transform were introduced to improve the smoothness of the original sequence, and the different models were tested and compared. The results show that the average relative error of the traditional DGM (1,1) model is large, and the error of the improved model is greatly reduced after the weakening buffer operator treatment, and the d2 operator is more suitable for predicting the wax thickness of short sequence and wide spacing sequence. Translation transformation of the original sequence can improve the smoothness of the sequence, and different original sequences have selectivity on the offset of translation transformation function. The effect of weakening buffer operator on model improvement is much better than that of translational transformation. It is feasible to use the modified GM (1,1) model to predict the wax thickness of tube wall, and this method has certain popularization value.
{"title":"Prediction and application of wax thickness on tube wall based on improved DGM (1,1) model","authors":"Changkun Cheng, Menglong Zhao, Hui Shen, Benquan Li, Yanping Liu, Pei Yang","doi":"10.1117/12.3032055","DOIUrl":"https://doi.org/10.1117/12.3032055","url":null,"abstract":"In order to study the change of wax deposition thickness with time, an improved DGM (1,1) model was established based on the grey theory model. Taking indoor loop experiment and field pipeline data as examples, the weakening buffer operator and translation transform were introduced to improve the smoothness of the original sequence, and the different models were tested and compared. The results show that the average relative error of the traditional DGM (1,1) model is large, and the error of the improved model is greatly reduced after the weakening buffer operator treatment, and the d2 operator is more suitable for predicting the wax thickness of short sequence and wide spacing sequence. Translation transformation of the original sequence can improve the smoothness of the sequence, and different original sequences have selectivity on the offset of translation transformation function. The effect of weakening buffer operator on model improvement is much better than that of translational transformation. It is feasible to use the modified GM (1,1) model to predict the wax thickness of tube wall, and this method has certain popularization value.","PeriodicalId":198425,"journal":{"name":"Other Conferences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141377565","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}
Traditional terminal devices generally adopt a process oriented integrated software architecture design scheme, with high coupling between software and hardware modules in various business units. As more and more business modules are connected to intelligent terminals, the software complexity of intelligent terminals also increases exponentially. The complexity of processing new business functions is high, and the development of business software can only be carried out by terminal hardware vendors, making it difficult to meet the needs of flexible business adjustments and rapid installation and deployment. This article designs a software APP based method and system for various data collection needs in intelligent terminals. The hardware of intelligent terminals adopts a modular, scalable, and low-power design, which is adaptable to complex operating environments and has high reliability and stability; By using Docker technology to achieve software and hardware decoupling, APPs communicate through the MQTT protocol, solving the problem of data sharing between different containers and multiple applications within the terminal, and improving the data collection performance of intelligent terminals.
{"title":"Design method and system of software application based on intelligent terminal","authors":"Tao Du","doi":"10.1117/12.3031922","DOIUrl":"https://doi.org/10.1117/12.3031922","url":null,"abstract":"Traditional terminal devices generally adopt a process oriented integrated software architecture design scheme, with high coupling between software and hardware modules in various business units. As more and more business modules are connected to intelligent terminals, the software complexity of intelligent terminals also increases exponentially. The complexity of processing new business functions is high, and the development of business software can only be carried out by terminal hardware vendors, making it difficult to meet the needs of flexible business adjustments and rapid installation and deployment. This article designs a software APP based method and system for various data collection needs in intelligent terminals. The hardware of intelligent terminals adopts a modular, scalable, and low-power design, which is adaptable to complex operating environments and has high reliability and stability; By using Docker technology to achieve software and hardware decoupling, APPs communicate through the MQTT protocol, solving the problem of data sharing between different containers and multiple applications within the terminal, and improving the data collection performance of intelligent terminals.","PeriodicalId":198425,"journal":{"name":"Other Conferences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141376434","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
扫码关注我们
求助内容：
应助结果提醒方式：