Pub Date : 2013-03-20DOI: 10.1109/CISS.2013.6552251
Yang Hu, Xuedan Zhang, Yuhan Dong
In power-limited cooperative communication systems, power allocation is a key issue to maintain the quality of communications with limited power supply. In this paper, we propose an adaptive power allocation scheme based on the mixed channel state information including the instantaneous channel state information of the channels between source node and the other nodes, also the statistical channel state information of the channels between relay nodes and destination node. In the proposed scheme, the source node near-optimally allocates power and selects the relays to optimize the outage performance. A simplified scheme is also proposed for practical utilization by considering less cases without significantly performance loss. Numerical results suggest that both the proposed adaptive scheme and its simplified version can offer better communication performance.
{"title":"Adaptive power allocation for wireless cooperative communications","authors":"Yang Hu, Xuedan Zhang, Yuhan Dong","doi":"10.1109/CISS.2013.6552251","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552251","url":null,"abstract":"In power-limited cooperative communication systems, power allocation is a key issue to maintain the quality of communications with limited power supply. In this paper, we propose an adaptive power allocation scheme based on the mixed channel state information including the instantaneous channel state information of the channels between source node and the other nodes, also the statistical channel state information of the channels between relay nodes and destination node. In the proposed scheme, the source node near-optimally allocates power and selects the relays to optimize the outage performance. A simplified scheme is also proposed for practical utilization by considering less cases without significantly performance loss. Numerical results suggest that both the proposed adaptive scheme and its simplified version can offer better communication performance.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123279477","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 : 2013-03-20DOI: 10.1109/CISS.2013.6552348
Yuandao Sun, B. L. Mark
This paper analyzes the aggregate interference in a cognitive radio network. We consider a model in which the secondary transmitters are geographically distributed according to a Poisson point process in a wireless environment subject to shadowing noise and path loss. The secondary transmitters may transmit simultaneously and consequently incur an aggregate interference level on the primary system. We derive the moment generating function and the expectation of the aggregate interference for this model using properties of the Poisson point process. Based on the interference analysis, a scheme is proposed to estimate the maximum transmission power for each of the active secondary transmitters so as to satisfy a constraint on the aggregate interference. Our numerical results show a significant gain in the achievable capacity for the secondary system relative to an earlier scheme in which only a single secondary transmitter was permitted to transmit at any given time.
{"title":"Interference model for spectrum sensing with power control","authors":"Yuandao Sun, B. L. Mark","doi":"10.1109/CISS.2013.6552348","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552348","url":null,"abstract":"This paper analyzes the aggregate interference in a cognitive radio network. We consider a model in which the secondary transmitters are geographically distributed according to a Poisson point process in a wireless environment subject to shadowing noise and path loss. The secondary transmitters may transmit simultaneously and consequently incur an aggregate interference level on the primary system. We derive the moment generating function and the expectation of the aggregate interference for this model using properties of the Poisson point process. Based on the interference analysis, a scheme is proposed to estimate the maximum transmission power for each of the active secondary transmitters so as to satisfy a constraint on the aggregate interference. Our numerical results show a significant gain in the achievable capacity for the secondary system relative to an earlier scheme in which only a single secondary transmitter was permitted to transmit at any given time.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"11 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123605795","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 : 2013-03-20DOI: 10.1109/CISS.2013.6552308
Osso Vahabzadeh, M. Salehi
We propose a novel two-user cooperation scheme that employs protograph-based low-density parity-check (LDPC) codes. The proposed scenario is based on time division where each user transmits its message to the base station (BS) in two successive intervals. In the first interval, the user sends its message to the BS as well as its partner user. If the partner user successfully decodes the received signal, the two users cooperatively send the main user's message using the Alamouti scheme during the second interval. Otherwise, the main user simply retransmits its message to the BS. The users change roles during the next two intervals. Furthermore, the users encode their information over a class of protograph-based LDPC codes called the Accumulate-Repeat-4-Jagged-Accumulate (AR4JA) codes that allow flexible selections of rate and length. Using this technique, a three-level diversity is achieved when there exists a strong interuser link, whereas when the interuser channel has a poor quality, at least a two-level diversity is achieved.
{"title":"Cooperative communication using protograph-based low-density parity-check codes","authors":"Osso Vahabzadeh, M. Salehi","doi":"10.1109/CISS.2013.6552308","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552308","url":null,"abstract":"We propose a novel two-user cooperation scheme that employs protograph-based low-density parity-check (LDPC) codes. The proposed scenario is based on time division where each user transmits its message to the base station (BS) in two successive intervals. In the first interval, the user sends its message to the BS as well as its partner user. If the partner user successfully decodes the received signal, the two users cooperatively send the main user's message using the Alamouti scheme during the second interval. Otherwise, the main user simply retransmits its message to the BS. The users change roles during the next two intervals. Furthermore, the users encode their information over a class of protograph-based LDPC codes called the Accumulate-Repeat-4-Jagged-Accumulate (AR4JA) codes that allow flexible selections of rate and length. Using this technique, a three-level diversity is achieved when there exists a strong interuser link, whereas when the interuser channel has a poor quality, at least a two-level diversity is achieved.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114468785","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 : 2013-03-20DOI: 10.1109/CISS.2013.6552259
G. Yue, N. Prasad, M. Jiang, M. Khojastepour, S. Rangarajan
In this paper, we consider a downlink (DL) multiuser (MU) multi-input-multi-output (MIMO) channel with linear precoding in advanced cellular systems. We propose a general residual error based channel state information (CSI) feedback framework to improve the MU-MIMO performance. In particular, we propose a simple form of the enhanced feedback, i.e., residual error norm (REN) feedback in addition to the conventional implicit CSI report, in the Long Term Evolution (LTE) cellular systems. We also illustrate mechanisms that the base station uses to exploit the proposed enhanced CSI feedback for rate-matching. The system level simulations demonstrate that the proposed residual error based enhanced CSI feedback with REN provides substantial system throughput improvements in both homogenous and heterogenous networks.
{"title":"Residual error based CSI feedback enhancement for downlink multiuser MIMO","authors":"G. Yue, N. Prasad, M. Jiang, M. Khojastepour, S. Rangarajan","doi":"10.1109/CISS.2013.6552259","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552259","url":null,"abstract":"In this paper, we consider a downlink (DL) multiuser (MU) multi-input-multi-output (MIMO) channel with linear precoding in advanced cellular systems. We propose a general residual error based channel state information (CSI) feedback framework to improve the MU-MIMO performance. In particular, we propose a simple form of the enhanced feedback, i.e., residual error norm (REN) feedback in addition to the conventional implicit CSI report, in the Long Term Evolution (LTE) cellular systems. We also illustrate mechanisms that the base station uses to exploit the proposed enhanced CSI feedback for rate-matching. The system level simulations demonstrate that the proposed residual error based enhanced CSI feedback with REN provides substantial system throughput improvements in both homogenous and heterogenous networks.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124009589","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 : 2013-03-20DOI: 10.1109/CISS.2013.6552314
K. Slavakis, G. Giannakis, G. Leus
A novel approach is developed for nonlinear compression and reconstruction of high- or even infinite-dimensional signals living on a smooth but otherwise unknown manifold. Compression is effected through affine embeddings to lower-dimensional spaces. These embeddings are obtained via linear regression and bilinear dictionary learning algorithms that leverage manifold smoothness as well as sparsity of the affine model and its residuals. The emergent unifying framework is general enough to encompass known locally linear embedding and compressive sampling approaches to dimensionality reduction. Emphasis is placed on reconstructing high-dimensional data from their low-dimensional embeddings. Preliminary tests demonstrate the analytical claims, and their potential to (de)compressing synthetic and real data.
{"title":"Robust sparse embedding and reconstruction via dictionary learning","authors":"K. Slavakis, G. Giannakis, G. Leus","doi":"10.1109/CISS.2013.6552314","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552314","url":null,"abstract":"A novel approach is developed for nonlinear compression and reconstruction of high- or even infinite-dimensional signals living on a smooth but otherwise unknown manifold. Compression is effected through affine embeddings to lower-dimensional spaces. These embeddings are obtained via linear regression and bilinear dictionary learning algorithms that leverage manifold smoothness as well as sparsity of the affine model and its residuals. The emergent unifying framework is general enough to encompass known locally linear embedding and compressive sampling approaches to dimensionality reduction. Emphasis is placed on reconstructing high-dimensional data from their low-dimensional embeddings. Preliminary tests demonstrate the analytical claims, and their potential to (de)compressing synthetic and real data.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120936673","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 : 2013-03-20DOI: 10.1109/CISS.2013.6552286
Zixia Hu, Zhiyong Chen, Hongxiang Li
This paper addresses the performance of the joint decode-and-forward (JDF) strategy for two-way relay systems over Rayleigh fading channels. We show that the JDF enjoys a lower bit error rate (BER) in the first time slot, which translates into higher capacity for broadcast in the second time slot. Specifically, we present the optimal decision rules for JDF and partial decoding-and-forward (PDF) and derive their corresponding BER union bounds for BPSK signals. Furthermore, we propose a novel scheme, termed JDF-JM, to re-encode the messages at the relay node for unmatched data rates from the two sources. The achievable rates of JDF and PDF for the second time slot are then analyzed. Simulation results are provided to illustrate the performance of JDF over DF-XOR under different channel coding and modulation settings.
{"title":"Performance analysis of joint decode-and-forward scheme for two-way relay channels","authors":"Zixia Hu, Zhiyong Chen, Hongxiang Li","doi":"10.1109/CISS.2013.6552286","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552286","url":null,"abstract":"This paper addresses the performance of the joint decode-and-forward (JDF) strategy for two-way relay systems over Rayleigh fading channels. We show that the JDF enjoys a lower bit error rate (BER) in the first time slot, which translates into higher capacity for broadcast in the second time slot. Specifically, we present the optimal decision rules for JDF and partial decoding-and-forward (PDF) and derive their corresponding BER union bounds for BPSK signals. Furthermore, we propose a novel scheme, termed JDF-JM, to re-encode the messages at the relay node for unmatched data rates from the two sources. The achievable rates of JDF and PDF for the second time slot are then analyzed. Simulation results are provided to illustrate the performance of JDF over DF-XOR under different channel coding and modulation settings.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126171024","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 : 2013-03-20DOI: 10.1109/CISS.2013.6552342
Junil Choi, D. Love, Upamanyu Madhow
Accurate channel state information at the transmitter can significantly enhance the performance of multiple antenna systems, but efficient channel quantization techniques must be developed in order to scale such informed transmitter strategies to frequency division duplexed (FDD) massive MIMO systems. Recent results show that noncoherent trellis-coded quantization (NTCQ) is an effective approach for limited feedback transmit beamforming with a large number of transmit antennas. In this paper, we investigate extensions of NTCQ that exploit channel correlations in time and space to significantly reduce the required feedback rate. Our numerical results show that near-optimal beamforming with moderate feedback overhead can be obtained in massive MIMO systems.
{"title":"Limited feedback in massive MIMO systems: Exploiting channel correlations via noncoherent trellis-coded quantization","authors":"Junil Choi, D. Love, Upamanyu Madhow","doi":"10.1109/CISS.2013.6552342","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552342","url":null,"abstract":"Accurate channel state information at the transmitter can significantly enhance the performance of multiple antenna systems, but efficient channel quantization techniques must be developed in order to scale such informed transmitter strategies to frequency division duplexed (FDD) massive MIMO systems. Recent results show that noncoherent trellis-coded quantization (NTCQ) is an effective approach for limited feedback transmit beamforming with a large number of transmit antennas. In this paper, we investigate extensions of NTCQ that exploit channel correlations in time and space to significantly reduce the required feedback rate. Our numerical results show that near-optimal beamforming with moderate feedback overhead can be obtained in massive MIMO systems.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122784004","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 : 2013-03-20DOI: 10.1109/CISS.2013.6552266
Ahmad Abu Al Haija, M. Vu
In this paper, we analyze and compare several encoding and decoding techniques for the interference channel with destination cooperation (IC-DC). For the encoding techniques, we consider standard Han-Kobayashi (HK) techniques at both sources as well as quantize-forward (QF) and compress-forward (CF) relaying at the destinations. For the decoding techniques, we compare backward and sliding window decoding at both destinations. We prove that the achievable rate regions obtained with QF and CF relaying are the same as long as the same decoding technique is used by the destinations. We also show that with backward decoding, QF and CF relaying techniques achieve the same rate region as that obtained by the HK with noisy network coding (NNC) scheme. Therefore, QF relaying is the preferred scheme because it is simpler than both CF relaying and NNC and still leads to the same rate region. Furthermore, we provide numerical results for the Gaussian channel. These results show that destination cooperation is more efficient in strong IC than in weak IC. Also, if the destinations have enough powers or the inter-destination links are very strong, sliding window decoding achieves almost the same rate region as backward decoding while having a much shorter decoding delay.
{"title":"Analysis of encoding and decoding techniques for the interference channel with destination cooperation","authors":"Ahmad Abu Al Haija, M. Vu","doi":"10.1109/CISS.2013.6552266","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552266","url":null,"abstract":"In this paper, we analyze and compare several encoding and decoding techniques for the interference channel with destination cooperation (IC-DC). For the encoding techniques, we consider standard Han-Kobayashi (HK) techniques at both sources as well as quantize-forward (QF) and compress-forward (CF) relaying at the destinations. For the decoding techniques, we compare backward and sliding window decoding at both destinations. We prove that the achievable rate regions obtained with QF and CF relaying are the same as long as the same decoding technique is used by the destinations. We also show that with backward decoding, QF and CF relaying techniques achieve the same rate region as that obtained by the HK with noisy network coding (NNC) scheme. Therefore, QF relaying is the preferred scheme because it is simpler than both CF relaying and NNC and still leads to the same rate region. Furthermore, we provide numerical results for the Gaussian channel. These results show that destination cooperation is more efficient in strong IC than in weak IC. Also, if the destinations have enough powers or the inter-destination links are very strong, sliding window decoding achieves almost the same rate region as backward decoding while having a much shorter decoding delay.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130772035","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 : 2013-03-20DOI: 10.1109/CISS.2013.6624251
Min-sheng Ni, D. Brown
This paper compares interference alignment and opportunistic transmission for a 3-user single-input single-output (SISO) interference channel in terms of average sum rate in the presence of channel estimation errors. In the case of interference alignment, channel estimation errors cause interference leakage which consequently results in a loss of achievable rate. In the case of opportunistic transmission, channel estimation errors result in a non-zero probability of incorrectly choosing the node with the best channel. The effect of these impairments is quantified in terms of the achievable average sum rate of these transmission techniques. Analysis and numerical examples for independent and identically distributed fading channels show that SISO interference alignment can achieve better average sum rate with good channel estimates and at high SNR whereas opportunistic transmission provides better performance at low SNR and/or when the channel estimates are poor.
{"title":"A performance comparison of interference alignment and opportunistic transmission with channel estimation errors","authors":"Min-sheng Ni, D. Brown","doi":"10.1109/CISS.2013.6624251","DOIUrl":"https://doi.org/10.1109/CISS.2013.6624251","url":null,"abstract":"This paper compares interference alignment and opportunistic transmission for a 3-user single-input single-output (SISO) interference channel in terms of average sum rate in the presence of channel estimation errors. In the case of interference alignment, channel estimation errors cause interference leakage which consequently results in a loss of achievable rate. In the case of opportunistic transmission, channel estimation errors result in a non-zero probability of incorrectly choosing the node with the best channel. The effect of these impairments is quantified in terms of the achievable average sum rate of these transmission techniques. Analysis and numerical examples for independent and identically distributed fading channels show that SISO interference alignment can achieve better average sum rate with good channel estimates and at high SNR whereas opportunistic transmission provides better performance at low SNR and/or when the channel estimates are poor.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133064434","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 : 2013-03-20DOI: 10.1109/CISS.2013.6552338
Yue M. Lu
In recent years, there have been increasing efforts to develop solid-state sensors with single-photon sensitivity, with applications ranging from bio-imaging to 3D computer vision. In this paper, we present adaptive sensing models, theory and algorithms for these single-photon sensors, aiming to improve their dynamic ranges. Mapping different sensor configurations onto a finite set of states, we represent adaptive sensing schemes as finite-state parametric Markov chains. After deriving an asymptotic expression for the Fisher information rate of these Markovian systems, we propose a design criterion for sensing policies based on minimax ratio regret. We also present a suboptimal yet effective sensing policy based on random walks. Numerical experiments demonstrate the strong performance of the proposed scheme, which expands the sensor dynamic ranges of existing nonadaptive approaches by several orders of magnitude.
{"title":"Adaptive sensing and inference for single-photon imaging","authors":"Yue M. Lu","doi":"10.1109/CISS.2013.6552338","DOIUrl":"https://doi.org/10.1109/CISS.2013.6552338","url":null,"abstract":"In recent years, there have been increasing efforts to develop solid-state sensors with single-photon sensitivity, with applications ranging from bio-imaging to 3D computer vision. In this paper, we present adaptive sensing models, theory and algorithms for these single-photon sensors, aiming to improve their dynamic ranges. Mapping different sensor configurations onto a finite set of states, we represent adaptive sensing schemes as finite-state parametric Markov chains. After deriving an asymptotic expression for the Fisher information rate of these Markovian systems, we propose a design criterion for sensing policies based on minimax ratio regret. We also present a suboptimal yet effective sensing policy based on random walks. Numerical experiments demonstrate the strong performance of the proposed scheme, which expands the sensor dynamic ranges of existing nonadaptive approaches by several orders of magnitude.","PeriodicalId":268095,"journal":{"name":"2013 47th Annual Conference on Information Sciences and Systems (CISS)","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134356942","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
扫码关注我们
求助内容：
应助结果提醒方式：