首页 > 最新文献

2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)最新文献

英文 中文
Analyzing user reviews in Thai language toward aspects in mobile applications 分析泰语用户评论在移动应用方面的作用
Boonyarit Deewattananon, Usa Sammapun
As more and more Thais own mobile devices, mobile applications are high in demand. Before installing mobile applications, many users read reviews written by other users to determine whether or not the application is worth using. In addition, mobile application developers also rely on user reviews to get insight information on which aspects of the mobile application users like or do not like and why. They can use the information to market the beloved aspects of their software product and improve on the problematic ones. However, when there are many reviews, it is difficult to comprehend information in the user reviews. Several researches in recent years aim to extract opinions and sentiments from various texts or documents such as Twitter, webboards, and software product reviews. Most of these researches are for English documents. For Thai language, researches usually focus on other contexts such as hotel reviews or general opinions on Twitter. In this paper, we present an approach to analyze user reviews written in Thai based on techniques in natural language processing, topic modeling, and sentiment analysis. The approach aims to help Thai users and developers discover dynamically, instead of pre-determined, various aspects and associated sentiments from a vast amount of user reviews. The result of the approach is a list of aspects with associated opinions and sentiments to help users assess mobile applications and provide summarized user feedbacks for developers.
随着越来越多的泰国人拥有移动设备,移动应用程序的需求也越来越大。在安装移动应用程序之前,许多用户会阅读其他用户写的评论,以确定该应用程序是否值得使用。此外,手机应用开发者还会通过用户评论来了解用户喜欢或不喜欢手机应用的哪些方面以及原因。他们可以利用这些信息来推销他们的软件产品中受人喜爱的方面,并改进有问题的方面。然而,当用户评论很多时,很难理解用户评论中的信息。近年来的一些研究旨在从各种文本或文档(如Twitter、webboards和软件产品评论)中提取观点和情感。这些研究大多是针对英文文献的。对于泰语,研究通常侧重于其他上下文,如酒店评论或Twitter上的一般意见。在本文中,我们提出了一种基于自然语言处理、主题建模和情感分析技术来分析泰语用户评论的方法。该方法旨在帮助泰国用户和开发者动态地(而不是预先确定地)从大量用户评论中发现各种方面和相关情绪。该方法的结果是一个包含相关意见和情感的方面列表,以帮助用户评估移动应用程序,并为开发人员提供总结的用户反馈。
{"title":"Analyzing user reviews in Thai language toward aspects in mobile applications","authors":"Boonyarit Deewattananon, Usa Sammapun","doi":"10.1109/JCSSE.2017.8025903","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025903","url":null,"abstract":"As more and more Thais own mobile devices, mobile applications are high in demand. Before installing mobile applications, many users read reviews written by other users to determine whether or not the application is worth using. In addition, mobile application developers also rely on user reviews to get insight information on which aspects of the mobile application users like or do not like and why. They can use the information to market the beloved aspects of their software product and improve on the problematic ones. However, when there are many reviews, it is difficult to comprehend information in the user reviews. Several researches in recent years aim to extract opinions and sentiments from various texts or documents such as Twitter, webboards, and software product reviews. Most of these researches are for English documents. For Thai language, researches usually focus on other contexts such as hotel reviews or general opinions on Twitter. In this paper, we present an approach to analyze user reviews written in Thai based on techniques in natural language processing, topic modeling, and sentiment analysis. The approach aims to help Thai users and developers discover dynamically, instead of pre-determined, various aspects and associated sentiments from a vast amount of user reviews. The result of the approach is a list of aspects with associated opinions and sentiments to help users assess mobile applications and provide summarized user feedbacks for developers.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"101 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77424054","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}
引用次数: 9
Trending topic discovery of Twitter Tweets using clustering and topic modeling algorithms 使用聚类和主题建模算法的Twitter Tweets趋势主题发现
Ma. Shiela C. Sapul, T. Aung, Rachsuda Jiamthapthaksin
There is no previous research that compares the results of k-means, CLOPE clustering and Latent Dirichlet Allocation (LDA) topic modeling algorithms for detecting trending topics on tweets. Since not all tweets contain hashtags, we considered three training data feature sets: hashtags, keywords and keywords + hashtags in this study. Our proposed methodology proved that CLOPE can also be used in a non-transactional database like Twitter data set to answer the trending topic discovery and could provide more topic patterns than k-means and LDA. Using additional feature sets has improved the results of k-means and LDA, thus, keywords + hashtags can identify more meaningful topics.
之前没有研究比较k-means、CLOPE聚类和Latent Dirichlet Allocation (LDA)主题建模算法检测tweets趋势话题的结果。由于并非所有推文都包含hashtag,因此我们在本研究中考虑了三种训练数据特征集:hashtag、keywords和keywords + hashtag。我们提出的方法证明,CLOPE也可以用于非事务性数据库(如Twitter数据集)来回答趋势主题发现问题,并且可以提供比k-means和LDA更多的主题模式。使用额外的特征集改进了k-means和LDA的结果,因此,关键词+标签可以识别更有意义的主题。
{"title":"Trending topic discovery of Twitter Tweets using clustering and topic modeling algorithms","authors":"Ma. Shiela C. Sapul, T. Aung, Rachsuda Jiamthapthaksin","doi":"10.1109/JCSSE.2017.8025911","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025911","url":null,"abstract":"There is no previous research that compares the results of k-means, CLOPE clustering and Latent Dirichlet Allocation (LDA) topic modeling algorithms for detecting trending topics on tweets. Since not all tweets contain hashtags, we considered three training data feature sets: hashtags, keywords and keywords + hashtags in this study. Our proposed methodology proved that CLOPE can also be used in a non-transactional database like Twitter data set to answer the trending topic discovery and could provide more topic patterns than k-means and LDA. Using additional feature sets has improved the results of k-means and LDA, thus, keywords + hashtags can identify more meaningful topics.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"9 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83430847","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}
引用次数: 11
One time key Issuing for Verification and Detecting Caller ID Spoofing Attacks 用于验证和检测来电显示欺骗攻击的一次性密钥颁发
Narongsak Sukma, R. Chokngamwong
Caller ID has been used to tell the recipient who is calling before answering the call. In fact, nowadays using just Caller ID is not enough to proof the real caller since there are several ways to manipulate the caller identity. There are number of solutions to proof the caller e.g. using Time base, SMS base, or hardware. Even using DSA and CA, it can lead to data leak or inconsistent verification processing. The One-time password practices can mitigate the risk of Man-in-the-middle attacks because SSL has vulnerability assessment that can lead to MITM or man in the middle attack. The attacker can intercept SSL verification process between Server and client for sniffing then spoofing. It would be better if we can find a solution that does not rely on CA, Third party and/or external hardware. In this paper, we propose the solution with self-controlled security and one-time key issue to avoid data leak. The one-time key issuance is a good solution for verification and detecting caller ID Spoofing attacker through this methodology since it does not rely on third-party CA and store certification anywhere. This solution provides the best of key management as the one-time secret key is used. Results from our test lab show effectively verification rates and good performance where resource and power consumption are not impacted.
来电显示已经被用来在接听电话之前告诉收件人谁在打电话。事实上,现在仅仅使用呼叫者ID不足以证明真正的呼叫者,因为有几种方法可以操纵呼叫者身份。有许多解决方案来证明调用者,例如使用时间基础,短信基础或硬件。即使使用DSA和CA,也可能导致数据泄漏或验证处理不一致。一次性密码实践可以降低中间人攻击的风险,因为SSL具有可能导致MITM或中间人攻击的漏洞评估。攻击者可以拦截服务器和客户端之间的SSL验证过程,进行嗅探和欺骗。如果我们能找到一个不依赖CA、第三方和/或外部硬件的解决方案,那就更好了。在本文中,我们提出了一种具有自我控制安全性和一次性密钥问题的解决方案,以避免数据泄露。一次性密钥发布是通过这种方法验证和检测调用者ID欺骗攻击者的一个很好的解决方案,因为它不依赖于第三方CA,并且可以将证书存储在任何地方。此解决方案提供了最好的密钥管理,因为使用了一次性密钥。我们测试实验室的结果显示,在不影响资源和功耗的情况下,验证率和性能都很好。
{"title":"One time key Issuing for Verification and Detecting Caller ID Spoofing Attacks","authors":"Narongsak Sukma, R. Chokngamwong","doi":"10.1109/JCSSE.2017.8025898","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025898","url":null,"abstract":"Caller ID has been used to tell the recipient who is calling before answering the call. In fact, nowadays using just Caller ID is not enough to proof the real caller since there are several ways to manipulate the caller identity. There are number of solutions to proof the caller e.g. using Time base, SMS base, or hardware. Even using DSA and CA, it can lead to data leak or inconsistent verification processing. The One-time password practices can mitigate the risk of Man-in-the-middle attacks because SSL has vulnerability assessment that can lead to MITM or man in the middle attack. The attacker can intercept SSL verification process between Server and client for sniffing then spoofing. It would be better if we can find a solution that does not rely on CA, Third party and/or external hardware. In this paper, we propose the solution with self-controlled security and one-time key issue to avoid data leak. The one-time key issuance is a good solution for verification and detecting caller ID Spoofing attacker through this methodology since it does not rely on third-party CA and store certification anywhere. This solution provides the best of key management as the one-time secret key is used. Results from our test lab show effectively verification rates and good performance where resource and power consumption are not impacted.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"77 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81127723","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}
引用次数: 3
Front-rear crossover: A new crossover technique for solving a trap problem 前后交叉:解决陷阱问题的一种新的交叉技术
Dilok Pumsuwan, S. Rimcharoen, Nutthanon Leelathakul
Crossover methods are important keys to the success of genetic algorithms. However, traditional crossover methods fail to solve a trap problem, which is a difficult benchmark problem designed to deceive genetic algorithms to favor all-zero bits, while the actual solution is all-one bits. The Bayesian optimization algorithm (BOA) is the most famous algorithm that can solve the trap problem; however, it incurs a large computational cost. This paper, therefore, proposes a novel crossover technique, called a front-rear crossover (FRC), to enhance the simple genetic algorithm. We test the proposed technique with various benchmark problems and compare the results with four other crossover algorithms, including single point crossover (SPC), two point crossover (TPC), uniform crossover (UC) and ring crossover (RC). The FRC outperforms the four techniques in all test problems. It can also solve the trap problem by requiring the 40 times lesser number of fitness evaluations than BOA's.
交叉算法是遗传算法成功的关键。然而,传统的交叉方法无法解决陷阱问题,陷阱问题是一个困难的基准问题,旨在欺骗遗传算法,使其倾向于全零比特,而实际的解决方案是全一比特。贝叶斯优化算法(BOA)是解决陷阱问题最著名的算法;然而,它会产生很大的计算成本。因此,本文提出了一种新的交叉技术,称为前后交叉(FRC),以增强简单的遗传算法。我们用各种基准问题测试了所提出的技术,并将结果与其他四种交叉算法进行了比较,包括单点交叉(SPC)、两点交叉(TPC)、均匀交叉(UC)和环形交叉(RC)。FRC在所有测试问题中都优于这四种技术。它还可以解决陷阱问题,因为它需要的健身评估次数比BOA少40倍。
{"title":"Front-rear crossover: A new crossover technique for solving a trap problem","authors":"Dilok Pumsuwan, S. Rimcharoen, Nutthanon Leelathakul","doi":"10.1109/JCSSE.2017.8025922","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025922","url":null,"abstract":"Crossover methods are important keys to the success of genetic algorithms. However, traditional crossover methods fail to solve a trap problem, which is a difficult benchmark problem designed to deceive genetic algorithms to favor all-zero bits, while the actual solution is all-one bits. The Bayesian optimization algorithm (BOA) is the most famous algorithm that can solve the trap problem; however, it incurs a large computational cost. This paper, therefore, proposes a novel crossover technique, called a front-rear crossover (FRC), to enhance the simple genetic algorithm. We test the proposed technique with various benchmark problems and compare the results with four other crossover algorithms, including single point crossover (SPC), two point crossover (TPC), uniform crossover (UC) and ring crossover (RC). The FRC outperforms the four techniques in all test problems. It can also solve the trap problem by requiring the 40 times lesser number of fitness evaluations than BOA's.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"5 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79452045","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}
引用次数: 2
A rapid anomaly detection technique for big data curation 面向大数据管理的快速异常检测技术
Korn Poonsirivong, C. Jittawiriyanukoon
Anomaly detection (outlier) using simulation helps us analyze the anomaly instances from big data source. As the hasty explosion of today's data stream, outlier detection technique will be an analytical tool to be employed for evaluating massive unstructured datasets. In order to speed-up the processing time to handle enormous datasets, this research will conduct experiments of advanced distant-based outlier detection algorithms to investigate the most effective algorithms using MOA. The algorithms used in this study are Continuous Outlie Detection (COD), Micro-Cluster based COD or MCOD, and STream OutlierR Miner (STORM). The results demonstrate MCOD algorithm can outperform other two algorithms in terms of processing time and accurate anomalies.
利用仿真方法进行异常检测(outlier),有助于我们从大数据源中分析异常实例。随着当今数据流的快速爆炸,异常值检测技术将成为评估大量非结构化数据集的一种分析工具。为了加快处理庞大数据集的处理时间,本研究将对先进的基于距离的离群点检测算法进行实验,探索利用MOA最有效的算法。本研究中使用的算法是连续离群检测(COD)、基于微集群的COD或MCOD和STream OutlierR Miner (STORM)。结果表明,MCOD算法在处理时间和异常精度方面优于其他两种算法。
{"title":"A rapid anomaly detection technique for big data curation","authors":"Korn Poonsirivong, C. Jittawiriyanukoon","doi":"10.1109/JCSSE.2017.8025900","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025900","url":null,"abstract":"Anomaly detection (outlier) using simulation helps us analyze the anomaly instances from big data source. As the hasty explosion of today's data stream, outlier detection technique will be an analytical tool to be employed for evaluating massive unstructured datasets. In order to speed-up the processing time to handle enormous datasets, this research will conduct experiments of advanced distant-based outlier detection algorithms to investigate the most effective algorithms using MOA. The algorithms used in this study are Continuous Outlie Detection (COD), Micro-Cluster based COD or MCOD, and STream OutlierR Miner (STORM). The results demonstrate MCOD algorithm can outperform other two algorithms in terms of processing time and accurate anomalies.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"47 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76550378","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}
引用次数: 2
Robust video editing detection using Scalable Color and Color Layout Descriptors 鲁棒视频编辑检测使用可缩放的颜色和颜色布局描述符
Peerapon Chantharainthron, Sasipa Panthuwadeethorn, Suphakant Phimoltares
Nowadays, recorded videos from surveillance cameras are important evidence for legal investigation in the field of forensic science. Videos may be modified to deviate contents by a person involves in a crime. In this paper, a video editing detection based on Scalable Color Descriptor (SCD) and Color Layout Descriptor (CLD) is proposed. The detection method is composed of two components: (1) generating video identifier and signature and (2) video verification. The experimental results show that applying SCD and CLD to design the detection method outperforms the other descriptors in terms of false acceptance rate and false rejection rate. It is concluded that our method accurately classifies whether or not an incoming video is forged.
目前,监控录像是法医学领域法律调查的重要证据。参与犯罪的人可以修改视频,使其偏离内容。提出了一种基于可缩放颜色描述符(SCD)和颜色布局描述符(CLD)的视频编辑检测方法。该检测方法由两个部分组成:(1)生成视频标识和签名;(2)视频验证。实验结果表明,应用SCD和CLD描述符设计的检测方法在误接受率和误拒率方面优于其他描述符。实验结果表明,该方法能够准确地判别输入视频是否伪造。
{"title":"Robust video editing detection using Scalable Color and Color Layout Descriptors","authors":"Peerapon Chantharainthron, Sasipa Panthuwadeethorn, Suphakant Phimoltares","doi":"10.1109/JCSSE.2017.8025923","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025923","url":null,"abstract":"Nowadays, recorded videos from surveillance cameras are important evidence for legal investigation in the field of forensic science. Videos may be modified to deviate contents by a person involves in a crime. In this paper, a video editing detection based on Scalable Color Descriptor (SCD) and Color Layout Descriptor (CLD) is proposed. The detection method is composed of two components: (1) generating video identifier and signature and (2) video verification. The experimental results show that applying SCD and CLD to design the detection method outperforms the other descriptors in terms of false acceptance rate and false rejection rate. It is concluded that our method accurately classifies whether or not an incoming video is forged.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"32 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80067315","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}
引用次数: 3
Speech emotion recognition using derived features from speech segment and kernel principal component analysis 基于语音段衍生特征和核主成分分析的语音情感识别
Matee Charoendee, A. Suchato, P. Punyabukkana
Speech emotion recognition is a challenging problem, with identifying efficient features being of particular concern. This paper has two components. First, it presents an empirical study that evaluated four feature reduction methods, chi-square, gain ratio, RELIEF-F, and kernel principal component analysis (KPCA), on utterance level using a support vector machine (SVM) as a classifier. KPCA had the highest F-score when its F-score was compared with the average F-score of the other methods. Using KPCA is more effective than classifying without using feature reduction methods up to 5.73%. The paper also presents an application of statistical functions to raw features from the segment level to derive global features. The features were then reduced using KPCA and classified with SVM. Subsequently, we conducted a majority vote to determine the emotion for the entire utterance. The results demonstrate that this approach outperformed the baseline approaches, which used features from the utterance level, the utterance level with KPCA, the segment level, the segment level with KPCA, and the segment level with the application of statistical functions without KPCA. This yielded a higher F-score at 13.16%, 7.03%, 5.13%, 4.92% and 11.04%, respectively.
语音情感识别是一个具有挑战性的问题,识别有效的特征是一个特别重要的问题。本文由两部分组成。首先,本文利用支持向量机(SVM)作为分类器,对四种特征约简方法——卡方、增益比、RELIEF-F和核主成分分析(KPCA)在话语水平上进行了实证研究。与其他方法的平均f值相比,KPCA的f值最高。使用KPCA的分类效率比不使用特征约简方法的分类效率高5.73%。本文还提出了一种将统计函数应用于原始特征的方法,从段水平推导出全局特征。然后使用KPCA对特征进行约简,并用SVM对特征进行分类。随后,我们进行了多数投票,以确定整个话语的情绪。结果表明,该方法优于基线方法,即使用来自话语水平、带有KPCA的话语水平、片段水平、带有KPCA的片段水平和不使用KPCA的统计函数的片段水平的特征。f值分别为13.16%、7.03%、5.13%、4.92%和11.04%。
{"title":"Speech emotion recognition using derived features from speech segment and kernel principal component analysis","authors":"Matee Charoendee, A. Suchato, P. Punyabukkana","doi":"10.1109/JCSSE.2017.8025936","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025936","url":null,"abstract":"Speech emotion recognition is a challenging problem, with identifying efficient features being of particular concern. This paper has two components. First, it presents an empirical study that evaluated four feature reduction methods, chi-square, gain ratio, RELIEF-F, and kernel principal component analysis (KPCA), on utterance level using a support vector machine (SVM) as a classifier. KPCA had the highest F-score when its F-score was compared with the average F-score of the other methods. Using KPCA is more effective than classifying without using feature reduction methods up to 5.73%. The paper also presents an application of statistical functions to raw features from the segment level to derive global features. The features were then reduced using KPCA and classified with SVM. Subsequently, we conducted a majority vote to determine the emotion for the entire utterance. The results demonstrate that this approach outperformed the baseline approaches, which used features from the utterance level, the utterance level with KPCA, the segment level, the segment level with KPCA, and the segment level with the application of statistical functions without KPCA. This yielded a higher F-score at 13.16%, 7.03%, 5.13%, 4.92% and 11.04%, respectively.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"8 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78032322","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}
引用次数: 2
Building a brain atlas based on gabor texture features 基于gabor纹理特征的脑图谱构建
Arkane Khaminkure, Paramate Horkaew, J. Panyavaraporn
Brain atlas has become a primary means of computer aided neurological diagnosis. It relies on registering intra/inter-subject brain scans on a common frame of reference, on which statistical variability model is built. This diffeomorphic map of anatomically plausible correspondence could in turn be used for monitoring and identifying progress and manifestation of the disease, respectively. It is accepted that dense image registration is very accurate but computationally expensive. This paper thus presents a feature based image registration by using orientation invariant Gabor responses of texture. The reported results herein demonstrate that it is both anatomically accurate and robust.
脑图谱已成为计算机辅助神经学诊断的主要手段。它依赖于在一个共同的参考框架上记录主体内/主体间的大脑扫描,并在此基础上建立统计变异性模型。这种解剖上似是而非的对应的差胚图可以分别用于监测和识别疾病的进展和表现。人们普遍认为密集图像配准精度高,但计算量大。本文提出了一种基于纹理方向不变性Gabor响应的特征配准方法。本文报道的结果表明,它是解剖准确和稳健。
{"title":"Building a brain atlas based on gabor texture features","authors":"Arkane Khaminkure, Paramate Horkaew, J. Panyavaraporn","doi":"10.1109/JCSSE.2017.8025935","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025935","url":null,"abstract":"Brain atlas has become a primary means of computer aided neurological diagnosis. It relies on registering intra/inter-subject brain scans on a common frame of reference, on which statistical variability model is built. This diffeomorphic map of anatomically plausible correspondence could in turn be used for monitoring and identifying progress and manifestation of the disease, respectively. It is accepted that dense image registration is very accurate but computationally expensive. This paper thus presents a feature based image registration by using orientation invariant Gabor responses of texture. The reported results herein demonstrate that it is both anatomically accurate and robust.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"46 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73179708","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}
引用次数: 2
Design computer-assisted learning in an online Augmented Reality environment based on Shneiderman's eight Golden Rules 基于施耐德曼的八条黄金法则,设计在线增强现实环境中的计算机辅助学习
Naladtaporn Aottiwerch, Urachart KoKaew
Microbial science is inevitably involved in human daily life because these creatures live around us. They are both useful and punishable. If the people have knowledge about microorganisms, it can control the microbes that cause the wicked things, and it can also be useful to use microorganisms effectively. Currently, the study still use the microscope in the education. There are limitations when exploring various cycles, it will not be able to explore as the time required. As the cycles of nature, it must have time as a variable. Therefore, the microscope helps to see the structure clearer only, but it cannot see all the natural cycles covered by a single microscope. Therefore, this research uses the Augmented Reality technology to be developed as instructional media (A case study of Phylum Basidiomycota, the fungi, which is considered to be the most complex internal structure). This helps to visualize the three-dimensional structure and cycles of nature from electronic devices. But the problem of instructional media created with Augmented Reality technology is that it is inaccessible and difficult to use. The researcher has developed together with online instructional media for easy access, and designed instructional media with the theory of Shneiderman's 8 Golden Rules for ease of use, and measured the performance with real applications by the third-year students of the Faculty of Science, Khon kaen University. It was found that Augmented Reality instructional media in online system was accessible and easy to use. It is also very satisfying for users, with an average score of 4.5 out of 1–5, this means that the criteria is very good.
微生物科学不可避免地与人类的日常生活有关,因为这些生物生活在我们周围。它们既有用又要受到惩罚。如果人们对微生物有所了解,就可以控制导致邪恶事物的微生物,也可以有效地利用微生物。目前,在教育研究中仍使用显微镜。在探索各种循环时存在局限性,它将无法按照所需的时间进行探索。正如自然界的周期一样,它必须有时间作为变量。因此,显微镜只能帮助更清楚地看到结构,而不能看到单个显微镜覆盖的所有自然循环。因此,本研究采用增强现实技术作为教学媒介(以担子菌门为例,担子菌门被认为是内部结构最复杂的真菌)。这有助于从电子设备中可视化三维结构和自然界的循环。但利用增强现实技术创建的教学媒体存在着难以接近和难以使用的问题。研究者与在线教学媒体共同开发了易于访问的教学媒体,并以Shneiderman’s 8 Golden Rules理论设计了易于使用的教学媒体,并通过实际应用对孔原大学理学院三年级学生的表现进行了测量。发现在线系统中的增强现实教学媒体具有可访问性和易用性。对于用户来说,它也非常满意,在1-5分中平均得分为4.5分,这意味着这个标准非常好。
{"title":"Design computer-assisted learning in an online Augmented Reality environment based on Shneiderman's eight Golden Rules","authors":"Naladtaporn Aottiwerch, Urachart KoKaew","doi":"10.1109/JCSSE.2017.8025926","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025926","url":null,"abstract":"Microbial science is inevitably involved in human daily life because these creatures live around us. They are both useful and punishable. If the people have knowledge about microorganisms, it can control the microbes that cause the wicked things, and it can also be useful to use microorganisms effectively. Currently, the study still use the microscope in the education. There are limitations when exploring various cycles, it will not be able to explore as the time required. As the cycles of nature, it must have time as a variable. Therefore, the microscope helps to see the structure clearer only, but it cannot see all the natural cycles covered by a single microscope. Therefore, this research uses the Augmented Reality technology to be developed as instructional media (A case study of Phylum Basidiomycota, the fungi, which is considered to be the most complex internal structure). This helps to visualize the three-dimensional structure and cycles of nature from electronic devices. But the problem of instructional media created with Augmented Reality technology is that it is inaccessible and difficult to use. The researcher has developed together with online instructional media for easy access, and designed instructional media with the theory of Shneiderman's 8 Golden Rules for ease of use, and measured the performance with real applications by the third-year students of the Faculty of Science, Khon kaen University. It was found that Augmented Reality instructional media in online system was accessible and easy to use. It is also very satisfying for users, with an average score of 4.5 out of 1–5, this means that the criteria is very good.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"45 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82625625","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}
引用次数: 6
Burmese word segmentation with Character Clustering and CRFs 基于字符聚类和CRFs的缅甸语分词
M. Phyu, Kiyota Hashimoto
Word segmentation is one of the most fundamental processes for most natural language processing tasks. In particular, languages with no word boundary in writing such as Chinese, Japanese, Korean, Thai, and Burmese need it. However, the Burmese language still waits for a technique with good performance. In this paper, we propose a new technique for Burmese word segmentation employing the idea of Character Clustering for Conditional Random Fields. Character clusters are groups of some inseparable characters due to language characteristics. We proposed a set of 29 types of Burmese Character Clusters (BCCs) as rules, and Conditional Random Fields is applied as a sequential labelling machine learning method. We compared our proposed method with CRF without BCC and Syllable-based CRFs. The result shows that our proposed method achieved the highest performance.
分词是大多数自然语言处理任务中最基本的过程之一。特别是,汉语、日语、韩语、泰语、缅甸语等没有文字边界的语言需要它。然而,缅甸语仍在等待一种表现良好的技术。本文提出了一种基于条件随机场的字符聚类思想的缅甸语分词新技术。字簇是由于语言的特点而形成的一组不可分割的字。我们提出了一组29种缅甸语字符簇(bcc)作为规则,并将条件随机场(Conditional Random Fields)作为顺序标记机器学习方法。我们将该方法与不含BCC的CRF和基于音节的CRF进行了比较。结果表明,本文提出的方法达到了最高的性能。
{"title":"Burmese word segmentation with Character Clustering and CRFs","authors":"M. Phyu, Kiyota Hashimoto","doi":"10.1109/JCSSE.2017.8025934","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025934","url":null,"abstract":"Word segmentation is one of the most fundamental processes for most natural language processing tasks. In particular, languages with no word boundary in writing such as Chinese, Japanese, Korean, Thai, and Burmese need it. However, the Burmese language still waits for a technique with good performance. In this paper, we propose a new technique for Burmese word segmentation employing the idea of Character Clustering for Conditional Random Fields. Character clusters are groups of some inseparable characters due to language characteristics. We proposed a set of 29 types of Burmese Character Clusters (BCCs) as rules, and Conditional Random Fields is applied as a sequential labelling machine learning method. We compared our proposed method with CRF without BCC and Syllable-based CRFs. The result shows that our proposed method achieved the highest performance.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"23 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87374280","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}
引用次数: 5
期刊
2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1