Pub Date : 2012-02-16DOI: 10.1109/ICTKE.2012.6152407
K. Kungcharoen, P. Palangsantikul, W. Premchaiswadi
This paper presents a guideline for application development to provide image object detection capability using “Aforge.NET Framework” in conjunction with C# language. In detecting the target object, image processing techniques such as Blob Counter and HSL Color space were used to distinguish the object from the background and determine the position of the target object on the image. This application can be applied to enhance various capabilities on the mobile robot such as object detection, object following and rotation direction control of robot's camera.
本文提出了使用“Aforge”提供图像对象检测功能的应用程序开发指南。. NET框架”，结合c#语言。在检测目标物体时，利用Blob Counter和HSL Color space等图像处理技术将目标与背景区分开来，确定目标物体在图像上的位置。该应用程序可用于增强移动机器人的各种功能，如物体检测，物体跟踪和机器人相机的旋转方向控制。
{"title":"Development of object detection software for a mobile robot using an AForce.Net framework","authors":"K. Kungcharoen, P. Palangsantikul, W. Premchaiswadi","doi":"10.1109/ICTKE.2012.6152407","DOIUrl":"https://doi.org/10.1109/ICTKE.2012.6152407","url":null,"abstract":"This paper presents a guideline for application development to provide image object detection capability using “Aforge.NET Framework” in conjunction with C# language. In detecting the target object, image processing techniques such as Blob Counter and HSL Color space were used to distinguish the object from the background and determine the position of the target object on the image. This application can be applied to enhance various capabilities on the mobile robot such as object detection, object following and rotation direction control of robot's camera.","PeriodicalId":235347,"journal":{"name":"2011 Ninth International Conference on ICT and Knowledge Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113933516","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 : 2012-02-16DOI: 10.1109/ICTKE.2012.6152410
B. Gobin
This paper gives an overview of the work done to develop a task ontology based on the task templates provided by CommonKADS. It discusses how modeling of KBS is done in the CommonKADS and also gives a brief overview of OWL-S which an upper-level ontology for web services. Constructs of OWL-S ontology have been compared with constructs proposed by CommonKADS to see to what extent it can be reused to build a task ontology to model the tasks that are performed by Knowledge Based Systems.
{"title":"Reusing OWL-S to model knowledge intensive tasks performed by Knowledge Based Systems","authors":"B. Gobin","doi":"10.1109/ICTKE.2012.6152410","DOIUrl":"https://doi.org/10.1109/ICTKE.2012.6152410","url":null,"abstract":"This paper gives an overview of the work done to develop a task ontology based on the task templates provided by CommonKADS. It discusses how modeling of KBS is done in the CommonKADS and also gives a brief overview of OWL-S which an upper-level ontology for web services. Constructs of OWL-S ontology have been compared with constructs proposed by CommonKADS to see to what extent it can be reused to build a task ontology to model the tasks that are performed by Knowledge Based Systems.","PeriodicalId":235347,"journal":{"name":"2011 Ninth International Conference on ICT and Knowledge Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124242331","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 : 2012-02-16DOI: 10.1109/ICTKE.2012.6152406
T. Popeea, A. Constantinescu, F. Radulescu, R. Rughinis
Data mining is the process of extracting patterns from large data sets by combining methods from statistics and artificial intelligence with database management. One of the classes of data mining is classification, where the goal is to generalize a known structure to apply to new data. Supervised learning, a branch of the classification algorithms uses a set of training data to produce an inferred function, called a classifier, which is then used to predict the correct output value for any valid input object. This approach allows supervised learning algorithms to be applied with notable success on games, by predicting the outcome of future matches based on the stored results of previously played matches. We will present the outcome of applying two supervised learning algorithms on a very popular card game, called “Dominion”.
{"title":"An analysis on the applicability of supervised learning algorithms on card games","authors":"T. Popeea, A. Constantinescu, F. Radulescu, R. Rughinis","doi":"10.1109/ICTKE.2012.6152406","DOIUrl":"https://doi.org/10.1109/ICTKE.2012.6152406","url":null,"abstract":"Data mining is the process of extracting patterns from large data sets by combining methods from statistics and artificial intelligence with database management. One of the classes of data mining is classification, where the goal is to generalize a known structure to apply to new data. Supervised learning, a branch of the classification algorithms uses a set of training data to produce an inferred function, called a classifier, which is then used to predict the correct output value for any valid input object. This approach allows supervised learning algorithms to be applied with notable success on games, by predicting the outcome of future matches based on the stored results of previously played matches. We will present the outcome of applying two supervised learning algorithms on a very popular card game, called “Dominion”.","PeriodicalId":235347,"journal":{"name":"2011 Ninth International Conference on ICT and Knowledge Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125079453","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 : 2012-02-16DOI: 10.1109/ICTKE.2012.6152404
A. Tungkasthan, S. Intarasema, W. Premchaiswadi
This paper presents the image retrieval results obtained by the Flickr website based on using the combination of keywords and tags for retrieving images. The aim of this paper is to improve the accuracy of the image search results returned by an image search engine, Flickr. In order to improve the retrieval performance of images, sixty keywords in various categories are used for testing based on the Flickr image database. The results show that the proposed system returned more accurate results than the results obtained from an existing Flickr system.
{"title":"Tag similarity for Flickr","authors":"A. Tungkasthan, S. Intarasema, W. Premchaiswadi","doi":"10.1109/ICTKE.2012.6152404","DOIUrl":"https://doi.org/10.1109/ICTKE.2012.6152404","url":null,"abstract":"This paper presents the image retrieval results obtained by the Flickr website based on using the combination of keywords and tags for retrieving images. The aim of this paper is to improve the accuracy of the image search results returned by an image search engine, Flickr. In order to improve the retrieval performance of images, sixty keywords in various categories are used for testing based on the Flickr image database. The results show that the proposed system returned more accurate results than the results obtained from an existing Flickr system.","PeriodicalId":235347,"journal":{"name":"2011 Ninth International Conference on ICT and Knowledge Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129385484","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 : 2012-02-16DOI: 10.1109/ICTKE.2012.6152393
W. Romsaiyud, W. Premchaiswadi
Social Network has become a very popular communication tool among Internet users who connect to each other by one or more relations. Millions of users are sharing opinions and experiences on different aspects of life every day via the social network community. Comments from the members of social network can be influential and have an impact on trust among members within the social group. The Discovery of Influential Behavior Pattern of Members in Social Networks brings challenge to workers in this research field. Understanding social networks requires analysis of structural relations between the users and the patterns of interaction among users. This paper thus focuses on 2 folds: First, we defined many factors for leadership in social network and showed that, those at individuals who are central to social networks serve as the opinion leaders. Second, we proposed a fuzzy data-mining algorithm to find association rules for analyzing the posting messages into quantitative values and discovered interesting sequential patterns among them. The sequential patterns are very important for real-world applications since the patterns mined out exhibit the sequential quantitative regularity in databases and can provide useful information to applications.
{"title":"Applying mining fuzzy sequential patterns technique to predict the leadership in social networks","authors":"W. Romsaiyud, W. Premchaiswadi","doi":"10.1109/ICTKE.2012.6152393","DOIUrl":"https://doi.org/10.1109/ICTKE.2012.6152393","url":null,"abstract":"Social Network has become a very popular communication tool among Internet users who connect to each other by one or more relations. Millions of users are sharing opinions and experiences on different aspects of life every day via the social network community. Comments from the members of social network can be influential and have an impact on trust among members within the social group. The Discovery of Influential Behavior Pattern of Members in Social Networks brings challenge to workers in this research field. Understanding social networks requires analysis of structural relations between the users and the patterns of interaction among users. This paper thus focuses on 2 folds: First, we defined many factors for leadership in social network and showed that, those at individuals who are central to social networks serve as the opinion leaders. Second, we proposed a fuzzy data-mining algorithm to find association rules for analyzing the posting messages into quantitative values and discovered interesting sequential patterns among them. The sequential patterns are very important for real-world applications since the patterns mined out exhibit the sequential quantitative regularity in databases and can provide useful information to applications.","PeriodicalId":235347,"journal":{"name":"2011 Ninth International Conference on ICT and Knowledge Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122183945","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 : 2012-02-16DOI: 10.1109/ICTKE.2012.6152397
Puangpet Srivichai, K. Meksamoot, Anchalee Jengjalern, N. Chakpitak
This paper presents a project that focuses on the conceptual framework of a system which combines a knowledge management system (KMS) and mentoring process to develop the professional skills of new university staff to advance in their career. Data collection involved interviewing academic staff in both a newly created university (Rajabhat Suan Dusit) and a well-established university (Chiang Mai University). Results from this project demonstrate an integrated approach to staff development, which combines a Knowledge Management System and mentoring program. The KMS contains users, content, and activities and within the system, staff are matched with mentors who are accepted as experts and have attained a wide range of knowledge, and information, as well as being experienced in activities relying on multiple techniques such as mentoring, training, coaching, and counseling for professional development. Furthermore, the initial model is justifiably a beneficial tool for developing staff in educational organizations, mainly as it develops new staff in a shorter timeframe when compared with existing training processes and has potential to help solve the problem of replacing retired staff. However, in the drive toward achieving success, this paper notes that the system should be appropriately designed to include users' needs including ease of access and should utilize coordinators to facilitate the system, and encourage effective working relationships among all staff.
{"title":"Integrated knowledge management system based mentoring for new university staff development","authors":"Puangpet Srivichai, K. Meksamoot, Anchalee Jengjalern, N. Chakpitak","doi":"10.1109/ICTKE.2012.6152397","DOIUrl":"https://doi.org/10.1109/ICTKE.2012.6152397","url":null,"abstract":"This paper presents a project that focuses on the conceptual framework of a system which combines a knowledge management system (KMS) and mentoring process to develop the professional skills of new university staff to advance in their career. Data collection involved interviewing academic staff in both a newly created university (Rajabhat Suan Dusit) and a well-established university (Chiang Mai University). Results from this project demonstrate an integrated approach to staff development, which combines a Knowledge Management System and mentoring program. The KMS contains users, content, and activities and within the system, staff are matched with mentors who are accepted as experts and have attained a wide range of knowledge, and information, as well as being experienced in activities relying on multiple techniques such as mentoring, training, coaching, and counseling for professional development. Furthermore, the initial model is justifiably a beneficial tool for developing staff in educational organizations, mainly as it develops new staff in a shorter timeframe when compared with existing training processes and has potential to help solve the problem of replacing retired staff. However, in the drive toward achieving success, this paper notes that the system should be appropriately designed to include users' needs including ease of access and should utilize coordinators to facilitate the system, and encourage effective working relationships among all staff.","PeriodicalId":235347,"journal":{"name":"2011 Ninth International Conference on ICT and Knowledge Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131842588","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 : 2012-02-16DOI: 10.1109/ICTKE.2012.6152392
Yuttana Suttasupa, Suppat Rungraungsilp, Suwat Pinyopan, Pravit Wungchusunti, P. Chongstitvatana
Genetic Programming is a widely used technique to solve many optimization problems. The original representation of a solution is a tree structure. To improve its search capability there are many proposals for encoding data structure of a solution of Genetic Programming as a linear code. However there are a few work in comparing between these proposals. This work presents a systematic way to compare three popular techniques for linear encoding in Genetic Programming. They are Linear Genetic Programming, Gene Expression Programming and Multi-Expression Programming. Ten problems in Symbolic Expressions are defined and are used as benchmarks to compare the effectiveness of these proposals against the baseline standard Genetic Programming. The metrics of comparison are the Success Rate and the absolute error. The discussion and comparison of the strength and weakness of each method are also presented.
{"title":"A comparative study of linear encoding in Genetic Programming","authors":"Yuttana Suttasupa, Suppat Rungraungsilp, Suwat Pinyopan, Pravit Wungchusunti, P. Chongstitvatana","doi":"10.1109/ICTKE.2012.6152392","DOIUrl":"https://doi.org/10.1109/ICTKE.2012.6152392","url":null,"abstract":"Genetic Programming is a widely used technique to solve many optimization problems. The original representation of a solution is a tree structure. To improve its search capability there are many proposals for encoding data structure of a solution of Genetic Programming as a linear code. However there are a few work in comparing between these proposals. This work presents a systematic way to compare three popular techniques for linear encoding in Genetic Programming. They are Linear Genetic Programming, Gene Expression Programming and Multi-Expression Programming. Ten problems in Symbolic Expressions are defined and are used as benchmarks to compare the effectiveness of these proposals against the baseline standard Genetic Programming. The metrics of comparison are the Success Rate and the absolute error. The discussion and comparison of the strength and weakness of each method are also presented.","PeriodicalId":235347,"journal":{"name":"2011 Ninth International Conference on ICT and Knowledge Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131733243","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 : 2012-02-16DOI: 10.1109/ICTKE.2012.6152409
N. Sahavechaphan, S. U-ruekolan, N. Harnsamut, J. Phengsuwan, K. Aroonrua
The adoption of electronically formatted medical records, so called Electronic Health Record (EHR), has become extremely important in healthcare systems to enable the exchange of medical information among healthcare providers. To the best of our knowledge, no approach has yet administrated the access policies on the basis of different aspects and subject types in a flexible, scalable and cost-effective manner. We have thus focused on an efficient improvement of policy administration along with the application of ABAC. To achieve this, we believe that a desirable EHR access policy should be created on the fly based on the appropriate primitive policies. In this paper, we thus propose AAS-pada - the composition-based technique for EHR access policy administration on ABAC. Given a subject's attributes and a set of primitive policies, AAS-pada (i) selects the desirable primitive policies across five aspects corresponding to a subject's attributes. (ii) instantiates these primitive policies with the attribute values; and (iii) composes these instantiated primitive policies to form a desirable access policy. Our experimental results show that AAS-pada supports the coverage of all subject types with less investment on the initially created policies. Moreover, it has less impact when the edition of an individual aspect concern is required. Essentially, AAS-pada brings few contributions: flexibility, scalability and cost-effective in administrating the EHR access policies to various subject types.
{"title":"An efficient technique for aspect-based EHR access policy administration on ABAC","authors":"N. Sahavechaphan, S. U-ruekolan, N. Harnsamut, J. Phengsuwan, K. Aroonrua","doi":"10.1109/ICTKE.2012.6152409","DOIUrl":"https://doi.org/10.1109/ICTKE.2012.6152409","url":null,"abstract":"The adoption of electronically formatted medical records, so called Electronic Health Record (EHR), has become extremely important in healthcare systems to enable the exchange of medical information among healthcare providers. To the best of our knowledge, no approach has yet administrated the access policies on the basis of different aspects and subject types in a flexible, scalable and cost-effective manner. We have thus focused on an efficient improvement of policy administration along with the application of ABAC. To achieve this, we believe that a desirable EHR access policy should be created on the fly based on the appropriate primitive policies. In this paper, we thus propose AAS-pada - the composition-based technique for EHR access policy administration on ABAC. Given a subject's attributes and a set of primitive policies, AAS-pada (i) selects the desirable primitive policies across five aspects corresponding to a subject's attributes. (ii) instantiates these primitive policies with the attribute values; and (iii) composes these instantiated primitive policies to form a desirable access policy. Our experimental results show that AAS-pada supports the coverage of all subject types with less investment on the initially created policies. Moreover, it has less impact when the edition of an individual aspect concern is required. Essentially, AAS-pada brings few contributions: flexibility, scalability and cost-effective in administrating the EHR access policies to various subject types.","PeriodicalId":235347,"journal":{"name":"2011 Ninth International Conference on ICT and Knowledge Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124918326","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 : 2012-02-16DOI: 10.1109/ICTKE.2012.6152399
H. Kim, M. Yi
The present study proposes a new method that automatically creates a knowledge structure from a single document. Knowledge structure refers to an organization of knowledge, represented through key concepts that make up the knowledge domain and their proximity relationships. We examine several alternative methods in inferring a knowledge structure from a document, and those methods are compared with the knowledge structures obtained from learners (before and after learning) and domain experts. The knowledge structure created by the method that utilizes paragraph co-occurrences with cosine similarity has been found to be the most successful in generating a knowledge structure from a document and its performance to be comparable to a human expert in terms of similarity and consistency. Findings of the study have the potential to significantly improve the current practice in information retrieval.
{"title":"Empirical validation of an automated method of knowledge structure creation from single documents","authors":"H. Kim, M. Yi","doi":"10.1109/ICTKE.2012.6152399","DOIUrl":"https://doi.org/10.1109/ICTKE.2012.6152399","url":null,"abstract":"The present study proposes a new method that automatically creates a knowledge structure from a single document. Knowledge structure refers to an organization of knowledge, represented through key concepts that make up the knowledge domain and their proximity relationships. We examine several alternative methods in inferring a knowledge structure from a document, and those methods are compared with the knowledge structures obtained from learners (before and after learning) and domain experts. The knowledge structure created by the method that utilizes paragraph co-occurrences with cosine similarity has been found to be the most successful in generating a knowledge structure from a document and its performance to be comparable to a human expert in terms of similarity and consistency. Findings of the study have the potential to significantly improve the current practice in information retrieval.","PeriodicalId":235347,"journal":{"name":"2011 Ninth International Conference on ICT and Knowledge Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126932500","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 : 2012-02-16DOI: 10.1109/ICTKE.2012.6152411
S. Minz, I. K. A. Abughali
The scope for improvements in the VCD algorithm [1] has been identified in this paper. The enhancement proposed in this paper considers to eliminate the user inputs for the parameters λ and zp. The base algorithm and the proposed algorithm have been implemented and compared based on the outcomes of the two experiments. The traditional Silhouette coefficient has also been modified as an evaluation parameter. Results of both algorithms are compared by independent t-test. Although no significant difference has been observed in the performances of the base algorithm and the proposed algorithm in the experiment-1, the user need not do parameter setting for the enhanced algorithm. As most clustering algorithms are sensitive to the order of the data input, the results of experiment-2 show that the outcome of the proposed algorithm is not affected by the order of data input. More over the proposed algorithm yields cluster outcomes in hierarchical manner.
{"title":"Time-varying microarray data sets: Co-expression detection","authors":"S. Minz, I. K. A. Abughali","doi":"10.1109/ICTKE.2012.6152411","DOIUrl":"https://doi.org/10.1109/ICTKE.2012.6152411","url":null,"abstract":"The scope for improvements in the VCD algorithm [1] has been identified in this paper. The enhancement proposed in this paper considers to eliminate the user inputs for the parameters λ and zp. The base algorithm and the proposed algorithm have been implemented and compared based on the outcomes of the two experiments. The traditional Silhouette coefficient has also been modified as an evaluation parameter. Results of both algorithms are compared by independent t-test. Although no significant difference has been observed in the performances of the base algorithm and the proposed algorithm in the experiment-1, the user need not do parameter setting for the enhanced algorithm. As most clustering algorithms are sensitive to the order of the data input, the results of experiment-2 show that the outcome of the proposed algorithm is not affected by the order of data input. More over the proposed algorithm yields cluster outcomes in hierarchical manner.","PeriodicalId":235347,"journal":{"name":"2011 Ninth International Conference on ICT and Knowledge Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116053459","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
扫码关注我们
求助内容：
应助结果提醒方式：