Pub Date : 2017-02-01DOI: 10.1109/ITA.2017.8023482
Wei Yu
This paper aims to provide an information theoretical analysis of massive device connectivity scenario in which a large number of devices with sporadic traffic communicate in the uplink to a base-station (BS). In each coherence time interval, the BS needs to identify the active devices, to estimate their channels, and to decode the transmitted messages from the devices. This paper first derives an information theoretic upper bound on the overall transmission rate. We then provide a degree-of-freedom (DoF) analysis that illustrates the cost of device identification for massive connectivity. We show that the optimal number of active devices is strictly less than half of the coherence time slots, and the achievable DoF decreases linearly with the number of active devices when it exceeds the number of receive antennas. This paper further presents a two-phase practical framework in which device identification and channel estimation are performed jointly using compressed sensing techniques in the first phase, with data transmission taking place in the second phase. We outline the opportunities in utilizing compressed sensing results to analyze the performance of the overall framework and to optimize the system parameters.
{"title":"On the fundamental limits of massive connectivity","authors":"Wei Yu","doi":"10.1109/ITA.2017.8023482","DOIUrl":"https://doi.org/10.1109/ITA.2017.8023482","url":null,"abstract":"This paper aims to provide an information theoretical analysis of massive device connectivity scenario in which a large number of devices with sporadic traffic communicate in the uplink to a base-station (BS). In each coherence time interval, the BS needs to identify the active devices, to estimate their channels, and to decode the transmitted messages from the devices. This paper first derives an information theoretic upper bound on the overall transmission rate. We then provide a degree-of-freedom (DoF) analysis that illustrates the cost of device identification for massive connectivity. We show that the optimal number of active devices is strictly less than half of the coherence time slots, and the achievable DoF decreases linearly with the number of active devices when it exceeds the number of receive antennas. This paper further presents a two-phase practical framework in which device identification and channel estimation are performed jointly using compressed sensing techniques in the first phase, with data transmission taking place in the second phase. We outline the opportunities in utilizing compressed sensing results to analyze the performance of the overall framework and to optimize the system parameters.","PeriodicalId":305510,"journal":{"name":"2017 Information Theory and Applications Workshop (ITA)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116657988","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 : 2017-02-01DOI: 10.1109/ITA.2017.8023465
F. Librino, Giorgio Quer
A promising approach to cope with the increasing data demand in cellular networks is the use of device-to-device (D2D) communications over short distances. It allows to save valuable resources like energy, time and frequency, in particular when the spectrum is shared with the cellular communications. While spectrum sharing can grant a high spectrum reuse, it also requires a proper scheduling, in order to limit the resulting intra-cell interference. In contrast to several recent centralized approaches, in this paper we illustrate how context awareness, derived from the measurement of few local parameters, can be exploited to set up D2D communications in a distributed fashion. The tradeoff between the gain offered by non-orthogonal D2D communications over uplink channels and the impact of the increased interference is derived through a detailed theoretical analysis. As a result of this analysis, we state a theorem to determine the optimal transmission strategy in order to maximize the throughput in a single cell scenario. By comparing our strategy to the state-of-the art in the same network scenario, we show how the adaptivity offered by context awareness can be turned into an improved performance, in terms of sum throughput and fairness.
{"title":"On the coexistence of D2D and cellular networks: An optimal distributed approach","authors":"F. Librino, Giorgio Quer","doi":"10.1109/ITA.2017.8023465","DOIUrl":"https://doi.org/10.1109/ITA.2017.8023465","url":null,"abstract":"A promising approach to cope with the increasing data demand in cellular networks is the use of device-to-device (D2D) communications over short distances. It allows to save valuable resources like energy, time and frequency, in particular when the spectrum is shared with the cellular communications. While spectrum sharing can grant a high spectrum reuse, it also requires a proper scheduling, in order to limit the resulting intra-cell interference. In contrast to several recent centralized approaches, in this paper we illustrate how context awareness, derived from the measurement of few local parameters, can be exploited to set up D2D communications in a distributed fashion. The tradeoff between the gain offered by non-orthogonal D2D communications over uplink channels and the impact of the increased interference is derived through a detailed theoretical analysis. As a result of this analysis, we state a theorem to determine the optimal transmission strategy in order to maximize the throughput in a single cell scenario. By comparing our strategy to the state-of-the art in the same network scenario, we show how the adaptivity offered by context awareness can be turned into an improved performance, in terms of sum throughput and fairness.","PeriodicalId":305510,"journal":{"name":"2017 Information Theory and Applications Workshop (ITA)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123239133","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 : 2017-02-01DOI: 10.1109/ITA.2017.8023445
Chung Chan, A. Al-Bashabsheh, Qiaoqiao Zhou
Motivated by the fact that entities in a social network or biological system often interact by exchanging information, we propose an efficient info-clustering algorithm that can group entities into communities using a parametric max-flow algorithm. This is a meaningful special case of the info-clustering paradigm where the dependency structure is graphical and can be learned readily from data.
{"title":"Info-clustering: An efficient algorithm by network information flow","authors":"Chung Chan, A. Al-Bashabsheh, Qiaoqiao Zhou","doi":"10.1109/ITA.2017.8023445","DOIUrl":"https://doi.org/10.1109/ITA.2017.8023445","url":null,"abstract":"Motivated by the fact that entities in a social network or biological system often interact by exchanging information, we propose an efficient info-clustering algorithm that can group entities into communities using a parametric max-flow algorithm. This is a meaningful special case of the info-clustering paradigm where the dependency structure is graphical and can be learned readily from data.","PeriodicalId":305510,"journal":{"name":"2017 Information Theory and Applications Workshop (ITA)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125477833","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 : 2017-02-01DOI: 10.1109/ITA.2017.8023449
I. Duursma, Hoang Dau
As an alternative to replication of data blocks, the Hadoop Distributed File System offers the possibility of erasure coding using Reed-Solomon codes. The use of Reed-Solomon codes significantly reduces storage overhead but has more expensive failure recovery. Using the shortened Reed-Solomon code RS(10,4), with 10 data symbols and 4 check symbols, standard erasure repair requires downloading 10 symbols or 80 bits. Known schemes attain a reduced repair bandwidth of 65 or 64 bits. In this paper we present three repair schemes with bandwidth 60, 56 and 54, respectively.
{"title":"Low bandwidth repair of the RS(10,4) Reed-Solomon code","authors":"I. Duursma, Hoang Dau","doi":"10.1109/ITA.2017.8023449","DOIUrl":"https://doi.org/10.1109/ITA.2017.8023449","url":null,"abstract":"As an alternative to replication of data blocks, the Hadoop Distributed File System offers the possibility of erasure coding using Reed-Solomon codes. The use of Reed-Solomon codes significantly reduces storage overhead but has more expensive failure recovery. Using the shortened Reed-Solomon code RS(10,4), with 10 data symbols and 4 check symbols, standard erasure repair requires downloading 10 symbols or 80 bits. Known schemes attain a reduced repair bandwidth of 65 or 64 bits. In this paper we present three repair schemes with bandwidth 60, 56 and 54, respectively.","PeriodicalId":305510,"journal":{"name":"2017 Information Theory and Applications Workshop (ITA)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122458983","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 : 2017-02-01DOI: 10.1109/ITA.2017.8023468
Yu-Yu Lin, I. Rubin
Traffic management mechanisms for autonomous vehicular transportation systems are designed to regulate vehicular topological layouts and mobility patterns to form robust data communication networks while guaranteeing vehicular throughput rates. To enhance the performance of the underlying wireless communications networking operations, this system would be aided by the deployment of an information network infrastructure that consists of Road Side Units (RSUs). In this paper, we study the design of an RSU-aided autonomous vehicular network that incorporates both data networking and traffic management dimensions. We investigate the inter-relationships that characterize the joint design of vehicular ad hoc networking control mechanisms and cost-effective RSU backbone network. We configure vehicles into platoon structures in aiming to guarantee a robust dissemination of data message flows. An efficient algorithm is developed to determine the optimal settings of platoon parameters and RSU locations across a highway. The result is used to demonstrate the fundamental design tradeoffs to be made when considering performance metrics that involve vehicular throughput rates, infrastructure deployment costs, and the reliability of wireless communications networking.
{"title":"Infrastructure aided networking and traffic management for autonomous transportation","authors":"Yu-Yu Lin, I. Rubin","doi":"10.1109/ITA.2017.8023468","DOIUrl":"https://doi.org/10.1109/ITA.2017.8023468","url":null,"abstract":"Traffic management mechanisms for autonomous vehicular transportation systems are designed to regulate vehicular topological layouts and mobility patterns to form robust data communication networks while guaranteeing vehicular throughput rates. To enhance the performance of the underlying wireless communications networking operations, this system would be aided by the deployment of an information network infrastructure that consists of Road Side Units (RSUs). In this paper, we study the design of an RSU-aided autonomous vehicular network that incorporates both data networking and traffic management dimensions. We investigate the inter-relationships that characterize the joint design of vehicular ad hoc networking control mechanisms and cost-effective RSU backbone network. We configure vehicles into platoon structures in aiming to guarantee a robust dissemination of data message flows. An efficient algorithm is developed to determine the optimal settings of platoon parameters and RSU locations across a highway. The result is used to demonstrate the fundamental design tradeoffs to be made when considering performance metrics that involve vehicular throughput rates, infrastructure deployment costs, and the reliability of wireless communications networking.","PeriodicalId":305510,"journal":{"name":"2017 Information Theory and Applications Workshop (ITA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130056164","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 : 2017-02-01DOI: 10.1109/ITA.2017.8023448
Chiranjib Saha, Mehrnaz Afshang, Harpreet S. Dhillon
The growing complexity of heterogeneous cellular networks (HetNets) has necessitated the need to consider variety of user and base station (BS) configurations for realistic performance evaluation and system design. This is directly reflected in the HetNet simulation models considered by standardization bodies, such as the third generation partnership project (3GPP). Complementary to these simulation models, stochastic geometry-based approach modeling the user and BS locations as independent and homogeneous Poisson point processes (PPPs) has gained prominence in the past few years. Despite its success in revealing useful insights, this PPP-based model is not rich enough to capture all the spatial configurations that appear in real-world HetNet deployments (on which 3GPP simulation models are based). In this paper, we bridge the gap between the 3GPP simulation models and the popular PPP-based analytical model by developing a new unified HetNet model in which a fraction of users and some BS tiers are modeled as Poisson cluster processes (PCPs). This model captures both non-uniformity and coupling in the BS and user locations. For this setup, we derive exact expression for downlink coverage probability under maximum signal-to-interference ratio (SIR) cell association model. As intermediate results, we define and evaluate sum-product functionals for PPP and PCP. Special instances of the proposed model are shown to closely resemble different configurations considered in 3GPP HetNet models. Our results concretely demonstrate that the performance trends are highly sensitive to the assumptions made on the user and SBS configurations.
{"title":"Poisson cluster process: Bridging the gap between PPP and 3GPP HetNet models","authors":"Chiranjib Saha, Mehrnaz Afshang, Harpreet S. Dhillon","doi":"10.1109/ITA.2017.8023448","DOIUrl":"https://doi.org/10.1109/ITA.2017.8023448","url":null,"abstract":"The growing complexity of heterogeneous cellular networks (HetNets) has necessitated the need to consider variety of user and base station (BS) configurations for realistic performance evaluation and system design. This is directly reflected in the HetNet simulation models considered by standardization bodies, such as the third generation partnership project (3GPP). Complementary to these simulation models, stochastic geometry-based approach modeling the user and BS locations as independent and homogeneous Poisson point processes (PPPs) has gained prominence in the past few years. Despite its success in revealing useful insights, this PPP-based model is not rich enough to capture all the spatial configurations that appear in real-world HetNet deployments (on which 3GPP simulation models are based). In this paper, we bridge the gap between the 3GPP simulation models and the popular PPP-based analytical model by developing a new unified HetNet model in which a fraction of users and some BS tiers are modeled as Poisson cluster processes (PCPs). This model captures both non-uniformity and coupling in the BS and user locations. For this setup, we derive exact expression for downlink coverage probability under maximum signal-to-interference ratio (SIR) cell association model. As intermediate results, we define and evaluate sum-product functionals for PPP and PCP. Special instances of the proposed model are shown to closely resemble different configurations considered in 3GPP HetNet models. Our results concretely demonstrate that the performance trends are highly sensitive to the assumptions made on the user and SBS configurations.","PeriodicalId":305510,"journal":{"name":"2017 Information Theory and Applications Workshop (ITA)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123482220","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 : 2017-02-01DOI: 10.1109/ITA.2017.8023444
Seok-Ho Chang, Hee-Gul Park, Sang-Hyo Kim, Jihwan P. Choi
This paper studies the distance threshold (i.e., coverage of the cell center region) in fractional frequency reuse cells. We analyze the influence of the transmission power of the base station on the optimal distance threshold. Our analysis focuses on the case where the transmission powers of all the base stations scale up or down proportionally. It is shown that in this case, the optimal threshold for an arbitrary cell in the system is a non-increasing function in the transmission power.
{"title":"Study on the coverage of fractional frequency reuse cells","authors":"Seok-Ho Chang, Hee-Gul Park, Sang-Hyo Kim, Jihwan P. Choi","doi":"10.1109/ITA.2017.8023444","DOIUrl":"https://doi.org/10.1109/ITA.2017.8023444","url":null,"abstract":"This paper studies the distance threshold (i.e., coverage of the cell center region) in fractional frequency reuse cells. We analyze the influence of the transmission power of the base station on the optimal distance threshold. Our analysis focuses on the case where the transmission powers of all the base stations scale up or down proportionally. It is shown that in this case, the optimal threshold for an arbitrary cell in the system is a non-increasing function in the transmission power.","PeriodicalId":305510,"journal":{"name":"2017 Information Theory and Applications Workshop (ITA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131168393","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 : 2017-02-01DOI: 10.1109/ITA.2017.8023477
I. Tashev, Zhong-Qiu Wang, Keith W. Godin
Recognition of speaker emotion during interaction in spoken dialog systems can enhance the user experience, and provide system operators with information valuable to ongoing assessment of interaction system performance and utility. Interaction utterances are very short, and we assume the speaker's emotion is constant throughout a given utterance. This paper investigates combinations of a GMM-based low-level feature extractor with a neural network serving as a high level feature extractor. The advantage of this system architecture is that it combines the fast developing neural network-based solutions with the classic statistical approaches applied to emotion recognition. Experiments on a Mandarin data set compare different solutions under the same or close conditions.
{"title":"Speech emotion recognition based on Gaussian Mixture Models and Deep Neural Networks","authors":"I. Tashev, Zhong-Qiu Wang, Keith W. Godin","doi":"10.1109/ITA.2017.8023477","DOIUrl":"https://doi.org/10.1109/ITA.2017.8023477","url":null,"abstract":"Recognition of speaker emotion during interaction in spoken dialog systems can enhance the user experience, and provide system operators with information valuable to ongoing assessment of interaction system performance and utility. Interaction utterances are very short, and we assume the speaker's emotion is constant throughout a given utterance. This paper investigates combinations of a GMM-based low-level feature extractor with a neural network serving as a high level feature extractor. The advantage of this system architecture is that it combines the fast developing neural network-based solutions with the classic statistical approaches applied to emotion recognition. Experiments on a Mandarin data set compare different solutions under the same or close conditions.","PeriodicalId":305510,"journal":{"name":"2017 Information Theory and Applications Workshop (ITA)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127743866","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 : 2017-02-01DOI: 10.1109/ITA.2017.8023461
Ali Bereyhi, R. Müller, H. Schulz-Baldes
For noisy compressive sensing systems, the asymptotic distortion with respect to an arbitrary distortion function is determined when a general class of least-square based reconstruction schemes is employed. The sampling matrix is considered to belong to a large ensemble of random matrices including i.i.d. and projector matrices, and the source vector is assumed to be i.i.d. with a desired distribution. We take a statistical mechanical approach by representing the asymptotic distortion as a macroscopic parameter of a spin glass and employing the replica method for the large-system analysis. In contrast to earlier studies, we evaluate the general replica ansatz which includes the RS ansatz as well as RSB. The generality of the solution enables us to study the impact of symmetry breaking. Our numerical investigations depict that for the reconstruction scheme with the “zero-norm” penalty function, the RS fails to predict the asymptotic distortion for relatively large compression rates; however, the one-step RSB ansatz gives a valid prediction of the performance within a larger regime of compression rates.
{"title":"Replica symmetry breaking in compressive sensing","authors":"Ali Bereyhi, R. Müller, H. Schulz-Baldes","doi":"10.1109/ITA.2017.8023461","DOIUrl":"https://doi.org/10.1109/ITA.2017.8023461","url":null,"abstract":"For noisy compressive sensing systems, the asymptotic distortion with respect to an arbitrary distortion function is determined when a general class of least-square based reconstruction schemes is employed. The sampling matrix is considered to belong to a large ensemble of random matrices including i.i.d. and projector matrices, and the source vector is assumed to be i.i.d. with a desired distribution. We take a statistical mechanical approach by representing the asymptotic distortion as a macroscopic parameter of a spin glass and employing the replica method for the large-system analysis. In contrast to earlier studies, we evaluate the general replica ansatz which includes the RS ansatz as well as RSB. The generality of the solution enables us to study the impact of symmetry breaking. Our numerical investigations depict that for the reconstruction scheme with the “zero-norm” penalty function, the RS fails to predict the asymptotic distortion for relatively large compression rates; however, the one-step RSB ansatz gives a valid prediction of the performance within a larger regime of compression rates.","PeriodicalId":305510,"journal":{"name":"2017 Information Theory and Applications Workshop (ITA)","volume":"22 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129036392","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 : 2017-02-01DOI: 10.1109/ITA.2017.8023483
Jingge Zhu, S. Lim, M. Gastpar
For a two-user Gaussian multiple access channel, computation codes are designed for the scenarios where the decoder is not interested in decoding the two codewords, but only the sum of them. It has been observed that good computation codes should possess some algebraic structure. In this note, we expose the fact that such algebraic structure could undermine the capability of the codes for recovering the messages, i.e., for the purpose of multiple-access. Particularly, we establish duality results between the codes which are good for computation and the codes which are good for multiple access.
{"title":"On the duality between multiple-access codes and computation codes","authors":"Jingge Zhu, S. Lim, M. Gastpar","doi":"10.1109/ITA.2017.8023483","DOIUrl":"https://doi.org/10.1109/ITA.2017.8023483","url":null,"abstract":"For a two-user Gaussian multiple access channel, computation codes are designed for the scenarios where the decoder is not interested in decoding the two codewords, but only the sum of them. It has been observed that good computation codes should possess some algebraic structure. In this note, we expose the fact that such algebraic structure could undermine the capability of the codes for recovering the messages, i.e., for the purpose of multiple-access. Particularly, we establish duality results between the codes which are good for computation and the codes which are good for multiple access.","PeriodicalId":305510,"journal":{"name":"2017 Information Theory and Applications Workshop (ITA)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116782479","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
扫码关注我们
求助内容：
应助结果提醒方式：