Pub Date : 2016-12-01DOI: 10.1109/ATNAC.2016.7878796
Diyang Li, Lin Zhang, Junchao Qiu
In this paper, we present a high security code division multiple access scheme for visible light communication (VLC) systems, and derive the information leakage expression. In our design, we propose to apply chaotic sequences to identify the users in VLC systems. Since the chaotic signals are noise-like and sensitive to the primary condition, only the legitimate users can retrieve the information according to the known primary condition, while the eavesdroppers can not intercept the information. Thus the security of VLC system is enhanced. Simulations are performed and the results show that the presented design can provide high security information transmission for multiple users.
{"title":"High security chaotic multiple access scheme for VLC systems","authors":"Diyang Li, Lin Zhang, Junchao Qiu","doi":"10.1109/ATNAC.2016.7878796","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878796","url":null,"abstract":"In this paper, we present a high security code division multiple access scheme for visible light communication (VLC) systems, and derive the information leakage expression. In our design, we propose to apply chaotic sequences to identify the users in VLC systems. Since the chaotic signals are noise-like and sensitive to the primary condition, only the legitimate users can retrieve the information according to the known primary condition, while the eavesdroppers can not intercept the information. Thus the security of VLC system is enhanced. Simulations are performed and the results show that the presented design can provide high security information transmission for multiple users.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124412224","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878794
M. N. Sakib, Chin-Tser Huang
The availability of GPS in smartphones and other wireless devices has made location based services extremely popular. One of the most widely used location based services is finding nearby friends. Popular social networks like Facebook offer this service purely based on exact user locations. To subscribe to this feature, users are forced to let the service provider know their actual locations, compromising their location privacy. In this paper, we present a protocol based on elliptic curve cryptography concepts for proximity testing which can preserve location privacy of the users. Our protocol enables two parties, Alice and Bob, to test whether they are within an agreed upon distance range from each other without revealing their exact location. Our security analysis shows that our protocol is secure against most known location privacy threats including location triangulation attacks. From experimental evaluation performed on prototype implementation, we found that our protocol is practical for resource-constrained smartphone devices requiring a reasonably small execution time (53 ms) without the communication overhead.
{"title":"Privacy preserving proximity testing using elliptic curves","authors":"M. N. Sakib, Chin-Tser Huang","doi":"10.1109/ATNAC.2016.7878794","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878794","url":null,"abstract":"The availability of GPS in smartphones and other wireless devices has made location based services extremely popular. One of the most widely used location based services is finding nearby friends. Popular social networks like Facebook offer this service purely based on exact user locations. To subscribe to this feature, users are forced to let the service provider know their actual locations, compromising their location privacy. In this paper, we present a protocol based on elliptic curve cryptography concepts for proximity testing which can preserve location privacy of the users. Our protocol enables two parties, Alice and Bob, to test whether they are within an agreed upon distance range from each other without revealing their exact location. Our security analysis shows that our protocol is secure against most known location privacy threats including location triangulation attacks. From experimental evaluation performed on prototype implementation, we found that our protocol is practical for resource-constrained smartphone devices requiring a reasonably small execution time (53 ms) without the communication overhead.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"295 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122977079","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878804
K. D. Joshi, Kotaro Kataoka
Multipath TCP (MPTCP) brings promising features of throughput improvement and load balancing by utilizing the multiple available paths. However, adding a subflow without awareness of the network state will result in wasting network resources and degrading MPTCP performance. Finding and operating the proper number of subflows are necessary to achieve the best performance of MPTCP. However, an MPTCP host does not have knowledge about the number of available paths in the network, and it may create the suboptimal number of subflows. This paper proposes SubFlow Optimizer (SFO) for MPTCP in SDN that estimates the Optimum Number of Subflows (ONS) and informs it to the MPTCP hosts. The estimated ONS reflects the number of optimal paths found out of the set of feasible paths between the server and client. Selecting such an optimal path for a new subflow improves its throughput whereas detecting ONS makes efficient use of the overall network. SFO also enables the quick negotiation of ONS between MPTCP hosts during its session establishment that reduces the time required for ONS negotiation down to one Round-Trip Time (RTT). Therefore, MPTCP hosts can immediately achieve the best performance without incremental try and catch of subflow creation. The results of performance evaluation show that SFO brings the significant throughput improvement to the overall MPTCP session compared with the cases of improper estimation of the available number of subflows.
{"title":"SFO: SubFlow Optimizer for MPTCP in SDN","authors":"K. D. Joshi, Kotaro Kataoka","doi":"10.1109/ATNAC.2016.7878804","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878804","url":null,"abstract":"Multipath TCP (MPTCP) brings promising features of throughput improvement and load balancing by utilizing the multiple available paths. However, adding a subflow without awareness of the network state will result in wasting network resources and degrading MPTCP performance. Finding and operating the proper number of subflows are necessary to achieve the best performance of MPTCP. However, an MPTCP host does not have knowledge about the number of available paths in the network, and it may create the suboptimal number of subflows. This paper proposes SubFlow Optimizer (SFO) for MPTCP in SDN that estimates the Optimum Number of Subflows (ONS) and informs it to the MPTCP hosts. The estimated ONS reflects the number of optimal paths found out of the set of feasible paths between the server and client. Selecting such an optimal path for a new subflow improves its throughput whereas detecting ONS makes efficient use of the overall network. SFO also enables the quick negotiation of ONS between MPTCP hosts during its session establishment that reduces the time required for ONS negotiation down to one Round-Trip Time (RTT). Therefore, MPTCP hosts can immediately achieve the best performance without incremental try and catch of subflow creation. The results of performance evaluation show that SFO brings the significant throughput improvement to the overall MPTCP session compared with the cases of improper estimation of the available number of subflows.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126898875","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878790
F. Wibowo, M. Gregory
Software Defined Networking (SDN) is an approach developed to facilitate next generation computer networking by decoupling the traffic control system from the underlying traffic transmission system. One key focus in the transition of next-generation computer networking is the service management improvement of network connectivity services. Connectivity across the global digital network requires a multi-domain capability. Decoupled of the control plane from data plane is the main character of SDN, along with the programmability for network services, utilizing management controllers. SDN had intrinsic potential to improve how a multi-domain implementation might occur utilizing the programmability capability. In this paper, we provide the outcomes of research into how SDN's decoupled programmable control regime affects the performance of multi-domain connectivity services.
{"title":"Software Defined Networking properties in multi-domain networks","authors":"F. Wibowo, M. Gregory","doi":"10.1109/ATNAC.2016.7878790","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878790","url":null,"abstract":"Software Defined Networking (SDN) is an approach developed to facilitate next generation computer networking by decoupling the traffic control system from the underlying traffic transmission system. One key focus in the transition of next-generation computer networking is the service management improvement of network connectivity services. Connectivity across the global digital network requires a multi-domain capability. Decoupled of the control plane from data plane is the main character of SDN, along with the programmability for network services, utilizing management controllers. SDN had intrinsic potential to improve how a multi-domain implementation might occur utilizing the programmability capability. In this paper, we provide the outcomes of research into how SDN's decoupled programmable control regime affects the performance of multi-domain connectivity services.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"5 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113963328","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878799
M. A. Khan, H. Tembine
The traditional human controlled network management approaches may not cope with the envisioned virtualized and more dynamic mobile communication paradigm. We propose an autonomic network management and policy execution framework that re-factors the network functionalities by decomposing the network architecture into hierarchical layers. We propose an hybrid self-learning scheme and present an aggregate approach to efficient learning without reconstructing from scratch for each layer, cluster, and player, for a variety of learning algorithms widely used in practical network management. To evaluate performance of proposed framework, we develop a full-scale demonstrator. Results confirm that system learns autonomously.
{"title":"Autonomic management of future wireless networks","authors":"M. A. Khan, H. Tembine","doi":"10.1109/ATNAC.2016.7878799","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878799","url":null,"abstract":"The traditional human controlled network management approaches may not cope with the envisioned virtualized and more dynamic mobile communication paradigm. We propose an autonomic network management and policy execution framework that re-factors the network functionalities by decomposing the network architecture into hierarchical layers. We propose an hybrid self-learning scheme and present an aggregate approach to efficient learning without reconstructing from scratch for each layer, cluster, and player, for a variety of learning algorithms widely used in practical network management. To evaluate performance of proposed framework, we develop a full-scale demonstrator. Results confirm that system learns autonomously.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126219102","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878781
Lei Wang, Xiao Wu, B. Zheng, Jingwu Cui, Huiming Zhou
Currently, all kinds of Location-based Services (LBS) are gradually demanding more location information of mobile users. The WiFi-based indoor positioning technologies have been investigated intensely. However, both positioning accuracy and stability are often degraded by RSS detection variance between different devices. To solve the two problems, this paper proposes a compensation strategy for RSS detection variance based on cosine similarity. Specifically, it uses cosine similarity as the metric to determine whether different devices could conduct compensation for RSS variance. To obtain the device pairs that satisfy the metric standard, it uses ratio correction method to compensate for RSS detection variance thus effectively solves the positioning accuracy and stability reduction causing by RSS detection variance between different devices. Experiments have shown that the proposed strategy reduces positioning error and improves positioning stability significantly.
{"title":"A cosine similarity-based compensation strategy for RSS detection variance in indoor localization","authors":"Lei Wang, Xiao Wu, B. Zheng, Jingwu Cui, Huiming Zhou","doi":"10.1109/ATNAC.2016.7878781","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878781","url":null,"abstract":"Currently, all kinds of Location-based Services (LBS) are gradually demanding more location information of mobile users. The WiFi-based indoor positioning technologies have been investigated intensely. However, both positioning accuracy and stability are often degraded by RSS detection variance between different devices. To solve the two problems, this paper proposes a compensation strategy for RSS detection variance based on cosine similarity. Specifically, it uses cosine similarity as the metric to determine whether different devices could conduct compensation for RSS variance. To obtain the device pairs that satisfy the metric standard, it uses ratio correction method to compensate for RSS detection variance thus effectively solves the positioning accuracy and stability reduction causing by RSS detection variance between different devices. Experiments have shown that the proposed strategy reduces positioning error and improves positioning stability significantly.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"113 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113969551","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878773
Mostfa Albdair, R. Addie, D. Fatseas
All network traffic is a byproduct of social networking. In this paper, Anonymized Internet (IP) Trace Datasets obtained from the Center for Applied Internet Data Analysis (CAIDA) has been used to identify and estimate characteristics of the underlying social network from the overall traffic. The analysis methods used here fall into two groups, the first being based on frequency analysis and second method being based on the use of traffic matrices, with the later analysis method being further sub-divided into groups based on the traffic mean, variance and covariance. The frequency analysis of origin (O), destination (D) and O-D Pair statistics exhibit heavy tailed behavior. Because the large number of IP addresses contained in the CAIDA Datasets, only the most predominate IP Addresses are used when estimating all three sub-divided groups of traffic matrices. Principal Component Analysis (PCA) and related methods are applied to identify key features of each type of traffic matrix. A new system called Antraff has been developed to carry out all the analysis procedures.
{"title":"Inference of social network behavior from Internet traffic traces","authors":"Mostfa Albdair, R. Addie, D. Fatseas","doi":"10.1109/ATNAC.2016.7878773","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878773","url":null,"abstract":"All network traffic is a byproduct of social networking. In this paper, Anonymized Internet (IP) Trace Datasets obtained from the Center for Applied Internet Data Analysis (CAIDA) has been used to identify and estimate characteristics of the underlying social network from the overall traffic. The analysis methods used here fall into two groups, the first being based on frequency analysis and second method being based on the use of traffic matrices, with the later analysis method being further sub-divided into groups based on the traffic mean, variance and covariance. The frequency analysis of origin (O), destination (D) and O-D Pair statistics exhibit heavy tailed behavior. Because the large number of IP addresses contained in the CAIDA Datasets, only the most predominate IP Addresses are used when estimating all three sub-divided groups of traffic matrices. Principal Component Analysis (PCA) and related methods are applied to identify key features of each type of traffic matrix. A new system called Antraff has been developed to carry out all the analysis procedures.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124834789","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878775
Nabeel Hadaad, A. Pitsillides, P. Kolios, A. Kuras, R. Addie
In disasters and emergencies severity of trauma and loss of life can be reduced by more effective communication between emergency workers, volunteers, and survivors. Typically, almost all of these parties will hold mobile phones (in addition to special purpose wireless communication devices, in the case of emergency workers), which are likely to be used intensively to seek and to provide aid to those in need. However, the utility of mobile phones may be limited by battery life. The usefulness of these mobile phones can therefore be enhanced by extending battery life. One way to extend battery life is to introduce a duty cycle, i.e. a pattern of use where the phone is alternately sleeping and active. It is shown below that under some broad assumptions about the type of emergency, it is best to introduce such a duty cycle straight away, and to start with quite short sleep cycles, which increase exponentially, but with a relatively slow rate of growth of the sleep cycle duration. Simulation experiments are conducted below which demonstrate the effectiveness of this strategy.
{"title":"Emergency network design - saving lives by saving power","authors":"Nabeel Hadaad, A. Pitsillides, P. Kolios, A. Kuras, R. Addie","doi":"10.1109/ATNAC.2016.7878775","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878775","url":null,"abstract":"In disasters and emergencies severity of trauma and loss of life can be reduced by more effective communication between emergency workers, volunteers, and survivors. Typically, almost all of these parties will hold mobile phones (in addition to special purpose wireless communication devices, in the case of emergency workers), which are likely to be used intensively to seek and to provide aid to those in need. However, the utility of mobile phones may be limited by battery life. The usefulness of these mobile phones can therefore be enhanced by extending battery life. One way to extend battery life is to introduce a duty cycle, i.e. a pattern of use where the phone is alternately sleeping and active. It is shown below that under some broad assumptions about the type of emergency, it is best to introduce such a duty cycle straight away, and to start with quite short sleep cycles, which increase exponentially, but with a relatively slow rate of growth of the sleep cycle duration. Simulation experiments are conducted below which demonstrate the effectiveness of this strategy.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125544903","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878817
Shan Jaffry, S. F. Hasan, X. Gui
On one hand, the small cells increase the overall data rate of the network. However, on the other hand, they result in increased cross-tier interference. This makes resource allocation to the cellular users more challenging. In this paper, we review a number of resource allocation schemes that are meant to reduce interference in both fixed and moving small cells. Distributed resource allocation for small cell networks aims at improving the overall system performance in terms of latency and power. A discussion that compares centralized schemes with a distributed one is also covered. We argue in this paper that distributed allocation is a better fit for the moving small cells.
{"title":"Making a case for the moving small cells","authors":"Shan Jaffry, S. F. Hasan, X. Gui","doi":"10.1109/ATNAC.2016.7878817","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878817","url":null,"abstract":"On one hand, the small cells increase the overall data rate of the network. However, on the other hand, they result in increased cross-tier interference. This makes resource allocation to the cellular users more challenging. In this paper, we review a number of resource allocation schemes that are meant to reduce interference in both fixed and moving small cells. Distributed resource allocation for small cell networks aims at improving the overall system performance in terms of latency and power. A discussion that compares centralized schemes with a distributed one is also covered. We argue in this paper that distributed allocation is a better fit for the moving small cells.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"351 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134330173","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 : 2016-12-01DOI: 10.1109/ATNAC.2016.7878808
Yi Cheng, Jianxin Chen, Linhui Sun, Yunyi Zheng
Peer-to-Peer(P2P)-based Video-on-Demand application has gained more attentions recently. Due to the system complexity, there are still many challenges for practical deployment such as peer selection. Previous works focused on how to find the most suitable service or the request response scheme on the peer-side. In this paper, we study the request response scheme on the server-side by discussing three kinds of response schemes, e.g. urgency first (UF), fresh request first (FRF) and complemental request first (RCF). Besides that, we proposed a redirection scheme named server request redirection (SRR) to improve the quality of service (QoS) of P2P-VoD system further, which is verified by the simulation results.
{"title":"Request response scheme on server for the centralized P2P-VoD system","authors":"Yi Cheng, Jianxin Chen, Linhui Sun, Yunyi Zheng","doi":"10.1109/ATNAC.2016.7878808","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878808","url":null,"abstract":"Peer-to-Peer(P2P)-based Video-on-Demand application has gained more attentions recently. Due to the system complexity, there are still many challenges for practical deployment such as peer selection. Previous works focused on how to find the most suitable service or the request response scheme on the peer-side. In this paper, we study the request response scheme on the server-side by discussing three kinds of response schemes, e.g. urgency first (UF), fresh request first (FRF) and complemental request first (RCF). Besides that, we proposed a redirection scheme named server request redirection (SRR) to improve the quality of service (QoS) of P2P-VoD system further, which is verified by the simulation results.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134389198","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
扫码关注我们
求助内容：
应助结果提醒方式：