2009 IEEE-RIVF International Conference on Computing and Communication Technologies最新文献

{"title":"Adaptive Modulation and SVC-Encoded Video IPTV Multicast over Mobile WiMAX","authors":"T. Cheng, Feng-Ming Yang, Jean-Lien C. Wu, I. Lin","doi":"10.1109/RIVF.2009.5174617","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174617","url":null,"abstract":"Adaptive modulation and coding (AMC), which is a technology used when channel condition changes, is adapted in mobile Worldwide Interoperability for Microwave Access (WiMAX). Scalable video coding (SVC) is a video coding scheme used for different users with bandwidth level. SVC encodes a video into a number of layers. Users receive different number of encoded layers based on their channel condition. In this paper, both AMC and SVC are employed to enhance the user perceived video quality in the system. Intermediate Control Server (ICS) is proposed to deal with the signaling between multimedia server and BS.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"104 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":"127569811","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":"Privacy Preserving EM-Based Clustering","authors":"T. Luong, T. Ho","doi":"10.1109/RIVF.2009.5174654","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174654","url":null,"abstract":"The problem of privacy-preserving EM-based clustering was solved when the dataset is horizontally partitioned into more than two parts (i.g., more than two computation parties). The aim of this work is to develop a method for the more difficult problem when the dataset is horizontally partitioned into only two parts. The key question is how to compute and reveal only the covariance matrix at various steps of the EM iterative process to the participating parties. We propose a method consisting of several protocols that provide privacy preservation for the computation of covariance matrices and final results without revealing the private information and the means. We also extend the proposed method for a better solution to the problem of privacy preserving k-means clustering.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"9 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":"130825420","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 Support Vector Machines Approach to Vietnamese Key Phrase Extraction","authors":"Chau Q. Nguyen, Luan T. Hong, T. Phan","doi":"10.1109/RIVF.2009.5174613","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174613","url":null,"abstract":"Automatic key phrase extraction is the task of automatically selecting a set of phrases that describe the content of a simple sentence. That a key phrase is extracted means that it is present verbatim in the sentence to which it is assigned. Accurate key phrase extraction is fundamental to the success of many recent digital library applications, clustering, and semantic information retrieval techniques. The present research discusses a support vector machines (SVMs) approach for Vietnamese key phrase extraction and presents a number of experiments in which performance is incrementally improved. In general, the Vietnamese key phrase extracting process consists of three steps: word segmentation for identifying lexical units in an input sentence, part-of-speech tagging for words, and key phrase extraction for phrases. The performance of Vietnamese key phras extraction systems is generally measured by the precision rate attained. This depends strongly on the nature and the size of a training set of key phrases. Most results are superior to 70.30% with a training set of 9,000 Vietnamese key phrases with of 2,000 sentences which was selected from the corpus of Vietnamese Lexicography Center (www.vietlex.com.vn). I. INTRODUCTION Key phrases, which can be single keywords or multiword key terms, are linguistic descriptors of documents. They are often sufficiently informative to help human readers get a feel for the essential topics and main contents included in the source documents. Key phrases have also been used as features in many text-related applications such as text clustering, document similarity analysis, and document summarization. Manually extracting key phrases from a number of documents is quite expensive. Automatic key phrase extraction is a maturing technology that can serve as an efficient and practical alternative. Key phrase extraction may be viewed as a classification problem. A document can be seen as a bag of phrases wherein each phrase belongs to one of the two possible classes: either it is a key phrase or it is a non-key phrase. We approach this problem from the perspective of machine learning research and treat it as a problem of supervised learning from examples. We divide our documents into two sets: training documents and testing documents. The training documents are used to tune the key phrase extraction algorithms, in order to attempt to maximize their performance. That is, the training documents are used to teach the supervised learning algorithms how to distinguish key phrases from non-key phrases. The testing documents are used to evaluate the tuned algorithms. The motivation for this work is to establish the range of applications for key phrases. There are at least five general application areas for key phrases: Text summarization, human- readable index, interactive query refinement, machine-readable index, and feature extraction as preprocessing for further machine analysis. SVMs is an extraordeinary phenomenon in machine","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"51 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":"127632544","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 Distiributed Checkpointing Scheme for the Mobile Computing Environment","authors":"Sungchae Lim","doi":"10.1109/RIVF.2009.5174610","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174610","url":null,"abstract":"During the past decade, there were drastic advances in the technology of the mobile computing environment. Such technical improvements give birth to a demand for running sophisticated applications over multiple mobile devices. Since more than one process executes concurrently in this computing environment and they have to send application data to each other, any failure on a process or a network connection may result in serious problems. Against such failure on distributed applications, many algorithms are devised. In this paper we also devise a new distributed checkpointing scheme very suitable for the mobile distributed applications. For our checkpointing scheme, we propose two key ideas of a checkpoint-related software agent, called checkpointing agent (CA), and a flexible checkpointing protocol. The CA is used to make consistent global checkpoints on behalf of application processes. Since the CA's communicate with each other via wired fixed networks, we can reduce network overheads paid for delivering checkpoint-related data via wirelesses networks.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"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":"114142300","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":"Applying Type Theory to Formal Specification of Recursive Multiagent Systems","authors":"Thi-Thanh-Ha Hoang, M. Occello, N. T. Binh","doi":"10.1109/RIVF.2009.5174624","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174624","url":null,"abstract":"Nowadays software systems are more and more complex. Such systems are composed of many sub-systems, in which each sub-system exists and interacts with other subsystems. Since a few years, multiagent systems (MAS) propose well considered approaches for these kinds of systems. In this paper, we concentrate on recursive MAS which are well adapted to describe complex systems. Up to now, recursive MAS are only specified by informal languages. This paper proposes the use of type theory to specify recursive MAS. This work constitutes a first theoretical step in the elaboration of a generic software tool for reliable design of recursive MAS.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"10 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":"123732370","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":"Robust Overlay Network with Self-Adaptive Topology: The Reliable File Storage Layer","authors":"L. Baud","doi":"10.1109/RIVF.2009.5174658","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174658","url":null,"abstract":"A reliable storage system is a system that ensures the protection of data from loss. Such systems are needed in many critical fields. We cannot imagine that a financial institution looses data about one its clients. Moreover the exponential growing volumes of the data and its availability are crucial issues. A centralized storage system would be overloaded and be a single point of failure. That is why overlay network may provide the solution as they can be used to implement a distributed storage system over an information system. ROSA is an overlay network that was designed to combine a high scalability while maintaining a strong connectivity. The reliability of its topology, designs ROSA as a good platform for deploying such a reliable storage system. Nevertheless ROSA is an unstructured overlay network, this will decrease the efficiency of the storage system. In this article we first propose a structure, called chain of lumps, built upon ROSA. This structure will provide the advantage of a structured network to ROSA. Once ROSA endowed with the structure, we propose a reliable storage system deployed over ROSA. Consequently this system will benefit of the reliability of ROSA.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"154 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":"116405411","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":"Improvement of Vietnamese Tone Classification using FM and MFCC Features","authors":"P. Le, E. Ambikairajah, E. Choi","doi":"10.1109/RIVF.2009.5174644","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174644","url":null,"abstract":"This paper focuses on tone classification for the Vietnamese speech. Traditionally, tone was classified or recognized by the fundamental frequency F0. However, our experimental results indicate that along with the fundamental frequency, Mel Frequency Cepstrum Coefficients and frequency modulation also carry a significant amount of tone information in the Vietnamese speech. Therefore, the proposed method takes into account these two types of features to improve the classification accuracy. The experimental results show that the proposed classification system provides an improvement of 7.5% in accuracy, compared to the conventional system based on F0 alone.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"3 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":"129566943","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 Effective Clustering-based Approach for Conceptual Association Rules Mining","authors":"T. Quan, Linh N. Ngo, S. Hui","doi":"10.1109/RIVF.2009.5174619","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174619","url":null,"abstract":"Association rule mining is a well-known data mining task for discovering association rules between items in a dataset. It has been successfully applied to different domains especially for business applications. However, the mined rules rely heavily on human interpretation in order to infer their semantic meanings. In this paper, we mine a new kind of association rules, called conceptual association rules, which imply the relationships between concepts. Conceptual association rules can convey more semantic meanings than those classical association rules. Conceptual association rules can be mined using Formal Concept Analysis (FCA). However, the FCA-based method for conceptual rule mining suffers from high computational cost when dealing with large datasets. To tackle this problem, we propose a cluster-based approach to mine conceptual association rules regionally, rather than globally. A distance metric is also proposed to ensure that the same rule sets will ultimately be obtained when the dataset is clustered. In this paper, we present the proposed clustering-based approach. In addition, the proposed approach has been evaluated with four benchmarking datasets and promising results have been achieved.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"72 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":"121468641","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":"Anchoring the Institutional Dimension of Speech Acts in Agents' Attitudes: A Logical Approach","authors":"E. Lorini, Dominique Longin, B. Gaudou","doi":"10.1109/RIVF.2009.5174622","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174622","url":null,"abstract":"The focus of this contribution is to define speech acts as institutional actions where modeled institutions are social or informal institutions. With social or informal institution, we mean an institution which is grounded on the acceptances of its members. In the first part of the paper we present a logic of acceptance, goal and action. Then, we specify how agents can create and maintain normative and institutional facts on the basis of their acceptances qua members of a certain institution. In particular we focus on obligations and social commitments and provide an original reductionist characterization of these concepts, anchoring them in agents' attitudes. Finally, we propose a formal characterization of the speech act promise. In this last part, we first define the constitutive rule which creates the relation between an utterance (as a physical action) and the speech act promise (as an institutional action). Then, we specify the deontic dimension of promise. Finally, we establish the relationship between promise and social commitment.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"14 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":"123913599","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":"Immersive, Emotive and Cognitive effects of HDTV: Evaluating Effects of Image Definition on Presence","authors":"C. Tijus, Florent Levillain, Hamid Bessaa, V. Besson, Olivier Floucat, N. Fouquereau, Bora Han, Zakia Ikhlef, Thierry Thibault, Alexandra Wang","doi":"10.1109/RIVF.2009.5174643","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174643","url":null,"abstract":"In the search of effects of image quality, we evaluated the effects of HDTV on Presence: Immersion, Emotion and Cognition. The set-up of the experiments involved respondents being wired up and recorded during two different viewing scenarios: in the first, they watched SD and HD versions of the same content being broadcast simultaneously on two identical adjacent HD-Ready flat-screen displays for ten minutes; in the second, they were asked to choose with a remote control and watch SD or HD programming from a selection offering content divided 50/50 between the two modes. In the first scenario, when the same content could be watched either in SD or HD over a ten-minute period, respondents spent 70% of the ten-minute period watching HD. 77% of them said they preferred HD; and 76% of them found that the quality of the HD picture was better. In the second scenario, when respondents were free to hop between different content modes as they saw fit, they spent 25% more time watching HD content before switching to a different channel. On average, they also chose HD programming 12.5% more than SD versions of the same programs. Physiological monitoring of the test subjects, combined with questionnaires, also found that HD both increased the legibility of, and the amount of ‘reading’ of the images, increasing comprehension of what was being shown, and stimulating viewers’ curiosity and imagination. Keywords-component; HDTV, Immersion, Emotion, Cognition","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"133 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":"114177017","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}