Pub Date : 2015-12-03DOI: 10.1109/WCSP.2015.7340968
Liujun Hu, Jiliang Zhang, Yang Wang, Liqin Ding, Shijun Chen, Lujuan Ma
Multi-Input Multi-Output (MIMO) scheme at 6.06.1GHz is one of the enabling technologies for the next generation mobile communications. To compare the spatial characteristics of MIMO channel at 6.05GHz with those at 2.45GHz, an extensive MIMO channel measurement is performed at both frequency bands under typical classroom environment with channel sounder based on vector network analyzer. Spatial correlations at both frequency bands are analyzed from the measured data in different propagation conditions, including Non Line-of-Sight (NLOS) and Line-of-Sight (LOS) propagation. Measurement shows that, there are significantly distinctions between spatial correlations at 6.05GHz and 2.45GHz. After that, Capacity results of the experiments are discussed.
{"title":"Spatial characterization of indoor MIMO radio channel at both 6.05GHz and 2.45GHz based on measurement","authors":"Liujun Hu, Jiliang Zhang, Yang Wang, Liqin Ding, Shijun Chen, Lujuan Ma","doi":"10.1109/WCSP.2015.7340968","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7340968","url":null,"abstract":"Multi-Input Multi-Output (MIMO) scheme at 6.06.1GHz is one of the enabling technologies for the next generation mobile communications. To compare the spatial characteristics of MIMO channel at 6.05GHz with those at 2.45GHz, an extensive MIMO channel measurement is performed at both frequency bands under typical classroom environment with channel sounder based on vector network analyzer. Spatial correlations at both frequency bands are analyzed from the measured data in different propagation conditions, including Non Line-of-Sight (NLOS) and Line-of-Sight (LOS) propagation. Measurement shows that, there are significantly distinctions between spatial correlations at 6.05GHz and 2.45GHz. After that, Capacity results of the experiments are discussed.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122315473","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341112
Hua Yang, Hang Zhang, Liu Yang
In this paper, a new gradient optimized blind source separation algorithm (GOA) which aims at improving the convergence performance is proposed. This algorithm modifies the gradient of cost function to make the iteration process of separation matrix closer to its change pattern. To be more specific, by adding the difference value between current time gradient and previous time gradient to the adaptive iterations of separation matrix, the proposed algorithm effectively improves convergence rate. Simulation experiment results show that the GOA has faster convergence rate when compared with the traditional momentum EASI algorithm. In the small step size conditions, the advantage of GOA is even more obvious.
{"title":"Gradient optimized blind sources separation algorithm","authors":"Hua Yang, Hang Zhang, Liu Yang","doi":"10.1109/WCSP.2015.7341112","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341112","url":null,"abstract":"In this paper, a new gradient optimized blind source separation algorithm (GOA) which aims at improving the convergence performance is proposed. This algorithm modifies the gradient of cost function to make the iteration process of separation matrix closer to its change pattern. To be more specific, by adding the difference value between current time gradient and previous time gradient to the adaptive iterations of separation matrix, the proposed algorithm effectively improves convergence rate. Simulation experiment results show that the GOA has faster convergence rate when compared with the traditional momentum EASI algorithm. In the small step size conditions, the advantage of GOA is even more obvious.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130049951","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341164
Yujin Zhou, Anfeng Sun, Jun Zhou, Ya Shen
This paper presents a compact multi-channel receiver front-end using system-in-package (SiP) integration technology. In the circuit linking design, a power divider network is introduced to keep the amplitude consistency of the local oscillator (LO) signal for each channel. The embedded low temperature co-fired ceramic (LTCC) RF filter equipped with two transmission zeros is developed by using substrate integrated waveguide (SIW) technology and its design and tuning techniques are discussed. Based on a viable LTCC SiP structure and micro-packaging technology, the receiver front-end module is fabricated and all the functional devices are integrated on a single substrate. The measured results indicate that the module has high selectivity as well as the great conversion gain and low noise figure of 50 dB and 2.8 dB respectively. The overall size of the three-channel module is about 36 mm ×23 mm × 3 mm.
本文采用系统级封装(SiP)集成技术设计了一种紧凑的多通道接收机前端。在电路连接设计中，引入了功率分配器网络来保持各通道本振(LO)信号幅度的一致性。采用衬底集成波导(SIW)技术，研制了具有两个传输零点的嵌入式低温共烧陶瓷(LTCC)射频滤波器，并对其设计和调谐技术进行了讨论。基于可行的LTCC SiP结构和微封装技术，制作了接收器前端模块，并将所有功能器件集成在单一基板上。测试结果表明，该模块具有高选择性、高转换增益和低噪声系数，分别为50 dB和2.8 dB。三通道模块的整体尺寸约为36mm ×23 mm × 3mm。
{"title":"A compact multi-channel receiver front-end using SiP integration technology on LTCC substrate for wireless communications","authors":"Yujin Zhou, Anfeng Sun, Jun Zhou, Ya Shen","doi":"10.1109/WCSP.2015.7341164","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341164","url":null,"abstract":"This paper presents a compact multi-channel receiver front-end using system-in-package (SiP) integration technology. In the circuit linking design, a power divider network is introduced to keep the amplitude consistency of the local oscillator (LO) signal for each channel. The embedded low temperature co-fired ceramic (LTCC) RF filter equipped with two transmission zeros is developed by using substrate integrated waveguide (SIW) technology and its design and tuning techniques are discussed. Based on a viable LTCC SiP structure and micro-packaging technology, the receiver front-end module is fabricated and all the functional devices are integrated on a single substrate. The measured results indicate that the module has high selectivity as well as the great conversion gain and low noise figure of 50 dB and 2.8 dB respectively. The overall size of the three-channel module is about 36 mm ×23 mm × 3 mm.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130113344","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 this paper, we consider amplify-and-forward cognitive relay networks in a spectrum-sharing environment. We present the performance analysis under two different partial relay selection (PRS) schemes, namely source-relay partial relay selection (SR-PRS) and relay-destination partial relay selection (RD-PRS). Specifically, we consider interference power constraint on secondary source and relay nodes, and transmit power constraint on secondary relay nodes. In this context, the exact outage probability is derived over Rayleigh fading channels. Our results show that the system performance is dominated by the power constraints and the number of secondary relay nodes. Moreover, we provide simulation results to compare the two different PRS schemes. Finally, Monte Carlo simulations are shown to validate the accuracy of the analytical results.
{"title":"Outage performance analysis of amplify-and-forward cognitive relay networks with partial relay selection","authors":"Xinyi Wang, Yuanxin Sun, Huogen Yu, Ting Feng, Wanbin Tang, Y. Zhang","doi":"10.1109/WCSP.2015.7341108","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341108","url":null,"abstract":"In this paper, we consider amplify-and-forward cognitive relay networks in a spectrum-sharing environment. We present the performance analysis under two different partial relay selection (PRS) schemes, namely source-relay partial relay selection (SR-PRS) and relay-destination partial relay selection (RD-PRS). Specifically, we consider interference power constraint on secondary source and relay nodes, and transmit power constraint on secondary relay nodes. In this context, the exact outage probability is derived over Rayleigh fading channels. Our results show that the system performance is dominated by the power constraints and the number of secondary relay nodes. Moreover, we provide simulation results to compare the two different PRS schemes. Finally, Monte Carlo simulations are shown to validate the accuracy of the analytical results.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"22 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114038782","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341234
Haipei Sun, Liusheng Huang, Long Chen, Hongli Xu, Jianxin Wang
The Software Defined Network (SDN) is a new networking paradigm, which separates the control plane and data plane. In this paper, we study two efficient large flow scheduling problems using SDN. We firstly present problem definitions, then we propose two algorithms based on Minimize-Cost Maximize-Flow (MCMF) model. One is for static model and the other for dynamic model. We show how to determine the undetermined factors and then how to use those factors to design efficient algorithms. Simulation results demonstrates the effectiveness of our proposed algorithms.
{"title":"A solution of splittable large flow scheduling based on MCMF in software defined network","authors":"Haipei Sun, Liusheng Huang, Long Chen, Hongli Xu, Jianxin Wang","doi":"10.1109/WCSP.2015.7341234","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341234","url":null,"abstract":"The Software Defined Network (SDN) is a new networking paradigm, which separates the control plane and data plane. In this paper, we study two efficient large flow scheduling problems using SDN. We firstly present problem definitions, then we propose two algorithms based on Minimize-Cost Maximize-Flow (MCMF) model. One is for static model and the other for dynamic model. We show how to determine the undetermined factors and then how to use those factors to design efficient algorithms. Simulation results demonstrates the effectiveness of our proposed algorithms.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128574123","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 this paper, we investigate the capacity offloading over unlicensed band for two-tier dual-mode small cell networks. We formulate this problem as a Stackelberg game. Specifically, the macro base station (MBS) is modeled as leader and small base stations (SBSs) are followers. MBS adopts a traffic flow pricing mechanism and broadcasts the price information to all SBSs firstly, then each SBS allocates the traffic load in licensed and unlicensed band via appropriate power allocation in the sequel, considering the traffic flow payment charged by MBS in licensed band. Then, we propose two hierarchical learning schemes based on Q-learning algorithm. Simulation results show the effectiveness of the proposed schemes.
{"title":"Capacity offloading in two-tier small cell networks over unlicensed band: A hierarchical learning framework","authors":"Youming Sun, Hongxiang Shao, Junfei Qiu, Jian Zhang, Fenggang Sun, S. Feng","doi":"10.1109/WCSP.2015.7341137","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341137","url":null,"abstract":"In this paper, we investigate the capacity offloading over unlicensed band for two-tier dual-mode small cell networks. We formulate this problem as a Stackelberg game. Specifically, the macro base station (MBS) is modeled as leader and small base stations (SBSs) are followers. MBS adopts a traffic flow pricing mechanism and broadcasts the price information to all SBSs firstly, then each SBS allocates the traffic load in licensed and unlicensed band via appropriate power allocation in the sequel, considering the traffic flow payment charged by MBS in licensed band. Then, we propose two hierarchical learning schemes based on Q-learning algorithm. Simulation results show the effectiveness of the proposed schemes.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128687752","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341089
Ge Chen, Songjun Ma, Weijie Wu, Xinbing Wang
Nowadays large amounts of data on peoples' online activities, especially web-browsing data, have become available. Exploitation on such data can benefit a lot of real-life applications, such as user behavior identification, online customers classification and targeted advertisement. However, how to extract features on user behaviors from large amount of time series data is still a challenge due to its high complexity. In this work, we study the problem of inferring users' instantaneous actions from their sequential online-shopping data. We propose a graphical hidden state model based on statistical features and integrate all available information sources to simulate the decision making process. Experimental results show that the proposed algorithm lead to nearly 30% of improvement on the million-clicks data sets.
{"title":"Large-scale online sequential behavior analysis with latent graphical model","authors":"Ge Chen, Songjun Ma, Weijie Wu, Xinbing Wang","doi":"10.1109/WCSP.2015.7341089","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341089","url":null,"abstract":"Nowadays large amounts of data on peoples' online activities, especially web-browsing data, have become available. Exploitation on such data can benefit a lot of real-life applications, such as user behavior identification, online customers classification and targeted advertisement. However, how to extract features on user behaviors from large amount of time series data is still a challenge due to its high complexity. In this work, we study the problem of inferring users' instantaneous actions from their sequential online-shopping data. We propose a graphical hidden state model based on statistical features and integrate all available information sources to simulate the decision making process. Experimental results show that the proposed algorithm lead to nearly 30% of improvement on the million-clicks data sets.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134462287","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341015
Yulong Xu, Yafei Zhang, Jiabao Wang, Yang Li, Hang Li
Robust scale calculation is a challenging problem in visual object tracking. Most state-of-the-art trackers fail to handle large scale variations in complex image sequences. This paper propose a novel approach for robust scale calculation in a tracking-by-detection framework. The proposed approach divides the target into four patches and computes the scale factor by finding the maximum response position of each patch via kernelized correlation filter. Experiments are performed on 20 sequences with scale variations in the recent benchmark evaluation. And the results show that our method outperforms state-of-the-art tracking methods while operating in real-time.
{"title":"Patch-based scale calculation for visual tracking","authors":"Yulong Xu, Yafei Zhang, Jiabao Wang, Yang Li, Hang Li","doi":"10.1109/WCSP.2015.7341015","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341015","url":null,"abstract":"Robust scale calculation is a challenging problem in visual object tracking. Most state-of-the-art trackers fail to handle large scale variations in complex image sequences. This paper propose a novel approach for robust scale calculation in a tracking-by-detection framework. The proposed approach divides the target into four patches and computes the scale factor by finding the maximum response position of each patch via kernelized correlation filter. Experiments are performed on 20 sequences with scale variations in the recent benchmark evaluation. And the results show that our method outperforms state-of-the-art tracking methods while operating in real-time.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133908727","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341208
Lin Cheng, Jun Zheng, Jie Xiao
This paper considers the dynamic downlink spectrum resource allocation problem in dense small cell networks. To address the problem, we propose a distributed downlink resource allocation (DDRA) algorithm, which allows each base station to perform resource allocation for its users in a distributed manner. To support the DDRA algorithm, each base station needs to maintain a couple of interference tables, SITable and WITable, which are used to store those base stations that have a strong interference and a weak interference to each user in the corresponding cell in each timeslot, respectively. Meanwhile, it also needs to maintain a couple of resource status tables, SRSTable and WRSTable, which are used to store the RBs that have been allocated by those base stations contained in the SITable and WITable in each timeslot, respectively. Based on the resource status tables, each base station performs resource block (RB) allocation for its users. For each new user, those RBs that would cause a strong interference are not considered in allocation. Only those RBs that would not cause any interference or only cause a weak interference are considered. Simulation results show that the proposed DDRA algorithm can significantly increase the system capacity as compared to an existing resource allocation algorithm.
{"title":"A distributed downlink resource allocation algorithm for dense small cell networks","authors":"Lin Cheng, Jun Zheng, Jie Xiao","doi":"10.1109/WCSP.2015.7341208","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341208","url":null,"abstract":"This paper considers the dynamic downlink spectrum resource allocation problem in dense small cell networks. To address the problem, we propose a distributed downlink resource allocation (DDRA) algorithm, which allows each base station to perform resource allocation for its users in a distributed manner. To support the DDRA algorithm, each base station needs to maintain a couple of interference tables, SITable and WITable, which are used to store those base stations that have a strong interference and a weak interference to each user in the corresponding cell in each timeslot, respectively. Meanwhile, it also needs to maintain a couple of resource status tables, SRSTable and WRSTable, which are used to store the RBs that have been allocated by those base stations contained in the SITable and WITable in each timeslot, respectively. Based on the resource status tables, each base station performs resource block (RB) allocation for its users. For each new user, those RBs that would cause a strong interference are not considered in allocation. Only those RBs that would not cause any interference or only cause a weak interference are considered. Simulation results show that the proposed DDRA algorithm can significantly increase the system capacity as compared to an existing resource allocation algorithm.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133168037","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341227
Che-Wei Wen, Jun Zheng
This paper considers energy efficiency of roadside units (RSUs) in sparse vehicular networks and proposes a simple but effective on/off scheduling mechanism for reducing power consumption of an RSU. With the proposed on/off scheduling mechanism, if there is no request received from vehicles, an RSU works alternately between ON and OFF in a periodic manner. If a request is received from a vehicle during the ON state, the RSU will extend its ON state for a basic ON period. Otherwise, if a request arrives during the OFF state, the request will be dropped. An analytical model is derived to estimate the performance of the proposed scheduling mechanism in terms of the request acceptance probability and energy efficiency of an RSU. Simulation results are also presented to verify the accuracy of the derived analytical model.
{"title":"An RSU on/off scheduling mechanism for energy efficiency in sparse vehicular networks","authors":"Che-Wei Wen, Jun Zheng","doi":"10.1109/WCSP.2015.7341227","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341227","url":null,"abstract":"This paper considers energy efficiency of roadside units (RSUs) in sparse vehicular networks and proposes a simple but effective on/off scheduling mechanism for reducing power consumption of an RSU. With the proposed on/off scheduling mechanism, if there is no request received from vehicles, an RSU works alternately between ON and OFF in a periodic manner. If a request is received from a vehicle during the ON state, the RSU will extend its ON state for a basic ON period. Otherwise, if a request arrives during the OFF state, the request will be dropped. An analytical model is derived to estimate the performance of the proposed scheduling mechanism in terms of the request acceptance probability and energy efficiency of an RSU. Simulation results are also presented to verify the accuracy of the derived analytical model.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133513907","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
扫码关注我们
求助内容：
应助结果提醒方式：