Redundancy-based techniques are used in the literature to neutralize the effects of hardware Trojan horses (HTHs). However, the available techniques assume that HTHs cannot be inserted into the replicated logic, without introducing recognizable changes in the side effects of the circuit. In this paper, we discuss the limitations of this assumption. We demonstrate that fault-tolerant techniques should be enhanced by obfuscation methods to be actually effective, and we propose a novel obfuscated TMR (Triple Modular Redundancy) to prove the concept. We evaluated the effectiveness of our approach on ISCAS benchmarks. The results show that Trojans would incur about 18% higher detection risk in average, if attackers try to deceive the obfuscated TMR.
{"title":"An Effective Application of Obfuscated TMR to Tackle Hardware Trojans","authors":"Masoume Mehdinia Siboni, Seyed Mohammadhossein Shekarian","doi":"10.1109/ICCKE48569.2019.8964879","DOIUrl":"https://doi.org/10.1109/ICCKE48569.2019.8964879","url":null,"abstract":"Redundancy-based techniques are used in the literature to neutralize the effects of hardware Trojan horses (HTHs). However, the available techniques assume that HTHs cannot be inserted into the replicated logic, without introducing recognizable changes in the side effects of the circuit. In this paper, we discuss the limitations of this assumption. We demonstrate that fault-tolerant techniques should be enhanced by obfuscation methods to be actually effective, and we propose a novel obfuscated TMR (Triple Modular Redundancy) to prove the concept. We evaluated the effectiveness of our approach on ISCAS benchmarks. The results show that Trojans would incur about 18% higher detection risk in average, if attackers try to deceive the obfuscated TMR.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"25 1","pages":"12-17"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85173956","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 : 2019-10-01DOI: 10.1109/ICCKE48569.2019.8965154
Maryam Karimi, Mahsa Mozafari, K. Bashiri
noise level is an important parameter to improve the performance of many image processing applications. Natural scenes follow special statistics independent of the image contents. These statistical characteristics change under the effects of distortions. Therefore, they can help image processing algorithms to estimate the noise level of input images. We devised a noise level estimation method based on the statistics of orientational differences between image pixel values and those of their neighbors. The proposed approach outperforms the state-of-the-art especially for higher noise levels. This variance estimation approach is effective for both Gaussian and non-Gaussian additive noises. In addition to the high accuracy, because of not using any normalization or image transformation, the proposed method is quite fast and completely useful for real-time applications.
{"title":"Efficient Noise Level Estimation Using Orientational Gradient Statistics","authors":"Maryam Karimi, Mahsa Mozafari, K. Bashiri","doi":"10.1109/ICCKE48569.2019.8965154","DOIUrl":"https://doi.org/10.1109/ICCKE48569.2019.8965154","url":null,"abstract":"noise level is an important parameter to improve the performance of many image processing applications. Natural scenes follow special statistics independent of the image contents. These statistical characteristics change under the effects of distortions. Therefore, they can help image processing algorithms to estimate the noise level of input images. We devised a noise level estimation method based on the statistics of orientational differences between image pixel values and those of their neighbors. The proposed approach outperforms the state-of-the-art especially for higher noise levels. This variance estimation approach is effective for both Gaussian and non-Gaussian additive noises. In addition to the high accuracy, because of not using any normalization or image transformation, the proposed method is quite fast and completely useful for real-time applications.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"3515 1","pages":"67-71"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86652973","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 : 2019-10-01DOI: 10.1109/ICCKE48569.2019.8964992
Mohammad Allahbakhsh, R. Rafat, Fariba Layegh Rafat
Assessing quality of products, especially when purchased online, is always a challenge. One of the widely used approaches for addressing this challenge is to rely on the scores computed by online rating systems, based on the feedback received from other users. For several reasons, like gaining benefits, personal interests or collusion, rating systems have always been facing with challenge of dishonest feedback. Although many techniques have been proposed for collusion detection, there are still issues that need more investigations. One of these issues is dealing with the sparsity problem, i.e., small number of votes per product, which makes it easier to manipulate scores. In this paper we propose a novel technique for calculating robust rank scores which relies on feedback prediction. In our model, we improve quality of computed scores by predicting feedback, for the people who have not assessed a product. This will result in decreasing sparsity. Then, we propose an iterative technique to calculate product rating scores based on the real and predicted feedbacks. We have implemented our method and compared its performance with three well-known related works. The result of comparison shows the superiority of our model.
{"title":"A Prediction-Based Approach for Computing Robust Rating Scores","authors":"Mohammad Allahbakhsh, R. Rafat, Fariba Layegh Rafat","doi":"10.1109/ICCKE48569.2019.8964992","DOIUrl":"https://doi.org/10.1109/ICCKE48569.2019.8964992","url":null,"abstract":"Assessing quality of products, especially when purchased online, is always a challenge. One of the widely used approaches for addressing this challenge is to rely on the scores computed by online rating systems, based on the feedback received from other users. For several reasons, like gaining benefits, personal interests or collusion, rating systems have always been facing with challenge of dishonest feedback. Although many techniques have been proposed for collusion detection, there are still issues that need more investigations. One of these issues is dealing with the sparsity problem, i.e., small number of votes per product, which makes it easier to manipulate scores. In this paper we propose a novel technique for calculating robust rank scores which relies on feedback prediction. In our model, we improve quality of computed scores by predicting feedback, for the people who have not assessed a product. This will result in decreasing sparsity. Then, we propose an iterative technique to calculate product rating scores based on the real and predicted feedbacks. We have implemented our method and compared its performance with three well-known related works. The result of comparison shows the superiority of our model.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"96 1","pages":"116-121"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76986951","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 : 2019-10-01DOI: 10.1109/ICCKE48569.2019.8964674
Mahdi Masoudi, Amir Rajabzadeh
This paper presents a scheduler, called ELS (based on the combination of EDF, LLF, and SJF algorithms), for hard real-time tasks in a homogeneous multi-core platform with the aim of increasing system performance (success rate). To obtain a suitable scheduling, ELS exploits the combination of three EDF (Earliest Deadline First), modified LLF (Least Laxity First) and SJF (Shortest Job First) scheduling algorithms in different task conditions. The core principle behind the ELS is choosing tasks based on the laxity ratio to the worst case execution time. The ELS scheduler was simulated in SimSO standard simulator in two cases, i.e., quad and eight-core platforms. The results of the experiments on 100 randomized tasks generated by the RandFixedSum algorithm showed that the success rate has improved on average 10%, 14.1%, 10.8%, and 33.3% compared to the EDF, SJF, LLF, and RM (Rate monotonic) respectively in a quad-core platform. Also, the success rate in an eight-core platform has improved about 31.6%, 21.6%, 6.6%, and 38.3% compared to EDF, SJF, LLF, and RM respectively.
{"title":"ELS: An Hard Real-time Scheduler for Homogeneous Multi-core Platforms","authors":"Mahdi Masoudi, Amir Rajabzadeh","doi":"10.1109/ICCKE48569.2019.8964674","DOIUrl":"https://doi.org/10.1109/ICCKE48569.2019.8964674","url":null,"abstract":"This paper presents a scheduler, called ELS (based on the combination of EDF, LLF, and SJF algorithms), for hard real-time tasks in a homogeneous multi-core platform with the aim of increasing system performance (success rate). To obtain a suitable scheduling, ELS exploits the combination of three EDF (Earliest Deadline First), modified LLF (Least Laxity First) and SJF (Shortest Job First) scheduling algorithms in different task conditions. The core principle behind the ELS is choosing tasks based on the laxity ratio to the worst case execution time. The ELS scheduler was simulated in SimSO standard simulator in two cases, i.e., quad and eight-core platforms. The results of the experiments on 100 randomized tasks generated by the RandFixedSum algorithm showed that the success rate has improved on average 10%, 14.1%, 10.8%, and 33.3% compared to the EDF, SJF, LLF, and RM (Rate monotonic) respectively in a quad-core platform. Also, the success rate in an eight-core platform has improved about 31.6%, 21.6%, 6.6%, and 38.3% compared to EDF, SJF, LLF, and RM respectively.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"167 1","pages":"339-344"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76333666","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 : 2019-10-01DOI: 10.1109/ICCKE48569.2019.8964947
Nazila Nikdel, M. Badamchizadeh
Finite-time controlling of a five-bar linkage arm is investigated in this paper. The manipulator has a parallelogram structure which is not stable and has a nonlinear equation of motion. Besides, external perturbations, as well as modeling uncertainties, can disturb the system response. A PSO-optimized (particle swarm optimization) finite-time control approach is presented for the manipulator utilizing fractional calculus framework to realize an acceptable performance. Designing a controller based on fractional Lyapunov theories, the plan stability is ascertained. A variety of simulations are conducted to expose the capability of suggested strategy to control the manipulator efficaciously.
{"title":"Finite-Time Control of a Parallelogram Five-Bar Manipulator Based on Fractional-Order Approach","authors":"Nazila Nikdel, M. Badamchizadeh","doi":"10.1109/ICCKE48569.2019.8964947","DOIUrl":"https://doi.org/10.1109/ICCKE48569.2019.8964947","url":null,"abstract":"Finite-time controlling of a five-bar linkage arm is investigated in this paper. The manipulator has a parallelogram structure which is not stable and has a nonlinear equation of motion. Besides, external perturbations, as well as modeling uncertainties, can disturb the system response. A PSO-optimized (particle swarm optimization) finite-time control approach is presented for the manipulator utilizing fractional calculus framework to realize an acceptable performance. Designing a controller based on fractional Lyapunov theories, the plan stability is ascertained. A variety of simulations are conducted to expose the capability of suggested strategy to control the manipulator efficaciously.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"33 2 1","pages":"149-154"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85557088","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 : 2019-10-01DOI: 10.1109/ICCKE48569.2019.8964924
M. Shahraeini, Zeinab Farmani
Smart grid denotes creating a two-way communication infrastructure connected to the electrical infrastructure. One of the most important steps of establishing smart grids in distribution level is the implementation of Advanced Metering Infrastructure (AMI). A variety of methods have been proposed to create a suitable platform for AMI, one of the most widely used of which is the use of data services of cellular networks. On the other hand, data volume in cellular networks has risen sharply and the need for data traffic management is highly felt. The Wi-Fi Offloading technique is one of the optimal methods for data traffic management in cellular networks. This study is assigned to the design of a data offloading platform for AMI. The proposed problem has been implemented and solved in the form of an optimization problem with a genetic algorithm. The simulation results indicate that data offloading has the ability for 100% management of AMI traffic. The results also show that increasing the coverage range of Wi-Fi antenna has a better performance than increasing the number of Wi-Fi access points.
{"title":"Designing of Communication Systems in Advanced Metering Infrastructure (AMI) using Wi-Fi Offloading Technology","authors":"M. Shahraeini, Zeinab Farmani","doi":"10.1109/ICCKE48569.2019.8964924","DOIUrl":"https://doi.org/10.1109/ICCKE48569.2019.8964924","url":null,"abstract":"Smart grid denotes creating a two-way communication infrastructure connected to the electrical infrastructure. One of the most important steps of establishing smart grids in distribution level is the implementation of Advanced Metering Infrastructure (AMI). A variety of methods have been proposed to create a suitable platform for AMI, one of the most widely used of which is the use of data services of cellular networks. On the other hand, data volume in cellular networks has risen sharply and the need for data traffic management is highly felt. The Wi-Fi Offloading technique is one of the optimal methods for data traffic management in cellular networks. This study is assigned to the design of a data offloading platform for AMI. The proposed problem has been implemented and solved in the form of an optimization problem with a genetic algorithm. The simulation results indicate that data offloading has the ability for 100% management of AMI traffic. The results also show that increasing the coverage range of Wi-Fi antenna has a better performance than increasing the number of Wi-Fi access points.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"418 1","pages":"60-66"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83199833","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 : 2019-10-01DOI: 10.1109/ICCKE48569.2019.8964732
Mohammad-Hadi Dehghani, S. Kolahdouz-Rahimi
Smartphone technology affects every aspect of human life nowadays. Especially there is an increasing demand for online shopping through smartphones instead of websites. Therefore, to preserve the customers in the business, it is essential to keep up with the latest trends and convert the business websites to the equivalent mobile applications. Transforming a website to a mobile application efficiently and rapidly is of high demand from sellers with no programming knowledge. However, it is not a trivial task with the existence of complex websites for a variety of domains. WooCommerce with many E-Commerce functionalities and special customization features is one of the commonly-used E-Commerce platforms in the community. It is built on top of WordPress and operates over a large number of online stores. This research provides a unified framework for the transformation of WooCommerce websites to Android as the most widely-used mobile operating system. The Model-Driven Engineering (MDE) is applied for the development of the framework, which provides an efficient way to automatically generate an Android implementation by focusing the attention of software developers from the low level of implementation to the high level of design.
{"title":"An Automatic Generation of Android Application for WooCommerce","authors":"Mohammad-Hadi Dehghani, S. Kolahdouz-Rahimi","doi":"10.1109/ICCKE48569.2019.8964732","DOIUrl":"https://doi.org/10.1109/ICCKE48569.2019.8964732","url":null,"abstract":"Smartphone technology affects every aspect of human life nowadays. Especially there is an increasing demand for online shopping through smartphones instead of websites. Therefore, to preserve the customers in the business, it is essential to keep up with the latest trends and convert the business websites to the equivalent mobile applications. Transforming a website to a mobile application efficiently and rapidly is of high demand from sellers with no programming knowledge. However, it is not a trivial task with the existence of complex websites for a variety of domains. WooCommerce with many E-Commerce functionalities and special customization features is one of the commonly-used E-Commerce platforms in the community. It is built on top of WordPress and operates over a large number of online stores. This research provides a unified framework for the transformation of WooCommerce websites to Android as the most widely-used mobile operating system. The Model-Driven Engineering (MDE) is applied for the development of the framework, which provides an efficient way to automatically generate an Android implementation by focusing the attention of software developers from the low level of implementation to the high level of design.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"61 1","pages":"194-200"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89355777","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 : 2019-10-01DOI: 10.1109/ICCKE48569.2019.8964775
S. Taghavi, Fardjad Davari, H. Malazi, Ahmad Ali Abin
To assist individuals in sports activities is one of the emerging areas of wearable applications. Among various kinds of sports, detecting tennis strokes faces unique challenges. In this sport the speed of strokes is high, enforcing wearable sensors to have high sampling rates, high-speed bus (to transfer the data to the processor), and the most importantly adequate size of high-speed memory. The constraints encourage researchers to design a custom made hardware to cope with the challenges. The research question that we are trying to address is to show how accurate a commercial smartwatch can detect tennis strokes by using various techniques in machine learning. In this paper, we propose an approach to detect three tennis strokes by utilizing a smartwatch. In our method, the smartwatch is part of a wireless network in which inertial data file is transferred to a laptop where data prepossessing and classification is performed. The data file contains acceleration and angular velocity data of the 3D accelerometer and gyroscope. We also enhanced our method with data prepossessing techniques to elevate data quality. The evaluation of our devised method shows promising results compared to a similar method.
{"title":"Tennis stroke detection using inertial data of a smartwatch","authors":"S. Taghavi, Fardjad Davari, H. Malazi, Ahmad Ali Abin","doi":"10.1109/ICCKE48569.2019.8964775","DOIUrl":"https://doi.org/10.1109/ICCKE48569.2019.8964775","url":null,"abstract":"To assist individuals in sports activities is one of the emerging areas of wearable applications. Among various kinds of sports, detecting tennis strokes faces unique challenges. In this sport the speed of strokes is high, enforcing wearable sensors to have high sampling rates, high-speed bus (to transfer the data to the processor), and the most importantly adequate size of high-speed memory. The constraints encourage researchers to design a custom made hardware to cope with the challenges. The research question that we are trying to address is to show how accurate a commercial smartwatch can detect tennis strokes by using various techniques in machine learning. In this paper, we propose an approach to detect three tennis strokes by utilizing a smartwatch. In our method, the smartwatch is part of a wireless network in which inertial data file is transferred to a laptop where data prepossessing and classification is performed. The data file contains acceleration and angular velocity data of the 3D accelerometer and gyroscope. We also enhanced our method with data prepossessing techniques to elevate data quality. The evaluation of our devised method shows promising results compared to a similar method.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"47 1","pages":"466-474"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85689236","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 : 2019-08-18DOI: 10.1109/ICCKE48569.2019.8964723
Fatemeh MohammadZadeh, S. A. Mirghasemi, A. Dorri, H. Ahmadifar
Smart cities are growing significantly due to the growth of smart connected vehicles and Internet of Things (IoT) where a wide range of devices are connected to share data. Online mapping is one of the fundamental services offered in smart cities which enables the vehicle owners to find shortest or fastest direction toward a destination thus reduces travel cost and air pollution. However, existing online mapping services rely on centralized servers, e.g., Google, which collect data from users to offer service. This method is unlikely to scale with growth in the smart city participants and introduces privacy concerns and data wall where data of the users is managed by big companies. To address these challenges, in this paper we introduce DMap, a blockchain-based platform where the users can share data in an anonymous distributed manner with service providers. To the best of our knowledge, DMap is the first distributed blockchain-based solution for online mapping. To improve the scalability of the blockchain, we propose to use edge-computing along with blockchain. To protect against malicious vehicles that may inject false data, we define a reputation system where the collected data of the vehicles is verified by monitoring the neighbor data. We introduce data marketplace where users can trade their data to address data wall challenge.
{"title":"DMap: A Distributed Blockchain-based Framework for Online Mapping in Smart City","authors":"Fatemeh MohammadZadeh, S. A. Mirghasemi, A. Dorri, H. Ahmadifar","doi":"10.1109/ICCKE48569.2019.8964723","DOIUrl":"https://doi.org/10.1109/ICCKE48569.2019.8964723","url":null,"abstract":"Smart cities are growing significantly due to the growth of smart connected vehicles and Internet of Things (IoT) where a wide range of devices are connected to share data. Online mapping is one of the fundamental services offered in smart cities which enables the vehicle owners to find shortest or fastest direction toward a destination thus reduces travel cost and air pollution. However, existing online mapping services rely on centralized servers, e.g., Google, which collect data from users to offer service. This method is unlikely to scale with growth in the smart city participants and introduces privacy concerns and data wall where data of the users is managed by big companies. To address these challenges, in this paper we introduce DMap, a blockchain-based platform where the users can share data in an anonymous distributed manner with service providers. To the best of our knowledge, DMap is the first distributed blockchain-based solution for online mapping. To improve the scalability of the blockchain, we propose to use edge-computing along with blockchain. To protect against malicious vehicles that may inject false data, we define a reputation system where the collected data of the vehicles is verified by monitoring the neighbor data. We introduce data marketplace where users can trade their data to address data wall challenge.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"88 10 1","pages":"397-402"},"PeriodicalIF":0.0,"publicationDate":"2019-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84059607","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
扫码关注我们
求助内容：
应助结果提醒方式：