{"title":"Building Lexical Resources: Towards Programmable Contributive Platforms","authors":"Mathieu Mangeot, Hong-Thai Nguyen","doi":"10.1109/RIVF.2009.5174629","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174629","url":null,"abstract":"Lexical resources are very important in nowadays society, with the globalization and the increase of world communi- cation and exchanges. There are clearly identified needs, both for humans and machines. Nevertheless, very few efforts are actually done in this domain. Consequently, there is an important lack of freely available good quality resources, especially for under- resourced languages. Furthermore, the majority of existing bilin- gual dictionaries is built with one language as English. Therefore, if one wants to translate from one language (that is not English) to another, it uses English as a pivot. And even for English native speakers, it creates a lot of misunderstandings that can be critical in many situations. In order to create and extend freely available good quality rich lexical resources for under-resourced languages online with a community of voluntary contributors, Jibiki, an online generic platform for managing (lookup, editing, import, export) any kind of lexical resources encoded in XML, has been developed. This platform is successfully used in several dictionary construction projects. Concerning the data, a serious game has been launched in order to collect precious lexical information such as collocations that will be integrated later into dictionary entries. Work is now done on extending our platform in order to reuse the resulting resources and enriching them by synchronization with the other systems (language learners and translators environments, machine translation systems, etc.).","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124643580","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 Approach To Accent Restoration Of Vietnamese Texts Using Dynamic Programming Combined With Co-Occurrence Graph","authors":"Ho Trong Nghia, Do Phuc","doi":"10.1109/RIVF.2009.5174609","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174609","url":null,"abstract":"In this paper, we would like to introduce a new approach to recover Vietnamese text's accents. Given a Vietnamese text in which accents are lost, our goal is to seek for a recovered text that yields a best lexical probability. Using a dynamic programming approach, we first build a model of language for Vietnamese as a lexical database which gives lexical probabilities to Vietnamese sentences. Second, we construct a map of literal translations of Vietnamese words to restrict our searching space. Finally, we apply dynamic programming as a searching engine to seek out the most probable sentence. We also use the co-occurrence graph to increase the accuracy of selection, the experimental results show that the average accuracy of our approach is about 93%-94%.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"538 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120879555","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":"BB84 Implementation and Computer Reality","authors":"P. Bellot, Minh-Dung Dang","doi":"10.1109/RIVF.2009.5174626","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174626","url":null,"abstract":"Quantum Key Distribution (QKD) principles and software implementations are now well-known. Focussing on CASCADE algorithm, a major step of the key distillation algorithm (BB84), we show that the mathematical optimality may not mean practical efficiency because of the design of computers and their processors. As pointed out by John Backus , the father of FORTRAN, most of the work of the processor of a Von Neumann computer is dedicated to transfer to and from memory and the computer bus appears as a bottleneck. Thus, it is preferable to repeat simple computations than to randomly access the memory. This will impact the design of the permutations required by CASCADE. Moreover, computers are designed to work with bytes, not with bits. This will imply a reparametrization of CASCACDE different from the mathematically optimal parametrization.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125720649","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":"Enhancing Optical Signal-to-Noise Ratio in Terrestrial Cascaded EDFAs Fiber Optic Communication Links using Hybrid Fiber Amplifier","authors":"T. N. Van, H. Viet","doi":"10.1109/RIVF.2009.5174638","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174638","url":null,"abstract":"In this paper, we propose calculating models of Terrestrial DWDM cascaded EDFAs Fiber Optic Communication Links using Hybird Fiber Amplifier (HFA) including combination of Distributed Raman Amplifier (DRA) and EDFA, and build algorithm charts to optimize parameters including signal power per channel launched fiber, EDFAs gain, pump power of Raman amplifier for improving optical Signal-to-Noise ratio (OSNR) at the end of link. Then, algorithm-based numerical calculating (MathCAD program) is applied in typical system (WDM Nation-wide links in Vietnam). Optimized results show that the OSNR can be increased by (1-5) dB comparing with that in cases of parameters chosen by experience way.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127489746","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}
Thanh Do, Thuy Nguyen, D. Nguyen, H. Nguyen, Weisong Shi
{"title":"Trouble Dashboard: A Distributed Failure Monitoring System for High-End Computing","authors":"Thanh Do, Thuy Nguyen, D. Nguyen, H. Nguyen, Weisong Shi","doi":"10.1109/RIVF.2009.5174661","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174661","url":null,"abstract":"Failure management is crucial for high performance computing systems, especially when the complexity of applications and underlying infrastructure has grown sharply in recent years. In this paper, we present the design, implementation and experiment of trouble dashboard (TD), an adaptive, flexible, and low overhead failure monitoring system. Our goal is to provide a lightweight, scalable failure-monitoring tool for both application scientists and system managers. In TD, a set of APIs is provided for application scientists to control the behavior of their applications with flexibility when failures happen. System managers can use the tool to monitor the status of not only computing nodes and running tasks but also failures when they occur. Experiments show that TD incurs low overhead, and remains accurate and flexible enough to adapt to various applications.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127336721","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":"An Efficient Algorithm for Fingerprint Reference-Point Detection","authors":"Hoang Thien Van, T. Le","doi":"10.1109/RIVF.2009.5174620","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174620","url":null,"abstract":"The reference-point played important roles in most algorithms of fingerprint recognition. It is widely used in fingerprint classification, and fingerprint matching. There are many methods proposed for reference point detection as Poincare index technique, geometry of region technique, direction curvature technique and orientation-consistency-based technique. However, the experimental results show that the present methods are less accurate on the fingerprint database which contains many poor-quality fingerprint images (the most accuracy of the present methods is 93% on the fingerprint database FVC2004, DB2, set A). This paper proposes a novel algorithm to locate fingerprint reference-point consistently and accurately for all types of fingerprints. The method computes the convex orientation consistency which describes both direction of curvature and how well the orientations over a neighborhood are consistent with the dominant orientation. Experimental results show the effectiveness and superiority of our proposed method (96.9 % on the FVC2004, DB2 set A).","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130413362","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 Freenet's Performance by Adaptive Clustering Cache Replacement","authors":"D. Nguyen, Bach Le Nguyen, Duy Loi Vu","doi":"10.1109/RIVF.2009.5174645","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174645","url":null,"abstract":"This paper proposes an adaptive clustering cache replacement scheme to improve the performance of Freenet peer-to-peer networks. Efficient data retrieval in peer-to-peer networks in general and in Freenet in particular is a challenging problem. We follow the approach of using the small-world behavior to model the data cache replacement in Freenet and propose an extension to it: an adaptive clustering cache replacement scheme instead of LRU and enhanced-clustering cache replacement. The chosen seed key is not fixed but may vary depending on the request change in order to increase the adaptability of Freenet. Simulation results show that our proposed scheme improves the performance of Freenet better in terms of higher request hit ratio and lower average hops per request in comparison to the two mentioned schemes at heavy workload.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125363369","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":"Eigen and Fisher Barycenter Contour for 2D Shape Classification","authors":"Kosorl Thourn, Y. Kitjaidure, S. Kondo","doi":"10.1109/RIVF.2009.5174637","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174637","url":null,"abstract":"To achieve a good performance for shape classification, it requires both shape representation and classifier. In this paper, the so-called Eigen Barycenter Contour (EBcC) and Fisher Barycenter Contour (FBcC) techniques are presented for 2D shape classification. The representation utilizes the area of triangles at different scale level of Barycenter Contour (BcC). However, it is not invariant to starting point selection, so the phase normalization is applied. After that, we linearly project the shape feature in 3D format onto a subspace based on EBcC technique into low dimensional subspace. The FBcC, another similar method, also produces well separated classes in low dimensional subspace. Finally, the normalized cross correlation is used to measure the similarity among shapes. The experimental results demonstrate that the FBcC method outperforms the EBcC method and achieves high retrieval efficiency over other recent methods in the literature for tests on three different databases, the affine shape database, the MPEG-7 database CE-1 part B and the Kimia's database.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121848598","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 Robust Framework for Visual Object Tracking","authors":"N. Binh","doi":"10.1109/RIVF.2009.5174611","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174611","url":null,"abstract":"Visual object tracking is an important problem in computer vision. Recent proposed tracking methods based on online learning a discriminative classifier have drawn considerable interest. However, most of existing approaches make a simple assumption about initializing the object to be tracked; on-line adaptation of binary classifier only has to discriminate the current object from its surrounding background can lead to tracking failure (drifting) without a recovering. This paper presents a novel framework for robust object tracking. The system comprises of a strong learned object detector incorporation with an online adaptation tracking mechanism. The main contributions are: (1) an efficient visual object learning algorithm based on online boosting, which provides a reliable object detector for the tracking process; (2) a robust strategy to deal with tracking failures and recovery of such failures. Our idea is to incorporate decision of given by the prior learned strong detector and an on-line boosting tracker. This allows almost completely avoiding the drifting problem in tracking. Complex object can be learned and the object is initiated automatically at its first appearance. Moreover, the distinct advantage is we can almost completely make sure that the object is always detected and tracked when it appears; the abruption is also detected and failure will be recovered by re-detecting the object. The online adaptation tracker monitors the whole process and gives output of the system. In the intensive set of experiments on challenging data set for several applications, we demonstrate the out performance of our framework over very recent proposed approaches.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"163 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123557816","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}
Van Tuan Le, N. Bouraqadi, Serge Stinckwich, Victor Moraru
{"title":"Connectivity Awareness in Networked Robotic Systems","authors":"Van Tuan Le, N. Bouraqadi, Serge Stinckwich, Victor Moraru","doi":"10.1109/RIVF.2009.5174632","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174632","url":null,"abstract":"Maintaining the network connectivity in mobile multi-robot systems (MRSs) is a key issue in many robotics applications. In our view, the solution to this problem consists of two steps: (i) making robots aware of the network connectivity; and (ii), making use of this knowledge in order to plan robots tasks without compromising the connectivity. We propose a novel distributed algorithm that will be executed on individual robots to make robot be aware of the network connectivity (i). We also rigorously formalize the problem of checking the robustness of a wireless network based on the conception of connectivity- awareness. The algorithm featured with very low communication overhead in comparison with existing works.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131292589","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}