Pub Date : 2014-06-22DOI: 10.1109/SPAWC.2014.6941776
Yiftach Richter, I. Bergel
In this paper, we propose a new method for bias correction in the simulation of random wireless ad-hoc networks (WANETs), when the distribution of the node locations is modeled as a Poisson-Point-Process (PPP). The aggregate interference is the main limiting factor in WANETs, and dominates the achievable rate and thus also the network capacity. In the proposed method, a bias correction constant is added to the aggregate interference that is measured in each simulation iteration. The value of the constant is derived through stochastic geometry analysis. We prove that the proposed method can reduce the computational complexity by several orders of magnitude, while producing more accurate simulation results. This improved accuracy is also demonstrated by simulations. As an example, we prove that a bias corrected simulation with only 100 transmitters is sufficient to estimate the aggregate interference with an accuracy of 1%.
{"title":"Analysis of the simulated aggregate interference in random ad-hoc networks","authors":"Yiftach Richter, I. Bergel","doi":"10.1109/SPAWC.2014.6941776","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941776","url":null,"abstract":"In this paper, we propose a new method for bias correction in the simulation of random wireless ad-hoc networks (WANETs), when the distribution of the node locations is modeled as a Poisson-Point-Process (PPP). The aggregate interference is the main limiting factor in WANETs, and dominates the achievable rate and thus also the network capacity. In the proposed method, a bias correction constant is added to the aggregate interference that is measured in each simulation iteration. The value of the constant is derived through stochastic geometry analysis. We prove that the proposed method can reduce the computational complexity by several orders of magnitude, while producing more accurate simulation results. This improved accuracy is also demonstrated by simulations. As an example, we prove that a bias corrected simulation with only 100 transmitters is sufficient to estimate the aggregate interference with an accuracy of 1%.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"56 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116576712","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-06-22DOI: 10.1109/SPAWC.2014.6941925
Fang Shang, B. Champagne, I. Psaromiligkos
We present a joint estimator of the time-of-arrival (TOA) and angle-of-arrival (AOA) for impulse radio ultra-wideband (IR-UWB) localization systems in which an antenna array is employed at the receiver and multiuser (MUI) interference exists. The proposed method includes 3 steps: (1) time-alignment and averaging to reduce the power level of the MUI and background noise; (2) preliminary TOA estimation based on energy detection followed by quadratic averaging; (3) joint TOA and AOA estimation using a recently proposed log likelihood function, but further extended to consider the effect of MUI. The validity of the proposed method is demonstrated by numerical simulations over a realistic space-time channel model.
{"title":"Joint TOA/AOA estimation of IR-UWB signals in the presence of multiuser interference","authors":"Fang Shang, B. Champagne, I. Psaromiligkos","doi":"10.1109/SPAWC.2014.6941925","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941925","url":null,"abstract":"We present a joint estimator of the time-of-arrival (TOA) and angle-of-arrival (AOA) for impulse radio ultra-wideband (IR-UWB) localization systems in which an antenna array is employed at the receiver and multiuser (MUI) interference exists. The proposed method includes 3 steps: (1) time-alignment and averaging to reduce the power level of the MUI and background noise; (2) preliminary TOA estimation based on energy detection followed by quadratic averaging; (3) joint TOA and AOA estimation using a recently proposed log likelihood function, but further extended to consider the effect of MUI. The validity of the proposed method is demonstrated by numerical simulations over a realistic space-time channel model.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131104487","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-06-22DOI: 10.1109/SPAWC.2014.6941496
Stefan Wesemann, W. Rave, G. Fettweis
We adopt the power gain description of wireless networks in order to provide conceptual insights on existing distributed asynchronous beamforming algorithms. From this common viewpoint, we compare the asynchronous distributed pricing (ADP) algorithm and the asynchronous scaled gradient projection (SGP) algorithm in terms of local subproblems, required information exchange and convergence behavior. We illustrate the underlying mechanisms that ensure the convergence to a stationary point of a sum utility function (i.e., complementary user actions, step size bounds), and we point out the algorithms' pros and limitations.
{"title":"Unifying viewpoints on distributed asynchronous optimization for MISO interference channels","authors":"Stefan Wesemann, W. Rave, G. Fettweis","doi":"10.1109/SPAWC.2014.6941496","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941496","url":null,"abstract":"We adopt the power gain description of wireless networks in order to provide conceptual insights on existing distributed asynchronous beamforming algorithms. From this common viewpoint, we compare the asynchronous distributed pricing (ADP) algorithm and the asynchronous scaled gradient projection (SGP) algorithm in terms of local subproblems, required information exchange and convergence behavior. We illustrate the underlying mechanisms that ensure the convergence to a stationary point of a sum utility function (i.e., complementary user actions, step size bounds), and we point out the algorithms' pros and limitations.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"7 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114005085","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-06-22DOI: 10.1109/SPAWC.2014.6941835
O. Barbu, N. L. Pedersen, Carles Navarro i Manchon, G. Monghal, C. Rom, B. Fleury
Traditionally, the dictionary matrices used in sparse wireless channel estimation have been based on the discrete Fourier transform, following the assumption that the channel frequency response (CFR) can be approximated as a linear combination of a small number of multipath components, each one being contributed by a specific propagation path. In practical communication systems, however, the channel response experienced by the receiver includes additional effects to those induced by the propagation channel. This composite channel embodies, in particular, the impact of the transmit (shaping) and receive (demodulation) filters. Hence, the assumption of the CFR being sparse in the canonical Fourier dictionary may no longer hold. In this work, we derive a signal model and subsequently a novel dictionary matrix for sparse estimation that account for the impact of transceiver filters. Numerical results obtained in an OFDM transmission scenario demonstrate the superior accuracy of a sparse estimator that uses our proposed dictionary rather than the classical Fourier dictionary, and its robustness against a mismatch in the assumed transmit filter characteristics.
{"title":"Sparse channel estimation including the impact of the transceiver filters with application to OFDM","authors":"O. Barbu, N. L. Pedersen, Carles Navarro i Manchon, G. Monghal, C. Rom, B. Fleury","doi":"10.1109/SPAWC.2014.6941835","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941835","url":null,"abstract":"Traditionally, the dictionary matrices used in sparse wireless channel estimation have been based on the discrete Fourier transform, following the assumption that the channel frequency response (CFR) can be approximated as a linear combination of a small number of multipath components, each one being contributed by a specific propagation path. In practical communication systems, however, the channel response experienced by the receiver includes additional effects to those induced by the propagation channel. This composite channel embodies, in particular, the impact of the transmit (shaping) and receive (demodulation) filters. Hence, the assumption of the CFR being sparse in the canonical Fourier dictionary may no longer hold. In this work, we derive a signal model and subsequently a novel dictionary matrix for sparse estimation that account for the impact of transceiver filters. Numerical results obtained in an OFDM transmission scenario demonstrate the superior accuracy of a sparse estimator that uses our proposed dictionary rather than the classical Fourier dictionary, and its robustness against a mismatch in the assumed transmit filter characteristics.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114253875","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-06-22DOI: 10.1109/SPAWC.2014.6941658
Binbin Dai, Wei Yu
This paper considers the joint beamforming and clustering design problem in a downlink network multiple-input multiple-output (MIMO) setup, where the base-stations (BSs) are connected to a central processor with rate-limited backhaul links. We formulate the problem as that of devising a sparse beamforming vector across the BSs for each user, where the nonzero beamforming entries correspond to that user's serving BSs. Differing from the previous works, this paper explicitly formulates the per-BS backhaul constraints in the network utility maximization framework. In contrast to the traditional utility maximization problem with transmit power constraint only, the additional backhaul constraints result in a discrete ℓ0-norm formulation, which makes the problem more challenging. Motivated by the compressive sensing literature, we propose to iteratively approximate the per-BS backhaul constraints using a reweighted ℓ1-norm technique and reformulate the backhaul constraints as weighted per-BS power constraints. This allows us to solve the weighted sum rate maximization problem through a generalized weighted minimum mean square error (WMMSE) approach. To reduce the computational complexity of the proposed algorithm within each iteration, we propose two additional techniques, iterative link removal and iterative user pool shrinking, which dynamically decrease the potential BS cluster size and user scheduling pool. Numerical results show that the proposed algorithm can significantly improve the system throughput as compared to the naive BS clustering strategy based on the channel strength.
{"title":"Sparse beamforming design for network MIMO system with per-base-station backhaul constraints","authors":"Binbin Dai, Wei Yu","doi":"10.1109/SPAWC.2014.6941658","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941658","url":null,"abstract":"This paper considers the joint beamforming and clustering design problem in a downlink network multiple-input multiple-output (MIMO) setup, where the base-stations (BSs) are connected to a central processor with rate-limited backhaul links. We formulate the problem as that of devising a sparse beamforming vector across the BSs for each user, where the nonzero beamforming entries correspond to that user's serving BSs. Differing from the previous works, this paper explicitly formulates the per-BS backhaul constraints in the network utility maximization framework. In contrast to the traditional utility maximization problem with transmit power constraint only, the additional backhaul constraints result in a discrete ℓ0-norm formulation, which makes the problem more challenging. Motivated by the compressive sensing literature, we propose to iteratively approximate the per-BS backhaul constraints using a reweighted ℓ1-norm technique and reformulate the backhaul constraints as weighted per-BS power constraints. This allows us to solve the weighted sum rate maximization problem through a generalized weighted minimum mean square error (WMMSE) approach. To reduce the computational complexity of the proposed algorithm within each iteration, we propose two additional techniques, iterative link removal and iterative user pool shrinking, which dynamically decrease the potential BS cluster size and user scheduling pool. Numerical results show that the proposed algorithm can significantly improve the system throughput as compared to the naive BS clustering strategy based on the channel strength.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134151223","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-06-22DOI: 10.1109/SPAWC.2014.6941377
Mohammad Javad Abdoli, Ming Jia, Jianglei Ma
Faster than Nyquist (FTN) transmission is investigated for a point-to-point AWGN link. The FTN is interpreted as a form of coding at the pulse shape level, and accordingly, the so-called Mazo phenomenon is interpreted as a coding gain. Then, it is shown by simulation that such a gain can disappear in a coded FTN transmission with a powerful FEC code, such as turbo code. This result undermines the FTN transmission as an effective technique in an actual communication system.
{"title":"Turbo-coded single-carrier faster-than-Nyquist transmission","authors":"Mohammad Javad Abdoli, Ming Jia, Jianglei Ma","doi":"10.1109/SPAWC.2014.6941377","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941377","url":null,"abstract":"Faster than Nyquist (FTN) transmission is investigated for a point-to-point AWGN link. The FTN is interpreted as a form of coding at the pulse shape level, and accordingly, the so-called Mazo phenomenon is interpreted as a coding gain. Then, it is shown by simulation that such a gain can disappear in a coded FTN transmission with a powerful FEC code, such as turbo code. This result undermines the FTN transmission as an effective technique in an actual communication system.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"30 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132571172","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-06-22DOI: 10.1109/SPAWC.2014.6941828
Shervin Shahidi, S. Valaee
We investigate the problem of graph matching to translate topological indoor localization to geographical localization, by modeling the building map and the semantic maps as graphs. A graph matching algorithm is proposed along with a node similarity measure based on finding the minimum distance between all sets of permutations of two vectors. We provide an efficient technique to calculate the similarity measurement, and prove its correctness via a theorem. The matching algorithm is shown to find all pairs of corresponding nodes correctly on real data.
{"title":"Graph matching for crowdsourced data in mobile sensor networks","authors":"Shervin Shahidi, S. Valaee","doi":"10.1109/SPAWC.2014.6941828","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941828","url":null,"abstract":"We investigate the problem of graph matching to translate topological indoor localization to geographical localization, by modeling the building map and the semantic maps as graphs. A graph matching algorithm is proposed along with a node similarity measure based on finding the minimum distance between all sets of permutations of two vectors. We provide an efficient technique to calculate the similarity measurement, and prove its correctness via a theorem. The matching algorithm is shown to find all pairs of corresponding nodes correctly on real data.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130452255","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-06-22DOI: 10.1109/SPAWC.2014.6941634
A. Cirik, Muhammad R. A. Khandaker, Y. Rong, Y. Hua
The uplink and downlink sum mean-squared error (MSE) duality for multi-hop amplify-and-forward (AF) multiple-input multiple-output (MIMO) relay channels is established, which is a generalization of several sum-MSE duality results. Unlike the previous results that prove the duality by computing the MSEs for each stream directly, we introduce an interesting perspective to the relation of the uplink-downlink duality based on the Karush-Kuhn-Tucker (KKT) conditions associated with uplink and downlink transceiver design optimization problems.
{"title":"On uplink-downlink sum-MSE duality of multi-hop MIMO relay channel","authors":"A. Cirik, Muhammad R. A. Khandaker, Y. Rong, Y. Hua","doi":"10.1109/SPAWC.2014.6941634","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941634","url":null,"abstract":"The uplink and downlink sum mean-squared error (MSE) duality for multi-hop amplify-and-forward (AF) multiple-input multiple-output (MIMO) relay channels is established, which is a generalization of several sum-MSE duality results. Unlike the previous results that prove the duality by computing the MSEs for each stream directly, we introduce an interesting perspective to the relation of the uplink-downlink duality based on the Karush-Kuhn-Tucker (KKT) conditions associated with uplink and downlink transceiver design optimization problems.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130882258","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-06-22DOI: 10.1109/SPAWC.2014.6941718
I. Bergel, D. Yellin, S. Shamai
In this paper we study the effect of partial channel state information (CSI) on the performance of dirty paper coding (DPC) schemes. We derive a novel lower bound that shows that the effect of the CSI is upper bounded by the effect of an additive white Gaussian noise with an appropriate variance. The bound is proved using a constructive proof that shows that the predicted rates are achievable using high dimensional lattice modulo precoding schemes. Simulation results demonstrate the usefulness of the bound. The derived bound is useful for the characterization of the interference mitigation performance in partial CSI scenarios such as FDD networks with finite rate feedback, uplink downlink capacity balancing in cooperative cellular networks, etc'.
{"title":"Dirty paper coding with partial channel state information","authors":"I. Bergel, D. Yellin, S. Shamai","doi":"10.1109/SPAWC.2014.6941718","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941718","url":null,"abstract":"In this paper we study the effect of partial channel state information (CSI) on the performance of dirty paper coding (DPC) schemes. We derive a novel lower bound that shows that the effect of the CSI is upper bounded by the effect of an additive white Gaussian noise with an appropriate variance. The bound is proved using a constructive proof that shows that the predicted rates are achievable using high dimensional lattice modulo precoding schemes. Simulation results demonstrate the usefulness of the bound. The derived bound is useful for the characterization of the interference mitigation performance in partial CSI scenarios such as FDD networks with finite rate feedback, uplink downlink capacity balancing in cooperative cellular networks, etc'.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134237030","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-06-22DOI: 10.1109/SPAWC.2014.6941734
R. T. Duran, Paschalis Tsiaflakis, L. Vandendorpe, M. Moonen
Femto base stations constitute a promising solution to cope with the dramatic increase in mobile data traffic, but they also contribute to increase the network power consumption. Traditionally, full power transmissions are used to satisfy the users' data rate demands, causing interference to neighboring cells. Cell breathing can reduce the total transmit power by adjusting the cell size to the traffic load, hence limiting interference. However, it requires full knowledge of the channel conditions and power allocation strategies of neighboring cells. Its implementation becomes more challenging in broadband heterogeneous networks due to the channel frequency selectivity, the power difference between base station types, and the required network coordination. Therefore, we propose a cell breathing approach for green heterogeneous networks, referred to as path loss-based cell breathing (PL-CB), which uses only path loss information to limit the interference caused to neighboring cells. It achieves a higher energy efficiency and a larger achievable rate region than other state-of-the-art techniques with negligible degradation with respect to the approach with full knowledge of the channel and transmit powers of neighboring cells.
{"title":"A cell breathing approach in green heterogeneous networks","authors":"R. T. Duran, Paschalis Tsiaflakis, L. Vandendorpe, M. Moonen","doi":"10.1109/SPAWC.2014.6941734","DOIUrl":"https://doi.org/10.1109/SPAWC.2014.6941734","url":null,"abstract":"Femto base stations constitute a promising solution to cope with the dramatic increase in mobile data traffic, but they also contribute to increase the network power consumption. Traditionally, full power transmissions are used to satisfy the users' data rate demands, causing interference to neighboring cells. Cell breathing can reduce the total transmit power by adjusting the cell size to the traffic load, hence limiting interference. However, it requires full knowledge of the channel conditions and power allocation strategies of neighboring cells. Its implementation becomes more challenging in broadband heterogeneous networks due to the channel frequency selectivity, the power difference between base station types, and the required network coordination. Therefore, we propose a cell breathing approach for green heterogeneous networks, referred to as path loss-based cell breathing (PL-CB), which uses only path loss information to limit the interference caused to neighboring cells. It achieves a higher energy efficiency and a larger achievable rate region than other state-of-the-art techniques with negligible degradation with respect to the approach with full knowledge of the channel and transmit powers of neighboring cells.","PeriodicalId":420837,"journal":{"name":"2014 IEEE 15th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133997666","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
扫码关注我们
求助内容：
应助结果提醒方式：