Pub Date : 2009-09-01DOI: 10.1109/YCICT.2009.5382394
Lan Shao, Wenbo Wang, Li Wang, Yicheng Lin, Yuexing Peng
In this paper, an adaptive distributed space-time block code (ADSTBC) with linear decoding complexity is proposed. Within a group of candidate minimum-decoding-complexity quasi-orthogonal STBC (MDC-QO-STBC) codewords obtained by changing the row order of a basic one, the codeword that has minimum absolute value of interference between real symbols (IRS) in its equivalent channel correlation matrix is optimal and adopted by ADSTBC. In addition, for the optimal codeword's IRS absolute value is small enough to be ignored, linear decoding can achieve the performance of single complex symbol maximum-likelihood decoding, which is employed by MDC-QO-STBC, thus the decoding complexity is significantly reduced. The simulation results when the cooperative relays number is 4 and 3 both show the superiority of ASTBC over the normal DSTBC in the block error ratio performance and decoding complexity as well.
{"title":"Adaptive distributed space-time block code with linear decoding complexity","authors":"Lan Shao, Wenbo Wang, Li Wang, Yicheng Lin, Yuexing Peng","doi":"10.1109/YCICT.2009.5382394","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382394","url":null,"abstract":"In this paper, an adaptive distributed space-time block code (ADSTBC) with linear decoding complexity is proposed. Within a group of candidate minimum-decoding-complexity quasi-orthogonal STBC (MDC-QO-STBC) codewords obtained by changing the row order of a basic one, the codeword that has minimum absolute value of interference between real symbols (IRS) in its equivalent channel correlation matrix is optimal and adopted by ADSTBC. In addition, for the optimal codeword's IRS absolute value is small enough to be ignored, linear decoding can achieve the performance of single complex symbol maximum-likelihood decoding, which is employed by MDC-QO-STBC, thus the decoding complexity is significantly reduced. The simulation results when the cooperative relays number is 4 and 3 both show the superiority of ASTBC over the normal DSTBC in the block error ratio performance and decoding complexity as well.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128466743","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382460
Chuanfu Xu, Yonggang Che, Jianbin Fang, Zhenghua Wang
In parallel performance simulation of parallel systems, a large amount of Logic Processes (LP) must be mapped to relatively small number of Physical Elements (PE). Previous researches have shown that different mapping schemes could result in significant variation in the whole parallel simulation cost. In this paper, we propose, implement, and evaluate a Minimum Communication-guided Mapping (MiniCoM) scheme for large-scale trace-driven parallel performance simulation. Guided by extracted information about interactions among LPs from previously generated traces, MiniCoM can map some most frequently interacted LPs to the same PE while trying to keep load balance between PEs. The mapping aims to minimize realistic communications among PEs which may run on different nodes of host systems with large inter-node latency. We use BigSim simulator and two target programs to evaluate MiniCoM. Our results show that MiniCoM is more efficient than blocked mapping adopted by BigSim: it can reduce the total parallel simulation runtime by up to 49%.
{"title":"Towards efficient mapping in large-scale trace-driven parallel performance simulation","authors":"Chuanfu Xu, Yonggang Che, Jianbin Fang, Zhenghua Wang","doi":"10.1109/YCICT.2009.5382460","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382460","url":null,"abstract":"In parallel performance simulation of parallel systems, a large amount of Logic Processes (LP) must be mapped to relatively small number of Physical Elements (PE). Previous researches have shown that different mapping schemes could result in significant variation in the whole parallel simulation cost. In this paper, we propose, implement, and evaluate a Minimum Communication-guided Mapping (MiniCoM) scheme for large-scale trace-driven parallel performance simulation. Guided by extracted information about interactions among LPs from previously generated traces, MiniCoM can map some most frequently interacted LPs to the same PE while trying to keep load balance between PEs. The mapping aims to minimize realistic communications among PEs which may run on different nodes of host systems with large inter-node latency. We use BigSim simulator and two target programs to evaluate MiniCoM. Our results show that MiniCoM is more efficient than blocked mapping adopted by BigSim: it can reduce the total parallel simulation runtime by up to 49%.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127949038","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382373
Yicheng Lin, Wenbo Wang, Jiong Shi, Li Wang, Lan Shao
In this paper, we study the resource allocation problem in the downlink of an OFDMA system. Taking into account the constraint that each user can be assigned only one modulation and coding scheme (MCS), our goal is to maximize the system utility, which can be either the sum rate of users or certain fairness metric. The joint subcarrier, rate, and power allocation problem is formulated, and a straightforward suboptimal algorithm is proposed to solve this problem efficiently. Through computer simulation, our proposed algorithm is verified to be better in performance compared to the existing ones.
{"title":"Resource allocation for OFDMA downlink with per-user MCS constraint","authors":"Yicheng Lin, Wenbo Wang, Jiong Shi, Li Wang, Lan Shao","doi":"10.1109/YCICT.2009.5382373","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382373","url":null,"abstract":"In this paper, we study the resource allocation problem in the downlink of an OFDMA system. Taking into account the constraint that each user can be assigned only one modulation and coding scheme (MCS), our goal is to maximize the system utility, which can be either the sum rate of users or certain fairness metric. The joint subcarrier, rate, and power allocation problem is formulated, and a straightforward suboptimal algorithm is proposed to solve this problem efficiently. Through computer simulation, our proposed algorithm is verified to be better in performance compared to the existing ones.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127186797","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382414
Jianjun Zhang, Lixiang Sun, Hong Yuan
In GPS signal indoor positioning system, the signal intensity received by the different channels of receiver are diverse when GPS signal penetrate buildings. In the process of weak signal acquisition, the cross correlation interference between the strong and weak signal will lead to the decrease of the signal to noise ratio of weak signal. However, it is difficult to assess the attenuation degree. According to the crosscorrelation between characteristics of GPS satellite signals, the equivalent carrier to noise ratio analysis method based on the spectral separation coefficient is proposed, The attenuation degree of signal carrier to noise ratio caused by the strong interferential signals with the changing Doppler shift is derived, which provides theoretical basis for assessing the influence of strong interferential signal on weak signal. Analysis of theoretical value and simulation results verify the accuracy of the proposed method.
{"title":"Assessment and research on the Self-Interference of GPS weak signal acquisition in indoor location environment","authors":"Jianjun Zhang, Lixiang Sun, Hong Yuan","doi":"10.1109/YCICT.2009.5382414","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382414","url":null,"abstract":"In GPS signal indoor positioning system, the signal intensity received by the different channels of receiver are diverse when GPS signal penetrate buildings. In the process of weak signal acquisition, the cross correlation interference between the strong and weak signal will lead to the decrease of the signal to noise ratio of weak signal. However, it is difficult to assess the attenuation degree. According to the crosscorrelation between characteristics of GPS satellite signals, the equivalent carrier to noise ratio analysis method based on the spectral separation coefficient is proposed, The attenuation degree of signal carrier to noise ratio caused by the strong interferential signals with the changing Doppler shift is derived, which provides theoretical basis for assessing the influence of strong interferential signal on weak signal. Analysis of theoretical value and simulation results verify the accuracy of the proposed method.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126835098","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382433
Yang Gao, F. Huang, Jia Hua Cheng, Lianhong Wu
A CMOS down-conversion mixer for MB-OFDM (Multi-Band Orthogonal Frequency Division Multiplexing) UWB (Ultra-Wide Band) application is presented. The mixer is implemented with a double-balanced Gilbert-cell architecture and adopts dynamic current source to improve noise performance. Two inductors are also introduced to reduce the flicker noise. Designed in SMIC 0.18 µm CMOS process, simulation results show a conversion gain of 9 to 11.5 dB, a noise figure of 10.8 to 13.2 dB, and an input-referred third-order intercept point of −10.5 to −8.2 dBm. The power consumption of the mixer core is 11.3 mW.
{"title":"A 3.1∼4.8 GHz wideband mixer for MB-OFDM UWB receivers with improved noise performance","authors":"Yang Gao, F. Huang, Jia Hua Cheng, Lianhong Wu","doi":"10.1109/YCICT.2009.5382433","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382433","url":null,"abstract":"A CMOS down-conversion mixer for MB-OFDM (Multi-Band Orthogonal Frequency Division Multiplexing) UWB (Ultra-Wide Band) application is presented. The mixer is implemented with a double-balanced Gilbert-cell architecture and adopts dynamic current source to improve noise performance. Two inductors are also introduced to reduce the flicker noise. Designed in SMIC 0.18 µm CMOS process, simulation results show a conversion gain of 9 to 11.5 dB, a noise figure of 10.8 to 13.2 dB, and an input-referred third-order intercept point of −10.5 to −8.2 dBm. The power consumption of the mixer core is 11.3 mW.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129061242","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382406
Zhihua Liu, Qixiang Ye, Lu Ke, Jianbin Jiao
A progressive region-merging algorithm for stereo matching is put forward in this paper. Firstly, the reference image is segmented by mean shift algorithm and the initial disparity maps are calculated using loopy belief propagation method. Secondly, we derive the reliable pixels through left-right consistent constraint. In addition, we present a new approach to exclude mismatch pixels in textureless regions, which will also reduce errors in the following region merging process. Finally, a progressive region-merging algorithm based on hierarchical clustering algorithm is put forward to merge neighboring regions and refine the plane parameters. Angle and distance are used together to measure whether the two planes are the same or not, which will reduce the calculation complexity. Experiments validate the proposed algorithm.
{"title":"A progressive region-merging algorithm for stereo matching","authors":"Zhihua Liu, Qixiang Ye, Lu Ke, Jianbin Jiao","doi":"10.1109/YCICT.2009.5382406","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382406","url":null,"abstract":"A progressive region-merging algorithm for stereo matching is put forward in this paper. Firstly, the reference image is segmented by mean shift algorithm and the initial disparity maps are calculated using loopy belief propagation method. Secondly, we derive the reliable pixels through left-right consistent constraint. In addition, we present a new approach to exclude mismatch pixels in textureless regions, which will also reduce errors in the following region merging process. Finally, a progressive region-merging algorithm based on hierarchical clustering algorithm is put forward to merge neighboring regions and refine the plane parameters. Angle and distance are used together to measure whether the two planes are the same or not, which will reduce the calculation complexity. Experiments validate the proposed algorithm.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121152475","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382333
Jianpeng Zhu, Jian Jin, Ying Wang
Emerging location-based application and sensor monitoring management system collect user's locations with limited power, which cannot report very accurate position values. An important query is the Continuous Nearest-Neighbor Query (CNNQ), which returns the closest mobile object given a query point over inaccurate location data collected from positioning devices. This paper proposes the Probabilistic Threshold filter and its pruning algorithm for CNNQ over imperfect data to utilize energy efficiently, which returns sets of objects that satisfy the query with probabilities higher than some threshold P. Probabilistic filter, Scenario analyzing and pruning algorithm employed here can handle CNNQ wisely to avoid computational and I/O expensive evaluation. The algorithm can be applied in Global Positioning System, Military Reconnaissance, Communication Technique, Traffic and Transportation Management etc.
{"title":"A probabilistic filter protocol for Continuous Nearest-Neighbor Query","authors":"Jianpeng Zhu, Jian Jin, Ying Wang","doi":"10.1109/YCICT.2009.5382333","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382333","url":null,"abstract":"Emerging location-based application and sensor monitoring management system collect user's locations with limited power, which cannot report very accurate position values. An important query is the Continuous Nearest-Neighbor Query (CNNQ), which returns the closest mobile object given a query point over inaccurate location data collected from positioning devices. This paper proposes the Probabilistic Threshold filter and its pruning algorithm for CNNQ over imperfect data to utilize energy efficiently, which returns sets of objects that satisfy the query with probabilities higher than some threshold P. Probabilistic filter, Scenario analyzing and pruning algorithm employed here can handle CNNQ wisely to avoid computational and I/O expensive evaluation. The algorithm can be applied in Global Positioning System, Military Reconnaissance, Communication Technique, Traffic and Transportation Management etc.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"51 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114322307","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382423
Qin Danyang, Wang Huihui, Wu Wei, Ma Lin, Sha Xuejun
Impact of nodes dynamically, randomly, frequently entering and leaving network on unreliable routing connection has been clearly described by a generalized routing reliability evaluating model according to measuring parameters of relative performance by studying on two-hop unit model presented in this paper. A new rate expression of node entering and leaving spindle region has been established by analyzing the two-hop unit model for MANET so as to obtain the closed solution of routing reliability. NS2-based simulating results validate the effectiveness and correctness. Routing reliability evaluating model proposed can be used to evaluate the reliability of communication link and can also be adopted to design MANET with given level of reliability.
{"title":"A generalized routing reliability evaluating model for manet","authors":"Qin Danyang, Wang Huihui, Wu Wei, Ma Lin, Sha Xuejun","doi":"10.1109/YCICT.2009.5382423","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382423","url":null,"abstract":"Impact of nodes dynamically, randomly, frequently entering and leaving network on unreliable routing connection has been clearly described by a generalized routing reliability evaluating model according to measuring parameters of relative performance by studying on two-hop unit model presented in this paper. A new rate expression of node entering and leaving spindle region has been established by analyzing the two-hop unit model for MANET so as to obtain the closed solution of routing reliability. NS2-based simulating results validate the effectiveness and correctness. Routing reliability evaluating model proposed can be used to evaluate the reliability of communication link and can also be adopted to design MANET with given level of reliability.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"6 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115344284","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382463
J. Mazierska
Novel low loss materials are needed to achieve miniaturization and further advances in wireless communications with precisely known microwave properties. Measurements of complex permittivity of low loss dielectric materials (especially anisotropic) in a wide range of temperatures still represent a challenging issue. Accuracy of surface resistance tests of superconducting materials can be low in some cases, and characterization of metamaterials is done only for one polarization and one incident angle, what is rather unsatisfactory. Accuracy of measurements is also determined by accuracy in determination of unloaded Qo-factor of test fixtures. Hence progress in microwave characterization of novel materials is also necessary. In this presentation a review of test resonators and a precise technique to measure the Qo-factor will be given. Also measurement results of complex permittivity of several low loss dielectrics and High Temperature superconducting materials will be shown.
{"title":"Microwave characterization of materials for telecommunication systems","authors":"J. Mazierska","doi":"10.1109/YCICT.2009.5382463","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382463","url":null,"abstract":"Novel low loss materials are needed to achieve miniaturization and further advances in wireless communications with precisely known microwave properties. Measurements of complex permittivity of low loss dielectric materials (especially anisotropic) in a wide range of temperatures still represent a challenging issue. Accuracy of surface resistance tests of superconducting materials can be low in some cases, and characterization of metamaterials is done only for one polarization and one incident angle, what is rather unsatisfactory. Accuracy of measurements is also determined by accuracy in determination of unloaded Qo-factor of test fixtures. Hence progress in microwave characterization of novel materials is also necessary. In this presentation a review of test resonators and a precise technique to measure the Qo-factor will be given. Also measurement results of complex permittivity of several low loss dielectrics and High Temperature superconducting materials will be shown.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124512276","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382375
Liu Zheng, Cai Jueping, Yao Lei, Du Ming
In this paper, we present a methodology for modeling, analysis and generation of NoC topology. Specially, our optimization framework of static and dynamic properties ensures core-to-core communication of the complete network. Our approach 1) fully exploits the regularity of standard topology and the flexibility of application-specific topology 2) generates a scalable network containing heterogeneous topologies, which raises the abstraction level of reuse from resources to subnets 3) satisfies NoC application. We evaluate and compare the performance of the topology generated utilizing our methodology with regular NoC topologies. Experimental results show the proposed design flow is efficient to provide superior performance for predefined requirements, and minimal cost function is achieved. In addition, we applied several multimedia applications as case studies.
{"title":"Application-aware generation and optimization for NoC topology","authors":"Liu Zheng, Cai Jueping, Yao Lei, Du Ming","doi":"10.1109/YCICT.2009.5382375","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382375","url":null,"abstract":"In this paper, we present a methodology for modeling, analysis and generation of NoC topology. Specially, our optimization framework of static and dynamic properties ensures core-to-core communication of the complete network. Our approach 1) fully exploits the regularity of standard topology and the flexibility of application-specific topology 2) generates a scalable network containing heterogeneous topologies, which raises the abstraction level of reuse from resources to subnets 3) satisfies NoC application. We evaluate and compare the performance of the topology generated utilizing our methodology with regular NoC topologies. Experimental results show the proposed design flow is efficient to provide superior performance for predefined requirements, and minimal cost function is achieved. In addition, we applied several multimedia applications as case studies.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129948336","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
扫码关注我们
求助内容：
应助结果提醒方式：