Pub Date : 2021-01-13DOI: 10.1109/ICOIN50884.2021.9333883
Hodong Kim, Changhee Hahn, Junbeom Hur
Cache side-channel attack is a class of attacks to retrieve sensitive information from a system by exploiting shared resource in CPUs. As the attacks are delivered to wide range of environments from mobile systems to cloud recently, many detection strategies have been proposed. Since the conventional cache side-channel are likely to incur tremendous number of cache events, most of the previous detection mechanisms were designed to carefully monitor cache events. However, recently proposed attacks tend to incur less cache events during the attack. PRIME+ABORT attack, for example, leverages the Intel TSX instead of accessing cache to measure access time. Because of the characteristic, cache event based detection mechanisms may hardly distinguish the attack. In this paper, we conduct an in-depth analysis of the PRIME+ABORT attack to identify the other useful hardware events for detection rather than cache events. Based on our finding, we present a novel mechanism called PRIME+ABORT Detector to detect the PRIME+ABORT attack and demonstrate that the detection mechanism can achieve 99.5% success rates with 0.3% performance overhead.
{"title":"Real-time Detection of Cache Side-channel Attack Using Non-cache Hardware Events","authors":"Hodong Kim, Changhee Hahn, Junbeom Hur","doi":"10.1109/ICOIN50884.2021.9333883","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333883","url":null,"abstract":"Cache side-channel attack is a class of attacks to retrieve sensitive information from a system by exploiting shared resource in CPUs. As the attacks are delivered to wide range of environments from mobile systems to cloud recently, many detection strategies have been proposed. Since the conventional cache side-channel are likely to incur tremendous number of cache events, most of the previous detection mechanisms were designed to carefully monitor cache events. However, recently proposed attacks tend to incur less cache events during the attack. PRIME+ABORT attack, for example, leverages the Intel TSX instead of accessing cache to measure access time. Because of the characteristic, cache event based detection mechanisms may hardly distinguish the attack. In this paper, we conduct an in-depth analysis of the PRIME+ABORT attack to identify the other useful hardware events for detection rather than cache events. Based on our finding, we present a novel mechanism called PRIME+ABORT Detector to detect the PRIME+ABORT attack and demonstrate that the detection mechanism can achieve 99.5% success rates with 0.3% performance overhead.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"14 1","pages":"28-31"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87389574","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.9334004
Jaehwan Kim, B. Derbel, Byung-Woo Hong
We present a potential application of the conventional scale-space theory to the estimation of optical flow in the deep learning framework. An unsupervised learning scheme for the computation of optical flow is integrated with a Gaussian scale space. The hierarchical propagation of intermediate estimations via a consecutive scales demonstrates a potential in the course of optimization leading to a better local minimum. The landscape of loss function associated with an optical flow problem in a neural network framework is highly complex and non-convex, which requires to guild the optimization path in such a way that a solution at a plateau region. The qualitative comparison of the optical flow solutions via a Gaussian scale-space provides the characteristics of solutions at different scales, thus provides a way to take into consideration of scales in further improving accuracy.
{"title":"Motion Estimation via Scale-Space in Unsupervised Deep Learning","authors":"Jaehwan Kim, B. Derbel, Byung-Woo Hong","doi":"10.1109/ICOIN50884.2021.9334004","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9334004","url":null,"abstract":"We present a potential application of the conventional scale-space theory to the estimation of optical flow in the deep learning framework. An unsupervised learning scheme for the computation of optical flow is integrated with a Gaussian scale space. The hierarchical propagation of intermediate estimations via a consecutive scales demonstrates a potential in the course of optimization leading to a better local minimum. The landscape of loss function associated with an optical flow problem in a neural network framework is highly complex and non-convex, which requires to guild the optimization path in such a way that a solution at a plateau region. The qualitative comparison of the optical flow solutions via a Gaussian scale-space provides the characteristics of solutions at different scales, thus provides a way to take into consideration of scales in further improving accuracy.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"4 1","pages":"730-731"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87525646","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.9333941
H. Otsuki, Eiji Kawai, Katsuyoshi Setoyama, H. Kimiyama, Katsuhiro Sebayashi, M. Maruyama
In this study, we propose an architecture for monitoring packets coming from a high-speed optical Ethernet network. Moreover, we implement a packet monitoring system adopting our proposed architecture using general PC-based equipment with a field-programmable gate array (FPGA)based network interface card (NIC). We also experimentally achieve a full line-rate processing capability for 100-Gbps Ethernet and examine its feasibility on 400-Gbps Ethernet.
{"title":"Parallel Monitoring Architecture for 100 Gbps and Beyond Optical Ethernet","authors":"H. Otsuki, Eiji Kawai, Katsuyoshi Setoyama, H. Kimiyama, Katsuhiro Sebayashi, M. Maruyama","doi":"10.1109/ICOIN50884.2021.9333941","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333941","url":null,"abstract":"In this study, we propose an architecture for monitoring packets coming from a high-speed optical Ethernet network. Moreover, we implement a packet monitoring system adopting our proposed architecture using general PC-based equipment with a field-programmable gate array (FPGA)based network interface card (NIC). We also experimentally achieve a full line-rate processing capability for 100-Gbps Ethernet and examine its feasibility on 400-Gbps Ethernet.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"18 1","pages":"358-360"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83593616","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.9333967
Jae-Woo Kim, C. I. Nwakanma, Dong-Seong Kim, Jae-Min Lee
This paper discusses intelligent edge computing technology using neuromorphic technology. Neuromorphic is a technology that uses pure hardware to implement intelligent systems, unlike traditional methods of implementing intelligent systems in a software manner using CPU or GPU hardware. In this paper, intelligent edge computing technology was introduced using NeuroEdge, one of the devices using Neurologic technology, and the performance was verified through a face recognition test. Results showed that using neuromorphic technology such as the NM500 chip saves the time needed for training systems and does not impose the burden of requiring many datasets for effective training.
{"title":"Intelligent Face Recognition on the Edge Computing using Neuromorphic Technology","authors":"Jae-Woo Kim, C. I. Nwakanma, Dong-Seong Kim, Jae-Min Lee","doi":"10.1109/ICOIN50884.2021.9333967","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333967","url":null,"abstract":"This paper discusses intelligent edge computing technology using neuromorphic technology. Neuromorphic is a technology that uses pure hardware to implement intelligent systems, unlike traditional methods of implementing intelligent systems in a software manner using CPU or GPU hardware. In this paper, intelligent edge computing technology was introduced using NeuroEdge, one of the devices using Neurologic technology, and the performance was verified through a face recognition test. Results showed that using neuromorphic technology such as the NM500 chip saves the time needed for training systems and does not impose the burden of requiring many datasets for effective training.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"35 1","pages":"514-516"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76443873","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.9333875
Hojoon Won, Younghan Kim
As the cloud infrastructure becomes more complex, the importance of fault detection technology is increasing. A machine learning-based fault detection technology is being used to overcome the limitations of the existing fault detection method through log analysis and threshold-based fault detection method. Machine learning-based fault detection methods are greatly influenced by features. In this paper, we introduce feature engineering techniques that can affect accuracy, and propose a method to improve the performance of fault detection models in cloud infrastructure through comparative analysis and verification of various feature analysis models.
{"title":"Performance Analysis of Machine Learning Based Fault Detection for Cloud Infrastructure","authors":"Hojoon Won, Younghan Kim","doi":"10.1109/ICOIN50884.2021.9333875","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333875","url":null,"abstract":"As the cloud infrastructure becomes more complex, the importance of fault detection technology is increasing. A machine learning-based fault detection technology is being used to overcome the limitations of the existing fault detection method through log analysis and threshold-based fault detection method. Machine learning-based fault detection methods are greatly influenced by features. In this paper, we introduce feature engineering techniques that can affect accuracy, and propose a method to improve the performance of fault detection models in cloud infrastructure through comparative analysis and verification of various feature analysis models.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"1 1","pages":"877-880"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83521698","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.9333874
Anwar Alyatama
This work extends the adaptive RSA algorithm that is based on the relative cost for solving the routing, modulation level and spectrum assignment (RMSA) for elastic optical network (EON). In planning and execution of EONs, RMSA is a viral aspect. Our proposed RMSA is rooted in the relative cost concept and evaluates the average effect upon the admission of a connection request at a given network state on a given set of resources. Besides, only if the minimal relative cost is less than the request’s value, a connection request is admitted. Simulation has been used to display the effectiveness of using relative cost RMSA for attaining higher fairness in EONs and lower lost revenue.
{"title":"Relative Cost Routing, Modulation and Spectrum Allocation in Elastic Optical Networks","authors":"Anwar Alyatama","doi":"10.1109/ICOIN50884.2021.9333874","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333874","url":null,"abstract":"This work extends the adaptive RSA algorithm that is based on the relative cost for solving the routing, modulation level and spectrum assignment (RMSA) for elastic optical network (EON). In planning and execution of EONs, RMSA is a viral aspect. Our proposed RMSA is rooted in the relative cost concept and evaluates the average effect upon the admission of a connection request at a given network state on a given set of resources. Besides, only if the minimal relative cost is less than the request’s value, a connection request is admitted. Simulation has been used to display the effectiveness of using relative cost RMSA for attaining higher fairness in EONs and lower lost revenue.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"24 1","pages":"127-131"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91153716","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.9334019
Anh-Tien Tran, D. Lakew, The-Vi Nguyen, Van-Dat Tuong, Thanh Phung Truong, Nhu-Ngoc Dao, Sungrae Cho
The rise of fifth-generation (5G) communication systems allows the super high-quality services to be implemented in real-life; however, it requires a massive amount of mobile data traffic to be simultaneously transmitted and processed. Fortunately, a significant percentage of mobile data traffic is indeed reusable and should be cached properly in somewhere, and then be delivered back to users’ equipment (UEs) in the future requests. To proactively utilize this nature of content distribution, the caching techniques have attracted significant attention from the research community by alleviating unnecessary duplicated data transmission of popular content in mobile edge caching enabled networks. As a result, numerous scientific approaches under different perspectives have been published and hence should be categorized through specific criteria. In this study, we systematically and extensively survey the most recent caching techniques that were published. For each caching policy, we critically analyze its target in detail by performance metrics, including hit ratio, latency, and storage efficiency. Besides, we display the current trend by sorting them into common technical classes such as machine learning, deep learning, game theory, optimization techniques, etc. To visualize and predict the application of caching algorithms, in reality, we summarize their typical use cases.
{"title":"Hit Ratio and Latency Optimization for Caching Systems: A Survey","authors":"Anh-Tien Tran, D. Lakew, The-Vi Nguyen, Van-Dat Tuong, Thanh Phung Truong, Nhu-Ngoc Dao, Sungrae Cho","doi":"10.1109/ICOIN50884.2021.9334019","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9334019","url":null,"abstract":"The rise of fifth-generation (5G) communication systems allows the super high-quality services to be implemented in real-life; however, it requires a massive amount of mobile data traffic to be simultaneously transmitted and processed. Fortunately, a significant percentage of mobile data traffic is indeed reusable and should be cached properly in somewhere, and then be delivered back to users’ equipment (UEs) in the future requests. To proactively utilize this nature of content distribution, the caching techniques have attracted significant attention from the research community by alleviating unnecessary duplicated data transmission of popular content in mobile edge caching enabled networks. As a result, numerous scientific approaches under different perspectives have been published and hence should be categorized through specific criteria. In this study, we systematically and extensively survey the most recent caching techniques that were published. For each caching policy, we critically analyze its target in detail by performance metrics, including hit ratio, latency, and storage efficiency. Besides, we display the current trend by sorting them into common technical classes such as machine learning, deep learning, game theory, optimization techniques, etc. To visualize and predict the application of caching algorithms, in reality, we summarize their typical use cases.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"38 1","pages":"577-581"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89034279","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.9333954
Minok Kim, Joonwoo Kim, Sangheon Pack
In vehicle platooning applications, vehicles keep track of the real-time states of other vehicles through beacons for the platoon’s stability and safety. However, under harsh wireless channel conditions, high packet loss incurs delays in updating other vehicles’ states and it makes vehicles not be able to react to dynamic situations in time. In this paper, we propose an adaptive beacon transmission scheme (A-BTS), which monitors packet loss events and controls the beacon transmission timing for reducing increased inter-reception time (IRT) of beacons caused by packet losses. Evaluation results demonstrate that A-BTS can reduce maximum IRT by 10.4% compared with the fixed beacon interval scheme.
{"title":"Adaptive Beacon Transmission for Reducing Inter-Reception Time in Vehicle Platooning","authors":"Minok Kim, Joonwoo Kim, Sangheon Pack","doi":"10.1109/ICOIN50884.2021.9333954","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333954","url":null,"abstract":"In vehicle platooning applications, vehicles keep track of the real-time states of other vehicles through beacons for the platoon’s stability and safety. However, under harsh wireless channel conditions, high packet loss incurs delays in updating other vehicles’ states and it makes vehicles not be able to react to dynamic situations in time. In this paper, we propose an adaptive beacon transmission scheme (A-BTS), which monitors packet loss events and controls the beacon transmission timing for reducing increased inter-reception time (IRT) of beacons caused by packet losses. Evaluation results demonstrate that A-BTS can reduce maximum IRT by 10.4% compared with the fixed beacon interval scheme.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"26 1","pages":"69-71"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89557898","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.9333944
Haneul Ko, Jaewook Lee, Sangheon Pack
In the network slicing environment, if insufficient resource is allocated to a resource-hungry slice (e.g., ultrareliable low latency communication (URLLC)), its quality of service (QoS) can be significantly degraded. In this paper, we propose a priority-based dynamic resource allocation scheme (PDRAS) where the resource management agent maintains some information such as priorities and demand profiles of slices. Based on these information, the agent dynamically allocates resources to slices. To maximize QoS of slices while maintaining the total amount of allocated resources below a certain level, a constrained Markov decision process (CMDP) problem is formulated and the optimal allocation policy is achieved by linear programming (LP). Extensive evaluation results are given to demonstrate the effectiveness of PDRAS with the optimal policy compared to that of other schemes in terms of QoS and the efficiency of the resource usage.
{"title":"Priority-Based Dynamic Resource Allocation Scheme in Network Slicing","authors":"Haneul Ko, Jaewook Lee, Sangheon Pack","doi":"10.1109/ICOIN50884.2021.9333944","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333944","url":null,"abstract":"In the network slicing environment, if insufficient resource is allocated to a resource-hungry slice (e.g., ultrareliable low latency communication (URLLC)), its quality of service (QoS) can be significantly degraded. In this paper, we propose a priority-based dynamic resource allocation scheme (PDRAS) where the resource management agent maintains some information such as priorities and demand profiles of slices. Based on these information, the agent dynamically allocates resources to slices. To maximize QoS of slices while maintaining the total amount of allocated resources below a certain level, a constrained Markov decision process (CMDP) problem is formulated and the optimal allocation policy is achieved by linear programming (LP). Extensive evaluation results are given to demonstrate the effectiveness of PDRAS with the optimal policy compared to that of other schemes in terms of QoS and the efficiency of the resource usage.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"3 1","pages":"62-64"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87602346","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.9333867
Ashar Ahmad, Muhammad Saad, Joongheon Kim, Daehun Nyang, David A. Mohaisen
Blockchain-based audit systems use “Practical Byzantine Fault Tolerance” (PBFT) consensus protocol which suffers from a high message complexity and low scalability. Alternatives to PBFT have not been tested in blockchain-based audit systems since no blockchain testbed supports the execution and benchmarking of different consensus protocols in a unified testing environment. In this paper, we address this gap by developing a blockchain testbed capable of executing and testing five consensus protocols in a blockchain network; namely PBFT, Proof-of-Work (PoW), Proof-of-Stake (PoS), Proof-of-Elapsed Time (PoET), and Clique. We carry out performance evaluation of those consensus algorithms using data from a real-world audit system. Our results show that the Clique protocol is best suited for blockchain-based audit systems, based on scalability features.
{"title":"Performance Evaluation of Consensus Protocols in Blockchain-based Audit Systems","authors":"Ashar Ahmad, Muhammad Saad, Joongheon Kim, Daehun Nyang, David A. Mohaisen","doi":"10.1109/ICOIN50884.2021.9333867","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333867","url":null,"abstract":"Blockchain-based audit systems use “Practical Byzantine Fault Tolerance” (PBFT) consensus protocol which suffers from a high message complexity and low scalability. Alternatives to PBFT have not been tested in blockchain-based audit systems since no blockchain testbed supports the execution and benchmarking of different consensus protocols in a unified testing environment. In this paper, we address this gap by developing a blockchain testbed capable of executing and testing five consensus protocols in a blockchain network; namely PBFT, Proof-of-Work (PoW), Proof-of-Stake (PoS), Proof-of-Elapsed Time (PoET), and Clique. We carry out performance evaluation of those consensus algorithms using data from a real-world audit system. Our results show that the Clique protocol is best suited for blockchain-based audit systems, based on scalability features.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"49 1","pages":"654-656"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87612612","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
扫码关注我们
求助内容：
应助结果提醒方式：