发布求助
文献互助 智能选刊 最新文献

Proceedings of the 2018 10th International Conference on Computer and Automation Engineering最新文献

筛选
英文 中文
Improving Accuracy in Thai Sign and Symptom Classification using Context-Free Grammar Approach 使用上下文无关语法方法提高泰语符号和症状分类的准确性
Proceedings of the 2018 10th International Conference on Computer and Automation Engineering Pub Date : 2018-02-24 DOI: 10.1145/3192975.3193011
Jarunee Duangsuwan, Pawin Saeku
{"title":"Improving Accuracy in Thai Sign and Symptom Classification using Context-Free Grammar Approach","authors":"Jarunee Duangsuwan, Pawin Saeku","doi":"10.1145/3192975.3193011","DOIUrl":"https://doi.org/10.1145/3192975.3193011","url":null,"abstract":"We examine our proposed word separator for Thai script called two-level tokenization (2LT) by applying this tokenizer to medical Thai script including chief complaints, ICD-10 descriptions. We verify the results of tokenization through the machine learning-based classification. The experimental result shows that the proposed tokenizer works well for Classification and Regression Trees (CART) method with an 85% of precision and 71% of recall. While the F1 score is also 76%. However these values are not high enough to make the proposed tokenizer worthwhile. This paper presents how to improve the results of Thai sign and symptom classification. To increase the precision, recall, and F1 score we adapt context-free grammar (CFG) concept to eliminate the unnecessary some conjunction words which are a common word from the consideration of experimental results. Consequently the precision, recall, and F1 score change from 85%, 71%, and 76% to 93%, 86%, and 89% respectively, this shows that applying CFG can be exploited to yield a higher accuracy than the previous experimental results without applying the CFG concept.","PeriodicalId":128533,"journal":{"name":"Proceedings of the 2018 10th International Conference on Computer and Automation Engineering","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131887551","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}
引用次数: 0
Analysis on the Successional Trend of China's New Energy Buses Promotion Policies 中国新能源客车推广政策的沿革趋势分析
Proceedings of the 2018 10th International Conference on Computer and Automation Engineering Pub Date : 2018-02-24 DOI: 10.1145/3192975.3193000
Cheng Li, Xiaofei Li, Xinzheng Yang, Liang Wang, Jun Wu, Maomao Yi
{"title":"Analysis on the Successional Trend of China's New Energy Buses Promotion Policies","authors":"Cheng Li, Xiaofei Li, Xinzheng Yang, Liang Wang, Jun Wu, Maomao Yi","doi":"10.1145/3192975.3193000","DOIUrl":"https://doi.org/10.1145/3192975.3193000","url":null,"abstract":"In popularization and application of new energy buses has become the pioneer for popularization and application of new energy vehicles in China. This article attempts to analyze the successional trend of new energy bus from the published promotion policies aspect. Firstly, this paper summarized the new energy bus promotion policies in China since 2009 and organized them into five parts, including popularizing demonstration plan, policy on financial subsidy, industry management policies, S&T innovation policy and infrastructure policies. Then policy changing trends are analyzed, such as the fall-off speed of purchase subsidy is being accelerated; the purchase subsidy is more specialized and requires higher technical performance of vehicles; construction scale of charging infrastructure has been enlarged continuously and quality assurance standards are more pragmatic. Finally, policy suggestions for subsidy are presented.","PeriodicalId":128533,"journal":{"name":"Proceedings of the 2018 10th International Conference on Computer and Automation Engineering","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116080562","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}
引用次数: 0
Immersive Signage Transmission with Low-Complexity Detection Scheme 低复杂度检测方案的沉浸式标牌传输
Proceedings of the 2018 10th International Conference on Computer and Automation Engineering Pub Date : 2018-02-24 DOI: 10.1145/3192975.3193007
Jae-Hyun Ro, Won-Seok Lee, Hyoung-Kyu Song
{"title":"Immersive Signage Transmission with Low-Complexity Detection Scheme","authors":"Jae-Hyun Ro, Won-Seok Lee, Hyoung-Kyu Song","doi":"10.1145/3192975.3193007","DOIUrl":"https://doi.org/10.1145/3192975.3193007","url":null,"abstract":"This paper proposes low-complexity detection scheme for immersive transmission in digital signage system based on multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM). For immersive signage transmission, a receiver of digital signage requires signal detection scheme with high reliability and low complexity. In this paper, low-complexity QR decomposition-M algorithm (QRD-M) is proposed. The proposed QRD-M calculates a threshold and eliminates unnecessary survival paths which have larger accumulated squared Euclidean distance (ASED) than a threshold. The simulation results show that the proposed QRD-M has the same error performance as conventional QRD-M. Also, the complexity of the QRD-M is very lower than the conventional QRD-M and it is decreased according to increased signal-to-noise ratio (SNR). An algorithm of the proposed QRD-M is used well in a receiver of small digital signage which requires high reliability and low complexity.","PeriodicalId":128533,"journal":{"name":"Proceedings of the 2018 10th International Conference on Computer and Automation Engineering","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127704254","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}
引用次数: 0
Music Playlist Recommender System AFT-IS 音乐播放列表推荐系统AFT-IS
Proceedings of the 2018 10th International Conference on Computer and Automation Engineering Pub Date : 2018-02-24 DOI: 10.1145/3192975.3193019
S. Ikeda, Kenta Oku, K. Kawagoe
{"title":"Music Playlist Recommender System AFT-IS","authors":"S. Ikeda, Kenta Oku, K. Kawagoe","doi":"10.1145/3192975.3193019","DOIUrl":"https://doi.org/10.1145/3192975.3193019","url":null,"abstract":"Previously, we had proposed a playlist recommendation method to suggest music by considering the change in acoustic features in the song so that the transition between songs becomes smooth. Our previous method uses the last two songs in a playlist to make recommendations for following songs that have a smooth transition of acoustic features from the current songs. However, in this previous method, if two or more songs are not given, it is not possible to recommend a suitable next song. Our method proposed in this paper considers the transition of the music that was last played and recommends the next song. Moreover, we have developed a playlist recommender system using our proposed method. As the user inputs information necessary for creating a playlist, the system outputs a playlist with a smooth transition of acoustic features.","PeriodicalId":128533,"journal":{"name":"Proceedings of the 2018 10th International Conference on Computer and Automation Engineering","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124391942","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}
引用次数: 0
Performance Analysis of Reference Channel Equalization Using the Constant Modulus Algorithm in an FM-based PCL system 在基于fm的PCL系统中使用恒模算法实现参考信道均衡的性能分析
Proceedings of the 2018 10th International Conference on Computer and Automation Engineering Pub Date : 2018-02-24 DOI: 10.1145/3192975.3193017
S. Son, Geun-Ho Park, Hyoung-Nam Kim
{"title":"Performance Analysis of Reference Channel Equalization Using the Constant Modulus Algorithm in an FM-based PCL system","authors":"S. Son, Geun-Ho Park, Hyoung-Nam Kim","doi":"10.1145/3192975.3193017","DOIUrl":"https://doi.org/10.1145/3192975.3193017","url":null,"abstract":"A frequency-modulation (FM)-based passive coherent location (PCL) system is a passive radar system for detecting a target using commercial FM broadcasting signals. A cross-correlation function between the direct-path signal propagating line-of-sight of the FM transmitter and the receiver, and the target echo signal, can be derived to detect the target. When clutter is received on the reference channel, the target detection probability can be reduced. In order to improve the detection performance, the direct-path signal on the reference channel should be essentially recovered. In this paper, we apply the constant modulus algorithm (CMA) to remove the clutter received on the reference channel and analyze the amount of removed clutter by simulation. Furthermore, we show that the reference channel equalization plays a very important role in removing ghost targets in the cross-correlation function.","PeriodicalId":128533,"journal":{"name":"Proceedings of the 2018 10th International Conference on Computer and Automation Engineering","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125509455","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}
引用次数: 0
A Recommender System for Ancient Books, Pamphlets and Paintings in Ritsumeikan Art Research Center Database 立命馆艺术研究中心数据库中古籍、小册子和绘画的推荐系统
Proceedings of the 2018 10th International Conference on Computer and Automation Engineering Pub Date : 2018-02-24 DOI: 10.1145/3192975.3193018
Jiayun Wang, K. Kawagoe
{"title":"A Recommender System for Ancient Books, Pamphlets and Paintings in Ritsumeikan Art Research Center Database","authors":"Jiayun Wang, K. Kawagoe","doi":"10.1145/3192975.3193018","DOIUrl":"https://doi.org/10.1145/3192975.3193018","url":null,"abstract":"In this paper, we develop a recommender system based on the Ritsumeikan Art Research Center (ARC) database, that stores a large number of the digital versions of ancient Japanese books, pamphlets, and paintings. We provide an easier way for novices to get access to this digital archive that was mostly used by experts before and for foreigners to know about Japanese arts and cultures. This recommender system is built as a web page. Users can select items of interest and then be provided with the most interesting items predicted by the recommender system. This system uses the restricted Boltzmann machine (RBM) for collaborative filtering to predict the most interesting items.","PeriodicalId":128533,"journal":{"name":"Proceedings of the 2018 10th International Conference on Computer and Automation Engineering","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126149972","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}
引用次数: 4
Similarity Retrieval of Trademark Images by Vector Graphics Based on Shape Characteristics of Components 基于组件形状特征的矢量图形商标图像相似度检索
Proceedings of the 2018 10th International Conference on Computer and Automation Engineering Pub Date : 2018-02-24 DOI: 10.1145/3192975.3192988
K. Abe, Hiroyuki Morita, Takahiro Hayashi
{"title":"Similarity Retrieval of Trademark Images by Vector Graphics Based on Shape Characteristics of Components","authors":"K. Abe, Hiroyuki Morita, Takahiro Hayashi","doi":"10.1145/3192975.3192988","DOIUrl":"https://doi.org/10.1145/3192975.3192988","url":null,"abstract":"This paper presents a similarity retrieval of trademark images represented by vector graphics. In the real inspection for new trademark images, similarity for essential objects which show products or services is evaluated to the registry. Although a similarity retrieval system which evaluates similarity between the essential objects has been already reported with trademark images represented by vector graphics, the existing system does not work well in some cases. The proposed method is an improvement version of the existing system. To enhance performance of the system, in the proposed method, the extraction of feature vectors for an object's contour shape is improved and the method of centroid distance is introduced into the feature extraction besides. Experimental results have shown that the proposed method could evaluate similarity of each essential object in trademarks better than the existing system.","PeriodicalId":128533,"journal":{"name":"Proceedings of the 2018 10th International Conference on Computer and Automation Engineering","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115319503","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
Proceedings of the 2018 10th International Conference on Computer and Automation Engineering 2018第十届计算机与自动化工程国际会议论文集
Proceedings of the 2018 10th International Conference on Computer and Automation Engineering Pub Date : 1900-01-01 DOI: 10.1145/3192975
{"title":"Proceedings of the 2018 10th International Conference on Computer and Automation Engineering","authors":"","doi":"10.1145/3192975","DOIUrl":"https://doi.org/10.1145/3192975","url":null,"abstract":"","PeriodicalId":128533,"journal":{"name":"Proceedings of the 2018 10th International Conference on Computer and Automation Engineering","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121393021","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}
引用次数: 1
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信