Pub Date : 2018-01-01DOI: 10.18178/jacn.2018.6.1.245
Chun-Ta Li, C. Weng
The decentralized group key agreement scheme allows a group of participants to exchange private multicast messages via the protection of a group session key in the group. Recently, Zhu proposed the first group authentication key agreement scheme based on chaotic maps and the structure of a group is organized in an ordered chain. Thus each participant needs to establish two temporary two-party session keys with its predecessor and successor in a parallel algorithm. In order to cope with dynamic groups, the group session keys are frequently updated whenever a new member joins or a member leaves the group. Zhu claimed that the proposed scheme is secure against various attacks such as replay, man-in-the-middle, impersonation and key compromise attacks. Furthermore, Zhu extended the proposed scheme to high level security attributes such as privacy preserving, no clock synchronization problem, mutual and group authentication and perfect forward secrecy etc. However, in this paper, we found that Zhu’s scheme is vulnerable to successor impersonation problem and this weakness leads to a malicious adversary from deriving group session keys after impersonate attack. Moreover, their scheme is vulnerable to known key attack and this problem may lead to an adversary to compromise the previous and future group session keys. To overcome these security flaws, in this paper, we significantly improve the security of Zhu’s group key agreement scheme without increasing the communication overhead and computation complexity.
{"title":"An Improved Group Key Agreement Scheme with Privacy Preserving Based on Chaotic Maps","authors":"Chun-Ta Li, C. Weng","doi":"10.18178/jacn.2018.6.1.245","DOIUrl":"https://doi.org/10.18178/jacn.2018.6.1.245","url":null,"abstract":"The decentralized group key agreement scheme allows a group of participants to exchange private multicast messages via the protection of a group session key in the group. Recently, Zhu proposed the first group authentication key agreement scheme based on chaotic maps and the structure of a group is organized in an ordered chain. Thus each participant needs to establish two temporary two-party session keys with its predecessor and successor in a parallel algorithm. In order to cope with dynamic groups, the group session keys are frequently updated whenever a new member joins or a member leaves the group. Zhu claimed that the proposed scheme is secure against various attacks such as replay, man-in-the-middle, impersonation and key compromise attacks. Furthermore, Zhu extended the proposed scheme to high level security attributes such as privacy preserving, no clock synchronization problem, mutual and group authentication and perfect forward secrecy etc. However, in this paper, we found that Zhu’s scheme is vulnerable to successor impersonation problem and this weakness leads to a malicious adversary from deriving group session keys after impersonate attack. Moreover, their scheme is vulnerable to known key attack and this problem may lead to an adversary to compromise the previous and future group session keys. To overcome these security flaws, in this paper, we significantly improve the security of Zhu’s group key agreement scheme without increasing the communication overhead and computation complexity.","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123943949","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-03-01DOI: 10.18178/JACN.2016.4.1.203
Sabita Nepal, Saurav Dahal, Seokjoo Shin
The IEEE 802.15.4 MAC protocol is the standard for Low-rate wireless personal area networks and is widely used in testbeds and simulation for wireless body area networks. Due to effective handling of some features such as low power communication and low data rates, this protocol is widely used for WBAN applications. However, it is not enough to support high data rates applications (>250 Kbps). In this article, feasibility of IEEE 802.15.4 MAC in the areas of Wireless Body Area Network (WBAN) will be studied. By presenting the challenging issues of WBAN and by giving extensive reasoning, it can be concluded that IEEE 802.15.4 MAC can be used in WBAN to some extent but to guarantee near optimum result, still some modifications are required.
{"title":"Does the IEEE 802.15.4 MAC Protocol Work Well in Wireless Body Area Networks","authors":"Sabita Nepal, Saurav Dahal, Seokjoo Shin","doi":"10.18178/JACN.2016.4.1.203","DOIUrl":"https://doi.org/10.18178/JACN.2016.4.1.203","url":null,"abstract":"The IEEE 802.15.4 MAC protocol is the standard for Low-rate wireless personal area networks and is widely used in testbeds and simulation for wireless body area networks. Due to effective handling of some features such as low power communication and low data rates, this protocol is widely used for WBAN applications. However, it is not enough to support high data rates applications (>250 Kbps). In this article, feasibility of IEEE 802.15.4 MAC in the areas of Wireless Body Area Network (WBAN) will be studied. By presenting the challenging issues of WBAN and by giving extensive reasoning, it can be concluded that IEEE 802.15.4 MAC can be used in WBAN to some extent but to guarantee near optimum result, still some modifications are required.","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133636296","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-03-01DOI: 10.18178/JACN.2016.4.1.198
Trianggoro Wiradinata, A. Paramita
This research will use the algorithm K-Nearest Neighbour (K-NN) to classify internet data traffic, K-NN is suitable for large amounts of data and can produce a more accurate classification, K-NN algorithm has a weakness takes computing high because K-NN algorithm calculating the distance of all existing data. One solution to overcome these weaknesses is to do the clustering process before the classification process, because the clustering process does not require high computing time, clustering algorithm that can be used is Fuzzy C-Mean algorithm, the Fuzzy C-Mean algorithm does not need to be determined in first number of clusters to be formed, clusters that form on this algorithm will be formed naturally based datasets be entered, but the algorithm Fuzzy C-Mean has the disadvantage of clustering results obtained are often not the same even though the same input data, this is because the initial dataset that of the Fuzzy C-Mean is not optimal, to optimize initial datasets in this research using feature selection algorithm, after main feature of dataset selected the output from fuzzy C-Mean become consistent. Selection of the features is a method that is expected to provide an initial dataset that is optimum for the algorithm Fuzzy C-Means. Algorithms for feature selection in this study used are Principal Component Analysis (PCA). PCA reduced non significant attribute to created optimal dataset and can improve performance clustering and classification algorithm. Results in this study is an combining method of classification, clustering and feature extraction of data, these three methods successfully modeled to generate a data classification method of internet bandwidth usage that has high accuracy and have a fast performance.
{"title":"Clustering and Feature Selection Technique for Improving Internet Traffic Classification Using K-NN","authors":"Trianggoro Wiradinata, A. Paramita","doi":"10.18178/JACN.2016.4.1.198","DOIUrl":"https://doi.org/10.18178/JACN.2016.4.1.198","url":null,"abstract":"This research will use the algorithm K-Nearest Neighbour (K-NN) to classify internet data traffic, K-NN is suitable for large amounts of data and can produce a more accurate classification, K-NN algorithm has a weakness takes computing high because K-NN algorithm calculating the distance of all existing data. One solution to overcome these weaknesses is to do the clustering process before the classification process, because the clustering process does not require high computing time, clustering algorithm that can be used is Fuzzy C-Mean algorithm, the Fuzzy C-Mean algorithm does not need to be determined in first number of clusters to be formed, clusters that form on this algorithm will be formed naturally based datasets be entered, but the algorithm Fuzzy C-Mean has the disadvantage of clustering results obtained are often not the same even though the same input data, this is because the initial dataset that of the Fuzzy C-Mean is not optimal, to optimize initial datasets in this research using feature selection algorithm, after main feature of dataset selected the output from fuzzy C-Mean become consistent. Selection of the features is a method that is expected to provide an initial dataset that is optimum for the algorithm Fuzzy C-Means. Algorithms for feature selection in this study used are Principal Component Analysis (PCA). PCA reduced non significant attribute to created optimal dataset and can improve performance clustering and classification algorithm. Results in this study is an combining method of classification, clustering and feature extraction of data, these three methods successfully modeled to generate a data classification method of internet bandwidth usage that has high accuracy and have a fast performance.","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125213107","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 : 2015-12-01DOI: 10.18178/JACN.2015.3.4.185
Ming-Hua Cheng, Cheng-Han Lin, W. Hwang, Feng-Cheng Yu
The Hybrid Coordination Function (HCF) was proposed in IEEE 802.11e, including the competition-based Enhanced Distributed Channel Access (EDCA) and polling-based HCF Controlled Channel Access (HCCA). This paper mainly carries on the research in the HCCA mechanism. In the HCCA mechanism, the Sample Scheduler offers a way to determine the time duration of the Transmission Opportunity (TXOP). The determination of TXOP is calculated by the equation according to two parameters of transmission, including the Mean Data Rate and Packet Size. Next, Sample Scheduler distributes the result of the TXOP to the QSTA. However, QSTAs are not able to completely utilize the allocated TXOP, which causes the waste of remaining TXOPs. The remaining TXOPs of each QSTA are wasted. Therefore, this paper focuses on allocating the remaining TXOP to QSTAs that can transmits more data packets and reduces the packet dropped rate. The simulation results show that the proposed scheme increases the system throughput and decreases the packet loss rate by utilizing the remaining TXOP.
{"title":"TXOP Combinatorial Problem in IEEE 802.11e HCCA Networks","authors":"Ming-Hua Cheng, Cheng-Han Lin, W. Hwang, Feng-Cheng Yu","doi":"10.18178/JACN.2015.3.4.185","DOIUrl":"https://doi.org/10.18178/JACN.2015.3.4.185","url":null,"abstract":"The Hybrid Coordination Function (HCF) was proposed in IEEE 802.11e, including the competition-based Enhanced Distributed Channel Access (EDCA) and polling-based HCF Controlled Channel Access (HCCA). This paper mainly carries on the research in the HCCA mechanism. In the HCCA mechanism, the Sample Scheduler offers a way to determine the time duration of the Transmission Opportunity (TXOP). The determination of TXOP is calculated by the equation according to two parameters of transmission, including the Mean Data Rate and Packet Size. Next, Sample Scheduler distributes the result of the TXOP to the QSTA. However, QSTAs are not able to completely utilize the allocated TXOP, which causes the waste of remaining TXOPs. The remaining TXOPs of each QSTA are wasted. Therefore, this paper focuses on allocating the remaining TXOP to QSTAs that can transmits more data packets and reduces the packet dropped rate. The simulation results show that the proposed scheme increases the system throughput and decreases the packet loss rate by utilizing the remaining TXOP.","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125992067","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 : 2015-07-07DOI: 10.7763/JACN.2015.V3.169
Nhien-An Le-Khac, Mohand Tahar Kechadi
2015 International Conference on Knowledge and Education Technology, Bangkok, Thailand, 6-7 July 2015
2015年知识与教育技术国际会议，泰国曼谷，2015年7月6-7日
{"title":"Security Threats of URL Shortening: A User's Perspective","authors":"Nhien-An Le-Khac, Mohand Tahar Kechadi","doi":"10.7763/JACN.2015.V3.169","DOIUrl":"https://doi.org/10.7763/JACN.2015.V3.169","url":null,"abstract":"2015 International Conference on Knowledge and Education Technology, Bangkok, Thailand, 6-7 July 2015","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117309472","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-09-03DOI: 10.7763/JACN.2014.V2.106
H. Haviluddin, R. Alfred
This paper presents an approach for a network traffic characterization by using an ARIMA (Autoregressive Integrated Moving Average) technique. The dataset used in this study is obtained from the internet network traffic activities of the Mulawarman University for a period of a week. The results are obtained using the Box-Jenkins Methodology. The Box-Jenkins methodology consists of five ARIMA models which include ARIMA (2, 1, 1) (1, 1, 1) ¹², ARIMA (1, 1, 1) (1, 1, 1) ¹², ARIMA (2, 1, 0) (1, 1, 1) ¹², ARIMA (0, 1, 0) (1, 1, 1) ¹², and ARIMA (0, 1, 0) (1, 2, 1) ¹². In this paper, ARIMA (0, 1, 0) (1, 2, 1) ¹² was selected as the best model that can be used to model the internet network traffic.
{"title":"Forecasting network activities using ARIMA method","authors":"H. Haviluddin, R. Alfred","doi":"10.7763/JACN.2014.V2.106","DOIUrl":"https://doi.org/10.7763/JACN.2014.V2.106","url":null,"abstract":"This paper presents an approach for a network traffic characterization by using an ARIMA (Autoregressive Integrated Moving Average) technique. The dataset used in this study is obtained from the internet network traffic activities of the Mulawarman University for a period of a week. The results are obtained using the Box-Jenkins Methodology. The Box-Jenkins methodology consists of five ARIMA models which include ARIMA (2, 1, 1) (1, 1, 1) ¹², ARIMA (1, 1, 1) (1, 1, 1) ¹², ARIMA (2, 1, 0) (1, 1, 1) ¹², ARIMA (0, 1, 0) (1, 1, 1) ¹², and ARIMA (0, 1, 0) (1, 2, 1) ¹². In this paper, ARIMA (0, 1, 0) (1, 2, 1) ¹² was selected as the best model that can be used to model the internet network traffic.","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","volume":"184 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127993714","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}
N-tier application design has become very common in the IT industry. Each individual layer, such as the application and data layer has its own main functionality. This design is very helpful in securing the application from unauthorized access and in protecting it from attacks to the data layer. The data layer is the core of a company's business, as all the important information of the company will be stored in the data layer and normally will be located in a secured off- line server with limited local network access. The application layer acts as the medium to exchange data between the client layer and the data layer over a network. As such, the application layer has been increasingly targeted for intrusion and attacks. This paper will introduce a method to minimize the security risks in the n-tier application design. The method introduced in this paper will mainly focus on how to secure the application layer from various attacks such as Denial of Services (DoS) attack and spoofing attacks. This is achieved through data protection such as random encryption key generation, data encryption etc. and so forth at both the client application and the application layer.
{"title":"Design of application layer services for security automation via a web service approach","authors":"K. Hee, C. Ho","doi":"10.7763/JACN.2014.V2.86","DOIUrl":"https://doi.org/10.7763/JACN.2014.V2.86","url":null,"abstract":"N-tier application design has become very common in the IT industry. Each individual layer, such as the application and data layer has its own main functionality. This design is very helpful in securing the application from unauthorized access and in protecting it from attacks to the data layer. The data layer is the core of a company's business, as all the important information of the company will be stored in the data layer and normally will be located in a secured off- line server with limited local network access. The application layer acts as the medium to exchange data between the client layer and the data layer over a network. As such, the application layer has been increasingly targeted for intrusion and attacks. This paper will introduce a method to minimize the security risks in the n-tier application design. The method introduced in this paper will mainly focus on how to secure the application layer from various attacks such as Denial of Services (DoS) attack and spoofing attacks. This is achieved through data protection such as random encryption key generation, data encryption etc. and so forth at both the client application and the application layer. ","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117198024","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-01-10DOI: 10.7763/JACN.2014.V2.104
M. Feknous, B. L. Guyader, A. Gravey
Optical technologies allow the end-user to take advantage of a very high bitrate access. This in turn modifies traffic patterns to be supported by access and aggregation (metro) networks. The present paper first proposes tentative traffic scenarios to assess future capacity requirements for these networks. It is shown that the current aggregation architecture based on primary and secondary aggregation rings should be reconsidered to limit potential bottlenecks and to take account of both infrastructure costs and potential energy savings. The paper then presents alternative architectures to revise and move the boundaries existing today between access and aggregation networks. A first alternative architecture is fully centralized and performs traffic aggregation in a central location. The second alternative architecture proposes to locate the first aggregation points (called "Next Generation Points of Presence") on the primary aggregation ring and to centralize control functions.
{"title":"Revisiting Access and Aggregation Network Architecture","authors":"M. Feknous, B. L. Guyader, A. Gravey","doi":"10.7763/JACN.2014.V2.104","DOIUrl":"https://doi.org/10.7763/JACN.2014.V2.104","url":null,"abstract":"Optical technologies allow the end-user to take advantage of a very high bitrate access. This in turn modifies traffic patterns to be supported by access and aggregation (metro) networks. The present paper first proposes tentative traffic scenarios to assess future capacity requirements for these networks. It is shown that the current aggregation architecture based on primary and secondary aggregation rings should be reconsidered to limit potential bottlenecks and to take account of both infrastructure costs and potential energy savings. The paper then presents alternative architectures to revise and move the boundaries existing today between access and aggregation networks. A first alternative architecture is fully centralized and performs traffic aggregation in a central location. The second alternative architecture proposes to locate the first aggregation points (called \"Next Generation Points of Presence\") on the primary aggregation ring and to centralize control functions.","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122341139","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 mainly deals with the offset error compensation algorithm related with the 6D IMU (inertial measurement unit) that measures the linear accelerations and angular velocities about the longitudinal, lateral, and vertical axis of ground vehicles. It is assumed that the independent wheel speed data and steering wheel angle information are provided for the sensor compensation algorithm. Using a disturbance observer, through designing a linear model and inverse model of the vehicle motion, the offset errors of the accelerometers are estimated. The stability of the entire compensational system is verified, and finally, the performance of the suggested algorithm is tested based on a well-known vehicle dynamics simulation tool, CarSim.
{"title":"Real-Time Offset Error Compensation of 6D IMU Mounted on Ground Vehicles Using Disturbance Observer","authors":"J. Oh, Y. Noh, Seibum B. Choi","doi":"10.7763/JACN.2013.V1.18","DOIUrl":"https://doi.org/10.7763/JACN.2013.V1.18","url":null,"abstract":"This paper mainly deals with the offset error compensation algorithm related with the 6D IMU (inertial measurement unit) that measures the linear accelerations and angular velocities about the longitudinal, lateral, and vertical axis of ground vehicles. It is assumed that the independent wheel speed data and steering wheel angle information are provided for the sensor compensation algorithm. Using a disturbance observer, through designing a linear model and inverse model of the vehicle motion, the offset errors of the accelerometers are estimated. The stability of the entire compensational system is verified, and finally, the performance of the suggested algorithm is tested based on a well-known vehicle dynamics simulation tool, CarSim.","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125127460","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.18178/jacn.2016.4.2.213
Yifan Zhao
{"title":"Research on Time Division Multi-channel p-Persistent CSMA Based on Binary Trees Conflict Resolution Mechanism","authors":"Yifan Zhao","doi":"10.18178/jacn.2016.4.2.213","DOIUrl":"https://doi.org/10.18178/jacn.2016.4.2.213","url":null,"abstract":"","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","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":"115213582","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
扫码关注我们
求助内容：
应助结果提醒方式：