Pub Date : 2021-01-13DOI: 10.1109/ICOIN50884.2021.9333889
Sichul Noh, Minjae Kang, Minho Park
In this paper, we propose a history-based dynamic timeout scheme to alleviate the flow table overflow attack which is one of typical attacks against Software Defined Networks (SDN). We investigated hard timeout and idle timeout used in OpenFlow which is the most popular protocol for SDN, and developed the proposed scheme that dynamically adjusts both hard timeout and idle timeout to reduce the number of flow rules. The experiment results shows it can protect SDN switches from the flow table overflow efficiently.
{"title":"Protection against Flow Table Overflow Attack in Software Defined Networks","authors":"Sichul Noh, Minjae Kang, Minho Park","doi":"10.1109/ICOIN50884.2021.9333889","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333889","url":null,"abstract":"In this paper, we propose a history-based dynamic timeout scheme to alleviate the flow table overflow attack which is one of typical attacks against Software Defined Networks (SDN). We investigated hard timeout and idle timeout used in OpenFlow which is the most popular protocol for SDN, and developed the proposed scheme that dynamically adjusts both hard timeout and idle timeout to reduce the number of flow rules. The experiment results shows it can protect SDN switches from the flow table overflow efficiently.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"116 1","pages":"486-490"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74271261","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 : 2021-01-13DOI: 10.1109/ICOIN50884.2021.9333885
Taeyun Ha, Donghyun Lee, Chunghyun Lee, Sungrae Cho
we design the power smart contract system based on VCG-auction-based transaction algorithm and block chain in the power trading market consisting of Prosumer (producer + consumer) capable of producing renewable energy. The analysis of the advantages and disadvantages of renewable energy and the differences between power sources are analyzed in detail. Investigate production and storage technology of renewable energy. The requirements and roles are organized from the perspective of the buyer/seller/intermediation system/blockchain, and the scenario is established. Establish overall system flow.
{"title":"VCG Auction Mechanism based on Block Chain in Smart Grid","authors":"Taeyun Ha, Donghyun Lee, Chunghyun Lee, Sungrae Cho","doi":"10.1109/ICOIN50884.2021.9333885","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333885","url":null,"abstract":"we design the power smart contract system based on VCG-auction-based transaction algorithm and block chain in the power trading market consisting of Prosumer (producer + consumer) capable of producing renewable energy. The analysis of the advantages and disadvantages of renewable energy and the differences between power sources are analyzed in detail. Investigate production and storage technology of renewable energy. The requirements and roles are organized from the perspective of the buyer/seller/intermediation system/blockchain, and the scenario is established. Establish overall system flow.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"51 1","pages":"465-468"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73816724","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 : 2021-01-13DOI: 10.1109/ICOIN50884.2021.9333920
Arooj Masood, The-Vi Nguyen, Sungrae Cho
In recent years, the wide spread adoption of mobile and multimedia applications has resulted in exponentially increasing multimedia traffic, which exerts a great burden on backhaul links and mobile core networks. Mobile edge computing (MEC) alleviates the problem by enabling mobile edge devices with cache storage and allowing them to store popular multimedia contents requested by users to reduce network congestion and content delivery latency. However, to decide the multimedia contents to cache in the edge devices, the popularity of contents needs to be taken into consideration. In this paper, we propose a deep regression-based video popularity estimation for proactive video caching in MEC networks. In each time slot, an edge device, i.e., base station (BS) generates local estimates on content popularity, which are then shared by the neighboring edge devices. Then, each edge device performs popularity prediction using a deep regression technique for proactive content caching for the next time slot. Simulation results show that the proposed deep regression based method for videos popularity prediction achieves good performance and reduces latency significantly.
{"title":"Deep Regression Model for Videos Popularity Prediction in Mobile Edge Caching Networks","authors":"Arooj Masood, The-Vi Nguyen, Sungrae Cho","doi":"10.1109/ICOIN50884.2021.9333920","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333920","url":null,"abstract":"In recent years, the wide spread adoption of mobile and multimedia applications has resulted in exponentially increasing multimedia traffic, which exerts a great burden on backhaul links and mobile core networks. Mobile edge computing (MEC) alleviates the problem by enabling mobile edge devices with cache storage and allowing them to store popular multimedia contents requested by users to reduce network congestion and content delivery latency. However, to decide the multimedia contents to cache in the edge devices, the popularity of contents needs to be taken into consideration. In this paper, we propose a deep regression-based video popularity estimation for proactive video caching in MEC networks. In each time slot, an edge device, i.e., base station (BS) generates local estimates on content popularity, which are then shared by the neighboring edge devices. Then, each edge device performs popularity prediction using a deep regression technique for proactive content caching for the next time slot. Simulation results show that the proposed deep regression based method for videos popularity prediction achieves good performance and reduces latency significantly.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"47 1","pages":"291-294"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79113167","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}
Multi-access Edge Computing (MEC) offers opportunities for improving the network performance. It can be utilized for improving web application. Every request that is destined for the cloud service providers can be processed at the edge. However, some web applications may have high fluctuation in terms of resource usage, for example e-commerce. The cloud server needs to be able to adapt with the traffic fluctuation by deploying the edge service automatically. We propose a technique for dynamically deploying the edge service by using statistical properties of the traffic, namely the moving average and moving standard deviation. These statistical properties are set as thresholds to decide whether to deploy the edge server or not. If the number of requests is higher than the maximum threshold, the edge server will be deployed. On the other hand, if it is lower than the minimum threshold, the edge server will be removed, if any. We build a testbed to evaluate our technique and the results show that it is feasible to use moving average and moving standard deviation for dynamic deployment.
{"title":"Traffic-aware Dynamic Container Deployment on the Network Edge","authors":"Muhamad Rizka Maulana, Hsiao-Yin Peng, Ying-Cen Lai, Li-Der Chou","doi":"10.1109/ICOIN50884.2021.9333880","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333880","url":null,"abstract":"Multi-access Edge Computing (MEC) offers opportunities for improving the network performance. It can be utilized for improving web application. Every request that is destined for the cloud service providers can be processed at the edge. However, some web applications may have high fluctuation in terms of resource usage, for example e-commerce. The cloud server needs to be able to adapt with the traffic fluctuation by deploying the edge service automatically. We propose a technique for dynamically deploying the edge service by using statistical properties of the traffic, namely the moving average and moving standard deviation. These statistical properties are set as thresholds to decide whether to deploy the edge server or not. If the number of requests is higher than the maximum threshold, the edge server will be deployed. On the other hand, if it is lower than the minimum threshold, the edge server will be removed, if any. We build a testbed to evaluate our technique and the results show that it is feasible to use moving average and moving standard deviation for dynamic deployment.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"39 1","pages":"571-576"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81978564","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 : 2021-01-13DOI: 10.1109/ICOIN50884.2021.9333884
Ankur Gupta, Harkirat Singh Arora, Rahul Kumar, B. Raman
Cardiovascular heart disease is at the top of the list of lethal diseases which causes major cancer deaths worldwide with mortality rate of approximately 7 million per annum. The development of machine computational design would help in early detection, prognostication and timely diagnosis of disease which will help in increasing the life-span of a patient. In the proposed work, a framework based on machine computations, DMHZ, is proposed for heart disease diagnosis which is validated using Z-Alizadeh Sani heart disease dataset from UCI repository. DMHZ utilizes the feature extraction techniques principal component analysis (PCA) for numeric feature extraction and multiple correspondence analysis (MCA) for categorical feature extraction. The model, DMHZ, is trained using machine learning classifiers, Logistic Regression (LR), Random Forest (RF) and Support Vector Machine (SVM), and validated using holdout validation scheme with hold-out ratio 3:1. Experimentation results show that DMHZ outperforms several state-of-the-art methods in terms of accuracy.
{"title":"DMHZ: A Decision Support System Based on Machine Computational Design for Heart Disease Diagnosis Using Z-Alizadeh Sani Dataset","authors":"Ankur Gupta, Harkirat Singh Arora, Rahul Kumar, B. Raman","doi":"10.1109/ICOIN50884.2021.9333884","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333884","url":null,"abstract":"Cardiovascular heart disease is at the top of the list of lethal diseases which causes major cancer deaths worldwide with mortality rate of approximately 7 million per annum. The development of machine computational design would help in early detection, prognostication and timely diagnosis of disease which will help in increasing the life-span of a patient. In the proposed work, a framework based on machine computations, DMHZ, is proposed for heart disease diagnosis which is validated using Z-Alizadeh Sani heart disease dataset from UCI repository. DMHZ utilizes the feature extraction techniques principal component analysis (PCA) for numeric feature extraction and multiple correspondence analysis (MCA) for categorical feature extraction. The model, DMHZ, is trained using machine learning classifiers, Logistic Regression (LR), Random Forest (RF) and Support Vector Machine (SVM), and validated using holdout validation scheme with hold-out ratio 3:1. Experimentation results show that DMHZ outperforms several state-of-the-art methods in terms of accuracy.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"146 1","pages":"818-823"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83094624","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 : 2021-01-13DOI: 10.1109/ICOIN50884.2021.9333855
Umar Sa'ad, D. Lakew, Sungrae Cho
The automobiles of today have evolved from electromechanical contrivances to intelligent, autonomous, and connected vehicles that communicate with one another in order to facilitate safer and more comfortable driving experiences. This involves content sharing between vehicles and roadside infrastructure to enable applications such as cooperative driving assistance, road hazard warning, and multimedia services. However, content sharing in connected vehicular networks (CVNs) is highly challenging owing to factors such as the high mobility of vehicles, frequent topology changes, intermittent wireless connectivity, and interference. Thanks to the advent of mobile edge computing (MEC), content sharing for CVNs benefits from proximity merit to tackle these challenges. In this article, we discuss existing edge caching techniques that have been proposed for reliable content delivery in vehicular networks and highlight their benefits and limitations. Furthermore, we enumerate the existing technical challenges that affect optimal edge caching and provide an insight to future research directions for edge caching in vehicular networks.
{"title":"Edge Caching for Content Sharing in Vehicular Networks: Technical Challenges, Existing Approaches, and Future Directions","authors":"Umar Sa'ad, D. Lakew, Sungrae Cho","doi":"10.1109/ICOIN50884.2021.9333855","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333855","url":null,"abstract":"The automobiles of today have evolved from electromechanical contrivances to intelligent, autonomous, and connected vehicles that communicate with one another in order to facilitate safer and more comfortable driving experiences. This involves content sharing between vehicles and roadside infrastructure to enable applications such as cooperative driving assistance, road hazard warning, and multimedia services. However, content sharing in connected vehicular networks (CVNs) is highly challenging owing to factors such as the high mobility of vehicles, frequent topology changes, intermittent wireless connectivity, and interference. Thanks to the advent of mobile edge computing (MEC), content sharing for CVNs benefits from proximity merit to tackle these challenges. In this article, we discuss existing edge caching techniques that have been proposed for reliable content delivery in vehicular networks and highlight their benefits and limitations. Furthermore, we enumerate the existing technical challenges that affect optimal edge caching and provide an insight to future research directions for edge caching in vehicular networks.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"43 6 1","pages":"770-775"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83155523","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 : 2021-01-13DOI: 10.1109/ICOIN50884.2021.9333858
Kazuma Uemoto, T. Takami
In recent years, the number of natural disasters in Japan has been increasing, and research on information sharing during disasters has been carried out. However, most of the previous research have limited the function of the system to the time of disaster. In this paper, we propose a system that is used in daily life and also adapt to the times of disaster. We set up disaster phase based on the damage assumption of the Cabinet Office in Japan and implement a system according to that phase. Several experiments are conducted with an important feature, Mobile Ad-hoc Network with Bluetooth.
{"title":"Information Sharing System Adapted to Disaster Phase","authors":"Kazuma Uemoto, T. Takami","doi":"10.1109/ICOIN50884.2021.9333858","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333858","url":null,"abstract":"In recent years, the number of natural disasters in Japan has been increasing, and research on information sharing during disasters has been carried out. However, most of the previous research have limited the function of the system to the time of disaster. In this paper, we propose a system that is used in daily life and also adapt to the times of disaster. We set up disaster phase based on the damage assumption of the Cabinet Office in Japan and implement a system according to that phase. Several experiments are conducted with an important feature, Mobile Ad-hoc Network with Bluetooth.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"244 1","pages":"752-754"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89744902","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 : 2021-01-13DOI: 10.1109/ICOIN50884.2021.9333870
Kaito Akaki, P. Pavarangkoon, N. Kitsuwan
A slicing and stitching technology has been invented to relax the consecutive constraint of spectrum slot allocation in elastic optical network (EON). This technology splits a spectrum band into several signal bands, called optical components, by making a copy of the original spectrum band and filtering out an unwanted signal on each spectrum band. The remaining optical components are injected into a transmission channel. At the destination, the optical components are recovered by using phase preserving wavelength conversion. Therefore, a request is able to allocate to dis-consecutive groups of slots. A conventional spectrum allocation scheme with this technology adopts slicing devices, called spectrum slicers, at only a source node. There is a problem of allocation patterns due to lack of flexibility since slicing at intermediate nodes is not considered. In this paper, we propose a spectrum allocation scheme considering slicers at both source node and intermediate nodes. Performance of the proposed scheme is evaluated by a computer simulation. The results show that the proposed scheme with 20 slicers reduces 45% of request blocking probability compared to the conventional scheme in COST239 topology when the traffic is 300 Erlang.
{"title":"Large L-shape Fit Spectrum Allocation for Elastic Optical Network with Spectrum Slicing","authors":"Kaito Akaki, P. Pavarangkoon, N. Kitsuwan","doi":"10.1109/ICOIN50884.2021.9333870","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333870","url":null,"abstract":"A slicing and stitching technology has been invented to relax the consecutive constraint of spectrum slot allocation in elastic optical network (EON). This technology splits a spectrum band into several signal bands, called optical components, by making a copy of the original spectrum band and filtering out an unwanted signal on each spectrum band. The remaining optical components are injected into a transmission channel. At the destination, the optical components are recovered by using phase preserving wavelength conversion. Therefore, a request is able to allocate to dis-consecutive groups of slots. A conventional spectrum allocation scheme with this technology adopts slicing devices, called spectrum slicers, at only a source node. There is a problem of allocation patterns due to lack of flexibility since slicing at intermediate nodes is not considered. In this paper, we propose a spectrum allocation scheme considering slicers at both source node and intermediate nodes. Performance of the proposed scheme is evaluated by a computer simulation. The results show that the proposed scheme with 20 slicers reduces 45% of request blocking probability compared to the conventional scheme in COST239 topology when the traffic is 300 Erlang.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"1 1","pages":"537-540"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89565748","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}
Today, millions of devices produce billions of network requests to the servers. All these request packets need to be scanned for security. Hence, providing network security and privacy requires filtering and deduplication of packets. In case of filtering, Bloom Filter data structure is the best alternative. Bloom Filter is a probabilistic data structure for membership filtering and it is capable of filtering massive amounts of data using a small memory footprint. However, Bloom Filter is not popular in many applications due to its false positive and false negative issues. Currently, many network security and privacy techniques are implementing Bloom Filter. In this paper, we discuss various facts on Bloom Filter. We advocate that Bloom Filter is the first layer of defence for network security and privacy. Furthermore, we discuss how Bloom Filter provides better security against various network attacks.
{"title":"Is Bloom Filter a Bad Choice for Security and Privacy?","authors":"Ripon Patgiri, Sabuzima Nayak, Naresh Babu Muppalaneni","doi":"10.1109/ICOIN50884.2021.9333950","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333950","url":null,"abstract":"Today, millions of devices produce billions of network requests to the servers. All these request packets need to be scanned for security. Hence, providing network security and privacy requires filtering and deduplication of packets. In case of filtering, Bloom Filter data structure is the best alternative. Bloom Filter is a probabilistic data structure for membership filtering and it is capable of filtering massive amounts of data using a small memory footprint. However, Bloom Filter is not popular in many applications due to its false positive and false negative issues. Currently, many network security and privacy techniques are implementing Bloom Filter. In this paper, we discuss various facts on Bloom Filter. We advocate that Bloom Filter is the first layer of defence for network security and privacy. Furthermore, we discuss how Bloom Filter provides better security against various network attacks.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"67 1","pages":"648-653"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85803352","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 : 2021-01-13DOI: 10.1109/ICOIN50884.2021.9333888
H. Lim, Younghan Kim, Kyoungjae Sun
The microservice architecture is an architectural style in which a service focused on performing one function is divided into independent and deployable small units of service, linked with other services through API, and independently developed and operated. However, in the communication between APIs, additional functions are required for communication between microservices such as load balancing and logging. This can be solved through service mesh, but currently service mesh only considers the container environment, so additional design is required for a structure that can manage virtual machines in the service mesh structure. In this paper, we propose a structure for deploying and managing microservices in a container and virtual machine mixed environment using service mesh.
{"title":"Service Management in Virtual Machine and Container Mixed Environment using Service Mesh","authors":"H. Lim, Younghan Kim, Kyoungjae Sun","doi":"10.1109/ICOIN50884.2021.9333888","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333888","url":null,"abstract":"The microservice architecture is an architectural style in which a service focused on performing one function is divided into independent and deployable small units of service, linked with other services through API, and independently developed and operated. However, in the communication between APIs, additional functions are required for communication between microservices such as load balancing and logging. This can be solved through service mesh, but currently service mesh only considers the container environment, so additional design is required for a structure that can manage virtual machines in the service mesh structure. In this paper, we propose a structure for deploying and managing microservices in a container and virtual machine mixed environment using service mesh.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"37 1","pages":"528-530"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85813597","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
扫码关注我们
求助内容：
应助结果提醒方式：