Pub Date : 2018-11-01DOI: 10.1109/CIS2018.2018.00054
Ruliang Wang, Xiaoli Pei
In this paper, we study the stability of a class of uncertain time-varying delay neutral systems. By constructing Lyapunov functions containing four integral integrals, using the techniques and methods of various types of inequalities, we can get the conclusion about the system Robust stability Finally, this conclusion is verified through the LMI toolbox in MATLAB.
{"title":"Robust Stability Analysis for Uncertain Time-Varying Delay Neutral Systems","authors":"Ruliang Wang, Xiaoli Pei","doi":"10.1109/CIS2018.2018.00054","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00054","url":null,"abstract":"In this paper, we study the stability of a class of uncertain time-varying delay neutral systems. By constructing Lyapunov functions containing four integral integrals, using the techniques and methods of various types of inequalities, we can get the conclusion about the system Robust stability Finally, this conclusion is verified through the LMI toolbox in MATLAB.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126000912","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 : 2018-11-01DOI: 10.1109/CIS2018.2018.00075
Ya-juan Yang, Liangliang Zhang, Quan-ju Zhang
Since the concept of workflow originates from the fields of production organization and office automation in 1970s, workflow technology research and related product development have entered a more prosperous stage during the 80s. Presently, workflow management technology has been successfully applied to libraries, hospitals, insurance companies and, of the most important, to the industrial fields. This paper aims at how the workflow-based technology can be applied to the area of intelligent education. We focus the attention on some important aspects of constructing business training platform with the workflow management system technology based-on, such as the construction framework, platform functions and implementation. Mean-while, workflow reference model design is presented and the workflow-based scheduling is carried out that will be employed in the developing process. Moreover, we point out the follow-up development potentials for constructing other wisdom training platform based on the workflow management systems.
{"title":"Constructing Business Simulation Training Platform Based on Workflow Management Systems","authors":"Ya-juan Yang, Liangliang Zhang, Quan-ju Zhang","doi":"10.1109/CIS2018.2018.00075","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00075","url":null,"abstract":"Since the concept of workflow originates from the fields of production organization and office automation in 1970s, workflow technology research and related product development have entered a more prosperous stage during the 80s. Presently, workflow management technology has been successfully applied to libraries, hospitals, insurance companies and, of the most important, to the industrial fields. This paper aims at how the workflow-based technology can be applied to the area of intelligent education. We focus the attention on some important aspects of constructing business training platform with the workflow management system technology based-on, such as the construction framework, platform functions and implementation. Mean-while, workflow reference model design is presented and the workflow-based scheduling is carried out that will be employed in the developing process. Moreover, we point out the follow-up development potentials for constructing other wisdom training platform based on the workflow management systems.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134257506","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 : 2018-11-01DOI: 10.1109/CIS2018.2018.00101
Hui-fang Yu
Proxy signcryption is that the proxy signcrypter obtains the delegate authorization from the original signcrypter, and then signcrypts the specified message on behalf of the original signcrypter. In this paper, the author constructs a novel certificateless proxy signcryption scheme based on three cyclic multiplication groups and its security bases on the intractability of the co-bilinear Diffie-Hellman (co-BDH) and co-computational Diffie-Hellman (co-CDH) problems. Our certificateless proxy signcryption scheme is very appropriate for applications in electric commerce and electric government.
{"title":"Certificateless Proxy Signcryption Using Cyclic Multiplication Groups","authors":"Hui-fang Yu","doi":"10.1109/CIS2018.2018.00101","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00101","url":null,"abstract":"Proxy signcryption is that the proxy signcrypter obtains the delegate authorization from the original signcrypter, and then signcrypts the specified message on behalf of the original signcrypter. In this paper, the author constructs a novel certificateless proxy signcryption scheme based on three cyclic multiplication groups and its security bases on the intractability of the co-bilinear Diffie-Hellman (co-BDH) and co-computational Diffie-Hellman (co-CDH) problems. Our certificateless proxy signcryption scheme is very appropriate for applications in electric commerce and electric government.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132295943","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 : 2018-11-01DOI: 10.1109/CIS2018.2018.00068
Jie-lan Zhang, Yi Chen, Xinhong Hei, Lei Zhu, Qingpan Zhao, Yichuan Wang
With the rapid development of information technology, knowledge graph extracts more and more attentions from researchers. However, Chinese knowledge graph of construction industry is still at the beginning stage, and Chinese word segmentation method, as the basis of natural language processing, plays a vital role on the process of building knowledge graph. In this paper, we study Chinese design specifications of building stairs, and proposes a reverse maximum matching (RMM) based word segmentation method to parse Chinese building specifications. The proposed method first converts the dictionary of building into a hash dictionary. And then, by traversing the design specifications of building stairs, the proposed method handles the non-Chinese symbols in the design specifications. Finally, the proposed method uses RMM algorithm to match contexts with Chinese design specifications and generate the goal results. Through performing experiments on Chinese design specifications of building stairs, the results can be shown that the proposed method is feasible.
{"title":"A RMM Based Word Segmentation Method for Chinese Design Specifications of Building Stairs","authors":"Jie-lan Zhang, Yi Chen, Xinhong Hei, Lei Zhu, Qingpan Zhao, Yichuan Wang","doi":"10.1109/CIS2018.2018.00068","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00068","url":null,"abstract":"With the rapid development of information technology, knowledge graph extracts more and more attentions from researchers. However, Chinese knowledge graph of construction industry is still at the beginning stage, and Chinese word segmentation method, as the basis of natural language processing, plays a vital role on the process of building knowledge graph. In this paper, we study Chinese design specifications of building stairs, and proposes a reverse maximum matching (RMM) based word segmentation method to parse Chinese building specifications. The proposed method first converts the dictionary of building into a hash dictionary. And then, by traversing the design specifications of building stairs, the proposed method handles the non-Chinese symbols in the design specifications. Finally, the proposed method uses RMM algorithm to match contexts with Chinese design specifications and generate the goal results. Through performing experiments on Chinese design specifications of building stairs, the results can be shown that the proposed method is feasible.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115324538","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 : 2018-11-01DOI: 10.1109/CIS2018.2018.00073
Xinpeng Li, Yong Wang, Hao Feng, Wenlong Ke
Intrusion detection plays a key role in maintaining the security of computer networks. Host-based intrusion detection systems usually analyze log data to discover host abnormal behavior. In recent years, with the rapid growth of massive host log data generated by virtual machines in the cloud environment, the traditional log analysis methods are limited by factors such as single data source, independent data, large data volume, and insufficient single-point computing capability. To solve this problem, this paper proposes a Spark-based host log data processing method, which first expands the data dimension based on Spark SQL to obtain more detailed dimensional data; then accomplish the query (especially union query) and counting complex data for more comprehensive host health used Spark SQL. Series of experiments result show that our proposed method can achieve platform scalability and has well time performance in log data processing.
{"title":"A Parallel Host Log Analysis Approach Based on Spark","authors":"Xinpeng Li, Yong Wang, Hao Feng, Wenlong Ke","doi":"10.1109/CIS2018.2018.00073","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00073","url":null,"abstract":"Intrusion detection plays a key role in maintaining the security of computer networks. Host-based intrusion detection systems usually analyze log data to discover host abnormal behavior. In recent years, with the rapid growth of massive host log data generated by virtual machines in the cloud environment, the traditional log analysis methods are limited by factors such as single data source, independent data, large data volume, and insufficient single-point computing capability. To solve this problem, this paper proposes a Spark-based host log data processing method, which first expands the data dimension based on Spark SQL to obtain more detailed dimensional data; then accomplish the query (especially union query) and counting complex data for more comprehensive host health used Spark SQL. Series of experiments result show that our proposed method can achieve platform scalability and has well time performance in log data processing.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115899770","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 : 2018-11-01DOI: 10.1109/CIS2018.2018.00057
Xiaoyan Hu, Lejun Zhang, Tianwen Huang, Xiaoying Lei
Ensuring the security of a communication system is the key step of information hiding. With the rapid development of Internet technology and the increasingly complex network environment, more and more secret information needs to be transmitted over the network. Voice over IP (VoIP) is based on the IP network of digital transmission technology, taking voice services in VoIP as a steganographic carrier is one of the important methods for secure transmission of secret information. In this paper, we will start with the communication principle of VoIP streaming media information hiding, and gives the definition of imperceptibility, undetectability, irreducibility, unattackable, and insensitivity of VoIP streaming information hiding, and then analyze the covert communication process of steganography for VoIP. Finally, a security evaluation method based on information hiding of VoIP streaming media is proposed.
保证通信系统的安全是信息隐藏的关键步骤。随着Internet技术的飞速发展和网络环境的日益复杂，越来越多的保密信息需要通过网络进行传输。IP语音(Voice over IP, VoIP)是基于IP网络的数字传输技术，将VoIP中的语音业务作为隐写载体是保密信息安全传输的重要方法之一。本文从VoIP流媒体信息隐藏的通信原理出发，给出了VoIP流媒体信息隐藏的不可感知性、不可检测性、不可约性、不可攻击性和不敏感性的定义，分析了VoIP隐写的隐蔽通信过程。最后，提出了一种基于信息隐藏的VoIP流媒体安全评估方法。
{"title":"A Security Evaluation Method for Voice-over-IP Streaming Media Information Hiding","authors":"Xiaoyan Hu, Lejun Zhang, Tianwen Huang, Xiaoying Lei","doi":"10.1109/CIS2018.2018.00057","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00057","url":null,"abstract":"Ensuring the security of a communication system is the key step of information hiding. With the rapid development of Internet technology and the increasingly complex network environment, more and more secret information needs to be transmitted over the network. Voice over IP (VoIP) is based on the IP network of digital transmission technology, taking voice services in VoIP as a steganographic carrier is one of the important methods for secure transmission of secret information. In this paper, we will start with the communication principle of VoIP streaming media information hiding, and gives the definition of imperceptibility, undetectability, irreducibility, unattackable, and insensitivity of VoIP streaming information hiding, and then analyze the covert communication process of steganography for VoIP. Finally, a security evaluation method based on information hiding of VoIP streaming media is proposed.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114385798","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 : 2018-11-01DOI: 10.1109/CIS2018.2018.00012
Cai Dai, Yanjun Ji, Juan Li
Pareto dominance based Multi-objective Evolutionary Algorithms (MOEAs) is an effective method for solving multi-objective problems with two or three objectives. However, in many-objective problems, the determination of the solution set scale is a challenge which highly limits the performance of existing MOEAs. The small quantity of solution set in MOEA may lead to large non-dominance area which dramatically reduces the selection pressure, while large scale solution set will inevitably increases the time and memory consumption. In order to solve this problem, in this paper, a grid-based Pareto dominance approach is proposed for many-objective problem. In this approach, one single solution is used to create the non-dominance area which approximates that used to be determined by a set of solutions in MOEA. Moreover, in this approach, both the selection pressure, diversity of solutions and time and memory consumption are taken into consideration by utilizing the smallest number of virtual solutions to determine whether a solution is a non-dominance solution. In this paper, a new MOEA based on the grid-based Pareto dominance is designed for many-objective problems. In the experiment, the well-known algorithms and relaxed forms of Pareto dominance are used to compare with the algorithm and the grid-based Pareto dominance. The experimental results show that the proposed approaches can guide the search for many-objective spaces to converge to the true PF and maintain the diversity of solutions.
{"title":"An Improvement Evolutionary Algorithm Based on Grid-Based Pareto Dominance for Many-Objective Optimization","authors":"Cai Dai, Yanjun Ji, Juan Li","doi":"10.1109/CIS2018.2018.00012","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00012","url":null,"abstract":"Pareto dominance based Multi-objective Evolutionary Algorithms (MOEAs) is an effective method for solving multi-objective problems with two or three objectives. However, in many-objective problems, the determination of the solution set scale is a challenge which highly limits the performance of existing MOEAs. The small quantity of solution set in MOEA may lead to large non-dominance area which dramatically reduces the selection pressure, while large scale solution set will inevitably increases the time and memory consumption. In order to solve this problem, in this paper, a grid-based Pareto dominance approach is proposed for many-objective problem. In this approach, one single solution is used to create the non-dominance area which approximates that used to be determined by a set of solutions in MOEA. Moreover, in this approach, both the selection pressure, diversity of solutions and time and memory consumption are taken into consideration by utilizing the smallest number of virtual solutions to determine whether a solution is a non-dominance solution. In this paper, a new MOEA based on the grid-based Pareto dominance is designed for many-objective problems. In the experiment, the well-known algorithms and relaxed forms of Pareto dominance are used to compare with the algorithm and the grid-based Pareto dominance. The experimental results show that the proposed approaches can guide the search for many-objective spaces to converge to the true PF and maintain the diversity of solutions.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117009938","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 : 2018-11-01DOI: 10.1109/CIS2018.2018.00090
Qing Wu, Zongxian Qi, Zhicang Wang, Yu Zhang
Local linear embedding has the characteristics of nonlinearity and simple implementation, but it cannot accurately handle the selection of neighborhoods under the conditions of noise, large curvature and sparse sampling. To solve this problem, an improved weighted local linear embedding method (WLE-LLE) is proposed. In WLE-LLE, the dimensionality reduction objective function is reconstructed by utilizing Laplacian Eigenmaps, which can effectively represent the manifold structure of nonlinear data. Theoretical analyses show the proposed method is better than LLE algorithm in preserving the original manifold structure of the data. And numerical experiments show its classification recognition rate is greatly improved, which is 2%-8% higher than LLE.
{"title":"An Improved Weighted Local Linear Embedding Algorithm","authors":"Qing Wu, Zongxian Qi, Zhicang Wang, Yu Zhang","doi":"10.1109/CIS2018.2018.00090","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00090","url":null,"abstract":"Local linear embedding has the characteristics of nonlinearity and simple implementation, but it cannot accurately handle the selection of neighborhoods under the conditions of noise, large curvature and sparse sampling. To solve this problem, an improved weighted local linear embedding method (WLE-LLE) is proposed. In WLE-LLE, the dimensionality reduction objective function is reconstructed by utilizing Laplacian Eigenmaps, which can effectively represent the manifold structure of nonlinear data. Theoretical analyses show the proposed method is better than LLE algorithm in preserving the original manifold structure of the data. And numerical experiments show its classification recognition rate is greatly improved, which is 2%-8% higher than LLE.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"389 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115991114","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 : 2018-11-01DOI: 10.1109/CIS2018.2018.00085
Kangshun Li, Yi Wang
The power grid is an artificial network. Studying the complex power grid with distributed generation is of great significance to people's life, production and social stability. This paper studies synchronous and operational reliability of power grid when distributed generation enter the network from the dynamic point of view. It is found that the more the power output of distributed generation is, the more easy the power grid is to synchronize and the stronger the resistance to disturbance when distributed generation is connected to a single power grid. When distributed generation is connected to interconnected power grids through small degree load nodes or a large sub network, the synchronization capability of interconnected power grids will be enhanced. No matter single power grid or interconnected power grids, the more distributed generation connected to the grid there are, the more the synchronization ability of power grid will be improved.
{"title":"Influence of Distributed Generation Connection on Dynamic Characteristics of Power Grid","authors":"Kangshun Li, Yi Wang","doi":"10.1109/CIS2018.2018.00085","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00085","url":null,"abstract":"The power grid is an artificial network. Studying the complex power grid with distributed generation is of great significance to people's life, production and social stability. This paper studies synchronous and operational reliability of power grid when distributed generation enter the network from the dynamic point of view. It is found that the more the power output of distributed generation is, the more easy the power grid is to synchronize and the stronger the resistance to disturbance when distributed generation is connected to a single power grid. When distributed generation is connected to interconnected power grids through small degree load nodes or a large sub network, the synchronization capability of interconnected power grids will be enhanced. No matter single power grid or interconnected power grids, the more distributed generation connected to the grid there are, the more the synchronization ability of power grid will be improved.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117100125","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 : 2018-11-01DOI: 10.1109/CIS2018.2018.00089
Ying Huang, Yingxu Wang, Yiwang Huang
Process discovery, one of the key steps in process management, aims at discovering process models from process execution data stored in event logs. Most discovery algorithms assume that all data in an event log fully comply with the process execution specification. However, in real event logs, noise and irrelevant infrequent behaviour are often present. In this paper, we propose a novel filtering method that the removal of infrequent behavior from event logs. The method has been evaluated in detail and it is shown that its application in existing process discovery algorithms significantly improves the quality of the discovered process models and that it scales well to large datasets.
{"title":"Filtering Out Infrequent Events by Expectation from Business Process Event Logs","authors":"Ying Huang, Yingxu Wang, Yiwang Huang","doi":"10.1109/CIS2018.2018.00089","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00089","url":null,"abstract":"Process discovery, one of the key steps in process management, aims at discovering process models from process execution data stored in event logs. Most discovery algorithms assume that all data in an event log fully comply with the process execution specification. However, in real event logs, noise and irrelevant infrequent behaviour are often present. In this paper, we propose a novel filtering method that the removal of infrequent behavior from event logs. The method has been evaluated in detail and it is shown that its application in existing process discovery algorithms significantly improves the quality of the discovered process models and that it scales well to large datasets.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124527149","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
扫码关注我们
求助内容：
应助结果提醒方式：