Pub Date : 2017-11-01DOI: 10.1109/ICSAI.2017.8248524
Novie Joy, C. Pelobello, Raul Vincent W. Lumapas, Adrian D. Ablazo
This research runs a predictive model using a simple decision tree of the twitter mined about the opinion of the people towards the new K-12 education program of the Philippines. The initial study which acquired sentiments from Twitter microblogs was utilized to find out whether a predictive model can substantially generate knowledge to support the K to 12 educational reforms in the Philippines. RapidMiner was used as tool to perform analytics on Twitter data. Various RapidMiner operators were used to process the Twitter microblogs to perform clustering and predictive analytics. It also utilized AYLIEN as an extension module of RapidMiner for text analysis and extract insights from these tweets. The experiment reveals in word cluster analysis that users who expressed sentiments about K-12 used similar words on the messages they posted. Overall, the results suggest that tweet data have a quite peculiar nature. Words used in discussed topic create a sort of Twitter culture. The results showed that in the decision tree generated, only favorites variable or the number of likes on a K-12 tweet provides a strong indication of classifying a K-12 tweet as subjective or objective.
{"title":"Knowledge creation opportunities for the K to 12 educationaltransformation in the Philippines using predictive analytics","authors":"Novie Joy, C. Pelobello, Raul Vincent W. Lumapas, Adrian D. Ablazo","doi":"10.1109/ICSAI.2017.8248524","DOIUrl":"https://doi.org/10.1109/ICSAI.2017.8248524","url":null,"abstract":"This research runs a predictive model using a simple decision tree of the twitter mined about the opinion of the people towards the new K-12 education program of the Philippines. The initial study which acquired sentiments from Twitter microblogs was utilized to find out whether a predictive model can substantially generate knowledge to support the K to 12 educational reforms in the Philippines. RapidMiner was used as tool to perform analytics on Twitter data. Various RapidMiner operators were used to process the Twitter microblogs to perform clustering and predictive analytics. It also utilized AYLIEN as an extension module of RapidMiner for text analysis and extract insights from these tweets. The experiment reveals in word cluster analysis that users who expressed sentiments about K-12 used similar words on the messages they posted. Overall, the results suggest that tweet data have a quite peculiar nature. Words used in discussed topic create a sort of Twitter culture. The results showed that in the decision tree generated, only favorites variable or the number of likes on a K-12 tweet provides a strong indication of classifying a K-12 tweet as subjective or objective.","PeriodicalId":285726,"journal":{"name":"2017 4th International Conference on Systems and Informatics (ICSAI)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133448415","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 : 2017-11-01DOI: 10.1109/ICSAI.2017.8248423
Liang Pang, Zhi Xue
In wireless sensor networks, the shared wireless medium and the broadcast nature make the network vulnerable to intelligent jamming attacks. Such attacks are launched timely by eavesdropping on packets being sent across the network. They can severely affect the network capacity to execute its preset functions. In order to address this issue, we propose a novel anti-jamming method which uses the jammer location as the prerequisite to restore the communication links. The proposed method is based on using the artificial noise generated by the synergistic sensor nodes to degrade the wiretap channel of jammer. The feasibility of our method is theoretically proved with the possible network and jammer model. We also provide a simplified scheme to estimate some unknown parameters which are important for practical application. Extensive experiments are conducted in MATLAB to evaluate the effectiveness and performance of our method. The experimental results suggest that the proposed method can make the jammer unable to correctly decode the received packets because of the low Signal-to-Noise Ratio, and significantly restore the communication links by increasing the Packet Send Ratio (PSR)/Packet Delivery Ratio (PDR) at the transmitter/receiver side.
{"title":"A novel anti-jamming method in wireless sensor networks: Using artificial noise to actively interfere the intelligent jammer","authors":"Liang Pang, Zhi Xue","doi":"10.1109/ICSAI.2017.8248423","DOIUrl":"https://doi.org/10.1109/ICSAI.2017.8248423","url":null,"abstract":"In wireless sensor networks, the shared wireless medium and the broadcast nature make the network vulnerable to intelligent jamming attacks. Such attacks are launched timely by eavesdropping on packets being sent across the network. They can severely affect the network capacity to execute its preset functions. In order to address this issue, we propose a novel anti-jamming method which uses the jammer location as the prerequisite to restore the communication links. The proposed method is based on using the artificial noise generated by the synergistic sensor nodes to degrade the wiretap channel of jammer. The feasibility of our method is theoretically proved with the possible network and jammer model. We also provide a simplified scheme to estimate some unknown parameters which are important for practical application. Extensive experiments are conducted in MATLAB to evaluate the effectiveness and performance of our method. The experimental results suggest that the proposed method can make the jammer unable to correctly decode the received packets because of the low Signal-to-Noise Ratio, and significantly restore the communication links by increasing the Packet Send Ratio (PSR)/Packet Delivery Ratio (PDR) at the transmitter/receiver side.","PeriodicalId":285726,"journal":{"name":"2017 4th International Conference on Systems and Informatics (ICSAI)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115648667","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 : 2017-11-01DOI: 10.1109/ICSAI.2017.8248389
Yilun Sun, Qiang Sun, Kai-Di Chang
In order to improve the accuracy of indoor positioning in wireless sensor network, an indoor localization algorithm based on improved Kalman filtering is proposed. By introducing suboptimal unbiased maximum a posteriori (MAP) noise statistical estimator, the system noise covariance and measurement noise covariance of Kalman algorithm is modified adaptively to replace Gaussian white noise sequence of zero mean difference and known covariance, which makes the algorithm have the good filtering effect. In order to show the performance of the proposed algorithm, the indoor localization algorithm performance is compared. The experiment result shows that the proposed algorithm can improve indoor positioning accuracy of unknown nodes.
{"title":"The application of indoor localization systems based on the improved Kalman filtering algorithm","authors":"Yilun Sun, Qiang Sun, Kai-Di Chang","doi":"10.1109/ICSAI.2017.8248389","DOIUrl":"https://doi.org/10.1109/ICSAI.2017.8248389","url":null,"abstract":"In order to improve the accuracy of indoor positioning in wireless sensor network, an indoor localization algorithm based on improved Kalman filtering is proposed. By introducing suboptimal unbiased maximum a posteriori (MAP) noise statistical estimator, the system noise covariance and measurement noise covariance of Kalman algorithm is modified adaptively to replace Gaussian white noise sequence of zero mean difference and known covariance, which makes the algorithm have the good filtering effect. In order to show the performance of the proposed algorithm, the indoor localization algorithm performance is compared. The experiment result shows that the proposed algorithm can improve indoor positioning accuracy of unknown nodes.","PeriodicalId":285726,"journal":{"name":"2017 4th International Conference on Systems and Informatics (ICSAI)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115683022","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 : 2017-11-01DOI: 10.1109/ICSAI.2017.8248474
Shuo-Tsung Chen, Daniel Lee
Most applications in the field of medical image processing require precise estimation. Efficient and automatic image segmentation methods are useful for the isolation and visualization of vessels in computed tomographic angiography (CTA). There have been many methods proposed for the segmentation of vessels. To achieve this goal, this work aims to improve the segmentation of lung vessel trees by reducing the uncertainty in 3D Frangi filter and 3D neutrosophic transform. First of all, gray-level thresholding and some morphological processes are applied to have the segmentation of lung region mainly. Next, 3D Frangi filter is applied to detect lung vessel trees. Finally, 3D neutrosophic transform integrated with k-means clustering obtains better detection of lung vessel trees.
{"title":"Improving the segmentation of lung vessel trees by reducing the uncertainty in neutrosophic transform","authors":"Shuo-Tsung Chen, Daniel Lee","doi":"10.1109/ICSAI.2017.8248474","DOIUrl":"https://doi.org/10.1109/ICSAI.2017.8248474","url":null,"abstract":"Most applications in the field of medical image processing require precise estimation. Efficient and automatic image segmentation methods are useful for the isolation and visualization of vessels in computed tomographic angiography (CTA). There have been many methods proposed for the segmentation of vessels. To achieve this goal, this work aims to improve the segmentation of lung vessel trees by reducing the uncertainty in 3D Frangi filter and 3D neutrosophic transform. First of all, gray-level thresholding and some morphological processes are applied to have the segmentation of lung region mainly. Next, 3D Frangi filter is applied to detect lung vessel trees. Finally, 3D neutrosophic transform integrated with k-means clustering obtains better detection of lung vessel trees.","PeriodicalId":285726,"journal":{"name":"2017 4th International Conference on Systems and Informatics (ICSAI)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114541333","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 : 2017-11-01DOI: 10.1109/ICSAI.2017.8248380
Lu Wang, Xiang Li
Based on the characteristics of the high-dynamic range process technology with the high robustness and in combination with the anti-interference requirement that is proposed the following industries: industrial robotics, automatic driving, ships and arms for depth information process technology, the essay proposes a binocular vision measurement system that is able to automatically adapt to a high-dynamic environment based on xilinx 7Z010 SoC and depth information image processing algorithms, with the goal of reducing the complex interference factors in image processing, and offers a powerful support to the frontier projects in the field of machine vision.
{"title":"The solution to the binocular vision measurement system oriented to high-dynamic range process","authors":"Lu Wang, Xiang Li","doi":"10.1109/ICSAI.2017.8248380","DOIUrl":"https://doi.org/10.1109/ICSAI.2017.8248380","url":null,"abstract":"Based on the characteristics of the high-dynamic range process technology with the high robustness and in combination with the anti-interference requirement that is proposed the following industries: industrial robotics, automatic driving, ships and arms for depth information process technology, the essay proposes a binocular vision measurement system that is able to automatically adapt to a high-dynamic environment based on xilinx 7Z010 SoC and depth information image processing algorithms, with the goal of reducing the complex interference factors in image processing, and offers a powerful support to the frontier projects in the field of machine vision.","PeriodicalId":285726,"journal":{"name":"2017 4th International Conference on Systems and Informatics (ICSAI)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114564809","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 : 2017-11-01DOI: 10.1109/ICSAI.2017.8248346
M. Valenzuela, Alvaro Peña, Luis Lopez, H. Pinto
Many problems addressed in operational research are combinatorial and NP-hard type. Therefore, designing binary algorithms based on swarm intelligence continuous metaheuristics is an area of interest in operational research. In this paper we use a general binarization mechanism based on the percentile concept. We apply the percentile concept to multi-verse optimizer algorithm to solve set covering problem (SCP). Experiments are designed to demonstrate the utility of the percentile concept in binarization. Additionally we verify the efficiency of our algorithm through benchmark instances, showing that Binary multi-verse Optimizer (BMVO) obtains adequate results when it is evaluated against another state of the art algorithm.
{"title":"A binary multi-verse optimizer algorithm applied to the set covering problem","authors":"M. Valenzuela, Alvaro Peña, Luis Lopez, H. Pinto","doi":"10.1109/ICSAI.2017.8248346","DOIUrl":"https://doi.org/10.1109/ICSAI.2017.8248346","url":null,"abstract":"Many problems addressed in operational research are combinatorial and NP-hard type. Therefore, designing binary algorithms based on swarm intelligence continuous metaheuristics is an area of interest in operational research. In this paper we use a general binarization mechanism based on the percentile concept. We apply the percentile concept to multi-verse optimizer algorithm to solve set covering problem (SCP). Experiments are designed to demonstrate the utility of the percentile concept in binarization. Additionally we verify the efficiency of our algorithm through benchmark instances, showing that Binary multi-verse Optimizer (BMVO) obtains adequate results when it is evaluated against another state of the art algorithm.","PeriodicalId":285726,"journal":{"name":"2017 4th International Conference on Systems and Informatics (ICSAI)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117198775","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}
Many resources today are shared freely through social network or cloud storage platforms, which are helpful for uses to acquire data or exchange information. Unfortunately, due to the unrestricted participations, some resources with advertisements or fraud are also uploaded, which force users to hit the ad websites or steal users' data. Therefore, the quality evaluation of one resource is needed for users to judge whether to utilize or install it. In this paper, we implement a system to evaluate the quality based on software install packages, which applies four algorithms to forecast the quality scores. We conduct an extensive experimental study on a real dataset and find that the prediction can be performed in less than one second (0.002s∼0.04s) and with a high accuracy (82.84%∼90.52%).
{"title":"Resource quality prediction based on machine learning algorithms","authors":"Yu Wang, Dingyu Yang, Yunfan Shi, Yizhen Wang, Wanli Chen","doi":"10.1109/ICSAI.2017.8248529","DOIUrl":"https://doi.org/10.1109/ICSAI.2017.8248529","url":null,"abstract":"Many resources today are shared freely through social network or cloud storage platforms, which are helpful for uses to acquire data or exchange information. Unfortunately, due to the unrestricted participations, some resources with advertisements or fraud are also uploaded, which force users to hit the ad websites or steal users' data. Therefore, the quality evaluation of one resource is needed for users to judge whether to utilize or install it. In this paper, we implement a system to evaluate the quality based on software install packages, which applies four algorithms to forecast the quality scores. We conduct an extensive experimental study on a real dataset and find that the prediction can be performed in less than one second (0.002s∼0.04s) and with a high accuracy (82.84%∼90.52%).","PeriodicalId":285726,"journal":{"name":"2017 4th International Conference on Systems and Informatics (ICSAI)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115115640","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 : 2017-11-01DOI: 10.1109/ICSAI.2017.8248397
Guibing Hu, Xue-song Qiu, Luoming Meng
RFID is widely adopted for human activity recognition in interior environments, e.g., elder-caring. Gaining insight through raw RFID data analysis is the key part of the human activity recognition systems. However, the inviolable uncertainty in RFID data, including external environment noise and fragmentary reading (reading collision), increase the difficulty for high-level application widely adoption. In order to address these challenges, we proposing a Hidden Markov Models based data analysis approach in this paper, comparing with previous researches, our method need less limitations and requires only a few prior knowledge about RFID placing, the approach learns from raw RFID data and apply it to analyze the data. Our method analyzes RFID RSSI and 3D-accelerometer data collecting from human movement recognition to overcome aforementioned issues. This system has already been built and successfully deployed in a real experimental room. Result shows that the system run well to obtains an activity recognition with low error rate of 2.5%.
{"title":"Human activity recognition based on Hidden Markov Models using computational RFID","authors":"Guibing Hu, Xue-song Qiu, Luoming Meng","doi":"10.1109/ICSAI.2017.8248397","DOIUrl":"https://doi.org/10.1109/ICSAI.2017.8248397","url":null,"abstract":"RFID is widely adopted for human activity recognition in interior environments, e.g., elder-caring. Gaining insight through raw RFID data analysis is the key part of the human activity recognition systems. However, the inviolable uncertainty in RFID data, including external environment noise and fragmentary reading (reading collision), increase the difficulty for high-level application widely adoption. In order to address these challenges, we proposing a Hidden Markov Models based data analysis approach in this paper, comparing with previous researches, our method need less limitations and requires only a few prior knowledge about RFID placing, the approach learns from raw RFID data and apply it to analyze the data. Our method analyzes RFID RSSI and 3D-accelerometer data collecting from human movement recognition to overcome aforementioned issues. This system has already been built and successfully deployed in a real experimental room. Result shows that the system run well to obtains an activity recognition with low error rate of 2.5%.","PeriodicalId":285726,"journal":{"name":"2017 4th International Conference on Systems and Informatics (ICSAI)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124788607","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 : 2017-11-01DOI: 10.1109/icsai.2017.8248281
Wang Changyuan, Jiang Guangyi, Chen Hua, Jin Ruiming
Eye tracking technology has attracted more and more attention at home and abroad, becomes a hot topic in many disciplines. The part pupil tracking is very important. As the primary means of dealing with nonlinear and non-Gaussian filtering problem, Particle Filter has overcame the Kalman Filters's defects, it has no distribution limit to process noise and observation noise. While SIR (Sequential Importance Resampling) sampling method can eliminate particle degradation in the traditional particle filter. In this paper, we track the pupil by Particle Filter based on SIR. Experiments show that the method can be accurate and real-time to track the pupil, and it has high value of research and application.
{"title":"A pupil tracking method based on particle filter","authors":"Wang Changyuan, Jiang Guangyi, Chen Hua, Jin Ruiming","doi":"10.1109/icsai.2017.8248281","DOIUrl":"https://doi.org/10.1109/icsai.2017.8248281","url":null,"abstract":"Eye tracking technology has attracted more and more attention at home and abroad, becomes a hot topic in many disciplines. The part pupil tracking is very important. As the primary means of dealing with nonlinear and non-Gaussian filtering problem, Particle Filter has overcame the Kalman Filters's defects, it has no distribution limit to process noise and observation noise. While SIR (Sequential Importance Resampling) sampling method can eliminate particle degradation in the traditional particle filter. In this paper, we track the pupil by Particle Filter based on SIR. Experiments show that the method can be accurate and real-time to track the pupil, and it has high value of research and application.","PeriodicalId":285726,"journal":{"name":"2017 4th International Conference on Systems and Informatics (ICSAI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122972713","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 : 2017-11-01DOI: 10.1109/ICSAI.2017.8248388
Xin Ye, Zhengjun Zhai
Solid state disk has been widely used in various storage system due to fast access speed, good shock resistance, nonvolatile and low power consumption. Generally, solid state storage media is NAND Flash. Because the blocks in a NAND flash have a limited number of erase cycles, this reduces the life of NAND flash. Wear-leveling algorithm is employed to extend the lifetime and reliability of SSDs. In this paper, we propose a novel wear-leveling algorithm based on cold, warm and hot block. First, we divide the cold block and warm block, depending on the erase count of blocks. Second, we extracted the hot data from the warm block and merge them into a new block called hot block. Third, the hot data would be stored into RAM, and warm block and cold block into NAND flash. When we update hot block, we just need to do it in the RAM. According to some experiments with correlative wear-leveling algorithms, this algorithm we propose shows the superiority of similar wear-leveling algorithm.
{"title":"Cold-warm-hot block wear-leveling algorithm for a NAND flash storage system","authors":"Xin Ye, Zhengjun Zhai","doi":"10.1109/ICSAI.2017.8248388","DOIUrl":"https://doi.org/10.1109/ICSAI.2017.8248388","url":null,"abstract":"Solid state disk has been widely used in various storage system due to fast access speed, good shock resistance, nonvolatile and low power consumption. Generally, solid state storage media is NAND Flash. Because the blocks in a NAND flash have a limited number of erase cycles, this reduces the life of NAND flash. Wear-leveling algorithm is employed to extend the lifetime and reliability of SSDs. In this paper, we propose a novel wear-leveling algorithm based on cold, warm and hot block. First, we divide the cold block and warm block, depending on the erase count of blocks. Second, we extracted the hot data from the warm block and merge them into a new block called hot block. Third, the hot data would be stored into RAM, and warm block and cold block into NAND flash. When we update hot block, we just need to do it in the RAM. According to some experiments with correlative wear-leveling algorithms, this algorithm we propose shows the superiority of similar wear-leveling algorithm.","PeriodicalId":285726,"journal":{"name":"2017 4th International Conference on Systems and Informatics (ICSAI)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123004904","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
扫码关注我们
求助内容：
应助结果提醒方式：