Pub Date : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945418
Naman Gupta, Vinayak Naik, Srishti Sengupta
With the advent of the Internet of Things (IoT), privacy and security of sensitive data has become a major concern. In general, sensors which are the enablers for IoT, send the sensed data to a cloud database over the internet. The communication to the cloud database may be compromised by an adversary, or the database maybe accessed by a curious database administrator, thereby raising security concerns. To solve this issue, we demonstrate a solution to safeguard IoT devices in a home network scenario from potential attacks. A firewall is set up using a Raspberry Pi as a gateway which secures their communication with the cloud database. Furthermore, we plan to build a location-aware (physical location in the home network scenario) heuristics and a signature based traffic detection dashboard running on the Raspberry Pi, in order to control the IoT devices and log their network behavior.
{"title":"A firewall for Internet of Things","authors":"Naman Gupta, Vinayak Naik, Srishti Sengupta","doi":"10.1109/COMSNETS.2017.7945418","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945418","url":null,"abstract":"With the advent of the Internet of Things (IoT), privacy and security of sensitive data has become a major concern. In general, sensors which are the enablers for IoT, send the sensed data to a cloud database over the internet. The communication to the cloud database may be compromised by an adversary, or the database maybe accessed by a curious database administrator, thereby raising security concerns. To solve this issue, we demonstrate a solution to safeguard IoT devices in a home network scenario from potential attacks. A firewall is set up using a Raspberry Pi as a gateway which secures their communication with the cloud database. Furthermore, we plan to build a location-aware (physical location in the home network scenario) heuristics and a signature based traffic detection dashboard running on the Raspberry Pi, in order to control the IoT devices and log their network behavior.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134365969","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945393
Tanmoy Maitra, Sarbani Roy
Secure communication in a continuous patient monitoring system (PMS) through body sensors is required to keep privacy on user's and sensors' secret information and data respectively. This paper presents a secure communication protocol for PMS (SecPMS) in order to get efficient and secure services in such environment. Robustness of the proposed protocol is analyzed using random oracle and it shows that SecPMS provides strong security against possible known attacks. Furthermore, performance comparison is given as an evidence which establishes the efficiency of SecPMS than related existing protocols with respect to time complexity of computation.
{"title":"SecPMS: An efficient and secure communication protocol for continuous patient monitoring system using body sensors","authors":"Tanmoy Maitra, Sarbani Roy","doi":"10.1109/COMSNETS.2017.7945393","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945393","url":null,"abstract":"Secure communication in a continuous patient monitoring system (PMS) through body sensors is required to keep privacy on user's and sensors' secret information and data respectively. This paper presents a secure communication protocol for PMS (SecPMS) in order to get efficient and secure services in such environment. Robustness of the proposed protocol is analyzed using random oracle and it shows that SecPMS provides strong security against possible known attacks. Furthermore, performance comparison is given as an evidence which establishes the efficiency of SecPMS than related existing protocols with respect to time complexity of computation.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123974036","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945445
P. Kumari, T. Anjali
Health data is one of the most sensitive data available and its misuse can very easily endanger human lives. Ergo, each system and process in Body Sensor Network (BSN) which accesses this data needs to be secured well enough. In order to achieve this high security along with low energy consumption, a key management scheme named as Double Encryption has been proposed here. The proposed method uses two keys for encryption: a novel physiological feature based key and a pre-shared key between the communicating nodes. The feature and key generation, both are more economical than the existing algorithms in terms of computation, communication, storage, security and error. The features are exchanged with the help of simple addition and subtraction, instead of heavy computations like a vault or coffer creation, commitment, encryption or decryption. The another salient feature of the proposed algorithm is that if the key negotiation fails once, the protocol does not need to be restarted. The protocol is secure in various scenarios like Brute Force Attack, RCB (Remotely Capturing Biometric data) attack, Node Capture attack and Battery Depletion Attack.
{"title":"Securing a body sensor network","authors":"P. Kumari, T. Anjali","doi":"10.1109/COMSNETS.2017.7945445","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945445","url":null,"abstract":"Health data is one of the most sensitive data available and its misuse can very easily endanger human lives. Ergo, each system and process in Body Sensor Network (BSN) which accesses this data needs to be secured well enough. In order to achieve this high security along with low energy consumption, a key management scheme named as Double Encryption has been proposed here. The proposed method uses two keys for encryption: a novel physiological feature based key and a pre-shared key between the communicating nodes. The feature and key generation, both are more economical than the existing algorithms in terms of computation, communication, storage, security and error. The features are exchanged with the help of simple addition and subtraction, instead of heavy computations like a vault or coffer creation, commitment, encryption or decryption. The another salient feature of the proposed algorithm is that if the key negotiation fails once, the protocol does not need to be restarted. The protocol is secure in various scenarios like Brute Force Attack, RCB (Remotely Capturing Biometric data) attack, Node Capture attack and Battery Depletion Attack.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121397917","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945365
A. Bharti, Subrat Kar, V. Jain
In this paper, we propose construction method of new two-dimensional (2-D) codes where one-coincidence frequency hopping code (OCFHC) is used for wavelength assignment and congruence codes (CCs) for time slot assignment. The performance evaluation of the OCFHC/quadratic congruence code (OCFHC/QCC) is made in presence of atmospheric turbulence and various weather conditions. Lognormal model is used for weak turbulence and gamma-gamma model for moderate and strong turbulence conditions. Various weather conditions like thick fog, light fog and very clear air are considered in the evaluation.
{"title":"Performance analysis of wireless OCDMA multi-user system based on new 2-D code in presence of atmospheric turbulence and various weather conditions","authors":"A. Bharti, Subrat Kar, V. Jain","doi":"10.1109/COMSNETS.2017.7945365","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945365","url":null,"abstract":"In this paper, we propose construction method of new two-dimensional (2-D) codes where one-coincidence frequency hopping code (OCFHC) is used for wavelength assignment and congruence codes (CCs) for time slot assignment. The performance evaluation of the OCFHC/quadratic congruence code (OCFHC/QCC) is made in presence of atmospheric turbulence and various weather conditions. Lognormal model is used for weak turbulence and gamma-gamma model for moderate and strong turbulence conditions. Various weather conditions like thick fog, light fog and very clear air are considered in the evaluation.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121477398","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945366
A. Bhowal, R. S. Kshetrimayum
In this paper, relay based mobile to mobile (M2M) system employing amplify and forward (AF) protocol has been considered and its end to end performance over N-α-μ fading channels has been explored. The closed form expressions for probability density function (PDF), cumulative distribution function (CDF) of cascaded α-μ fading channels and lower bound on average symbol error probability (ASEP) have been obtained. The analytical results have been confirmed by means of Monte Carlo simulations. The variation of the performance due to change in fading coefficients, relative geometrical gain, power allocation and number of cascaded components is also reported in this paper.
{"title":"End to end performance analysis of M2M cooperative communication over cascaded α-μ channels","authors":"A. Bhowal, R. S. Kshetrimayum","doi":"10.1109/COMSNETS.2017.7945366","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945366","url":null,"abstract":"In this paper, relay based mobile to mobile (M2M) system employing amplify and forward (AF) protocol has been considered and its end to end performance over N-α-μ fading channels has been explored. The closed form expressions for probability density function (PDF), cumulative distribution function (CDF) of cascaded α-μ fading channels and lower bound on average symbol error probability (ASEP) have been obtained. The analytical results have been confirmed by means of Monte Carlo simulations. The variation of the performance due to change in fading coefficients, relative geometrical gain, power allocation and number of cascaded components is also reported in this paper.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128744050","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945437
Ashraf Y. Mahgoub, S. Ganesh, Folker Meyer, A. Grama, S. Chaterji
Motivated by the increasing trend of storing data for web applications in fast NoSQL systems, in this paper, we experiment with the leading NoSQL datastore — Cassandra — and a latest generation re-design of Cassandra — ScyllaDB — meant to deliver bleeding-edge performance on modern multicore machines. We evaluate the scalability claim of ScyllaDB, in terms of the number of clients, and provide diagnostic evidence through OS-level metrics, such as, disk utilization and cache-miss rates. Specifically we are motivated by the need to store large amounts of IoT-generated data in nearby datastores. Our evaluation is the first in the line of objective benchmarking of these two technologies that are finding widespread adoption in data centers and other modern computing platforms. For example, we find hitherto unreported performance instability of ScyllaDB when the servers are replicated while we identify the root cause of improved read performance of ScyllaDB compared to Cassandra.
{"title":"Suitability of NoSQL systems — Cassandra and ScyllaDB — For IoT workloads","authors":"Ashraf Y. Mahgoub, S. Ganesh, Folker Meyer, A. Grama, S. Chaterji","doi":"10.1109/COMSNETS.2017.7945437","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945437","url":null,"abstract":"Motivated by the increasing trend of storing data for web applications in fast NoSQL systems, in this paper, we experiment with the leading NoSQL datastore — Cassandra — and a latest generation re-design of Cassandra — ScyllaDB — meant to deliver bleeding-edge performance on modern multicore machines. We evaluate the scalability claim of ScyllaDB, in terms of the number of clients, and provide diagnostic evidence through OS-level metrics, such as, disk utilization and cache-miss rates. Specifically we are motivated by the need to store large amounts of IoT-generated data in nearby datastores. Our evaluation is the first in the line of objective benchmarking of these two technologies that are finding widespread adoption in data centers and other modern computing platforms. For example, we find hitherto unreported performance instability of ScyllaDB when the servers are replicated while we identify the root cause of improved read performance of ScyllaDB compared to Cassandra.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126623332","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945356
Megha Vij, Vinayak Naik, Venkata M. V. Gunturi
We look at the problem of using accelerometer in smartphones to detect mobility activities of users. The activities are internally composed of several simple activities. One can perform the task of distinguishing the activities using classic classification techniques with two different data representations namely, statistical features and ECDF-based features. Our recommendation in this paper is to use the latter as it suits better for mobility activities. Our major contribution is to explore the challenge of class imbalance in detecting mobility activities. To handle that challenge, we propose use of an ensemble of a classification model. It improves accuracy of detection over standalone classification models. To evaluate performance of the recommended technique, we use transportation by a metro train as a running case study. We consider two activities during the metro train travel. They are (a) whether user is at a metro train station or (b) in a metro train. Our recommended technique results in precision of 98% for the case study. It is significantly more than the state-of-the-art value of 70% for a similar case study. This case study finds its applications in the area of smart city analytics, for instance, our solution could be used to estimate rush at metro stations. In the long run, it can also be used to enhance navigation services to account for delays at metro stations into their algorithms.
{"title":"Use of ECDF-based features and ensemble of classifiers to accurately detect mobility activities of people using accelerometers","authors":"Megha Vij, Vinayak Naik, Venkata M. V. Gunturi","doi":"10.1109/COMSNETS.2017.7945356","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945356","url":null,"abstract":"We look at the problem of using accelerometer in smartphones to detect mobility activities of users. The activities are internally composed of several simple activities. One can perform the task of distinguishing the activities using classic classification techniques with two different data representations namely, statistical features and ECDF-based features. Our recommendation in this paper is to use the latter as it suits better for mobility activities. Our major contribution is to explore the challenge of class imbalance in detecting mobility activities. To handle that challenge, we propose use of an ensemble of a classification model. It improves accuracy of detection over standalone classification models. To evaluate performance of the recommended technique, we use transportation by a metro train as a running case study. We consider two activities during the metro train travel. They are (a) whether user is at a metro train station or (b) in a metro train. Our recommended technique results in precision of 98% for the case study. It is significantly more than the state-of-the-art value of 70% for a similar case study. This case study finds its applications in the area of smart city analytics, for instance, our solution could be used to estimate rush at metro stations. In the long run, it can also be used to enhance navigation services to account for delays at metro stations into their algorithms.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124026834","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945426
Ashish Sharma, Jatin Arora, Pritam Khan, Sidhartha Satapathy, S. Agarwal, Satadal Sengupta, S. Mridha, Niloy Ganguly
Online cricket commentary has become very popular as the internet provides access to a large number of sports websites. A key challenge for them is to offer their readers an insightful and fast paced live commentary. In this paper, we propose a framework to automate cricket shot identification and commentary generation using sensor data as features for machine learning models.
{"title":"CommBox: Utilizing sensors for real-time cricket shot identification and commentary generation","authors":"Ashish Sharma, Jatin Arora, Pritam Khan, Sidhartha Satapathy, S. Agarwal, Satadal Sengupta, S. Mridha, Niloy Ganguly","doi":"10.1109/COMSNETS.2017.7945426","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945426","url":null,"abstract":"Online cricket commentary has become very popular as the internet provides access to a large number of sports websites. A key challenge for them is to offer their readers an insightful and fast paced live commentary. In this paper, we propose a framework to automate cricket shot identification and commentary generation using sensor data as features for machine learning models.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117150023","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945398
P. B. Gohain, S. Chaudhari
Cooperative spectrum sensing (CSS) is one of the efficient scheme that helps in improving the spectrum sensing performance of a cognitive radio network. In this paper we propose a Dempster-Shafer theory (DST) based CSS for cognitive radio network. The fusion rule is the D-S combination rule which is well known for its ability to handle uncertainty and has been used in quite a different number of fields. Noise uncertainty, which is unavoidable in practical field, can gravely limit the detection performance of CSS. In this paper we specially investigate sensor nodes undergoing uncertainty in noise power when the detection scheme is based on energy of the received signal and use DS theory to minimize such effects. Simulation results reveal significant improvement in CSS gain as compared to previous traditional methods.
{"title":"Cooperative energy detection using dempster-shafer theory under noise uncertainties","authors":"P. B. Gohain, S. Chaudhari","doi":"10.1109/COMSNETS.2017.7945398","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945398","url":null,"abstract":"Cooperative spectrum sensing (CSS) is one of the efficient scheme that helps in improving the spectrum sensing performance of a cognitive radio network. In this paper we propose a Dempster-Shafer theory (DST) based CSS for cognitive radio network. The fusion rule is the D-S combination rule which is well known for its ability to handle uncertainty and has been used in quite a different number of fields. Noise uncertainty, which is unavoidable in practical field, can gravely limit the detection performance of CSS. In this paper we specially investigate sensor nodes undergoing uncertainty in noise power when the detection scheme is based on energy of the received signal and use DS theory to minimize such effects. Simulation results reveal significant improvement in CSS gain as compared to previous traditional methods.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122569527","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945378
R. Meshram, Aditya Gopalan, D. Manjunath
We consider a restless multi-armed bandit (RMAB) in which each arm can be in one of two states, say 0 or 1. Playing the arm brings it to state 0 with probability one and not playing it induces state transitions with arm-dependent probabilities. Playing an arm generates a unit reward with a probability that depends on the state of the arm. The belief about the state of the arm can be calculated using a Bayesian update after every play. This RMAB has been designed for use in recommendation systems which in turn can be used in applications like creating of playlists or placement of advertisements. In this paper we analyse the RMAB by first showing that it is Whittle-indexable and then obtain a closed form expression for the Whittle index for each arm calculated from the belief about its state and the parameters that describe the arm. For an RMAB to be useful in practice, we need to be able to learn the parameters of the arms. We present an algorithm derived from Thompson sampling scheme, that learns the parameters of the arms and also evaluate its performance numerically.
{"title":"Restless bandits that hide their hand and recommendation systems","authors":"R. Meshram, Aditya Gopalan, D. Manjunath","doi":"10.1109/COMSNETS.2017.7945378","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945378","url":null,"abstract":"We consider a restless multi-armed bandit (RMAB) in which each arm can be in one of two states, say 0 or 1. Playing the arm brings it to state 0 with probability one and not playing it induces state transitions with arm-dependent probabilities. Playing an arm generates a unit reward with a probability that depends on the state of the arm. The belief about the state of the arm can be calculated using a Bayesian update after every play. This RMAB has been designed for use in recommendation systems which in turn can be used in applications like creating of playlists or placement of advertisements. In this paper we analyse the RMAB by first showing that it is Whittle-indexable and then obtain a closed form expression for the Whittle index for each arm calculated from the belief about its state and the parameters that describe the arm. For an RMAB to be useful in practice, we need to be able to learn the parameters of the arms. We present an algorithm derived from Thompson sampling scheme, that learns the parameters of the arms and also evaluate its performance numerically.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129877750","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
扫码关注我们
求助内容：
应助结果提醒方式：