Pub Date : 2019-11-01DOI: 10.1109/ISKE47853.2019.9170401
Weixin Lu, K. An, Yang Zhang, Huayu Wang, Tao Liang
This paper investigates the robust beamforming (BF) schemes for an integrated satellite terrestrial relay network coexisting with a cognitive terrestrial user. Owing to the unavailable line-of-sight (LOS) between satellite and intended terminal, a multi-antenna base station (BS) is used to be a relay. By assuming that only the imperfect channel state information (CSI) is available, we propose two schemes based on loose robust BF and tight robust BF schemes, respectively. Due to the non-convexity and mathematically intractability of the initial optimization problem, we develop a reformulation and transformation approach. Finally, the validity and effectiveness of the proposed schemes are confirmed.
{"title":"Robust Secure Beamforming for Integrated Satellite Terrestrial Relay Networks Coexisting with Cognitive Terrestrial User","authors":"Weixin Lu, K. An, Yang Zhang, Huayu Wang, Tao Liang","doi":"10.1109/ISKE47853.2019.9170401","DOIUrl":"https://doi.org/10.1109/ISKE47853.2019.9170401","url":null,"abstract":"This paper investigates the robust beamforming (BF) schemes for an integrated satellite terrestrial relay network coexisting with a cognitive terrestrial user. Owing to the unavailable line-of-sight (LOS) between satellite and intended terminal, a multi-antenna base station (BS) is used to be a relay. By assuming that only the imperfect channel state information (CSI) is available, we propose two schemes based on loose robust BF and tight robust BF schemes, respectively. Due to the non-convexity and mathematically intractability of the initial optimization problem, we develop a reformulation and transformation approach. Finally, the validity and effectiveness of the proposed schemes are confirmed.","PeriodicalId":399084,"journal":{"name":"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115902165","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 : 2019-11-01DOI: 10.1109/ISKE47853.2019.9170404
V. Loboda, G. Kolaczek
The paper presents an approach to solving one of the main security problems of modern information systems. This problem is related to unauthorized access to its resources. To prevent unauthorized access, it is necessary to improve the user authentication procedure. Currently, there are several basic approaches to user identity verification, but the most challenging is undoubtedly the verification of the user’s authenticity using its biometric features. One of such biometric features which can be used in computer systems is the dynamics of typing. The most interesting and popular ways how the authentication is performed in modern systems have been discussed in the first part of this work. The paper presents the outcome of research which used the following elements characterizing user style of typing: time intervals between keypress; duration of pressing the key; the speed of writing and sound. The novelty of the paper is related to combining the frequently used dynamic elements of typing with the sound spectrogram associated with the process of typing.
{"title":"Sound and Keystroke Dynamics Analysis for User Authenticity Verification","authors":"V. Loboda, G. Kolaczek","doi":"10.1109/ISKE47853.2019.9170404","DOIUrl":"https://doi.org/10.1109/ISKE47853.2019.9170404","url":null,"abstract":"The paper presents an approach to solving one of the main security problems of modern information systems. This problem is related to unauthorized access to its resources. To prevent unauthorized access, it is necessary to improve the user authentication procedure. Currently, there are several basic approaches to user identity verification, but the most challenging is undoubtedly the verification of the user’s authenticity using its biometric features. One of such biometric features which can be used in computer systems is the dynamics of typing. The most interesting and popular ways how the authentication is performed in modern systems have been discussed in the first part of this work. The paper presents the outcome of research which used the following elements characterizing user style of typing: time intervals between keypress; duration of pressing the key; the speed of writing and sound. The novelty of the paper is related to combining the frequently used dynamic elements of typing with the sound spectrogram associated with the process of typing.","PeriodicalId":399084,"journal":{"name":"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114902255","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 : 2019-11-01DOI: 10.1109/ISKE47853.2019.9170342
Yinsheng Zhang
Here, stochastic dynamic field (SDF) is introduced to describe the high stochastic properties of dynamic systems full of various fields. It suggests that there exists measurable space where quantities can be represented and computed. In frame, the space is abstracted as a coordinate system with undetermined dimensions; correspondingly, a quantity (as a high-dimension point) in the coordinate system is a superpositional tensor, i.e., with undetermined relationships between dimensions (indices) or in a random scope in a dimension. As to the certain properties of superpositional tensors in space, gradient, divergence, emission, interactions, as well as the periodicity are modeled, and some classical physical laws such as Euler Equation and Gaussian Law are tried to be transformed with the random factors.
{"title":"Analysis on the Stochastic Dynamic Field","authors":"Yinsheng Zhang","doi":"10.1109/ISKE47853.2019.9170342","DOIUrl":"https://doi.org/10.1109/ISKE47853.2019.9170342","url":null,"abstract":"Here, stochastic dynamic field (SDF) is introduced to describe the high stochastic properties of dynamic systems full of various fields. It suggests that there exists measurable space where quantities can be represented and computed. In frame, the space is abstracted as a coordinate system with undetermined dimensions; correspondingly, a quantity (as a high-dimension point) in the coordinate system is a superpositional tensor, i.e., with undetermined relationships between dimensions (indices) or in a random scope in a dimension. As to the certain properties of superpositional tensors in space, gradient, divergence, emission, interactions, as well as the periodicity are modeled, and some classical physical laws such as Euler Equation and Gaussian Law are tried to be transformed with the random factors.","PeriodicalId":399084,"journal":{"name":"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124618541","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 : 2019-11-01DOI: 10.1109/ISKE47853.2019.9170345
Yanyan Wang, Junsheng Zhang, Xiaodong Qiao
Massive scientific and technical literature has led to information overload for researchers. To obtain scientific and technical information efficiently, this paper proposes a method to organize scientific literature information with events. It aims to promoting the discovery and management of relations among scientific literature for intelligent applications. To construct the semantic link network of scientific research events, the first step is to analyze external characteristics and internal textual contents of scientific literature, and then extract information as the elements of scientific research events. Publication events, cooperation events and citation events formulate the semantic link network of scientific research events. We investigate data sources for the construction of scientific research events, and then we verify the possibility of the proposed method in the case study.
{"title":"An Event-Centric Scientific Literature Information Organization Method","authors":"Yanyan Wang, Junsheng Zhang, Xiaodong Qiao","doi":"10.1109/ISKE47853.2019.9170345","DOIUrl":"https://doi.org/10.1109/ISKE47853.2019.9170345","url":null,"abstract":"Massive scientific and technical literature has led to information overload for researchers. To obtain scientific and technical information efficiently, this paper proposes a method to organize scientific literature information with events. It aims to promoting the discovery and management of relations among scientific literature for intelligent applications. To construct the semantic link network of scientific research events, the first step is to analyze external characteristics and internal textual contents of scientific literature, and then extract information as the elements of scientific research events. Publication events, cooperation events and citation events formulate the semantic link network of scientific research events. We investigate data sources for the construction of scientific research events, and then we verify the possibility of the proposed method in the case study.","PeriodicalId":399084,"journal":{"name":"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121116097","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 : 2019-11-01DOI: 10.1109/ISKE47853.2019.9170418
Zhongmin Wang, Lin Wei, Hengshan Zhang, Tianhua Chen, Yimin Zhou
The assembly line balancing problems are significant in mass production systems. In order to solve the uncertainties that practically exist but barely mentioned in the literature,this paper proposed a mathematical model with an optimization algorithm to solve the assembly line balancing problem with uncertainty operation time. The developed model is able to work with variable number of workstations under the uncertain environment, aiming to reach the minimal number of workstation and minimize idle time for each workstation. In particular, the proposed approach first introduces the concept of protection time that closely works with the uncertain operation time.Four dominance rules and the mechanism of determining up and low bounds are subsequently put forward, which serve as the basis for the proposed branch and bound algorithm. And experimental results show the proposed work verified on a benchmark data set is able to solve the uncertainties efficiently.
{"title":"A Method Of Assembly Line Balancing Problem With Uncertain Operation Time","authors":"Zhongmin Wang, Lin Wei, Hengshan Zhang, Tianhua Chen, Yimin Zhou","doi":"10.1109/ISKE47853.2019.9170418","DOIUrl":"https://doi.org/10.1109/ISKE47853.2019.9170418","url":null,"abstract":"The assembly line balancing problems are significant in mass production systems. In order to solve the uncertainties that practically exist but barely mentioned in the literature,this paper proposed a mathematical model with an optimization algorithm to solve the assembly line balancing problem with uncertainty operation time. The developed model is able to work with variable number of workstations under the uncertain environment, aiming to reach the minimal number of workstation and minimize idle time for each workstation. In particular, the proposed approach first introduces the concept of protection time that closely works with the uncertain operation time.Four dominance rules and the mechanism of determining up and low bounds are subsequently put forward, which serve as the basis for the proposed branch and bound algorithm. And experimental results show the proposed work verified on a benchmark data set is able to solve the uncertainties efficiently.","PeriodicalId":399084,"journal":{"name":"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"154 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121522314","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 demand of Internet video multicast service and the advantages of SDN (soft defined network), a multi-factor adaptive SDN video multicast routing algorithm is proposed. The algorithm combines hop count, bandwidth and load balancing, and realizes the multicast system simulation based on this routing algorithm. The simulation results show that with the increase of the number of members in multicast group, the packet loss rate and RTT and packet-in of the controller of the whole system do not change much, and the network performance of the whole system is stable. It is suitable for solving the problem of unstable video communication effect caused by network congestion and packet loss.
{"title":"Research on a Multi-factor Adaptive SDN Video Multicast Routing","authors":"Xingyu Liu, Xueqin Yang, Wen-xian Tang, Peng Zhang","doi":"10.1109/ISKE47853.2019.9170420","DOIUrl":"https://doi.org/10.1109/ISKE47853.2019.9170420","url":null,"abstract":"With the demand of Internet video multicast service and the advantages of SDN (soft defined network), a multi-factor adaptive SDN video multicast routing algorithm is proposed. The algorithm combines hop count, bandwidth and load balancing, and realizes the multicast system simulation based on this routing algorithm. The simulation results show that with the increase of the number of members in multicast group, the packet loss rate and RTT and packet-in of the controller of the whole system do not change much, and the network performance of the whole system is stable. It is suitable for solving the problem of unstable video communication effect caused by network congestion and packet loss.","PeriodicalId":399084,"journal":{"name":"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122966067","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 : 2019-11-01DOI: 10.1109/ISKE47853.2019.9170299
Ke Li, Yufeng Yu, D. Wan, Gen Li
Continuous hydrological time series have the characteristics of randomness and mutagenicity, which reduce the accuracy of its prediction model. In this paper, a hydrological time series-deep belief network (HTS-DBN) based on the continuous restricted Boltzmann machine is proposed. The continuous Boltzmann machine can process the continuous hydrological time series better than the traditional Boltzmann machine. In addition, the number of input layer nodes and the optimal structure of the network in HTS-DBN are determined by similarity correlation method. At the same time, the LM algorithm is used to optimize the HTS-DBN model. Experiments show that HTS-DBN has better accuracy in predicting hydrological time series.
{"title":"Hydrological Time Series Prediction Model Based on Deep Belief Network","authors":"Ke Li, Yufeng Yu, D. Wan, Gen Li","doi":"10.1109/ISKE47853.2019.9170299","DOIUrl":"https://doi.org/10.1109/ISKE47853.2019.9170299","url":null,"abstract":"Continuous hydrological time series have the characteristics of randomness and mutagenicity, which reduce the accuracy of its prediction model. In this paper, a hydrological time series-deep belief network (HTS-DBN) based on the continuous restricted Boltzmann machine is proposed. The continuous Boltzmann machine can process the continuous hydrological time series better than the traditional Boltzmann machine. In addition, the number of input layer nodes and the optimal structure of the network in HTS-DBN are determined by similarity correlation method. At the same time, the LM algorithm is used to optimize the HTS-DBN model. Experiments show that HTS-DBN has better accuracy in predicting hydrological time series.","PeriodicalId":399084,"journal":{"name":"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125890981","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 : 2019-11-01DOI: 10.1109/ISKE47853.2019.9170304
Z. Yu, Zefan Cai
In this article, We try to analyze the video of soccer shooting, Where contains the key messages: position, speed and the flying curve. The curve is the most difficult message to get. K-means clustering is the common algorithm. But it needs a mass storage space and calculating time Which affects the real time performance. In the article, a feature tree model based on K-means clustering for moving object detection and recognition is put forward. The algorithm need not to build different feature clustering for different templates of soccer. (1) An union HOG feature and FLOW feature extraction method is put forward, including the character representation. (2) A K-means clustering feature construction method is put forward, Which can reduce the feature times effectively and improve the real time performance by means of feature tree construction. Moreover, after the recognition of the soccer in space coordinates, We generate the final curve in neighborhood comparison method.
{"title":"Using Feature Tree Model to Track High Speed Flying Soccer in Complicated Background","authors":"Z. Yu, Zefan Cai","doi":"10.1109/ISKE47853.2019.9170304","DOIUrl":"https://doi.org/10.1109/ISKE47853.2019.9170304","url":null,"abstract":"In this article, We try to analyze the video of soccer shooting, Where contains the key messages: position, speed and the flying curve. The curve is the most difficult message to get. K-means clustering is the common algorithm. But it needs a mass storage space and calculating time Which affects the real time performance. In the article, a feature tree model based on K-means clustering for moving object detection and recognition is put forward. The algorithm need not to build different feature clustering for different templates of soccer. (1) An union HOG feature and FLOW feature extraction method is put forward, including the character representation. (2) A K-means clustering feature construction method is put forward, Which can reduce the feature times effectively and improve the real time performance by means of feature tree construction. Moreover, after the recognition of the soccer in space coordinates, We generate the final curve in neighborhood comparison method.","PeriodicalId":399084,"journal":{"name":"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"30 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120839133","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 : 2019-11-01DOI: 10.1109/ISKE47853.2019.9170369
Mengna Gao, Jing Dong, D. Zhou, Xiaopeng Wei, Qiang Zhang
In vieiv of the remarkable achievements of convolutional neural network in the field of computer vision, We propose a speech emotion recognition algorithm based on convolution neural network and feature fusion, Which extracts features from the original speech signal and its spectrogram for recognition. From the point of vieiv of feature enhancement, the features extracted from ID-CNN and 2D-CNN tivo models are fused by dimension splicing in this algorithm, and then the fused features are sent to the 2D-CNN model again to train. This Way of feature fusion makes better use of the emotional information of speech signal in time domain and frequency domain, and gives full play to the advantages of onedimensional convolution and tivo-dimensional convolution, in the three classified emotional recognition experiments of four databases, EMODB, CASIA, IEMOCAP and CHEAVD, the recognition rates of 91.6%, 96.5%, 80.5% and 62.7% Were obtained respectively, Which are the optimal recognition results in all the algorithms We proposed.
{"title":"Speech Emotion Recognition Based on Convolutional Neural Network and Feature Fusion","authors":"Mengna Gao, Jing Dong, D. Zhou, Xiaopeng Wei, Qiang Zhang","doi":"10.1109/ISKE47853.2019.9170369","DOIUrl":"https://doi.org/10.1109/ISKE47853.2019.9170369","url":null,"abstract":"In vieiv of the remarkable achievements of convolutional neural network in the field of computer vision, We propose a speech emotion recognition algorithm based on convolution neural network and feature fusion, Which extracts features from the original speech signal and its spectrogram for recognition. From the point of vieiv of feature enhancement, the features extracted from ID-CNN and 2D-CNN tivo models are fused by dimension splicing in this algorithm, and then the fused features are sent to the 2D-CNN model again to train. This Way of feature fusion makes better use of the emotional information of speech signal in time domain and frequency domain, and gives full play to the advantages of onedimensional convolution and tivo-dimensional convolution, in the three classified emotional recognition experiments of four databases, EMODB, CASIA, IEMOCAP and CHEAVD, the recognition rates of 91.6%, 96.5%, 80.5% and 62.7% Were obtained respectively, Which are the optimal recognition results in all the algorithms We proposed.","PeriodicalId":399084,"journal":{"name":"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128111072","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 : 2019-11-01DOI: 10.1109/ISKE47853.2019.9170291
Dong Liang, Yuanfu Li
In order to solve the multi attribute decision making problem of railway location selection, a decision making model base on the comparative advantage relation between three parameter interval numbers is presented. Firstly, the quantitative and qualitative attributes in railway line selection schemes are transformed into three parameter interval numbers, and a three parameter interval number decision matrix is obtained. Secondly, the three parameter interval number decision matrix is normalized into a normalized three parameter interval number decision matrix. Thirdly, the weight of evaluation attributes are calculated by distance measure between three parameter interval numbers and a weighted normalization decision matrix is obtained. Based on the weighted normalization decision matrix, the weighted comprehensive attribute value of each scheme is calculated and ranked. Finally, an engineering example of railway location selection is illustrated to show the effectivity and feasibility of the presented model.
{"title":"A Decision Making Model Base on the Comparative Advantage Relation between Three Parameter Interval Numbers in Railway Location Selection","authors":"Dong Liang, Yuanfu Li","doi":"10.1109/ISKE47853.2019.9170291","DOIUrl":"https://doi.org/10.1109/ISKE47853.2019.9170291","url":null,"abstract":"In order to solve the multi attribute decision making problem of railway location selection, a decision making model base on the comparative advantage relation between three parameter interval numbers is presented. Firstly, the quantitative and qualitative attributes in railway line selection schemes are transformed into three parameter interval numbers, and a three parameter interval number decision matrix is obtained. Secondly, the three parameter interval number decision matrix is normalized into a normalized three parameter interval number decision matrix. Thirdly, the weight of evaluation attributes are calculated by distance measure between three parameter interval numbers and a weighted normalization decision matrix is obtained. Based on the weighted normalization decision matrix, the weighted comprehensive attribute value of each scheme is calculated and ranked. Finally, an engineering example of railway location selection is illustrated to show the effectivity and feasibility of the presented model.","PeriodicalId":399084,"journal":{"name":"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128254127","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
扫码关注我们
求助内容：
应助结果提醒方式：