To deeply understand the brain response under different emotional states can fundamentally advance the computational models for emotion recognition. Various psychophysiology studies have demonstrated the correlations between human emotions and EEG signals. With the quick development of wearable devices and dry electrode techniques it is now possible to implement EEG-based emotion recognition from laboratories to real-world applications. In this paper we have developed EEG-based emotion recognition models for three emotions: positive, neutral and negative. Extracted features are downloaded from seed database to test a classification method. Gamma band is selected as it relates to emotional states more closely than other frequency bands. The linear dynamical system (LDS) is used to smooth the features before classification. The classification accuracy of the proposed system using DE, ASM, DASM, RASM is 97.33, 89.33 and 98.37 for SVM (linear), SVM (rbf sigma value 6) and KNN(n value 3) respectively.
{"title":"Human Emotion Classification from Brain EEG Signal Using Multimodal Approach of Classifier","authors":"N. Kimmatkar, V. Babu","doi":"10.1145/3193063.3193067","DOIUrl":"https://doi.org/10.1145/3193063.3193067","url":null,"abstract":"To deeply understand the brain response under different emotional states can fundamentally advance the computational models for emotion recognition. Various psychophysiology studies have demonstrated the correlations between human emotions and EEG signals. With the quick development of wearable devices and dry electrode techniques it is now possible to implement EEG-based emotion recognition from laboratories to real-world applications. In this paper we have developed EEG-based emotion recognition models for three emotions: positive, neutral and negative. Extracted features are downloaded from seed database to test a classification method. Gamma band is selected as it relates to emotional states more closely than other frequency bands. The linear dynamical system (LDS) is used to smooth the features before classification. The classification accuracy of the proposed system using DE, ASM, DASM, RASM is 97.33, 89.33 and 98.37 for SVM (linear), SVM (rbf sigma value 6) and KNN(n value 3) respectively.","PeriodicalId":429317,"journal":{"name":"Proceedings of the 2018 International Conference on Intelligent Information Technology","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124423955","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}
In this article, we illustrate some of the semantic web-related technologies and design a set of ontology knowledge structures based on biographical history, using the OWL markup language, which we call BKOnto. This is an official framework for processing biographical history-related messages on the semantic web, including biographical events, time and space relationships, related personal messages, and more. We elaborate on this ontology knowledge architecture and explain how to use BKOnto as a basis for more domain-specific knowledge representation. In BKOnto, we use the OWL language to define the main components of the cognitive structure of the historical body of biography, namely the Storyline of the biography and the historical event of the biography. The so-called biographical story line, which is used to organize the history of multiple biographical superstructure, can be used to describe the biography of a particular person. The so-called biographical historical events, based on the historical data can be based on the description of the content and related space-time factor description of the basic unit. BKOnto's design was based on the StoryLine and Event infrastructure, and then we developed the ontology knowledge building system based on this ontology awareness architecture. Therefore, we also developed a set of ontology knowledge building system based on BKOnto, which is called StoryTeller. The StoryTeller system can be used to construct relevant knowledge of human things in the history of the biography and form a complete biographical story. StoryTeller system, mainly based on the story line organized by the timeline, which contains a number of types and events related to multiple human things as the basic unit to build the story line. The event unit not only describes the description of related human affairs, but also contains the description of time factor and space factor, which is used to construct the space-time information of the unit in the story line. As a result, in a story line with multiple event units, you will be able to present a wealth of information about people and things with their associated spatiotemporal features. In addition, based on the idea of supporting the digital collection system, we also linked up individual event units with the digital collection system of their information sources so that more diverse digital collections could be presented in the future. The empirical study also uses the Mackay Digital Archives Project (http://dlm.csie.au.edu.tw/) as a source of information to demonstrate the ontology knowledge building process of Mackay's biographical stories, as well as related Digital collection of information.
{"title":"Towards a Biographic Knowledge-based Story Ontology System","authors":"J. Yeh","doi":"10.1145/3193063.3193065","DOIUrl":"https://doi.org/10.1145/3193063.3193065","url":null,"abstract":"In this article, we illustrate some of the semantic web-related technologies and design a set of ontology knowledge structures based on biographical history, using the OWL markup language, which we call BKOnto. This is an official framework for processing biographical history-related messages on the semantic web, including biographical events, time and space relationships, related personal messages, and more. We elaborate on this ontology knowledge architecture and explain how to use BKOnto as a basis for more domain-specific knowledge representation. In BKOnto, we use the OWL language to define the main components of the cognitive structure of the historical body of biography, namely the Storyline of the biography and the historical event of the biography. The so-called biographical story line, which is used to organize the history of multiple biographical superstructure, can be used to describe the biography of a particular person. The so-called biographical historical events, based on the historical data can be based on the description of the content and related space-time factor description of the basic unit. BKOnto's design was based on the StoryLine and Event infrastructure, and then we developed the ontology knowledge building system based on this ontology awareness architecture. Therefore, we also developed a set of ontology knowledge building system based on BKOnto, which is called StoryTeller. The StoryTeller system can be used to construct relevant knowledge of human things in the history of the biography and form a complete biographical story. StoryTeller system, mainly based on the story line organized by the timeline, which contains a number of types and events related to multiple human things as the basic unit to build the story line. The event unit not only describes the description of related human affairs, but also contains the description of time factor and space factor, which is used to construct the space-time information of the unit in the story line. As a result, in a story line with multiple event units, you will be able to present a wealth of information about people and things with their associated spatiotemporal features. In addition, based on the idea of supporting the digital collection system, we also linked up individual event units with the digital collection system of their information sources so that more diverse digital collections could be presented in the future. The empirical study also uses the Mackay Digital Archives Project (http://dlm.csie.au.edu.tw/) as a source of information to demonstrate the ontology knowledge building process of Mackay's biographical stories, as well as related Digital collection of information.","PeriodicalId":429317,"journal":{"name":"Proceedings of the 2018 International Conference on Intelligent Information Technology","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121338164","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}
Sinachettra Thay, P. Aimmanee, Bunyarit Uyyanavara, Pataravit Rukskul
Detection of a hemorrhage in CT scan slices is one of the crucial steps for a neurosurgeon to diagnose any abnormality and severity in the brain of a patient. It is usually time consuming as there are as many as 256 produced slices from a CT scan machine for each patient. In this paper, we introduce an automatic hemorrhage detection in brain CT slices using features-based approach. We employ decision tree based on 8 features to classify slices to two classes- with and without the sign of hemorrhage. The proposed method is tested on 1,451 CT scan slices and achieves a classification accuracy for up to 99% and it takes 0.12 second to detect slices.
{"title":"Fast Hemorrhage Detection in Brain CT Scan Slices Using Projection Profile Based Decision Tree","authors":"Sinachettra Thay, P. Aimmanee, Bunyarit Uyyanavara, Pataravit Rukskul","doi":"10.1145/3193063.3193073","DOIUrl":"https://doi.org/10.1145/3193063.3193073","url":null,"abstract":"Detection of a hemorrhage in CT scan slices is one of the crucial steps for a neurosurgeon to diagnose any abnormality and severity in the brain of a patient. It is usually time consuming as there are as many as 256 produced slices from a CT scan machine for each patient. In this paper, we introduce an automatic hemorrhage detection in brain CT slices using features-based approach. We employ decision tree based on 8 features to classify slices to two classes- with and without the sign of hemorrhage. The proposed method is tested on 1,451 CT scan slices and achieves a classification accuracy for up to 99% and it takes 0.12 second to detect slices.","PeriodicalId":429317,"journal":{"name":"Proceedings of the 2018 International Conference on Intelligent Information Technology","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129115974","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}
Bodeetorn Sutcharit, P. Aimmanee, Pongsate Tangseng
Automatic Optic Disc (OD) localization is an important problem in ophthalmic image processing. Knowing its location helps doctors with the early detection of preventable eye diseases. Inspired by a fast and accurate OD localization algorithm utilizing the vessel projection technique that is usually inefficient when the OD in the image is unusually pale, we employed the decision tree with 5 features to improve the accuracy of the existing algorithm. Also to overcome the problem of poor accuracy when the image is tilted, we repeatedly run this improved algorithm on a series of images tilted at different degree from the original image to obtain the voted location of the OD. The proposed method has been tested on different starting angles between 0 to 180 degrees from Structured Analysis of the Retina (STARE) and retinopathy of prematurity (ROP) datasets. We achieve an average accuracy of up to 86% with an average computation time per image of only 13 seconds per image. Our approach outperforms two other based approaches, Mahfouz and Rotational 2D Vessel Projection (RVP), by up to 34% and 12%, respectively.
{"title":"OD Localization Using Rotational 2D Vessel Projection with Decision Tree Classification","authors":"Bodeetorn Sutcharit, P. Aimmanee, Pongsate Tangseng","doi":"10.1145/3193063.3193075","DOIUrl":"https://doi.org/10.1145/3193063.3193075","url":null,"abstract":"Automatic Optic Disc (OD) localization is an important problem in ophthalmic image processing. Knowing its location helps doctors with the early detection of preventable eye diseases. Inspired by a fast and accurate OD localization algorithm utilizing the vessel projection technique that is usually inefficient when the OD in the image is unusually pale, we employed the decision tree with 5 features to improve the accuracy of the existing algorithm. Also to overcome the problem of poor accuracy when the image is tilted, we repeatedly run this improved algorithm on a series of images tilted at different degree from the original image to obtain the voted location of the OD. The proposed method has been tested on different starting angles between 0 to 180 degrees from Structured Analysis of the Retina (STARE) and retinopathy of prematurity (ROP) datasets. We achieve an average accuracy of up to 86% with an average computation time per image of only 13 seconds per image. Our approach outperforms two other based approaches, Mahfouz and Rotational 2D Vessel Projection (RVP), by up to 34% and 12%, respectively.","PeriodicalId":429317,"journal":{"name":"Proceedings of the 2018 International Conference on Intelligent Information Technology","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127281025","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}
In this paper, we propose a spoken term detection method for detection of terms in zero-resource languages. The proposed method uses the classifier (the speech comparator) trained by a machine learning method combined with the dynamic time warping method. The advantage of the proposed method is that the classifier can be trained using a large language resource that is different from the target language. We exploited the random forest as a classifier, and carried out an experiment of the spoken term detection from Kaqchikel speech. As a result, the proposed method showed better detection performance compared with the method based on the Euclidean distance.
{"title":"Spoken Term Detection of Zero-Resource Language using Machine Learning","authors":"A. Ito, Masatoshi Koizumi","doi":"10.1145/3193063.3193068","DOIUrl":"https://doi.org/10.1145/3193063.3193068","url":null,"abstract":"In this paper, we propose a spoken term detection method for detection of terms in zero-resource languages. The proposed method uses the classifier (the speech comparator) trained by a machine learning method combined with the dynamic time warping method. The advantage of the proposed method is that the classifier can be trained using a large language resource that is different from the target language. We exploited the random forest as a classifier, and carried out an experiment of the spoken term detection from Kaqchikel speech. As a result, the proposed method showed better detection performance compared with the method based on the Euclidean distance.","PeriodicalId":429317,"journal":{"name":"Proceedings of the 2018 International Conference on Intelligent Information Technology","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123540384","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}
CT-images have been used widely in hospitals around the world. The segmentation of liver from CT-images is important, because it can help medical doctors to have a clear view of the liver with rendering tools. The segmentation's result is also useful for radiotherapy. However, liver segmentation is a challenging task because of the liver's geometrical structure and position and because of the similarity between the liver and its nearby organs about the intensity of voxels. In this paper, we propose a method to segment the liver from CT-images by modeling the segmentation with a proposed level-set method on 3D-space. In combination with the proposed 3D level-set methods, we propose to combine the edge information with the region information into the level-set's energy function. The experimental results are compared with manual segmentation performed by clinical experts and with recently developed methods for liver segmentation. Our proposed method can perform the segmentation more accurate in comparison with the others. It also can produce a surface that is smoother than one resulted from the other methods in the comparison.
{"title":"A Robust Liver Segmentation in CT-images Using 3D Level-Set Developed with the Edge and the Region Information","authors":"Thanh-Sach Le, D. Tran","doi":"10.1145/3193063.3193064","DOIUrl":"https://doi.org/10.1145/3193063.3193064","url":null,"abstract":"CT-images have been used widely in hospitals around the world. The segmentation of liver from CT-images is important, because it can help medical doctors to have a clear view of the liver with rendering tools. The segmentation's result is also useful for radiotherapy. However, liver segmentation is a challenging task because of the liver's geometrical structure and position and because of the similarity between the liver and its nearby organs about the intensity of voxels. In this paper, we propose a method to segment the liver from CT-images by modeling the segmentation with a proposed level-set method on 3D-space. In combination with the proposed 3D level-set methods, we propose to combine the edge information with the region information into the level-set's energy function. The experimental results are compared with manual segmentation performed by clinical experts and with recently developed methods for liver segmentation. Our proposed method can perform the segmentation more accurate in comparison with the others. It also can produce a surface that is smoother than one resulted from the other methods in the comparison.","PeriodicalId":429317,"journal":{"name":"Proceedings of the 2018 International Conference on Intelligent Information Technology","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121570242","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}
Wide application usage of Wireless Sensor Network (WSN) triggers many developments in this area. Properly selecting network simulator plays an important role for developing WSN routing protocol and MAC protocol since its different performance focuses. This paper aims to provide an adequate guidance for simulation in Castalia which is suitable for low power sensor nodes deployed in large-scale wireless sensor networks. Moreover, LEACH is a well-known routing protocol, which is used for demonstration along the basic guidance. Lastly, manipulating data extracted from Castalia Result is documented for wide understanding what Castalia aid in WSN research.
{"title":"Simulation Wireless Sensor Networks in Castalia","authors":"K. Ngo, T. Huynh, D. Huynh","doi":"10.1145/3193063.3193066","DOIUrl":"https://doi.org/10.1145/3193063.3193066","url":null,"abstract":"Wide application usage of Wireless Sensor Network (WSN) triggers many developments in this area. Properly selecting network simulator plays an important role for developing WSN routing protocol and MAC protocol since its different performance focuses. This paper aims to provide an adequate guidance for simulation in Castalia which is suitable for low power sensor nodes deployed in large-scale wireless sensor networks. Moreover, LEACH is a well-known routing protocol, which is used for demonstration along the basic guidance. Lastly, manipulating data extracted from Castalia Result is documented for wide understanding what Castalia aid in WSN research.","PeriodicalId":429317,"journal":{"name":"Proceedings of the 2018 International Conference on Intelligent Information Technology","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123055549","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}
Non-volatile memory is emerged such as PCM and 3D XPoint. With the advent of Non-volatile memory, Software platforms have also been developed to manage Non-volatile memory areas. Recently those platforms support PTM system(Persistent transactional memory) which provides transaction system and guarantee crash-consistency of transaction at the main memory level. For ensuring crash-consistency of transaction, PTM system should use frequently hardware-instruction. Because ensuring persistent boundary has been changed volatile memory/storage to volatile cache/Non-volatile memory. This has a huge adverse effect on PTM system. In this paper, we propose a three techniques. Append-only dynamic log can support compact and dynamic log area. Lazy and bulk persistence aggressively delay persistence phase to commit phase. Non temporal persistence can provide enhanced memory copy function. Above techniques aim to reduce persistent overhead as many as possible. Our result shows that those techniques can enhance averagely 117% / 140% transaction performance.
{"title":"OpF-STM: Optimized Persistent Overhead Fail-safety Software Transactional Memory in Non-volatile Memory","authors":"Jihyun Kim, Y. Won","doi":"10.1145/3193063.3193076","DOIUrl":"https://doi.org/10.1145/3193063.3193076","url":null,"abstract":"Non-volatile memory is emerged such as PCM and 3D XPoint. With the advent of Non-volatile memory, Software platforms have also been developed to manage Non-volatile memory areas. Recently those platforms support PTM system(Persistent transactional memory) which provides transaction system and guarantee crash-consistency of transaction at the main memory level. For ensuring crash-consistency of transaction, PTM system should use frequently hardware-instruction. Because ensuring persistent boundary has been changed volatile memory/storage to volatile cache/Non-volatile memory. This has a huge adverse effect on PTM system. In this paper, we propose a three techniques. Append-only dynamic log can support compact and dynamic log area. Lazy and bulk persistence aggressively delay persistence phase to commit phase. Non temporal persistence can provide enhanced memory copy function. Above techniques aim to reduce persistent overhead as many as possible. Our result shows that those techniques can enhance averagely 117% / 140% transaction performance.","PeriodicalId":429317,"journal":{"name":"Proceedings of the 2018 International Conference on Intelligent Information Technology","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114147463","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}
This work addresses the problem of monitoring stateful services on a dynamic service-oriented architecture (SOA), such as OSGi. Indeed, in such architecture, services may disappear and appear, and if a used service disappears, then the client doesn't receive any notification. In such cases, classical monitoring approaches with statically linked monitors into services cannot be used. In this paper, we propose an OSGi based runtime monitoring system which enables to make security and self-healablility enforcement of dynamic services. For monitoring coherent stateful services usage, a transactional approach is defined to preserve the current run and collected data. In order to proof the validation of this solution, we give an implementation guidelines based on OSGi platform.
{"title":"An OSGi Monitoring System to Support Dynamicity and to Enhance Fault Tolerance of OSGi Systems","authors":"Yufang Dan, N. Stouls, S. Frénot","doi":"10.1145/3193063.3193072","DOIUrl":"https://doi.org/10.1145/3193063.3193072","url":null,"abstract":"This work addresses the problem of monitoring stateful services on a dynamic service-oriented architecture (SOA), such as OSGi. Indeed, in such architecture, services may disappear and appear, and if a used service disappears, then the client doesn't receive any notification. In such cases, classical monitoring approaches with statically linked monitors into services cannot be used. In this paper, we propose an OSGi based runtime monitoring system which enables to make security and self-healablility enforcement of dynamic services. For monitoring coherent stateful services usage, a transactional approach is defined to preserve the current run and collected data. In order to proof the validation of this solution, we give an implementation guidelines based on OSGi platform.","PeriodicalId":429317,"journal":{"name":"Proceedings of the 2018 International Conference on Intelligent Information Technology","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114699705","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 major premise of big data circulation is to identify the ownership of data resource. This paper summed some feasible techniques and methods for confirming big data property which are data citation technology, data provenance technology, data reversible hiding technology, computer forensic technology and block chain technology. The ownership of information property which from different sizes, different formats and different storage condition on distributed heterogeneous platforms can be confirmed by comprehensive application of these techniques and methods based on the coupling interface between them in the practice of big data.
{"title":"An Overview of Techniques for Confirming Big Data Property Rights","authors":"Su Cheng, Haijun Zhao","doi":"10.1145/3193063.3193069","DOIUrl":"https://doi.org/10.1145/3193063.3193069","url":null,"abstract":"The major premise of big data circulation is to identify the ownership of data resource. This paper summed some feasible techniques and methods for confirming big data property which are data citation technology, data provenance technology, data reversible hiding technology, computer forensic technology and block chain technology. The ownership of information property which from different sizes, different formats and different storage condition on distributed heterogeneous platforms can be confirmed by comprehensive application of these techniques and methods based on the coupling interface between them in the practice of big data.","PeriodicalId":429317,"journal":{"name":"Proceedings of the 2018 International Conference on Intelligent Information Technology","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129166145","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
扫码关注我们
求助内容：
应助结果提醒方式：