Pub Date : 2016-10-01DOI: 10.1109/IMCEC.2016.7867344
Syed Arsalan Ali, Gao Xiaoguang, Xiaowei Fu
In cooperative missions, if an individual UAV does not have sufficient resources to neutralize a target then a coalition of UAVs may needs to be formed that fulfills the target resource requirement. This paper proposes an algorithm for the decentralized coalition formation of multiple heterogeneous UAVs that cooperatively perform a search and attack task to neutralize the static ground targets. The main objective of the proposed algorithm is to determine the smallest coalition that would successfully destroy the target in minimum time. First, the responding UAVs are sorted in the ascending order of their resource difference based cost, and then the eligible sets of UAVs with required total resources that can fulfill the target resource criteria are determined. Second, from the eligible sets of UAVs, the algorithm determines the set with minimum time to neutralize the target based on the time of arrival of UAVs on target. Simulation tests to study the performance of proposed approach are carried out and the results are compared with one of the reference sub optimal decentralized coalition formation approach. The results clearly depict that the proposed approach is more effective and gives near optimal solution for the decentralized coalition formation.
{"title":"Decentralized coalition formation of multiple UAVs in an uncertain region","authors":"Syed Arsalan Ali, Gao Xiaoguang, Xiaowei Fu","doi":"10.1109/IMCEC.2016.7867344","DOIUrl":"https://doi.org/10.1109/IMCEC.2016.7867344","url":null,"abstract":"In cooperative missions, if an individual UAV does not have sufficient resources to neutralize a target then a coalition of UAVs may needs to be formed that fulfills the target resource requirement. This paper proposes an algorithm for the decentralized coalition formation of multiple heterogeneous UAVs that cooperatively perform a search and attack task to neutralize the static ground targets. The main objective of the proposed algorithm is to determine the smallest coalition that would successfully destroy the target in minimum time. First, the responding UAVs are sorted in the ascending order of their resource difference based cost, and then the eligible sets of UAVs with required total resources that can fulfill the target resource criteria are determined. Second, from the eligible sets of UAVs, the algorithm determines the set with minimum time to neutralize the target based on the time of arrival of UAVs on target. Simulation tests to study the performance of proposed approach are carried out and the results are compared with one of the reference sub optimal decentralized coalition formation approach. The results clearly depict that the proposed approach is more effective and gives near optimal solution for the decentralized coalition formation.","PeriodicalId":218222,"journal":{"name":"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124508418","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-10-01DOI: 10.1109/IMCEC.2016.7867215
Qingfeng Ma, Yuzhu He, Fuqiang Zhou
This paper presents a multi-objective fruit fly optimization algorithm (MOFOA) to solve test point selection problem. In the MOFOA, a binary string is used to represent a location of fruit fly, the number of 1s and the different position of 1s in the binary string represent the distance and direction of FOA respectively. The iteration search of MOFOA is based on smell search and vision search. Both the number of isolated faults and selected test points compose a multidimensional fitness function to enhance the global exploration ability. More than one possible optimal solution is searched by the approach. The accuracy and the efficiency of the proposed algorithm are proven by experiments. The results show that the MOFOA is more accurate and more efficient than other algorithms.
{"title":"Multi-objective fruit fly optimization algorithm for test point selection","authors":"Qingfeng Ma, Yuzhu He, Fuqiang Zhou","doi":"10.1109/IMCEC.2016.7867215","DOIUrl":"https://doi.org/10.1109/IMCEC.2016.7867215","url":null,"abstract":"This paper presents a multi-objective fruit fly optimization algorithm (MOFOA) to solve test point selection problem. In the MOFOA, a binary string is used to represent a location of fruit fly, the number of 1s and the different position of 1s in the binary string represent the distance and direction of FOA respectively. The iteration search of MOFOA is based on smell search and vision search. Both the number of isolated faults and selected test points compose a multidimensional fitness function to enhance the global exploration ability. More than one possible optimal solution is searched by the approach. The accuracy and the efficiency of the proposed algorithm are proven by experiments. The results show that the MOFOA is more accurate and more efficient than other algorithms.","PeriodicalId":218222,"journal":{"name":"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124963644","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-10-01DOI: 10.1109/IMCEC.2016.7867469
Guozhou Ge, Jingchang Pan
Large Sky Area Multi-Object Fiber Spectroscopy Telescope (LAMOST) is a meridian reflecting Schmidt telescope. For each observation, it will produce tens of thousands of spectra. The spectra obtained from LAMOST pilot survey and the first two years of its regular survey, LMOST data release 2 (DR2) was released online in December 2014. This data set contains about more than four million spectra, which include stars, galaxies, quasars and other unknown stars. LAMOST large scientific survey project has provide massive spectra for the astronomers to search some rare special stars such as Cataclysmic Variable stars (CVs), Herbig Ae/Be etc. These special stars always contain emission lines. The existing of emission lines indicate that the stars have experienced or are not stable ejection process. The search for these objects is helpful in astronomy for scholars to study the stellar evolution. In this paper, we study the identification method of emission line stars, using the distributed, parallel computing large data processing technology, Hadoop, the emission line stars (ELS) spectra were screened from the DR2 spectra data set. Through by a multi node cluster parallel data mining experiment, we got 51092 spectra with emission lines from these spectra. Hadoop cluster has greatly improved the identification transmission line of the stellar spectrum efficiency, and this paper provides important reference value for the future to resolve similar massive spectra data processing problems.
{"title":"Data mining of stellar spectra with emission lines based on Hadoop","authors":"Guozhou Ge, Jingchang Pan","doi":"10.1109/IMCEC.2016.7867469","DOIUrl":"https://doi.org/10.1109/IMCEC.2016.7867469","url":null,"abstract":"Large Sky Area Multi-Object Fiber Spectroscopy Telescope (LAMOST) is a meridian reflecting Schmidt telescope. For each observation, it will produce tens of thousands of spectra. The spectra obtained from LAMOST pilot survey and the first two years of its regular survey, LMOST data release 2 (DR2) was released online in December 2014. This data set contains about more than four million spectra, which include stars, galaxies, quasars and other unknown stars. LAMOST large scientific survey project has provide massive spectra for the astronomers to search some rare special stars such as Cataclysmic Variable stars (CVs), Herbig Ae/Be etc. These special stars always contain emission lines. The existing of emission lines indicate that the stars have experienced or are not stable ejection process. The search for these objects is helpful in astronomy for scholars to study the stellar evolution. In this paper, we study the identification method of emission line stars, using the distributed, parallel computing large data processing technology, Hadoop, the emission line stars (ELS) spectra were screened from the DR2 spectra data set. Through by a multi node cluster parallel data mining experiment, we got 51092 spectra with emission lines from these spectra. Hadoop cluster has greatly improved the identification transmission line of the stellar spectrum efficiency, and this paper provides important reference value for the future to resolve similar massive spectra data processing problems.","PeriodicalId":218222,"journal":{"name":"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129677396","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-10-01DOI: 10.1109/IMCEC.2016.7867477
Hu Mengzhong, Jin Xue-ming, Huang Yuankui
As to the problem of grating lobes suppression for wide-band reconnaissance DBF, a new method is proposed based on the technology of virtual antenna. The array antenna in the method uses main array antenna plus auxiliary array way. DBF algorithms in the method don't need to know the prior knowledge of reconnaissance signal and don't need complex matrix inverse operation, instead of it, the two kinds of fast calculation algorithm for the signal of virtual unit is used. Finally, the method not only suppresses grating lobe for broadband DBF effectively, but also improves the antenna angular resolution. At last, a 1-D and 16-unit array antenna is studied as an example for simulation analysis. The simulation results show that the proposed method can maximum suppress the grating lobe 15dB, and decrease the equivalent antenna beam width to half of the original antenna. So, the validity and superiority of this method is verified.
{"title":"A method for suppressing grating lobes of wideband reconnaissance DBF","authors":"Hu Mengzhong, Jin Xue-ming, Huang Yuankui","doi":"10.1109/IMCEC.2016.7867477","DOIUrl":"https://doi.org/10.1109/IMCEC.2016.7867477","url":null,"abstract":"As to the problem of grating lobes suppression for wide-band reconnaissance DBF, a new method is proposed based on the technology of virtual antenna. The array antenna in the method uses main array antenna plus auxiliary array way. DBF algorithms in the method don't need to know the prior knowledge of reconnaissance signal and don't need complex matrix inverse operation, instead of it, the two kinds of fast calculation algorithm for the signal of virtual unit is used. Finally, the method not only suppresses grating lobe for broadband DBF effectively, but also improves the antenna angular resolution. At last, a 1-D and 16-unit array antenna is studied as an example for simulation analysis. The simulation results show that the proposed method can maximum suppress the grating lobe 15dB, and decrease the equivalent antenna beam width to half of the original antenna. So, the validity and superiority of this method is verified.","PeriodicalId":218222,"journal":{"name":"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127134437","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-10-01DOI: 10.1109/IMCEC.2016.7867331
Chunmeng Hu, Sanyang Liu, Zhaohui Zhang
Topologies with strong invulnerability and high reliability has become an important issue in the development of Wireless Sensor Networks (WSNs). In this paper, WSNs is modeled as a weighted network which the load of nodes is considered as the weight of nodes. Thus, the problem of balancing the load turns into the problem of balancing the weight of the network. A load-aware and energy-aware local world (LAEAL) model which considers the node fitness, node energy and node weight for WSNs topology evolution is proposed. Both analysis and simulations indicate that LAEAL model enhances connectivity and network lifetime, achieves high robustness against malicious attacks, and at the same time maintains the invulnerability of random attacks.
{"title":"Load-weighted dynamic and evolution model for Wireless Sensor Networks","authors":"Chunmeng Hu, Sanyang Liu, Zhaohui Zhang","doi":"10.1109/IMCEC.2016.7867331","DOIUrl":"https://doi.org/10.1109/IMCEC.2016.7867331","url":null,"abstract":"Topologies with strong invulnerability and high reliability has become an important issue in the development of Wireless Sensor Networks (WSNs). In this paper, WSNs is modeled as a weighted network which the load of nodes is considered as the weight of nodes. Thus, the problem of balancing the load turns into the problem of balancing the weight of the network. A load-aware and energy-aware local world (LAEAL) model which considers the node fitness, node energy and node weight for WSNs topology evolution is proposed. Both analysis and simulations indicate that LAEAL model enhances connectivity and network lifetime, achieves high robustness against malicious attacks, and at the same time maintains the invulnerability of random attacks.","PeriodicalId":218222,"journal":{"name":"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130164300","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-10-01DOI: 10.1109/IMCEC.2016.7867567
Zongqiang Zheng
As the most important part of static synchronous generator (STATCOM), cascade valve group should be carried on the strict test, if the reliability of the device is high requirement. This paper presents a suitable control strategy for cascade valve group, and introduces the micro-grid islanding control. V/ƒ control is used as a modulation signal of link, it can provide the necessary support for system voltage and frequency. The control reference signal generation is used as another link modulation signal, meanwhile, a detailed design method of the connection reactor is proposed. Finally, the simulation model structure is consistent with the actual control system in PSCAD/EMTDC, verifies the correctness and feasibility of the control strategy.
{"title":"Design on control strategy for cascaded STATCOM valve group back-to-back running","authors":"Zongqiang Zheng","doi":"10.1109/IMCEC.2016.7867567","DOIUrl":"https://doi.org/10.1109/IMCEC.2016.7867567","url":null,"abstract":"As the most important part of static synchronous generator (STATCOM), cascade valve group should be carried on the strict test, if the reliability of the device is high requirement. This paper presents a suitable control strategy for cascade valve group, and introduces the micro-grid islanding control. V/ƒ control is used as a modulation signal of link, it can provide the necessary support for system voltage and frequency. The control reference signal generation is used as another link modulation signal, meanwhile, a detailed design method of the connection reactor is proposed. Finally, the simulation model structure is consistent with the actual control system in PSCAD/EMTDC, verifies the correctness and feasibility of the control strategy.","PeriodicalId":218222,"journal":{"name":"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126957612","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-10-01DOI: 10.1109/IMCEC.2016.7867448
F. Chen
This paper proposes a route planning method based on multi-agent system for the NP-hard problem in aircraft taxiing route planning. Route planning is made according to the flight schedule in sequence for one aircraft each time. The post-planned route does not damage the existing one and route planning is made by utilizing the free time window of the taxiing road section. The artificial intelligence algorithm based on multi-agent system is designed to search the free time windows so as to find out the optimal taxiing routes for the aircrafts. The simulation results show that the average taxiing time of aircrafts is significantly reduced by comparing with the fixed pre-selected taxiing path algorithm, and the taxiing time may be saved up to 19.6% at maximum.
{"title":"Aircraft taxiing route planning based on multi-agent system","authors":"F. Chen","doi":"10.1109/IMCEC.2016.7867448","DOIUrl":"https://doi.org/10.1109/IMCEC.2016.7867448","url":null,"abstract":"This paper proposes a route planning method based on multi-agent system for the NP-hard problem in aircraft taxiing route planning. Route planning is made according to the flight schedule in sequence for one aircraft each time. The post-planned route does not damage the existing one and route planning is made by utilizing the free time window of the taxiing road section. The artificial intelligence algorithm based on multi-agent system is designed to search the free time windows so as to find out the optimal taxiing routes for the aircrafts. The simulation results show that the average taxiing time of aircrafts is significantly reduced by comparing with the fixed pre-selected taxiing path algorithm, and the taxiing time may be saved up to 19.6% at maximum.","PeriodicalId":218222,"journal":{"name":"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126997040","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-10-01DOI: 10.1109/IMCEC.2016.7867287
A. Aburomman, M. Reaz
Feature extraction addresses the problem of finding the most compact and informative set of features. To maximize the effectiveness of each single feature extraction algorithm and to develop an efficient intrusion detection system, an ensemble of Linear Discriminant Analysis (LDA) and Principle Component Analysis (PCA) feature extraction algorithms is implemented. This ensemble PCA-LDA method has led to good results and showed a greater proportion of precision in comparison to a single feature extraction method.
{"title":"Ensemble of binary SVM classifiers based on PCA and LDA feature extraction for intrusion detection","authors":"A. Aburomman, M. Reaz","doi":"10.1109/IMCEC.2016.7867287","DOIUrl":"https://doi.org/10.1109/IMCEC.2016.7867287","url":null,"abstract":"Feature extraction addresses the problem of finding the most compact and informative set of features. To maximize the effectiveness of each single feature extraction algorithm and to develop an efficient intrusion detection system, an ensemble of Linear Discriminant Analysis (LDA) and Principle Component Analysis (PCA) feature extraction algorithms is implemented. This ensemble PCA-LDA method has led to good results and showed a greater proportion of precision in comparison to a single feature extraction method.","PeriodicalId":218222,"journal":{"name":"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132891912","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-10-01DOI: 10.1109/IMCEC.2016.7867535
Xiaohua Tian, Wangsheng Yu
Image segmentation is a hot topic of image processing. The challenging problem is how to preserve the weak edges as well as suppress the over-segmentation. In this paper, we proposed a novel image segmentation algorithm by combining the watershed transform and feature clustering. Firstly, the input image is pre-processed to suppress the noise and smooth the fin details. Secondly, a marker-based watershed transform is applied to segment the image into watershed regions. Finally, mean shift algorithm is exploited to cluster the watershed regions into the fina segmentation. The experiment results indicate that the proposed algorithm can obtain a relative better segmentation results compared with the state of the art works.
{"title":"Color image segmentation based on watershed transform and feature clustering","authors":"Xiaohua Tian, Wangsheng Yu","doi":"10.1109/IMCEC.2016.7867535","DOIUrl":"https://doi.org/10.1109/IMCEC.2016.7867535","url":null,"abstract":"Image segmentation is a hot topic of image processing. The challenging problem is how to preserve the weak edges as well as suppress the over-segmentation. In this paper, we proposed a novel image segmentation algorithm by combining the watershed transform and feature clustering. Firstly, the input image is pre-processed to suppress the noise and smooth the fin details. Secondly, a marker-based watershed transform is applied to segment the image into watershed regions. Finally, mean shift algorithm is exploited to cluster the watershed regions into the fina segmentation. The experiment results indicate that the proposed algorithm can obtain a relative better segmentation results compared with the state of the art works.","PeriodicalId":218222,"journal":{"name":"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132333413","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-10-01DOI: 10.1109/IMCEC.2016.7867405
J. Du, Y. Cheng, Xing Liang, Huaxiao Yang, Jianming Hu, Xiao Ji
The operation error of the electric energy metering device directly affects the accuracy of the electricity trade calculation, so it's very important to ensure the device working accurately. Based on the electric energy meter condition assessment model, considering economic benefits, management benefits and social benefits, we use fuzzy analytic hierarchy process to establish a rotation meter benefit assessment model. Using this model calculate the rotation benefit score. Thus the corresponding rotation strategies for electric energy meter were established. This method has better adaptability than the traditional management approach. By means of quantitative analysis of scientific results, the cycle of rotation, rotation adjustment strategy accordingly, more objective and reasonable than traditional management.
{"title":"Rotation strategy for electric energy meter based on analytic hierarchy process","authors":"J. Du, Y. Cheng, Xing Liang, Huaxiao Yang, Jianming Hu, Xiao Ji","doi":"10.1109/IMCEC.2016.7867405","DOIUrl":"https://doi.org/10.1109/IMCEC.2016.7867405","url":null,"abstract":"The operation error of the electric energy metering device directly affects the accuracy of the electricity trade calculation, so it's very important to ensure the device working accurately. Based on the electric energy meter condition assessment model, considering economic benefits, management benefits and social benefits, we use fuzzy analytic hierarchy process to establish a rotation meter benefit assessment model. Using this model calculate the rotation benefit score. Thus the corresponding rotation strategies for electric energy meter were established. This method has better adaptability than the traditional management approach. By means of quantitative analysis of scientific results, the cycle of rotation, rotation adjustment strategy accordingly, more objective and reasonable than traditional management.","PeriodicalId":218222,"journal":{"name":"2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130286819","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
扫码关注我们
求助内容：
应助结果提醒方式：