{"title":"Using Participatory Paradigm to Learn Human Behaviour","authors":"P. Taillandier, Thanh-Quang Chu","doi":"10.1109/KSE.2009.33","DOIUrl":"https://doi.org/10.1109/KSE.2009.33","url":null,"abstract":"Since the end of the seventies, the utilization of multi-agents simulations has spread out. A typical use of these simulations concerns the modeling of human behavior. In this application case, a key point to ensure the simulation realism is the definition of the agent behavior. Unfortunately, designing such behavior is often complex. In order to help the definition of human behavior, we propose an approach based on the participatory paradigm. In our approach, a human actor directly plays the role of an agent in the simulation. Knowledge about its behavior is extracted from analysis of the logs. In this context, we propose to formalize the human behavior by means of utility functions. An experiment, carried out in the domain of rescue simulation, is presented. This first experiment shows promising results for our approach.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115724089","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":"Vietnamese Lexical Functional Grammar","authors":"L. Hai, Phan Thi Tuoi","doi":"10.1109/KSE.2009.45","DOIUrl":"https://doi.org/10.1109/KSE.2009.45","url":null,"abstract":"Lexical Functional Grammar (LFG) is a multi-structure grammar that allows analyzing and generating natural language in syntactic, semantic, functional aspects and so on. This paper establishes a framework of LFG for Vietnamese (VLFG). The Vietnamese LFG may be useful for machine translation (MT) and other natural language processing (NLP) applications. Main focus of this research is concentrated in syntactic and functional structures and relation between them.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117062658","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}
Anh-Cuong Le, Phuong-Thai Nguyen, Hoai-Thu Vuong, Minh-Thu Pham, T. Ho
{"title":"An Experimental Study on Lexicalized Statistical Parsing for Vietnamese","authors":"Anh-Cuong Le, Phuong-Thai Nguyen, Hoai-Thu Vuong, Minh-Thu Pham, T. Ho","doi":"10.1109/KSE.2009.41","DOIUrl":"https://doi.org/10.1109/KSE.2009.41","url":null,"abstract":"Syntactic parsing is a central problem and a challenge in the field of natural language processing. It attracts many studies and consequently there exists the effective parsers for several popular languages such as English and Chinese. For Vietnamese parsing, there have been a few studies focusing on this problem, these studies lack of applying modern techniques, and no popular parser has been released. This paper presents the first study on developing a Vietnamese wide coverage parser based on lexicalized probabilistic context free grammar (LPCFG) and using a standard parsed corpus (similar to Penn Treebank). In this paper the Bikel's parser is modified to analyze Vietnamese. We also provide a comparison based on investigating different parsing models and different linguistic features. The best configuration achieves around 78% of F-score.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121600123","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}
H. Sasaki, Kazunori Mizuno, Nguyen Viet Ha, Yasushi Miki
{"title":"A Web Enhanced Learning Support Environment Using the Ubiquity Technology","authors":"H. Sasaki, Kazunori Mizuno, Nguyen Viet Ha, Yasushi Miki","doi":"10.1109/KSE.2009.24","DOIUrl":"https://doi.org/10.1109/KSE.2009.24","url":null,"abstract":"Japanese text is composed from three kinds of characters that are \"Hiragana\", \"Katakana\", and \"Chinese character\". This chapter is explained about these three kinds of characters necessary for writing Japanese.Children of lower grade have little knowledge on \"Kanji\".Therefore, they can't enough read and write \"Kanji\". However, applications like Web browser etc is not made for children. In this paper, we propose a new Web enhanced learning support environment for children based on child Web browser and the ubiquity technology.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129395067","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":"Adaptive Noisy Fingerprint Enhancement Based on Orientation Consistency","authors":"Thien Hoang Van, Hoang Thai Le","doi":"10.1109/KSE.2009.13","DOIUrl":"https://doi.org/10.1109/KSE.2009.13","url":null,"abstract":"Fingerprint image enhancement is an essential preprocessing step in fingerprint recognition application. There are many authors proposed the different fingerprint enhancement methods. Most present well-known methods are base on Gabor filters. However, the present proposed Gabor filters almost can not be efficient in some cases such as: the local orientation changes rapidly and the fingerprint image is heavily noisy. This paper proposes a novel filter design technique based on the orientation consistency to improve the Gabor filter with the aim that achieves higher efficiency in clarifying the high curvature ridges of the noisy fingerprint images. It is called Adaptive Orientation Consistency-based Gabor filter (AOC-BGF). Actually, this is the technique which tunes adaptively the Gabor filter window size based on analyzing the orientation consistency. The orientation consistency describes how well the orientations over a neighborhood are consistent with the dominant orientation. The performance of the minutiae detection process on the database FVC2004 DB4 shows the effectiveness and superiority of the proposed method.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124054730","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":"Machine Learning Approaches for Mood Classification of Songs toward Music Search Engine","authors":"Trung-Thanh Dang, Kiyoaki Shirai","doi":"10.1109/KSE.2009.10","DOIUrl":"https://doi.org/10.1109/KSE.2009.10","url":null,"abstract":"Human often wants to listen to music that fits best his current emotion. A grasp of emotions in songs might be a great help for us to effectively discover music. In this paper, we aimed at automatically classifying moods of songs based on lyrics and metadata, and proposed several methods for supervised learning of classifiers. In future, we plan to use automatically identified moods of songs as metadata in our music search engine. Mood categories in a famous contest about Audio Music Mood Classification (MIREX 2007) are applied for our system. The training data is collected from a LiveJournal blog site in which each blog entry is tagged with a mood and a song. Then three kinds of machine learning algorithms are applied for training classifiers: SVM, Naive Bayes and Graph-based methods. The experiments showed that artist, sentiment words, putting more weight for words in chorus and title parts are effective for mood classification. Graph-based method promises a good improvement if we have rich relationship information among songs.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127536199","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":"Implementing Adaptive Page Layout Algorithm on Embedded Devices","authors":"Vũ Quang Dũng, Xinxiao Li, Nguyen Viet Ha","doi":"10.1109/KSE.2009.17","DOIUrl":"https://doi.org/10.1109/KSE.2009.17","url":null,"abstract":"In many applications, there is a strong need to visualize the data content for interaction with users. Data can be presented as the order blocks to support interactivity and for the personalization of content. Thus, flexible layout techniques are needed to display dynamic information effectively. Several algorithms are proposed and implemented on PC-based systems. This paper investigates the ability of implementing such algorithms on embedded devices.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131529940","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":"The Effect of Local Website Search","authors":"V. Nguyen, P. Chuan","doi":"10.1109/KSE.2009.25","DOIUrl":"https://doi.org/10.1109/KSE.2009.25","url":null,"abstract":"Global search engine is a huge but it can’t replace local search engine. The local search engines help the end-user to retrieve easily what they want and to give accurate results than global search engines do. The end-user can also use the global search engines to augment the search performed by a local search engine, restricted to a single site. However, a single website is different from the whole web in link structure, access pattern, and possibility hit on page. To improve the performance of search sites, many researches have tried to combine original search methods with new ones such as: the PageRank, LPageRank, predictive access pattern,… This article would like to introduce a hybrid model to improve local website searched by using web server logs. This model combines capability of ranking structure link of PageRank and recommending access pattern of neural network to improve the result of search engine. It also present the way to combine search engine with PageRank, web log and neural network.To experiment with the new model, the authors have used this model for Music Machine Website with their web logs.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122074567","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}
T. Dang, K. Engelen, P. Meysman, K. Marchal, A. Verschoren, K. Laukens
{"title":"Conditional Random Fields Feature Subset Selection Based on Genetic Algorithms for Phosphorylation Site Prediction","authors":"T. Dang, K. Engelen, P. Meysman, K. Marchal, A. Verschoren, K. Laukens","doi":"10.1109/KSE.2009.11","DOIUrl":"https://doi.org/10.1109/KSE.2009.11","url":null,"abstract":"Conditional Random Fields (CRFs) are undirected probabilistic graphical models that were introduced for solving sequence labeling and segmenting problems. CRFs have several advantages compared to other well understood and widely used techniques such as Hidden Markov Models (HMMs) or Maximum Entropy Markov Models (MEMMs). Being a conditional model, it does not explicitly model the input data sequences but uses feature functions (features) to incorporate the arbitrary interactions and inter-dependencies that exist in the observation sequences. The number of all possible features is extremely large, up to millions, and is usually specified and designed in advance or according to a feature-generating scheme based on domain knowledge. This paper introduces a feature subset selection method for CRFs based on genetic algorithms, in which a population of candidate feature function subsets is evolved to achieve a maximal CRF performance. The method was experimentally validated on the well known bioinformatics problem of protein phosphorylation site prediction, phosphorylation being one of the most important protein modification mechanisms.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132423465","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 New Filter Approach to Extract Relevant Features from Mass Spectrum Datasets","authors":"Tri-Thanh Le, T. Vu, N. Trang, Ha-Nam Nguyen","doi":"10.1109/KSE.2009.36","DOIUrl":"https://doi.org/10.1109/KSE.2009.36","url":null,"abstract":"We propose an approach to extract relevant features from SELDI-TOF mass spectrum datasets. The proposed method can deal with both two-class and multiple-class problems. In the method, the relevance value of a feature representing how well the value of a feature helps to separate a sample from a given class was defined based on the difference between the numbers of samples in the given class with greater and less feature value than the sample. Using the relevance value as a basic factor, several ranked feature lists were established. Searching strategies to obtain optimal feature sets were also proposed by utilizing the relevance indices of features without using learning algorithms. The new method was applied to the three public mass spectrum datasets and showed better or comparable results than conventional filter methods","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127950418","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}