{"title":"Facial expression recognition by analyzing features of conceptual regions","authors":"Huiquan Zhang, Sha Luo, O. Yoshie","doi":"10.1109/ICIS.2013.6607893","DOIUrl":"https://doi.org/10.1109/ICIS.2013.6607893","url":null,"abstract":"Facial expression recognition utilizes collection of information from characteristic actions to analyze emotions and mental states of a person. It has emerged as the pivotal research topics in areas such as human computer interaction, sentimental analysis and synthetic face animation over the last years. This paper proposes an approach for facial expression by discovering associations between visual feature and Local Binary Pattern (LBP). Unlike many previous studies, the proposed approach automatically tracks the facial area and segments face into meaningful areas based on description of Local Binary Pattern. And then it accumulates the probabilities throughout the frames from video data to capture the temporal characteristics of facial expressions by analyzing facial expressions. Through the proposed approach, the temporal variation of facial expression can be quantified in individual areas. Thus, the recognition process of facial expression tends to be more comprehensible without sacrificing results of recognition. The empirical evaluation results of the approach are realized using video data which is collected from 10 volunteers. The results demonstrated that the proposed approach can effectively segment face into specific area and recognize facial expression.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115678577","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}
{"title":"Intelligent temporal data driven world actuation in ambient environments: Case study: Anomaly recognition and assistance provision in smart home","authors":"Farzad Amirjavid, A. Bouzouane, B. Bouchard","doi":"10.1109/ICIS.2013.6607856","DOIUrl":"https://doi.org/10.1109/ICIS.2013.6607856","url":null,"abstract":"A possible resident of smart home is an old person or an Alzheimer patient that should be assisted continuously for the rest of his life; however, normally this person desires to live independently at home. Typically, this person may forget sometimes completion of the activities; may realize the activities of daily living incorrectly, and may enter to dangerous states. In this context smart home project is proposed as an ambient intelligent environment, in which on one hand the resident is observed continuously through the embedded sensors, and on the other hand the resident is assisted automatically through the embedded electronically controllable actuators. In this work, we propose an approach to interpret the sensors' observations and how to automatically reason in the required assistance. The result is provision of automated assistance for the smart home resident.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"2830 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127445408","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}
{"title":"Combination of local and remote controllers design for a networked control system","authors":"Ching-Min Lee, Yan-Ming Li, Wei Dai, Sih-Ting Zeng","doi":"10.1109/ICIS.2013.6607880","DOIUrl":"https://doi.org/10.1109/ICIS.2013.6607880","url":null,"abstract":"In this paper, an H∞ state feedback control problem for a generalized state-space system is considered. For the system, we propose a controller module consists of a local controller and a remote one under networked framework. The remote controller could improve the control efficiency of the local controller to the plant when the correlated networked feedback system is working with measurement data lose or transmission delay. We utilize a modified finite sum inequality approach to derive a set of delay-dependent LMI-based sufficient conditions for the admissibility (generalized stability) analysis and controllers synthesis problems, respectively. At the end of this paper, we also present a numerical example to show the feasibility of the proposed conditions.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128556344","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}
{"title":"Instant distributed minimum diameter tree construction for scalable application layer multicast","authors":"Joongsoo Lee, Changjin Ahn, Younghee Lee","doi":"10.1109/ICIS.2013.6607811","DOIUrl":"https://doi.org/10.1109/ICIS.2013.6607811","url":null,"abstract":"Many research efforts on application layer multicast has been performed as an alternative group communication method because of difficulties in deployment problem of IP multicast and optimization is one of the hot topics to make efficient multicast tree. Because of high cost, adopting distributed optimization process in tree building has not been promising. This paper aims at minimizing the diameter of multicast tree with lessened overhead. We propose new algorithm called BrotherHood algorithm that can achieve efficient tree building only with positioning when new nodes join. We provide experimental results using simulation and the results show that proposed scheme performed well compared to greedy construction algorithm, which is known as best until now.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"219 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128172119","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}
{"title":"Automated proof for equivalence of telephone systems","authors":"Jun Sakoh, Noriaki Yoshimasa, Yoshinobu Kawabe","doi":"10.1109/ICIS.2013.6607888","DOIUrl":"https://doi.org/10.1109/ICIS.2013.6607888","url":null,"abstract":"An extended telephone system to avoid a phone fraud was introduced by Yamamoto et al. In this study, we prove that the extended telephone system is equivalent to the original telephone system at a level of abstraction. We conduct an automatic proof with the Alloy analyzer. After describing specifications of telephone systems in I/O-automaton, we translate the specifications into Alloy. We finally prove the existence of forward simulations by SAT solving.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133579522","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}
{"title":"A framework for evaluating software design pattern specification languages","authors":"Salman Khwaja, M. Alshayeb","doi":"10.1109/ICIS.2013.6607814","DOIUrl":"https://doi.org/10.1109/ICIS.2013.6607814","url":null,"abstract":"Software design patterns are solutions to recurring problems. These solutions have been widely accepted and adopted by the software practitioners. Design Patterns were initially described informally through the use of textual descriptions or some object oriented graphical notations. However, informal descriptions of design patterns give rise to ambiguity and incorrect usage of the design pattern. Many design pattern specification languages have been proposed to address the shortcomings of informal descriptions. These design pattern formalization techniques have been developed for different intentions including verification of design patterns and detection of design patterns in source code. In this paper we provide a set of evaluation criteria to evaluate and compare the various design pattern specification languages in order to aid practitioners and researchers to select the appropriate language for their use.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130923942","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}
{"title":"Membership classification using Integer Bloom Filter","authors":"Hung-Yu Cheng, H. Ma","doi":"10.1109/ICIS.2013.6607871","DOIUrl":"https://doi.org/10.1109/ICIS.2013.6607871","url":null,"abstract":"Due to the large quantity of digital information now available, information search engines provide a popular and important Internet service. Issues involved in the improvement of digital content search efficiency include: keyword filtering, inefficient search filtering, and existence search queries. Internet services are currently focusing on improving efficiency and accuracy. Through a pre-processing filter of inefficient search contents, a waste of Internet resources can be avoided and search efficiency can be improved. This study proposes an Integer Bloom Filter (IBF) that combines the concepts of a Bloom Filter (BF) and an artificial neutral network. It is based on the basic structure of the Bloom Filter so that multiple attribute existence algorithms can be developed. The algorithm's characteristics include: error-detected ratio, parallel computing, multiple attribute identification, non-fixed length string sample applications, as well as dynamic sample addition. With the non-fixed length string sample, the research results show that under proper conditions, the error-detected ratio has a very satisfactory performance and an on-line/off-line application field demonstrates its stable and highly efficient performance.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130296259","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}
Masatsugu Ichino, Hiroki Kasahara, Hideki Yoshii, Kazuhiro Tsurumaru, N. Komatsu, J. Katto
{"title":"A study on gait recognition using LPC cepstrum for mobile terminal","authors":"Masatsugu Ichino, Hiroki Kasahara, Hideki Yoshii, Kazuhiro Tsurumaru, N. Komatsu, J. Katto","doi":"10.1109/ICIS.2013.6607809","DOIUrl":"https://doi.org/10.1109/ICIS.2013.6607809","url":null,"abstract":"The use of mobile terminals has been expanding dramatically in recent years as they evolve from a means of dispatching and gathering information to a highly functional tool that supports personal lifestyles and behavior. A mobile terminal is likely to store various kinds of personal information such as a calendar and contact information as well as key data to carry out online transactions. Losing one's mobile terminal therefore creates the possibility that one's personal information may fall into the wrong hands and be used for malicious purposes. We therefore propose a method of personal authentication using sensor data in a mobile terminal. First, we applied the LPC cepstrum to this authentication and checked for validity. We also evaluated the effectiveness of gait authentication using several frames.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129528375","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}
{"title":"A story generation mechanism based on the cooperation of micro/macro story techniques: As a module in the integrated narrative generation system","authors":"T. Akimoto, Shohei Imabuchi, Takashi Ogata","doi":"10.1109/ICIS.2013.6607870","DOIUrl":"https://doi.org/10.1109/ICIS.2013.6607870","url":null,"abstract":"This paper proposes the story generation mechanism in our integrated narrative generation system. The basic method of story generation is to operate a story which is formed as a kind of discourse tree structure with diverse story techniques. The mechanism cooperatively and flexibly uses both micro level story techniques and macro level story techniques to generate a variety of story structures. We show several different types of stories which are generated by using the techniques in various combinatorial ways. At last, based on the results, the problems and future issues of the mechanism are discussed.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133791072","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}
{"title":"Improving performance of JNA by using LLVM JIT compiler","authors":"Yun-Hsin Tsai, I-Wei Wu, I-Chun Liu, J. Shann","doi":"10.1109/ICIS.2013.6607886","DOIUrl":"https://doi.org/10.1109/ICIS.2013.6607886","url":null,"abstract":"Java Native Access (JNA) has been proposed to alleviate the burden of programming in Java Native Interface (JNI). JNA allows programmer to call native functions without writing any JNI codes. However, JNA suffers from some performance degradation. To overcome this problem, in this paper, we modify the JNA source code and integrate the LLVM JIT compiler into JNA to improve the performance. Our experiment achieves about 8% to 16% performance improvement for calling a native function with different types and numbers of arguments. Furthermore, our design is a non-traditional way of using the runtime compiler, and the challenges we encountered may help other researchers to face the similar situations.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131321044","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}