Pub Date : 2014-04-26DOI: 10.1109/ICIST.2014.6920581
Ping Lai, Ruimin Lu, Yunzhi Liu
In the traditional Space-Time Adaptive Processing (STAP), adaptive algorithms require signal information so that lack real-time performance and the array processing techniques are not only of high complexity but also suffer from inadequate anti-jammer capability. In order to solve these problems, a subband blind adaptive array processing algorithm is proposed in this paper, which applies the space-time interference suppression technology to Direct Sequence Spread Spectrum (DSSS) system. For one thing, compared to the pure space-domain processing, Sub-band adaptive array (SBAA) greatly increases the freedoms of degree. For another, it also simplifies algorithm complexity relative to Tapped-delay-line adaptive array (TDLAA) structure of traditional STAP. The proposed sub-band blind adaptive array algorithm can provide higher convergence speed and better convergence accuracy with low algorithm complexity. Furthermore, the novel algorithm doesn't need training sequences, increasing the ability of tracing signal changes in real time. Simulation results show that the novel space-time interference suppression scheme exhibits a better anti-jamming performance.
{"title":"Space-time interference suppression technology based on sub-band blind adaptive array processing","authors":"Ping Lai, Ruimin Lu, Yunzhi Liu","doi":"10.1109/ICIST.2014.6920581","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920581","url":null,"abstract":"In the traditional Space-Time Adaptive Processing (STAP), adaptive algorithms require signal information so that lack real-time performance and the array processing techniques are not only of high complexity but also suffer from inadequate anti-jammer capability. In order to solve these problems, a subband blind adaptive array processing algorithm is proposed in this paper, which applies the space-time interference suppression technology to Direct Sequence Spread Spectrum (DSSS) system. For one thing, compared to the pure space-domain processing, Sub-band adaptive array (SBAA) greatly increases the freedoms of degree. For another, it also simplifies algorithm complexity relative to Tapped-delay-line adaptive array (TDLAA) structure of traditional STAP. The proposed sub-band blind adaptive array algorithm can provide higher convergence speed and better convergence accuracy with low algorithm complexity. Furthermore, the novel algorithm doesn't need training sequences, increasing the ability of tracing signal changes in real time. Simulation results show that the novel space-time interference suppression scheme exhibits a better anti-jamming performance.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126756832","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}
Tone-mapping technique which can convert high dynamic range (HDR) to low dynamic range (LDR) images provides accurately visualization of HDR images on standard LDR displays. Most of the existing tone-mapping method could not realize real time processing while preserving good visualization. Utilizing an adaptive three-section lookup table, this paper proposes an effective, high quality, real time technique to convert 12-bit images to 8-bit image which can preserve abundant details and high contrast simultaneously. Experiment results show that this method can improve the weak signals of the image greatly, and the low luminance details can be observed distinctly on an 8-bit monitor.
{"title":"A novel real-time method for high dynamic range image tone mapping","authors":"Qingquan Wu, Zuofeng Zhou, Hanbing Leng, Jianzhong Cao, Jihong Wang, Zhendong Gong, Xinming Fan, Huinan Guo","doi":"10.1109/ICIST.2014.6920510","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920510","url":null,"abstract":"Tone-mapping technique which can convert high dynamic range (HDR) to low dynamic range (LDR) images provides accurately visualization of HDR images on standard LDR displays. Most of the existing tone-mapping method could not realize real time processing while preserving good visualization. Utilizing an adaptive three-section lookup table, this paper proposes an effective, high quality, real time technique to convert 12-bit images to 8-bit image which can preserve abundant details and high contrast simultaneously. Experiment results show that this method can improve the weak signals of the image greatly, and the low luminance details can be observed distinctly on an 8-bit monitor.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122286458","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 : 2014-04-26DOI: 10.1109/ICIST.2014.6920407
Bo Lu, X. Duan, Cun-rui Wang
Image classification is an important task in content-based image retrieval, which can be regarded as an intermediate component to handle large-scale image datasets for improving the accuracy of image retrieval. Traditional image classification methods generally utilize Support Vector Machines (SVM) as image classifier. However, there are several drawbacks of using SVM, such as the high computational cost and large number of parameters to be optimized. In this paper we propose an Extreme Learning Machine (ELM) based Multi-modality Classifier Combination Framework (MCCF) to improve the accuracy of image classification. In this framework: (i) three ELM classifiers are trained by exploring three kinds of visual features respectively, (ii) a probability based fusion method is then proposed to combine the prediction results of each ELM classifier. Experiments on the widely used TRECVID datasets demonstrate that our approach can effectively improve the accuracy of image classification and achieve performance at extremely high speed.
{"title":"A novel approach for image classification based on extreme learning machine","authors":"Bo Lu, X. Duan, Cun-rui Wang","doi":"10.1109/ICIST.2014.6920407","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920407","url":null,"abstract":"Image classification is an important task in content-based image retrieval, which can be regarded as an intermediate component to handle large-scale image datasets for improving the accuracy of image retrieval. Traditional image classification methods generally utilize Support Vector Machines (SVM) as image classifier. However, there are several drawbacks of using SVM, such as the high computational cost and large number of parameters to be optimized. In this paper we propose an Extreme Learning Machine (ELM) based Multi-modality Classifier Combination Framework (MCCF) to improve the accuracy of image classification. In this framework: (i) three ELM classifiers are trained by exploring three kinds of visual features respectively, (ii) a probability based fusion method is then proposed to combine the prediction results of each ELM classifier. Experiments on the widely used TRECVID datasets demonstrate that our approach can effectively improve the accuracy of image classification and achieve performance at extremely high speed.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116695417","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 : 2014-04-26DOI: 10.1109/ICIST.2014.6920592
Dihong Gong, Na Li, Zhifeng Li, Y. Qiao
Biometric person recognition has received a lot of attention in recent years due to the growing security demands in commercial and law enforcement applications. However, using a single biometric has several problems. In order to alleviate these problems, multi-modal biometric systems are proposed by combining various biometric modalities to improve the robustness of person authentication. A typical application is to combine both audio and face for multimodal person recognition, since either face or voice is among the most natural biometrics that people use to identify each other. In this paper, a novel approach called multi-feature subspace analysis (MFSA) is proposed for audio-video based biometric person recognition. In the MFSA framework, each face sequence or utterance is represented with a fix-length feature vector, and then subspace analysis method is performed on a collection of random subspaces to construct an ensemble of classifiers for robust recognition. Experiments on the XM2VTSDB corpus sufficiently validate the feasibility and effectiveness of our new approach.
{"title":"Multi-feature subspace analysis for audio-vidoe based multi-modal person recognition","authors":"Dihong Gong, Na Li, Zhifeng Li, Y. Qiao","doi":"10.1109/ICIST.2014.6920592","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920592","url":null,"abstract":"Biometric person recognition has received a lot of attention in recent years due to the growing security demands in commercial and law enforcement applications. However, using a single biometric has several problems. In order to alleviate these problems, multi-modal biometric systems are proposed by combining various biometric modalities to improve the robustness of person authentication. A typical application is to combine both audio and face for multimodal person recognition, since either face or voice is among the most natural biometrics that people use to identify each other. In this paper, a novel approach called multi-feature subspace analysis (MFSA) is proposed for audio-video based biometric person recognition. In the MFSA framework, each face sequence or utterance is represented with a fix-length feature vector, and then subspace analysis method is performed on a collection of random subspaces to construct an ensemble of classifiers for robust recognition. Experiments on the XM2VTSDB corpus sufficiently validate the feasibility and effectiveness of our new approach.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116739591","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 : 2014-04-26DOI: 10.1109/ICIST.2014.6920579
Huimin Wang, Qian Geng, Zhaowei Qiao
Particle swarm optimization (PSO) has made significant progress and has been widely applied to computer science and engineering. Since its introduction, the parameter tuning of PSO has always been a hot topic. As a robust design method, the Taguchi method is known as a good tool in designing parameters. Thus the Taguchi method is adopted to analyze the effect of inertia weight, acceleration coefficients, population size, fitness evaluations, and population topology on PSO, and to identify the best settings of them for different optimization problems. The results of benchmark functions show that the optimum parameter settings depend on the benchmarks, and all the functions obtain their optimum solutions after parameter tuning. Good result are also achieved when dealing with the optimization design of a Halbach permanent magnet motor, which indicates that the PSO with best parameter settings identified by the Taguchi method is more suitable to such actual engineering problem.
{"title":"Parameter tuning of particle swarm optimization by using Taguchi method and its application to motor design","authors":"Huimin Wang, Qian Geng, Zhaowei Qiao","doi":"10.1109/ICIST.2014.6920579","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920579","url":null,"abstract":"Particle swarm optimization (PSO) has made significant progress and has been widely applied to computer science and engineering. Since its introduction, the parameter tuning of PSO has always been a hot topic. As a robust design method, the Taguchi method is known as a good tool in designing parameters. Thus the Taguchi method is adopted to analyze the effect of inertia weight, acceleration coefficients, population size, fitness evaluations, and population topology on PSO, and to identify the best settings of them for different optimization problems. The results of benchmark functions show that the optimum parameter settings depend on the benchmarks, and all the functions obtain their optimum solutions after parameter tuning. Good result are also achieved when dealing with the optimization design of a Halbach permanent magnet motor, which indicates that the PSO with best parameter settings identified by the Taguchi method is more suitable to such actual engineering problem.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127020560","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 : 2014-04-26DOI: 10.1109/ICIST.2014.6920386
Xuan Xiao, Zi Liu, Wangren Qiu
Post-translational modifications (PTMs) play vital roles in most of the protein maturation, structural stabilization and function. How to predict protein' PTMs types is an important and challenging problem. Most of the existing approaches can only be used to recognize single-label PTMs type. By introducing the multi-labeled K-Nearest-Neighbor algorithm, a new predictor has been proposed which can be used to dispose of the proteins containing both single and multi-label PTMs type. As a result that the 10-fold crosses validation was implemented on a benchmark data set of proteins which were divided into the following 4 types: (1) methylation, (2) nitrosylation, (3) acetylation, (4) phosphorylation, where many proteins belong to two or more types. For such a complex system, the outcomes achieved by our predictor for the six indices were quite promising, anticipated the predictor may become a complementary tool in this area.
{"title":"Using multi-label algorithm to predict the post-translation modification types of proteins","authors":"Xuan Xiao, Zi Liu, Wangren Qiu","doi":"10.1109/ICIST.2014.6920386","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920386","url":null,"abstract":"Post-translational modifications (PTMs) play vital roles in most of the protein maturation, structural stabilization and function. How to predict protein' PTMs types is an important and challenging problem. Most of the existing approaches can only be used to recognize single-label PTMs type. By introducing the multi-labeled K-Nearest-Neighbor algorithm, a new predictor has been proposed which can be used to dispose of the proteins containing both single and multi-label PTMs type. As a result that the 10-fold crosses validation was implemented on a benchmark data set of proteins which were divided into the following 4 types: (1) methylation, (2) nitrosylation, (3) acetylation, (4) phosphorylation, where many proteins belong to two or more types. For such a complex system, the outcomes achieved by our predictor for the six indices were quite promising, anticipated the predictor may become a complementary tool in this area.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115690554","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 : 2014-04-26DOI: 10.1109/ICIST.2014.6920327
Huaikun Xiang, Antao Ming
Bus passenger flow collection technology is a subject urgently to be solved in current city intelligent transport system construction. By using self-developed multi-sensor array devices to collect the foot type data of passengers getting on and off, a kind of bus passenger flow intelligent recognition and statistical algorithms based on motion vector tracking is researched and proposed. The basic idea is based on establishing the motion vector model, determining the optimal solution of motion vector by advance prediction method, similarity criterion and dynamic search strategy according to the law of human body kinematics, tracking the motion process of passengers dynamically, ultimately, determining the movement direction of the passengers. The actual test results show that this algorithm can accurately and effectively deal with all kinds of complicated conditions.
{"title":"A study of the city bus passenger flow intelligent statistical algorithm based on motion vector tracking","authors":"Huaikun Xiang, Antao Ming","doi":"10.1109/ICIST.2014.6920327","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920327","url":null,"abstract":"Bus passenger flow collection technology is a subject urgently to be solved in current city intelligent transport system construction. By using self-developed multi-sensor array devices to collect the foot type data of passengers getting on and off, a kind of bus passenger flow intelligent recognition and statistical algorithms based on motion vector tracking is researched and proposed. The basic idea is based on establishing the motion vector model, determining the optimal solution of motion vector by advance prediction method, similarity criterion and dynamic search strategy according to the law of human body kinematics, tracking the motion process of passengers dynamically, ultimately, determining the movement direction of the passengers. The actual test results show that this algorithm can accurately and effectively deal with all kinds of complicated conditions.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115019370","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 : 2014-04-26DOI: 10.1109/ICIST.2014.6920533
Hongyan Zhang, Xiaoming Yu, Yi Zhai
The hierarchical clustering algorithm is one of the clustering algorithms used widely. The typical character of the hierarchical clustering algorithm is to find the “shortest” patterns. But it is not to ensure that to find the global optimal result by adding the shortest pattern each time. In this paper, we use DNA computing to solve this problem. Because during the ligation of the DNA strands, the bio-reaction's character is to combine all the possible single DNA strands into the shortest double DNA strand. We propose a DNA model with the coding strategy and DNA computing algorithm for the hierarchical clustering problem. we use this algorithm to solve the real problem - the retailer's region partition problem. Although we use the computer to simulate the bio-chemical reactions, we will execute this algorithm in the biological lab in the near future.
{"title":"A DNA model for solving the hierarchical clustering problem","authors":"Hongyan Zhang, Xiaoming Yu, Yi Zhai","doi":"10.1109/ICIST.2014.6920533","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920533","url":null,"abstract":"The hierarchical clustering algorithm is one of the clustering algorithms used widely. The typical character of the hierarchical clustering algorithm is to find the “shortest” patterns. But it is not to ensure that to find the global optimal result by adding the shortest pattern each time. In this paper, we use DNA computing to solve this problem. Because during the ligation of the DNA strands, the bio-reaction's character is to combine all the possible single DNA strands into the shortest double DNA strand. We propose a DNA model with the coding strategy and DNA computing algorithm for the hierarchical clustering problem. we use this algorithm to solve the real problem - the retailer's region partition problem. Although we use the computer to simulate the bio-chemical reactions, we will execute this algorithm in the biological lab in the near future.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123307969","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 : 2014-04-26DOI: 10.1109/ICIST.2014.6920330
Jianzhao Zhang, Hang-sheng Zhao, Yongxiang Liu, Long Cao
Cognitive radio (CR) is a promising technology that enables opportunistic using of the unused spectrum to alleviate the spectrum scarcity problem. However, as the interference to licensed spectrum owners needs to be strictly controlled, CR enabled users (CRs) should vacate the using channel immediately on detecting licensed users activity and the end to end performance may be seriously degraded. In this paper, we propose a robust routing scheme for cognitive radio ad hoc networks that can accommodate to the spectrum availability variation and keep stable to guarantee the end to end performance of CRs. The path stability is modeled considering both available channel numbers and channel characteristic along the path. The paths beyond a robust threshold are regarded to be feasible and the one with maximal throughput is chosen for transmission. Simulation results show that the proposed scheme performs much better than other existing protocols in terms of route throughput and stability maintenance.
{"title":"Maximal throughput routing with stablility constraint in cognitive radio ad hoc networks","authors":"Jianzhao Zhang, Hang-sheng Zhao, Yongxiang Liu, Long Cao","doi":"10.1109/ICIST.2014.6920330","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920330","url":null,"abstract":"Cognitive radio (CR) is a promising technology that enables opportunistic using of the unused spectrum to alleviate the spectrum scarcity problem. However, as the interference to licensed spectrum owners needs to be strictly controlled, CR enabled users (CRs) should vacate the using channel immediately on detecting licensed users activity and the end to end performance may be seriously degraded. In this paper, we propose a robust routing scheme for cognitive radio ad hoc networks that can accommodate to the spectrum availability variation and keep stable to guarantee the end to end performance of CRs. The path stability is modeled considering both available channel numbers and channel characteristic along the path. The paths beyond a robust threshold are regarded to be feasible and the one with maximal throughput is chosen for transmission. Simulation results show that the proposed scheme performs much better than other existing protocols in terms of route throughput and stability maintenance.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124755323","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 : 2014-04-26DOI: 10.1109/ICIST.2014.6920583
Ganfeng Qiang, Lijun Yue, Fengqi Yu
In this paper, a novel method of background subtraction and update is proposed for indoor surveillance. It is based on the hypothesis that the foreground pixel's luminance and chroma fluctuate due to the movement of object. Different from the previous algorithms, this method takes each pixel's time continuity in video sequence into consideration. It still works well even the background is visible for a short time. The experimental results show that the proposed method has good performance for indoor scenes.
{"title":"A novel method of background subtraction for indoor surveillance","authors":"Ganfeng Qiang, Lijun Yue, Fengqi Yu","doi":"10.1109/ICIST.2014.6920583","DOIUrl":"https://doi.org/10.1109/ICIST.2014.6920583","url":null,"abstract":"In this paper, a novel method of background subtraction and update is proposed for indoor surveillance. It is based on the hypothesis that the foreground pixel's luminance and chroma fluctuate due to the movement of object. Different from the previous algorithms, this method takes each pixel's time continuity in video sequence into consideration. It still works well even the background is visible for a short time. The experimental results show that the proposed method has good performance for indoor scenes.","PeriodicalId":306383,"journal":{"name":"2014 4th IEEE International Conference on Information Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123059791","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
扫码关注我们
求助内容：
应助结果提醒方式：