Pub Date : 2018-10-01DOI: 10.1109/CYBERC.2018.00030
Lanfei Wang, Jiangming Kan, Jun Guo, Chao Wang
Path planning is an important part in the navigation control of mobile robot in a 3D environment. We proposed an improved ant colony algorithm to address the problems of falling into local optimum easily and long search time in 3D path planning. We redesigned pheromone update and heuristic function. New search mode is designed to solve the problem of searching time. We used a number of 3D terrains to carry out experiments, and set different starting and end points in each terrain. By comparing the results of improved ant colony algorithm and traditional ant colony algorithm, the improved one can reduce the shortest path length by an average of 8.164%.
{"title":"Improved Ant Colony Optimization for Ground Robot 3D Path Planning","authors":"Lanfei Wang, Jiangming Kan, Jun Guo, Chao Wang","doi":"10.1109/CYBERC.2018.00030","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00030","url":null,"abstract":"Path planning is an important part in the navigation control of mobile robot in a 3D environment. We proposed an improved ant colony algorithm to address the problems of falling into local optimum easily and long search time in 3D path planning. We redesigned pheromone update and heuristic function. New search mode is designed to solve the problem of searching time. We used a number of 3D terrains to carry out experiments, and set different starting and end points in each terrain. By comparing the results of improved ant colony algorithm and traditional ant colony algorithm, the improved one can reduce the shortest path length by an average of 8.164%.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131272088","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 : 2018-10-01DOI: 10.1109/CYBERC.2018.00055
A. Aburas, S. Eyono, Omesan Naidoo
commercial vehicles are used to improve people life. One of the main concern is the safety of these commercial vehicle during accidents. This research paper presents the idea of a Vehicle Accident Foresight System (VAFS). Accident datasets for VAFS are based on actual vehicle accident datasets extracted from open-source datasets. VAFS aims to analyze past accident data using the random forest algorithm to analyze and predict future accidents. One thousand decision trees are used in implementation. The implemented prototype consists of a dashboard which can specify accident locations according to time, it can also identify the elements which contribute the most to accident severity. The prediction model of VAFS has a minimum accuracy of 69% and a maximum accuracy of 100%.
{"title":"Vehicle Accident Foresight System Using Bigdata Intelligent Random Forest Algorithm","authors":"A. Aburas, S. Eyono, Omesan Naidoo","doi":"10.1109/CYBERC.2018.00055","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00055","url":null,"abstract":"commercial vehicles are used to improve people life. One of the main concern is the safety of these commercial vehicle during accidents. This research paper presents the idea of a Vehicle Accident Foresight System (VAFS). Accident datasets for VAFS are based on actual vehicle accident datasets extracted from open-source datasets. VAFS aims to analyze past accident data using the random forest algorithm to analyze and predict future accidents. One thousand decision trees are used in implementation. The implemented prototype consists of a dashboard which can specify accident locations according to time, it can also identify the elements which contribute the most to accident severity. The prediction model of VAFS has a minimum accuracy of 69% and a maximum accuracy of 100%.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123958106","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 : 2018-10-01DOI: 10.1109/CYBERC.2018.00013
Yang Zhang, Haichang Gao, Ge Pei, Shuai Kang, Xin Zhou
A good CAPTCHA(Completely Automated Public Turing Test to Tell Computers and Humans Apart) should be friendly for humans to solve but hard for computers. This balance between security and usability is hard to achieve. With the development of deep neural network techniques, increasingly more CAPTCHAs have been cracked. Recent works have shown deep neural networks to be highly susceptible to adversarial examples, which can reliably fool neural networks by adding noise that is imperceptible to humans that matches the needs of CAPTCHA design. In this paper, we study the effect of adversarial examples on CAPTCHA robustness (including image-selecting, clicking-based, and text-based CAPTCHAs). The experimental results demonstrate that adversarial examples have a positive effect on the robustness of CAPTCHA. Even if we fine tune the neural network, the impact of adversarial examples cannot be completely eliminated. At the end of this paper, suggestions are given on how to improve the security of CAPTCHA using adversarial examples.
{"title":"Effect of Adversarial Examples on the Robustness of CAPTCHA","authors":"Yang Zhang, Haichang Gao, Ge Pei, Shuai Kang, Xin Zhou","doi":"10.1109/CYBERC.2018.00013","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00013","url":null,"abstract":"A good CAPTCHA(Completely Automated Public Turing Test to Tell Computers and Humans Apart) should be friendly for humans to solve but hard for computers. This balance between security and usability is hard to achieve. With the development of deep neural network techniques, increasingly more CAPTCHAs have been cracked. Recent works have shown deep neural networks to be highly susceptible to adversarial examples, which can reliably fool neural networks by adding noise that is imperceptible to humans that matches the needs of CAPTCHA design. In this paper, we study the effect of adversarial examples on CAPTCHA robustness (including image-selecting, clicking-based, and text-based CAPTCHAs). The experimental results demonstrate that adversarial examples have a positive effect on the robustness of CAPTCHA. Even if we fine tune the neural network, the impact of adversarial examples cannot be completely eliminated. At the end of this paper, suggestions are given on how to improve the security of CAPTCHA using adversarial examples.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128427418","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}
Program slicing is an effective technique for narrowing the focus of attention to the relevant parts of a program. The dynamic slice contains only those statements that actually affect the variables in the slicing criterion, thus it is useful in software debugging, testing and maintenance. This paper proposes a new approach to dynamically slice object-oriented programs (OOPs) based on modular monadic semantics. It abstracts the computation of program slicing as a language-independent object, slice monad transformer, which can be applied to semantic descriptions of the program analyzed in a modular way, forming the corresponding monadic slicing algorithms. Such algorithms allow dynamic slices to be computed directly on abstract syntax, with no needs to explicitly construct intermediate structures such as dependence graphs or to record an execution history. Simultaneously, it could describe the basic object-oriented (OO) features such as encapsulation, inheritance and dynamic binding well. It has excellent reusability and language-flexibility properties comparing with the current dynamic slicing methods for OOPs.
{"title":"Monadic Dynamic Slicing of Object-Oriented Programs","authors":"Bihuan Xu, Junyan Qian, Yingzhou Zhang, Shurong Zhu","doi":"10.1109/CYBERC.2018.00053","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00053","url":null,"abstract":"Program slicing is an effective technique for narrowing the focus of attention to the relevant parts of a program. The dynamic slice contains only those statements that actually affect the variables in the slicing criterion, thus it is useful in software debugging, testing and maintenance. This paper proposes a new approach to dynamically slice object-oriented programs (OOPs) based on modular monadic semantics. It abstracts the computation of program slicing as a language-independent object, slice monad transformer, which can be applied to semantic descriptions of the program analyzed in a modular way, forming the corresponding monadic slicing algorithms. Such algorithms allow dynamic slices to be computed directly on abstract syntax, with no needs to explicitly construct intermediate structures such as dependence graphs or to record an execution history. Simultaneously, it could describe the basic object-oriented (OO) features such as encapsulation, inheritance and dynamic binding well. It has excellent reusability and language-flexibility properties comparing with the current dynamic slicing methods for OOPs.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128725622","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}
The use of geomagnetic information as indoor positioning technology based on location fingerprints has shown its unique technical superiority. However, the differences in the built-in geomagnetic sensors in different mobile phones make it difficult to achieve the desired positioning accuracy. In light of this problem, the author of this paper proposes a real-time positioning mechanism of smart phones based on geomagnetism. In an indoor environment with certain stability, a standard sensor of geomagnetism acquisition is used to collect data so that different models of mobile phones can achieve geomagnetic positioning through similarity matching algorithms. The method proposed solves the problem of differences of the builtin sensors of different mobile phones, reduces the time of geomagnetic positioning, improves its accuracy, and reduces the cost.
{"title":"GR-PMS: A Geomagnetism-Based Real-Time Positioning Mechanism of Smart Phones","authors":"Shijun Chen, Dawei Chen, Yuanyuan Wang, Yuanyuan Wu","doi":"10.1109/CYBERC.2018.00098","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00098","url":null,"abstract":"The use of geomagnetic information as indoor positioning technology based on location fingerprints has shown its unique technical superiority. However, the differences in the built-in geomagnetic sensors in different mobile phones make it difficult to achieve the desired positioning accuracy. In light of this problem, the author of this paper proposes a real-time positioning mechanism of smart phones based on geomagnetism. In an indoor environment with certain stability, a standard sensor of geomagnetism acquisition is used to collect data so that different models of mobile phones can achieve geomagnetic positioning through similarity matching algorithms. The method proposed solves the problem of differences of the builtin sensors of different mobile phones, reduces the time of geomagnetic positioning, improves its accuracy, and reduces the cost.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129103510","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 : 2018-10-01DOI: 10.1109/CYBERC.2018.00036
XiaWen Zhang, Zhao Qiu, Ping Huang, JianZheng Hu, JingYu Luo
In order to be able to make the image recognition and color recognition better fusion and application, this paper uses the YOLO v2 network that achieves excellent results in the target detection field, which can be through the training of traffic light samples to achieve the high speed and accuracy of identifying and positioning the traffic lights, in combination with the HSV color model, design the ratio of the red and green colors in the located area, identify the red and green colors, and then determine the status of the traffic lights. Through this study, we can understand the possibility of using YOLO v2 network in more fields, and at the same time combine color recognition to make YOLO v2 can get more extensive application.
{"title":"Application Research of YOLO v2 Combined with Color Identification","authors":"XiaWen Zhang, Zhao Qiu, Ping Huang, JianZheng Hu, JingYu Luo","doi":"10.1109/CYBERC.2018.00036","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00036","url":null,"abstract":"In order to be able to make the image recognition and color recognition better fusion and application, this paper uses the YOLO v2 network that achieves excellent results in the target detection field, which can be through the training of traffic light samples to achieve the high speed and accuracy of identifying and positioning the traffic lights, in combination with the HSV color model, design the ratio of the red and green colors in the located area, identify the red and green colors, and then determine the status of the traffic lights. Through this study, we can understand the possibility of using YOLO v2 network in more fields, and at the same time combine color recognition to make YOLO v2 can get more extensive application.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115311910","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 : 2018-10-01DOI: 10.1109/CYBERC.2018.00092
Hang Yuan, Leibo Liu, Hui Li, S. Yin, Shaojun Wei
Interconnection network is a fundamental communication pattern in processor architecture. The area, delay and multicast capacity of interconnection networks have strict requirement. In this paper Reconfigurable Non-blocking Multicast Permutation Network (RMPN) is a kind of routing unit that configurable and data path reconfigurable network. It consists of a switch subnet and a broadcast subnet. It can achieve the input data Non-blocking full Multicast and bit permutation under certain conditions. RMPN can be used to cascade for larger networks easily and configured by bidirectional self-routing. Compared to the previous network, RMPN can reduce number of routing units by 67%, path length by 27.7%and configuration size by 75%.
{"title":"A Full Multicast Reconfigurable Non-blocking Permutation Network","authors":"Hang Yuan, Leibo Liu, Hui Li, S. Yin, Shaojun Wei","doi":"10.1109/CYBERC.2018.00092","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00092","url":null,"abstract":"Interconnection network is a fundamental communication pattern in processor architecture. The area, delay and multicast capacity of interconnection networks have strict requirement. In this paper Reconfigurable Non-blocking Multicast Permutation Network (RMPN) is a kind of routing unit that configurable and data path reconfigurable network. It consists of a switch subnet and a broadcast subnet. It can achieve the input data Non-blocking full Multicast and bit permutation under certain conditions. RMPN can be used to cascade for larger networks easily and configured by bidirectional self-routing. Compared to the previous network, RMPN can reduce number of routing units by 67%, path length by 27.7%and configuration size by 75%.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126554721","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 : 2018-10-01DOI: 10.1109/CYBERC.2018.00019
L. Babenko, I. Pisarev
Cryptographic protocols are the basis for the security of any protected system, including the electronic voting system. One of the most effective ways to analyze protocol security is to use verifiers. In this paper, the formal verifier SPIN was used to analyze the security of the cryptographic protocol for e-voting, which is based on model checking using linear temporal logic (LTL). The cryptographic protocol of electronic voting is described. The main structural units of the Promela language used for simulation in the SPIN verifier are described. The model of the electronic voting protocol in the language Promela is given. The interacting parties, transferred data, the order of the messages transmitted between the parties are described. Security of the cryptographic protocol using the SPIN tool is verified. The simulation of the protocol with active intruder using the man in the middle attack (MITM) to substitute data is made. In the simulation results it is established that the protocol correctly handles the case of an active attack on the parties' authentication.
{"title":"Security Analysis of the Electronic Voting Protocol Based on Blind Intermediaries Using the SPIN Verifier","authors":"L. Babenko, I. Pisarev","doi":"10.1109/CYBERC.2018.00019","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00019","url":null,"abstract":"Cryptographic protocols are the basis for the security of any protected system, including the electronic voting system. One of the most effective ways to analyze protocol security is to use verifiers. In this paper, the formal verifier SPIN was used to analyze the security of the cryptographic protocol for e-voting, which is based on model checking using linear temporal logic (LTL). The cryptographic protocol of electronic voting is described. The main structural units of the Promela language used for simulation in the SPIN verifier are described. The model of the electronic voting protocol in the language Promela is given. The interacting parties, transferred data, the order of the messages transmitted between the parties are described. Security of the cryptographic protocol using the SPIN tool is verified. The simulation of the protocol with active intruder using the man in the middle attack (MITM) to substitute data is made. In the simulation results it is established that the protocol correctly handles the case of an active attack on the parties' authentication.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123805556","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 : 2018-10-01DOI: 10.1109/CYBERC.2018.00095
Juan Zhao, Xiaolong Xu
It is very important to assure the security of laptop access to internet of things (IoT) networks, where all the channels are wireless. In this paper, we design an algorithm to select the proper legitimate laptop to access IoT networks with one eavesdropper in the same networks. Both of each legitimate laptop and the eavesdropper laptop are equipped with multiple antennas as widely applied in 4G, 4G and wireless local area networks (WLAN). It is assumed that the maximum ratio transmit (MRT) and the maximum ratio receive (MRC) are respectively applied at the transmitter and the receiver for each legitimate laptop. The MRC receiver is also employed by each eavesdropper laptop. Our objective is to maximize the throughput of the legitimate laptop yet minimizing the throughput of the eavesdropper laptop over the whole networks. Numerical simulations demonstrate the gain of the proposed method as compared to the reference schemes.
{"title":"Security of Multi-antenna Laptop Wirelessly Access to Internet of Things Networks","authors":"Juan Zhao, Xiaolong Xu","doi":"10.1109/CYBERC.2018.00095","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00095","url":null,"abstract":"It is very important to assure the security of laptop access to internet of things (IoT) networks, where all the channels are wireless. In this paper, we design an algorithm to select the proper legitimate laptop to access IoT networks with one eavesdropper in the same networks. Both of each legitimate laptop and the eavesdropper laptop are equipped with multiple antennas as widely applied in 4G, 4G and wireless local area networks (WLAN). It is assumed that the maximum ratio transmit (MRT) and the maximum ratio receive (MRC) are respectively applied at the transmitter and the receiver for each legitimate laptop. The MRC receiver is also employed by each eavesdropper laptop. Our objective is to maximize the throughput of the legitimate laptop yet minimizing the throughput of the eavesdropper laptop over the whole networks. Numerical simulations demonstrate the gain of the proposed method as compared to the reference schemes.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130419694","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 : 2018-10-01DOI: 10.1109/CYBERC.2018.00089
Peng Liu, Yarong Guo, Yue-ming Li, Song Liu
This study investigates the problem of in-phase and quadrature (IQ) imbalance in the visible light communication (VLC) system. The effectiveness of the blind compensation method based on coordinate rotation digital computer (cordic) algorithm against the IQ imbalance is discussed. We further verify the proposed compensation method with QPSK and 16QAM signals respectively, with simulated impairments caused by the light emitting diode (LED) nonlinearity. Additionally, the analysis of Monte Carlo simulation under the assumption of different signal-to-noise ratio (SNR) is showed where in some cases, the compensation intensity increases as the SNR increases.
{"title":"IQ Imbalance Compensation Based on Cordic Algorithm in VLC-OFDM System","authors":"Peng Liu, Yarong Guo, Yue-ming Li, Song Liu","doi":"10.1109/CYBERC.2018.00089","DOIUrl":"https://doi.org/10.1109/CYBERC.2018.00089","url":null,"abstract":"This study investigates the problem of in-phase and quadrature (IQ) imbalance in the visible light communication (VLC) system. The effectiveness of the blind compensation method based on coordinate rotation digital computer (cordic) algorithm against the IQ imbalance is discussed. We further verify the proposed compensation method with QPSK and 16QAM signals respectively, with simulated impairments caused by the light emitting diode (LED) nonlinearity. Additionally, the analysis of Monte Carlo simulation under the assumption of different signal-to-noise ratio (SNR) is showed where in some cases, the compensation intensity increases as the SNR increases.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129906947","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
扫码关注我们
求助内容：
应助结果提醒方式：