Pub Date : 2014-12-01DOI: 10.1109/GlobalSIP.2014.7032266
D. Sharma, Lisa Meredith, Jose Lainez, Daniel Barreda, P. Naylor
We present NISQ, a data-driven non-intrusive speech quality measure that has been trained to predict the PESQ score for a given speech signal. NISQ is based on feature extraction and a binary tree regression based model. A training method using the intrusive PESQ algorithm to automatically label large quantities of speech data is presented and utilized. Our method is shown to predict PESQ with an RMS error of 0.49 on our test database.
{"title":"A non-intrusive PESQ measure","authors":"D. Sharma, Lisa Meredith, Jose Lainez, Daniel Barreda, P. Naylor","doi":"10.1109/GlobalSIP.2014.7032266","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032266","url":null,"abstract":"We present NISQ, a data-driven non-intrusive speech quality measure that has been trained to predict the PESQ score for a given speech signal. NISQ is based on feature extraction and a binary tree regression based model. A training method using the intrusive PESQ algorithm to automatically label large quantities of speech data is presented and utilized. Our method is shown to predict PESQ with an RMS error of 0.49 on our test database.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115703217","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}
This paper investigates the outage performance of decode-and-forward (DF) based cognitive relay networks (CRNs) in the presence of multiple secondary destinations (SDs) in a spectrum sharing scenario with orthogonal space-time block code (OSTBC) transmission. By employing an opportunistic scheduling algorithm to select one out of L SDs, we derive both the exact closed-form expression of outage probability and asymptotic expression of which in high signal-to-noise ratio (SNR) region over Rayleigh fading channels. Our theoretical analysis is corroborated by Monte Carlo simulation. The result shows that the outage performance of the system will be improved with the increase of both the number of antennas and SDs. When source and relay are equipped with N transmit antennas, the diversity order is N × min (N, L). Under this condition, if the number of antennas N is smaller than L, the diversity order is N2, which means the conventional multiuser diversity gain can not be achieved.
研究了具有正交空时分组码(OSTBC)传输的频谱共享场景下，基于解码转发(DF)的认知中继网络(crn)在多个次要目的地(sd)存在下的中断性能。利用机会调度算法从L个sd中选择一个，得到了瑞利衰落信道上高信噪比区域中断概率的精确封闭表达式和渐近表达式。我们的理论分析得到了蒙特卡罗模拟的证实。结果表明，随着天线数和SDs的增加，系统的中断性能将得到改善。当源和中继配置N个发射天线时，分集阶数为N × min (N, L)，在这种情况下，如果天线数N小于L，分集阶数为N2，即不能实现常规的多用户分集增益。
{"title":"Outage probability of multiuser cognitive relay networks with orthogonal space-time block code transmission","authors":"Pengwei Zhang, Xing Zhang, Jia Xing, Zhenhai Zhang","doi":"10.1109/GlobalSIP.2014.7032328","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032328","url":null,"abstract":"This paper investigates the outage performance of decode-and-forward (DF) based cognitive relay networks (CRNs) in the presence of multiple secondary destinations (SDs) in a spectrum sharing scenario with orthogonal space-time block code (OSTBC) transmission. By employing an opportunistic scheduling algorithm to select one out of L SDs, we derive both the exact closed-form expression of outage probability and asymptotic expression of which in high signal-to-noise ratio (SNR) region over Rayleigh fading channels. Our theoretical analysis is corroborated by Monte Carlo simulation. The result shows that the outage performance of the system will be improved with the increase of both the number of antennas and SDs. When source and relay are equipped with N transmit antennas, the diversity order is N × min (N, L). Under this condition, if the number of antennas N is smaller than L, the diversity order is N2, which means the conventional multiuser diversity gain can not be achieved.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124132625","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-12-01DOI: 10.1109/GlobalSIP.2014.7032323
Shengli Zhang, S. Liew
In this paper, we investigate the capacity of known interference channel, where the receiver knows the interference data but not the channel gain of the interference data, assuming the use of Gaussian modulations. We first present a tight upper bound for the capacity of this known-interference channel. After that, we obtain the achievable rate of the channel with a blind known interference cancellation (BKIC) scheme in closed form. We prove that this achievable rate can approach the aforementioned upper bound in the high SNR regime. Moreover, it is much larger than the achievable rate of the traditional interference cancellation scheme. In particular, the achievable rate of BKIC continues to increase with SNR in the high SNR regime, while that of the traditional scheme approaches a fixed bound that does not improve with SNR.
{"title":"Capacity of known interference channel with Gaussian modulations","authors":"Shengli Zhang, S. Liew","doi":"10.1109/GlobalSIP.2014.7032323","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032323","url":null,"abstract":"In this paper, we investigate the capacity of known interference channel, where the receiver knows the interference data but not the channel gain of the interference data, assuming the use of Gaussian modulations. We first present a tight upper bound for the capacity of this known-interference channel. After that, we obtain the achievable rate of the channel with a blind known interference cancellation (BKIC) scheme in closed form. We prove that this achievable rate can approach the aforementioned upper bound in the high SNR regime. Moreover, it is much larger than the achievable rate of the traditional interference cancellation scheme. In particular, the achievable rate of BKIC continues to increase with SNR in the high SNR regime, while that of the traditional scheme approaches a fixed bound that does not improve with SNR.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116965151","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-12-01DOI: 10.1109/GlobalSIP.2014.7032133
Nikhil Krishnan, D. Baron
Computing problems that handle large amounts of data necessitate the use of lossless data compression for efficient storage and transmission. We present numerical results that showcase the advantages of a novel lossless universal data compression algorithm that uses parallel computational units to increase the throughput with minimal degradation in the compression quality. Our approach is to divide the data into blocks, estimate the minimum description length (MDL) context tree source underlying the entire input, and compress each block in parallel based on the MDL source. Numerical results from a prototype implementation suggest that our algorithm offers a better trade-off between compression and throughput than competing universal data compression algorithms.
{"title":"Performance of parallel two-pass MDL context tree algorithm","authors":"Nikhil Krishnan, D. Baron","doi":"10.1109/GlobalSIP.2014.7032133","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032133","url":null,"abstract":"Computing problems that handle large amounts of data necessitate the use of lossless data compression for efficient storage and transmission. We present numerical results that showcase the advantages of a novel lossless universal data compression algorithm that uses parallel computational units to increase the throughput with minimal degradation in the compression quality. Our approach is to divide the data into blocks, estimate the minimum description length (MDL) context tree source underlying the entire input, and compress each block in parallel based on the MDL source. Numerical results from a prototype implementation suggest that our algorithm offers a better trade-off between compression and throughput than competing universal data compression algorithms.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117142152","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-12-01DOI: 10.1109/GlobalSIP.2014.7032334
Kang Song, Baofeng Ji, Yongming Huang, Luxi Yang
This paper investigates the performance of cognitive radio network (CogNet). An interference cancellation scheme employed at secondary transmitter is first discussed based on the cancellation of cross interference from secondary transmitter to primary receiver. Then, we derive the expressions of the probability density function (PDF) and cumulative distribution function (CDF) of the received SNRs of both primary receiver and secondary receiver, and provide the closed-form overall outage probability expression of the system, which shows that the overall performance of the CogNet is improved with interference cancellation performed at the secondary transmitter. The numerical results finally verify the accuracy of our analysis.
{"title":"Performance analysis of cognitive radio networks with interference cancellation","authors":"Kang Song, Baofeng Ji, Yongming Huang, Luxi Yang","doi":"10.1109/GlobalSIP.2014.7032334","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032334","url":null,"abstract":"This paper investigates the performance of cognitive radio network (CogNet). An interference cancellation scheme employed at secondary transmitter is first discussed based on the cancellation of cross interference from secondary transmitter to primary receiver. Then, we derive the expressions of the probability density function (PDF) and cumulative distribution function (CDF) of the received SNRs of both primary receiver and secondary receiver, and provide the closed-form overall outage probability expression of the system, which shows that the overall performance of the CogNet is improved with interference cancellation performed at the secondary transmitter. The numerical results finally verify the accuracy of our analysis.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123911133","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-12-01DOI: 10.1109/GlobalSIP.2014.7032109
A. Arafa, S. Ulukus
We consider the effects of decoding costs in energy harvesting communication systems. In our setting, receivers, in addition to transmitters, rely solely on energy harvested from nature, and need to spend some energy in order to decode their intended packets. We model the decoding energy as an increasing convex function of the rate of the incoming data. In this setting, in addition to the traditional energy causality constraints at the transmitters, we have the decoding causality constraints, where energy spent by the receiver for decoding cannot exceed its harvested energy. We first consider the point-to-point single-user problem where the goal is to maximize the total throughput by a given deadline subject to both energy and decoding causality constraints. We then consider the multiple access channel (MAC) where the transmitters and the receiver harvest energy from nature, and characterize the maximum departure region.
{"title":"Single-user and multiple access channels with energy harvesting transmitters and receivers","authors":"A. Arafa, S. Ulukus","doi":"10.1109/GlobalSIP.2014.7032109","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032109","url":null,"abstract":"We consider the effects of decoding costs in energy harvesting communication systems. In our setting, receivers, in addition to transmitters, rely solely on energy harvested from nature, and need to spend some energy in order to decode their intended packets. We model the decoding energy as an increasing convex function of the rate of the incoming data. In this setting, in addition to the traditional energy causality constraints at the transmitters, we have the decoding causality constraints, where energy spent by the receiver for decoding cannot exceed its harvested energy. We first consider the point-to-point single-user problem where the goal is to maximize the total throughput by a given deadline subject to both energy and decoding causality constraints. We then consider the multiple access channel (MAC) where the transmitters and the receiver harvest energy from nature, and characterize the maximum departure region.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125728943","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-12-01DOI: 10.1109/GlobalSIP.2014.7032066
Deepayan Bhowmik, A. Wallace, Robert J. Stewart, Xinyuan Qian, G. Michaelson
Profile guided optimisation is a common technique used by compilers and runtime systems to shorten execution runtimes and to optimise locality aware scheduling and memory access on heterogeneous hardware platforms. Some profiling tools trace the execution of low level code, whilst others are designed for abstract models of computation to provide rich domain-specific context in profiling reports. We have implemented mean shift, a computer vision tracking algorithm, in the RVC-CAL dataflow language and use both dynamic runtime and static dataflow profiling mechanisms to identify and eliminate bottlenecks in our naive initial version. We use these profiling reports to tune the CPU scheduler reducing runtime by 88%, and to optimise our dataflow implementation that reduces runtime by a further 43% - an overall runtime reduction of 93%. We also assess the portability of our mean shift optimisations by trading off CPU runtime against resource utilisation on FPGAs. Applying all dataflow optimisations reduces FPGA design space significantly, requiring fewer slice LUTs and less block memory.
{"title":"Profile driven dataflow optimisation of mean shift visual tracking","authors":"Deepayan Bhowmik, A. Wallace, Robert J. Stewart, Xinyuan Qian, G. Michaelson","doi":"10.1109/GlobalSIP.2014.7032066","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032066","url":null,"abstract":"Profile guided optimisation is a common technique used by compilers and runtime systems to shorten execution runtimes and to optimise locality aware scheduling and memory access on heterogeneous hardware platforms. Some profiling tools trace the execution of low level code, whilst others are designed for abstract models of computation to provide rich domain-specific context in profiling reports. We have implemented mean shift, a computer vision tracking algorithm, in the RVC-CAL dataflow language and use both dynamic runtime and static dataflow profiling mechanisms to identify and eliminate bottlenecks in our naive initial version. We use these profiling reports to tune the CPU scheduler reducing runtime by 88%, and to optimise our dataflow implementation that reduces runtime by a further 43% - an overall runtime reduction of 93%. We also assess the portability of our mean shift optimisations by trading off CPU runtime against resource utilisation on FPGAs. Applying all dataflow optimisations reduces FPGA design space significantly, requiring fewer slice LUTs and less block memory.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124657356","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-12-01DOI: 10.1109/GlobalSIP.2014.7032321
Yi Zhang, Wee Peng Tay, K. H. Li, M. Esseghir, D. Gaïti
We formulate and study a multi-user multi-armed bandit (MAB) problem for opportunistic spectrum access (OSA) that exploits the temporal-spatial reuse of PU channels so that SUs who do not interfere with each other can make use of the same PU channel. We propose a three-stage distributed channel allocation policy for OSA, where SUs collaboratively find an optimal channel access grouping, and independently learn the channel availability statistics to maximize the total expected number of successful SU transmissions. We adopt a distributed synchronous greedy graph coloring algorithm to cluster SUs into maximal independent sets, and a distributed average consensus algorithm to learn the sizes of the independent sets, with SUs belonging to a larger set being assigned a smaller access rank. Each SU then independently learns the PU channel statistics using a revised ε-greedy policy based on its assigned access rank. We provide the theoretical upper bound for the regret, and simulations suggest that our proposed policy has a significantly smaller regret than a random access policy and an adaptive randomization policy.
{"title":"Distributed opportunistic spectrum access with spatial reuse in cognitive radio networks","authors":"Yi Zhang, Wee Peng Tay, K. H. Li, M. Esseghir, D. Gaïti","doi":"10.1109/GlobalSIP.2014.7032321","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032321","url":null,"abstract":"We formulate and study a multi-user multi-armed bandit (MAB) problem for opportunistic spectrum access (OSA) that exploits the temporal-spatial reuse of PU channels so that SUs who do not interfere with each other can make use of the same PU channel. We propose a three-stage distributed channel allocation policy for OSA, where SUs collaboratively find an optimal channel access grouping, and independently learn the channel availability statistics to maximize the total expected number of successful SU transmissions. We adopt a distributed synchronous greedy graph coloring algorithm to cluster SUs into maximal independent sets, and a distributed average consensus algorithm to learn the sizes of the independent sets, with SUs belonging to a larger set being assigned a smaller access rank. Each SU then independently learns the PU channel statistics using a revised ε-greedy policy based on its assigned access rank. We provide the theoretical upper bound for the regret, and simulations suggest that our proposed policy has a significantly smaller regret than a random access policy and an adaptive randomization policy.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124695768","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-12-01DOI: 10.1109/GlobalSIP.2014.7032239
Santiago Segarra, Alejandro Ribeiro
This paper applies dithering to design a node centrality measure for weighted graphs. The construction is an improvement on the stable betweenness centrality measure which, in turn, was introduced as a robust alternative to the well-known betweenness centrality. We interpret any given graph as the mean representation of a distribution of graphs and define the dithered centrality value as the expected centrality value across all graphs in the distribution. We show that the dithered stable betweenness centrality measure preserves robustness in the presence of noise while improving the behavior of stable betweenness. Numerical experiments demonstrate the advantages of dithering by comparing the performance of betweenness, stable betweenness and dithered stable betweenness centralities in terms of robustness to noise, dependence on the number and quality of alternative paths, and distribution of centrality values across the graph.
{"title":"Dithering and betweenness centrality in weighted graphs","authors":"Santiago Segarra, Alejandro Ribeiro","doi":"10.1109/GlobalSIP.2014.7032239","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032239","url":null,"abstract":"This paper applies dithering to design a node centrality measure for weighted graphs. The construction is an improvement on the stable betweenness centrality measure which, in turn, was introduced as a robust alternative to the well-known betweenness centrality. We interpret any given graph as the mean representation of a distribution of graphs and define the dithered centrality value as the expected centrality value across all graphs in the distribution. We show that the dithered stable betweenness centrality measure preserves robustness in the presence of noise while improving the behavior of stable betweenness. Numerical experiments demonstrate the advantages of dithering by comparing the performance of betweenness, stable betweenness and dithered stable betweenness centralities in terms of robustness to noise, dependence on the number and quality of alternative paths, and distribution of centrality values across the graph.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130559582","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-12-01DOI: 10.1109/GlobalSIP.2014.7032245
László Czap, Athanasios Papadopoulos, C. Fragouli
We present achievability schemes for secure message transmission in the presence of a passive eavesdropper, over arbitrary networks, where each edge corresponds to an independent erasure channel and we have available public channel state feedback. Our schemes are efficiently described through linear programming formulations, that generalize the information flow linear programs to networks with security constraints; different sources of secrecy show up as parameters in our linear programs, and solving the optimization problem enables to select the optimal (in terms of rate) scheme that integrates them. As far as we know, these are the first linear programming formulations for secret message transmission over arbitrary networks with erasures and channel state feedback.
{"title":"Achievable secrecy in arbitrary erasure networks with feedback","authors":"László Czap, Athanasios Papadopoulos, C. Fragouli","doi":"10.1109/GlobalSIP.2014.7032245","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032245","url":null,"abstract":"We present achievability schemes for secure message transmission in the presence of a passive eavesdropper, over arbitrary networks, where each edge corresponds to an independent erasure channel and we have available public channel state feedback. Our schemes are efficiently described through linear programming formulations, that generalize the information flow linear programs to networks with security constraints; different sources of secrecy show up as parameters in our linear programs, and solving the optimization problem enables to select the optimal (in terms of rate) scheme that integrates them. As far as we know, these are the first linear programming formulations for secret message transmission over arbitrary networks with erasures and channel state feedback.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130988019","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
扫码关注我们
求助内容：
应助结果提醒方式：