Pub Date : 2018-09-01DOI: 10.1109/ICAWST.2018.8517221
Xue Zhou, Xin Zhu, Keijiro Nakamura, Noro Mahito
-Atrial fibrillation (AF) is the most common cardiac arrhythmia. AF may lead to stroke, heart failure, sudden death and increase the risk of cardiovascuar morbidity. Furthermore, AF draws great attention in clinical practice because of its continuously growing prevalence in aging society. The features for AF diagnosis include absolutely irregular RR intervals, and no discernible and distinct P waves. Paroxysmal AF is usually transient and hard to be found in routine health check. Longterm ECG monitoring may raise the sensitivity of AF’s detection. However, the analysis of huge amount of ECG is time and cost consuming. In this study, we propose a method based on convolutional neural networks for the detection of AF. Through validating with MIT-BIH atrial fibrillation database, we get a sensitivity of 98.9%, a specificity of 99.0%, and an accuracy of 99.0%.
{"title":"Atrial Fibrillation Detection Using Convolutional Neural Networks","authors":"Xue Zhou, Xin Zhu, Keijiro Nakamura, Noro Mahito","doi":"10.1109/ICAWST.2018.8517221","DOIUrl":"https://doi.org/10.1109/ICAWST.2018.8517221","url":null,"abstract":"-Atrial fibrillation (AF) is the most common cardiac arrhythmia. AF may lead to stroke, heart failure, sudden death and increase the risk of cardiovascuar morbidity. Furthermore, AF draws great attention in clinical practice because of its continuously growing prevalence in aging society. The features for AF diagnosis include absolutely irregular RR intervals, and no discernible and distinct P waves. Paroxysmal AF is usually transient and hard to be found in routine health check. Longterm ECG monitoring may raise the sensitivity of AF’s detection. However, the analysis of huge amount of ECG is time and cost consuming. In this study, we propose a method based on convolutional neural networks for the detection of AF. Through validating with MIT-BIH atrial fibrillation database, we get a sensitivity of 98.9%, a specificity of 99.0%, and an accuracy of 99.0%.","PeriodicalId":277939,"journal":{"name":"2018 9th International Conference on Awareness Science and Technology (iCAST)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131656973","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 : 2018-09-01DOI: 10.1109/ICAWST.2018.8517233
M. A. Yi-Hsiang, Yean Han, Jia-Yeu Lin, S. Cosentino, Yuya Nishio, C. Oshiyama, A. Takanishi
This research is part of a WAS-5 robot project to make it possible to assist music therapist in treating Autism Spectrum Disorder (ASD) subjects. One of the challenges faced by ASD subjects is social skills where tempo matching is an important factor when interacting with other people such as conversations and physical activities. This research aims to develop a system that trains the subject to match the music tempo played by WAS-5 with a feedback system. The system evaluates the tempo of the subject’s movement and varies the tempo of the music in real-time to guide the subject in order to achieve tempo synchronization. Tempo has been successfully captured in this research through the use of Optical Flow with USB camera and achieved better accuracy using PID control. However, error is still present due to hardware limitations and human factors. Future works includes the fine tuning of the PID to lower error rate, hardware upgrade for better image acquisition, and preliminary experiments with a group of ASD subjects before implementation into actual therapy.
{"title":"A Synchronization Feedback System to Improve Interaction Correlation in Subjects With Autism Spectrum Disorder","authors":"M. A. Yi-Hsiang, Yean Han, Jia-Yeu Lin, S. Cosentino, Yuya Nishio, C. Oshiyama, A. Takanishi","doi":"10.1109/ICAWST.2018.8517233","DOIUrl":"https://doi.org/10.1109/ICAWST.2018.8517233","url":null,"abstract":"This research is part of a WAS-5 robot project to make it possible to assist music therapist in treating Autism Spectrum Disorder (ASD) subjects. One of the challenges faced by ASD subjects is social skills where tempo matching is an important factor when interacting with other people such as conversations and physical activities. This research aims to develop a system that trains the subject to match the music tempo played by WAS-5 with a feedback system. The system evaluates the tempo of the subject’s movement and varies the tempo of the music in real-time to guide the subject in order to achieve tempo synchronization. Tempo has been successfully captured in this research through the use of Optical Flow with USB camera and achieved better accuracy using PID control. However, error is still present due to hardware limitations and human factors. Future works includes the fine tuning of the PID to lower error rate, hardware upgrade for better image acquisition, and preliminary experiments with a group of ASD subjects before implementation into actual therapy.","PeriodicalId":277939,"journal":{"name":"2018 9th International Conference on Awareness Science and Technology (iCAST)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133045364","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 : 2018-09-01DOI: 10.1109/ICAWST.2018.8517235
D. Mai, A. Pham
This paper presents an experimental implementation and performance evaluation of an indoor positioning system based on visible light communications (VLC). The system hardware, including a VLC transmitter and a receiver, is designed taking into account the illumination flicker, brightness, signal synchronization, noise and path loss issues. In addition, we propose a simple protocol design for location identification (ID), including the location ID format, the ID frame structure and its error control. The experiments are performed to optimize the design of the receiver so that the pulse-error rate (PER) is minimized. Furthermore, we also confirm the location ID detectability in case of with and without Golay error correction code. Experimental results confirm that it is possible to achieve the PER bellow 10-3 at 9 m or shorter distance. In addition, the location ID detectability is higher than 95% when the receiving time of 0.7 seconds, which is equivalent to the walking speed of 1.4 m/sec, under the LED coverage cell of 2 m.
{"title":"Implementation and Evaluation of VLC-Based Indoor Positioning Systems for Smart Supermarkets","authors":"D. Mai, A. Pham","doi":"10.1109/ICAWST.2018.8517235","DOIUrl":"https://doi.org/10.1109/ICAWST.2018.8517235","url":null,"abstract":"This paper presents an experimental implementation and performance evaluation of an indoor positioning system based on visible light communications (VLC). The system hardware, including a VLC transmitter and a receiver, is designed taking into account the illumination flicker, brightness, signal synchronization, noise and path loss issues. In addition, we propose a simple protocol design for location identification (ID), including the location ID format, the ID frame structure and its error control. The experiments are performed to optimize the design of the receiver so that the pulse-error rate (PER) is minimized. Furthermore, we also confirm the location ID detectability in case of with and without Golay error correction code. Experimental results confirm that it is possible to achieve the PER bellow 10-3 at 9 m or shorter distance. In addition, the location ID detectability is higher than 95% when the receiving time of 0.7 seconds, which is equivalent to the walking speed of 1.4 m/sec, under the LED coverage cell of 2 m.","PeriodicalId":277939,"journal":{"name":"2018 9th International Conference on Awareness Science and Technology (iCAST)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133856090","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 : 2018-09-01DOI: 10.1109/ICAWST.2018.8517243
Yong Liu
For an ensemble learning system by a set of individual learning models, not only should each individual model be able to learn well the data, but also be aware of what other individuals have learned. With such awareness, each individual would be able to adjust its own learning so that all the individuals could cooperatively and efficiently solve the whole data better. In this paper, all the individual learners are trained simultaneously by a modified negative correlation learning with opposition learning. The idea is that some individuals might choose to learn to be more different to other individuals on some data points once the whole ensemble have well learned these data points. Experimental results have been presented to show how such opposition learning could build awareness among individual learners so that they could be helpful in designing a robust ensemble learning system.
{"title":"Learning Targets for Building Cooperation Awareness in Ensemble Learning","authors":"Yong Liu","doi":"10.1109/ICAWST.2018.8517243","DOIUrl":"https://doi.org/10.1109/ICAWST.2018.8517243","url":null,"abstract":"For an ensemble learning system by a set of individual learning models, not only should each individual model be able to learn well the data, but also be aware of what other individuals have learned. With such awareness, each individual would be able to adjust its own learning so that all the individuals could cooperatively and efficiently solve the whole data better. In this paper, all the individual learners are trained simultaneously by a modified negative correlation learning with opposition learning. The idea is that some individuals might choose to learn to be more different to other individuals on some data points once the whole ensemble have well learned these data points. Experimental results have been presented to show how such opposition learning could build awareness among individual learners so that they could be helpful in designing a robust ensemble learning system.","PeriodicalId":277939,"journal":{"name":"2018 9th International Conference on Awareness Science and Technology (iCAST)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116778133","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 : 2018-09-01DOI: 10.1109/ICAWST.2018.8517167
Takeyuki Miyagi, R. Rupasingha, Incheon Paik
Service discovery is important issue when providing value-added services by composition. Existing approaches such as keyword or ontology matching have limitations within current Web services because these approaches are working based on isolated services. To solve this problem, calculating service relationship is needed. When we calculate it, 4 properties are usually considered, functional similarity, quality of service (QoS), association of invocation, and sociability. In our previous research, we could calculate functional similarity and QoS by ontology or global social service network [2]. But association of invocation and sociability has not been calculated from real world. In this research, we calculate them by using word embedding. Word embedding can find the relationship between services. In this research, we experiment to calculate similarity of Web API methods as services. By regarding the method call sequence as the input of word embedding, we observe how the method is related to other method. Finally, experimental results show that which method is related to other methods.
{"title":"Analysis of Web Service Using Word Embedding by Deep Learning","authors":"Takeyuki Miyagi, R. Rupasingha, Incheon Paik","doi":"10.1109/ICAWST.2018.8517167","DOIUrl":"https://doi.org/10.1109/ICAWST.2018.8517167","url":null,"abstract":"Service discovery is important issue when providing value-added services by composition. Existing approaches such as keyword or ontology matching have limitations within current Web services because these approaches are working based on isolated services. To solve this problem, calculating service relationship is needed. When we calculate it, 4 properties are usually considered, functional similarity, quality of service (QoS), association of invocation, and sociability. In our previous research, we could calculate functional similarity and QoS by ontology or global social service network [2]. But association of invocation and sociability has not been calculated from real world. In this research, we calculate them by using word embedding. Word embedding can find the relationship between services. In this research, we experiment to calculate similarity of Web API methods as services. By regarding the method call sequence as the input of word embedding, we observe how the method is related to other method. Finally, experimental results show that which method is related to other methods.","PeriodicalId":277939,"journal":{"name":"2018 9th International Conference on Awareness Science and Technology (iCAST)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117261469","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 : 2018-09-01DOI: 10.1109/ICAWST.2018.8517199
Vimal Kumar, K. Lai, Yu-Hsin Chang, Chien-Yu Lin
Technological innovation is a well-known opportunity and it has given the new concept to the competitive era and makes the world easy. It is applied to technological evolution and scientific principles consideration. The innovations in any field occurred where the innovative paths provided by technological trajectories. Further, these technological trajectories are analyzed by the descriptive analysis whereas, the knowledge flow of a technology from one country, institution or corporation to another has been used as a method of identifying by analyzing the patent citation network. It is argued that the quantitative method is used for mapping the technological trajectories and patent citation network. This paper addresses the patent citation network and its bibliometric analysis that are used to monitor the technological trajectories for energy storage device (ESD). The current research focuses on the enhancement and growth in the innovation of energy storage device. The scope of study focuses on the list of patent classification according to the International Patent Classification (IPC) has been used to identify the ESD patents by searching in the United States Patent and Trademark Office (USPTO) database. Further, the scope of this study focuses on key innovation for the energy storage device and its technological trajectories can be considered as patent citation network. Further, it provides the way to develop the main path technology for the industry.
{"title":"Mapping Technological Trajectories for Energy Storage Device through Patent Citation Network","authors":"Vimal Kumar, K. Lai, Yu-Hsin Chang, Chien-Yu Lin","doi":"10.1109/ICAWST.2018.8517199","DOIUrl":"https://doi.org/10.1109/ICAWST.2018.8517199","url":null,"abstract":"Technological innovation is a well-known opportunity and it has given the new concept to the competitive era and makes the world easy. It is applied to technological evolution and scientific principles consideration. The innovations in any field occurred where the innovative paths provided by technological trajectories. Further, these technological trajectories are analyzed by the descriptive analysis whereas, the knowledge flow of a technology from one country, institution or corporation to another has been used as a method of identifying by analyzing the patent citation network. It is argued that the quantitative method is used for mapping the technological trajectories and patent citation network. This paper addresses the patent citation network and its bibliometric analysis that are used to monitor the technological trajectories for energy storage device (ESD). The current research focuses on the enhancement and growth in the innovation of energy storage device. The scope of study focuses on the list of patent classification according to the International Patent Classification (IPC) has been used to identify the ESD patents by searching in the United States Patent and Trademark Office (USPTO) database. Further, the scope of this study focuses on key innovation for the energy storage device and its technological trajectories can be considered as patent citation network. Further, it provides the way to develop the main path technology for the industry.","PeriodicalId":277939,"journal":{"name":"2018 9th International Conference on Awareness Science and Technology (iCAST)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124304333","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 : 2018-09-01DOI: 10.1109/ICAWST.2018.8517176
Hidetoshi Ito, B. Chakraborty
Dynamic Time Warping (DTW) is a well known algorithm for measuring similarity of two time series and widely used in classification, clustering or regression problems related to time series data. Unlike simple Euclid distance measure, DTW can handle time series of unequal lengths and is able to find an optimal alignment between two time sequences. Though very efficient, the computational cost of DTW is very high. There are several suboptimal variants of DTW for lowering computation, none of them is perfect. In this work, an approach to reduce computational burden of DTW has been proposed from the perspective of removing unimportant portion of the time series from computing, selected by a mask generated by edge detection algorithm commonly used in image processing or computer vision. The proposed Edge-Detectional Dynamic Time Warping (EDDTW) has been compared with original DTW by simulation experiments with 43 publicly available benchmark data sets. The simulation results show that EDDTW outperforms DTW regarding classification accuracy in more than half of the data sets, while reducing on the average 60% of the original time series leading to reduction in computational time.
动态时间翘曲(Dynamic Time Warping, DTW)是一种众所周知的度量两个时间序列相似性的算法，广泛用于与时间序列数据相关的分类、聚类或回归问题。与简单的欧几里得距离测量不同，DTW可以处理不等长度的时间序列，并能够找到两个时间序列之间的最佳对齐。DTW虽然效率很高，但计算成本很高。为了降低计算量，DTW有几个次优变体，没有一个是完美的。在这项工作中，提出了一种减少DTW计算负担的方法，从计算中去除时间序列中不重要的部分，由图像处理或计算机视觉中常用的边缘检测算法生成的掩模选择。通过43个公开的基准数据集的仿真实验，将提出的边缘检测动态时间翘曲(EDDTW)与原始的DTW进行了比较。仿真结果表明，EDDTW在超过一半的数据集上的分类精度优于DTW，同时平均减少了原始时间序列的60%，从而减少了计算时间。
{"title":"A Proposal for Cost Aware Edge-Detectional Dynamic Time Warping for Time Series Classification","authors":"Hidetoshi Ito, B. Chakraborty","doi":"10.1109/ICAWST.2018.8517176","DOIUrl":"https://doi.org/10.1109/ICAWST.2018.8517176","url":null,"abstract":"Dynamic Time Warping (DTW) is a well known algorithm for measuring similarity of two time series and widely used in classification, clustering or regression problems related to time series data. Unlike simple Euclid distance measure, DTW can handle time series of unequal lengths and is able to find an optimal alignment between two time sequences. Though very efficient, the computational cost of DTW is very high. There are several suboptimal variants of DTW for lowering computation, none of them is perfect. In this work, an approach to reduce computational burden of DTW has been proposed from the perspective of removing unimportant portion of the time series from computing, selected by a mask generated by edge detection algorithm commonly used in image processing or computer vision. The proposed Edge-Detectional Dynamic Time Warping (EDDTW) has been compared with original DTW by simulation experiments with 43 publicly available benchmark data sets. The simulation results show that EDDTW outperforms DTW regarding classification accuracy in more than half of the data sets, while reducing on the average 60% of the original time series leading to reduction in computational time.","PeriodicalId":277939,"journal":{"name":"2018 9th International Conference on Awareness Science and Technology (iCAST)","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122581177","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 : 2018-09-01DOI: 10.1109/ICAWST.2018.8517228
Yean Han, Yuya Nishio, Yi-Hsiang Ma, C. Oshiyama, Jia-Yeu Lin, A. Takanishi, S. Cosentino
Waseda Anthropomorphic Saxophonist No.5 (WAS-5) will be used in the music therapy of subjects with Spectrum Disorder (ASD). The impairment to recognize facial expression by ASD in other people causes problems when interacting with other people. WAS-5 will have a protocol to train the subjects to react with specific action to specific music then transfer that correlation to the expressions made by WAS5 through classical conditioning to differentiate expressions. This research has done a preliminary experiment with a mock program of the training program on normal people with positive effects. To effectively ensure subject fully perceive the facial expression of WAS-5, a gaze detection is also being developed using OpenCV and a USB camera. This research aims to improve the social skills of ASD subjects to better interact with other people. Further experiments with ASD subjects will be done with hardware upgrade.
{"title":"A human-robot interface to improve facial expression recognition in subjects with Autism Spectrum Disorder","authors":"Yean Han, Yuya Nishio, Yi-Hsiang Ma, C. Oshiyama, Jia-Yeu Lin, A. Takanishi, S. Cosentino","doi":"10.1109/ICAWST.2018.8517228","DOIUrl":"https://doi.org/10.1109/ICAWST.2018.8517228","url":null,"abstract":"Waseda Anthropomorphic Saxophonist No.5 (WAS-5) will be used in the music therapy of subjects with Spectrum Disorder (ASD). The impairment to recognize facial expression by ASD in other people causes problems when interacting with other people. WAS-5 will have a protocol to train the subjects to react with specific action to specific music then transfer that correlation to the expressions made by WAS5 through classical conditioning to differentiate expressions. This research has done a preliminary experiment with a mock program of the training program on normal people with positive effects. To effectively ensure subject fully perceive the facial expression of WAS-5, a gaze detection is also being developed using OpenCV and a USB camera. This research aims to improve the social skills of ASD subjects to better interact with other people. Further experiments with ASD subjects will be done with hardware upgrade.","PeriodicalId":277939,"journal":{"name":"2018 9th International Conference on Awareness Science and Technology (iCAST)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131583698","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 : 2018-09-01DOI: 10.1109/ICAWST.2018.8517190
Hiroyuki Abe, Masafumi Matsuhara, G. Chakraborty, H. Mabuchi
In recent years, the amount of information on the Web is growing exponentially with the spread of the Internet. We generally use search engines to search for the intended information. However, the search engine displays the Web pages including the entered search query in list format. It is difficult for the user to find out the intended information if the entered search query is a word whose meaning depends on the situation and location of the user. It needs the intended information to the multiple hidden topics. In this research, we classify Web search results based on each topic. The topic is defined as the latent meaning, and the contents included in the word. Moreover, our method displays automatically generated snippets for each topic with the Web search results to the user. It is easy to find required information from snippets, even though the intended information is ambiguous. It first classifies the Web search results by Latent Dirichlet Allocation (LDA) which is a major topic model method. It then generates the snippets using Conditional Variational AutoEncoder (Conditional VAE) based on the clustering of We search results. It is expected that using LDA for the clustering will group the Web search result according to the latent meanings of the search query. Also, we expect that proper snippets will be generated for each topic by Conditional VAE. In this paper, we show that LDA is effective for the clustering of Web search results. Moreover, the snippets generated by Conditional VAE is able to generate sentences considered each topic.
{"title":"Topic-Aware Automatic Snippet Generation for Resolving Multiple Meaning on Web Search Result","authors":"Hiroyuki Abe, Masafumi Matsuhara, G. Chakraborty, H. Mabuchi","doi":"10.1109/ICAWST.2018.8517190","DOIUrl":"https://doi.org/10.1109/ICAWST.2018.8517190","url":null,"abstract":"In recent years, the amount of information on the Web is growing exponentially with the spread of the Internet. We generally use search engines to search for the intended information. However, the search engine displays the Web pages including the entered search query in list format. It is difficult for the user to find out the intended information if the entered search query is a word whose meaning depends on the situation and location of the user. It needs the intended information to the multiple hidden topics. In this research, we classify Web search results based on each topic. The topic is defined as the latent meaning, and the contents included in the word. Moreover, our method displays automatically generated snippets for each topic with the Web search results to the user. It is easy to find required information from snippets, even though the intended information is ambiguous. It first classifies the Web search results by Latent Dirichlet Allocation (LDA) which is a major topic model method. It then generates the snippets using Conditional Variational AutoEncoder (Conditional VAE) based on the clustering of We search results. It is expected that using LDA for the clustering will group the Web search result according to the latent meanings of the search query. Also, we expect that proper snippets will be generated for each topic by Conditional VAE. In this paper, we show that LDA is effective for the clustering of Web search results. Moreover, the snippets generated by Conditional VAE is able to generate sentences considered each topic.","PeriodicalId":277939,"journal":{"name":"2018 9th International Conference on Awareness Science and Technology (iCAST)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131217412","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 : 2018-09-01DOI: 10.1109/ICAWST.2018.8517227
Ryosuke Kawakubo, Yodai Watanabe
The secret sharing (SS) scheme is a cryptosystem which encrypts a secret into multiple pieces, called shares, so that only qualified combination of shares can be employed to recover the secret. The visual secret sharing (VSS) scheme is an example of SS schemes whose decryption can be performed by a human without any numerical computations. This paper is an attempt to modify the structural similarity (SSIM) index so that the modified one can measure both the structural and tonal similarities simultaneously and then to employ the modified index to give an optimization-based halftoning suitable for the encryption of VSS schemes.
{"title":"Simple formulation of structural similarity for halftoning and its application to Visual secret sharing","authors":"Ryosuke Kawakubo, Yodai Watanabe","doi":"10.1109/ICAWST.2018.8517227","DOIUrl":"https://doi.org/10.1109/ICAWST.2018.8517227","url":null,"abstract":"The secret sharing (SS) scheme is a cryptosystem which encrypts a secret into multiple pieces, called shares, so that only qualified combination of shares can be employed to recover the secret. The visual secret sharing (VSS) scheme is an example of SS schemes whose decryption can be performed by a human without any numerical computations. This paper is an attempt to modify the structural similarity (SSIM) index so that the modified one can measure both the structural and tonal similarities simultaneously and then to employ the modified index to give an optimization-based halftoning suitable for the encryption of VSS schemes.","PeriodicalId":277939,"journal":{"name":"2018 9th International Conference on Awareness Science and Technology (iCAST)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123277036","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
扫码关注我们
求助内容：
应助结果提醒方式：