发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
Application of PAMS Collaboration Platform to Simulation-Based Researches in Soil Science: The Case of the MIcro-ORganism Project PAMS协同平台在土壤科学模拟研究中的应用——以微生物项目为例
2009 IEEE-RIVF International Conference on Computing and Communication Technologies Pub Date : 2009-07-13 DOI: 10.1109/RIVF.2009.5174623
Trong Khanh Nguyen, B. Gaudou, Hô Tuòng Vinh, N. Marilleau
{"title":"Application of PAMS Collaboration Platform to Simulation-Based Researches in Soil Science: The Case of the MIcro-ORganism Project","authors":"Trong Khanh Nguyen, B. Gaudou, Hô Tuòng Vinh, N. Marilleau","doi":"10.1109/RIVF.2009.5174623","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174623","url":null,"abstract":"Major researches in the domain of complex systems are interdisciplinary, collaborative and geographically distributed. The purpose of this paper is to explore a new collaborative approach that facilitates scientists' interactions during the modelling and simulation process. Based on the problem of collaboration in a simulation project, we identify the needs for this kind of platform. Accordingly, a new collaborative platform dedicated to agent-based simulation (PAMS) has been developed. This new environment integrates common collaborative tools (e.g. videoconferencing, instant messaging, whiteboard) and specific tools to share and manipulate models, simulators, experiments and results... In this paper, we illustrate our approach by presenting our experiment with MIOR, a model developed in soil science.","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":"125106367","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}
引用次数: 11
A Web-oriented System to Manage the Translation of an Online Encyclopedia 一个基于web的在线百科全书翻译管理系统
2009 IEEE-RIVF International Conference on Computing and Communication Technologies Pub Date : 2009-07-13 DOI: 10.1109/RIVF.2009.5174614
C. Boitet, Cong-Phap Huynh, H. Blanchon, Hong-Thai Nguyen
{"title":"A Web-oriented System to Manage the Translation of an Online Encyclopedia","authors":"C. Boitet, Cong-Phap Huynh, H. Blanchon, Hong-Thai Nguyen","doi":"10.1109/RIVF.2009.5174614","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174614","url":null,"abstract":"We start from a Web-oriented system for evaluating, presenting, processing, enlarging and annotating corpora of translations, previously applied to a real MT evaluation task, involving classical subjective measures, objective n-gram-based scores, and objective post-edition-based task-related evaluation. We describe its recent extension to support the high-quality translation into French of the large on-line Encyclopedia of Life Support Systems (EOLSS) presented as documents each made of a Web page and a companion UNL file, by applying contributive on-line human post-edition to results of machine translation systems and of UNL deconverters. Target language Web pages are generated on the fly from source language ones, using the best target segments available in the database. 25 documents (about 220,000 words) of the EOLSS are now available in French, Spanish, Russian, Arabic and Japanese. MT followed by contributive incremental cheap or free post-edition is now proved to be a viable way of making difficult information available in many languages.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"22 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":"126156096","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}
引用次数: 6
A Mathematical Formalism of Hierarchical Systems for a Distributed Simulation: Case of the Nervous System 用于分布式仿真的层次系统的数学形式:以神经系统为例
2009 IEEE-RIVF International Conference on Computing and Communication Technologies Pub Date : 2009-07-13 DOI: 10.1109/RIVF.2009.5174608
Omar Bennani, S. B. Amor
{"title":"A Mathematical Formalism of Hierarchical Systems for a Distributed Simulation: Case of the Nervous System","authors":"Omar Bennani, S. B. Amor","doi":"10.1109/RIVF.2009.5174608","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174608","url":null,"abstract":"In this paper we present a mathematical formulation of hierarchical systems based on graphs. In particular we are interested in the mathematical theory of integrative physiology (MTIP) developed by Gilbert Chauvet, which describes biological structures and their functioning as a combination of hierarchical structures (synapses, neurones, neural network) and of functional interactions between these structures. In this work our aim is to provide a mathematical modeling of the nervous system as a hierarchical network using pretopology theory in the framework of the MTIP.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"353 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":"122037646","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}
引用次数: 1
Latent Ontological Feature Discovery for Text Clustering 文本聚类的潜在本体特征发现
2009 IEEE-RIVF International Conference on Computing and Communication Technologies Pub Date : 2009-07-13 DOI: 10.1109/RIVF.2009.5174647
Van T. T. Duong, T. Cao, C. Chau, T. Quan
{"title":"Latent Ontological Feature Discovery for Text Clustering","authors":"Van T. T. Duong, T. Cao, C. Chau, T. Quan","doi":"10.1109/RIVF.2009.5174647","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174647","url":null,"abstract":"The content of a text is mainly defined by keywords and named entities occurring in it. In particular for news articles, named entities are usually important to define their semantics. However, named entities have ontological features, namely, their aliases, types, and identifiers, which are hidden from their textual appearance. In this paper, we explore weighted combinations of those latent named entity features with keywords for text clustering. To that end, the traditional vector space model is adapted with multiple vectors defined over spaces of entity names, types, name-type pairs, identifiers, and keywords. Clustering quality is evaluated by both of the self purity-separation type and the relative comparison type of measures. Hard and fuzzy clustering experiments of the proposed model on selected data subsets of Reuters-21578 are conducted and evaluated.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"8 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":"117029840","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}
引用次数: 2
Fuzzy Subspace Hidden Markov Models for Pattern Recognition 模式识别的模糊子空间隐马尔可夫模型
2009 IEEE-RIVF International Conference on Computing and Communication Technologies Pub Date : 2009-07-13 DOI: 10.1109/RIVF.2009.5174640
D. Tran, Wanli Ma, D. Sharma
{"title":"Fuzzy Subspace Hidden Markov Models for Pattern Recognition","authors":"D. Tran, Wanli Ma, D. Sharma","doi":"10.1109/RIVF.2009.5174640","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174640","url":null,"abstract":"This paper presents a novel fuzzy subspace-based approach to hidden Markov model. Features extracted from patterns are considered as feature vectors in a multi-dimensional feature space. Current hidden Markov modeling techniques treat features equally, however this assumption may not be true. We propose to consider subspaces in the feature space and assign a weight to each feature to determine the contribution of that feature in different subspaces to modeling and recognizing patterns. Weights can be computed if a learning estimation method such as maximum likelihood is given. Experimental results in network intrusion detection based on the proposed approach show promising results.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"6 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":"124545662","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}
引用次数: 5
Hybrid (2, n) Visual Secret Sharing Scheme for Color Images 彩色图像的混合(2,n)视觉秘密共享方案
2009 IEEE-RIVF International Conference on Computing and Communication Technologies Pub Date : 2009-07-13 DOI: 10.1109/RIVF.2009.5174642
Jung-San Lee, T. H. N. Le
{"title":"Hybrid (2, n) Visual Secret Sharing Scheme for Color Images","authors":"Jung-San Lee, T. H. N. Le","doi":"10.1109/RIVF.2009.5174642","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174642","url":null,"abstract":"In several recent decades, many secret sharing schemes for digital images have been developed. At the beginning stage, traditional schemes typically must deal with the problem of computational complexity. Later, other visual secret sharing schemes come with either higher storage cost or low accuracy problems. In this paper, a new (2, n) secret sharing scheme for color images is proposed with hybrid techniques: the gradual search algorithm for a single bitmap BTC (GSBTC), the discrete wavelet transform (DWT), and the vector quantization (VQ) technique. Experimental results confirm that our proposed scheme not only generates a high reconstructed secret color image quality but also provides a set of noise-like grayscale shadows which are much smaller than these in existing schemes.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"28 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":"120917117","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}
引用次数: 18
Autonomous Learning for Tracking and Recognition 跟踪和识别的自主学习
2009 IEEE-RIVF International Conference on Computing and Communication Technologies Pub Date : 2009-07-13 DOI: 10.1109/RIVF.2009.5174625
N. Binh
{"title":"Autonomous Learning for Tracking and Recognition","authors":"N. Binh","doi":"10.1109/RIVF.2009.5174625","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174625","url":null,"abstract":"We present an efficient approach for autonomous learning an object model from video or image sequences. The idea is to employ online boosting technique to adaptively learn an object representation from only as few as one labeled training sample. Our main contributions are: (1) A robust updating strategy of a discriminative classifier, which allows effective learning of an object model for tracking and recognition; (2) Learning and tracking are performed in a single procedure with possibility of reducing drifting and ability to recover tracking failure; and (3) a simple yet reliable framework for object recognition. Our main concern is to use the approach for the problem of hand and face tracking and gesture recognition. However, the proposed framework can be applied to other objects. Experiments on different data sets (publicity available) show the efficiency of our approach over very recent published approaches on different objects.","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":"116356759","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}
引用次数: 0
Mining High Utility Itemsets from Vertical Distributed Databases 从垂直分布式数据库中挖掘高实用项目集
2009 IEEE-RIVF International Conference on Computing and Communication Technologies Pub Date : 2009-07-13 DOI: 10.1109/RIVF.2009.5174650
Bay Vo, Huy Nguyen, H. Le
{"title":"Mining High Utility Itemsets from Vertical Distributed Databases","authors":"Bay Vo, Huy Nguyen, H. Le","doi":"10.1109/RIVF.2009.5174650","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174650","url":null,"abstract":"The utility based on itemsets mining approach has been discussed widely in recent years. There are many algorithms mining high utility itemsets (HUIs) by pruning candidates based on the estimated utility values, and based on the transaction-weighted utilization values. These algorithms aim to reduce search space. In this paper, we propose a method for HUIs from vertical distributed databases. This method does not integrate local databases in SlaverSites to MasterSite, and scan local database one time. Experiments show the run-time of this method is more efficient than that in the concentration database.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"13 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":"126424543","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}
引用次数: 15
Mining Abstract Highly Correlated Pairs 摘要高相关对
2009 IEEE-RIVF International Conference on Computing and Communication Technologies Pub Date : 2009-07-13 DOI: 10.1109/RIVF.2009.5174649
Minh Le Nguyen, François Sempé, Hô Tuòng Vinh, Jean-Daniel Zucker
{"title":"Mining Abstract Highly Correlated Pairs","authors":"Minh Le Nguyen, François Sempé, Hô Tuòng Vinh, Jean-Daniel Zucker","doi":"10.1109/RIVF.2009.5174649","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174649","url":null,"abstract":"Recommendation systems are essentially solving a prediction problem where, given that p items have already been selected or rated by a user, the goal is to propose k target items most likely to be appreciated by her/him. Many models have been proposed to identify these target items but the results are not always satisfactory in practice because they often only include the most popular items and ignore the “long tail” of items that are either less popular or new ones. This paper investigates the use of a type of domain abstraction to search for highly correlated pairs of abstract items that are then used to infer other target items of interest. The advantage of this approach is evaluated on the basis of real data showing better results compared to an approach only based on the concrete pairs. Basing on an empirical study we confirm that the accuracy improvement is linked to the relevance of the domain abstraction.","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":"128189733","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}
引用次数: 1
Adaptive Hybrid Mean Shift and Particle Filter 自适应混合均值移位和粒子滤波
2009 IEEE-RIVF International Conference on Computing and Communication Technologies Pub Date : 2009-07-13 DOI: 10.1109/RIVF.2009.5174615
Phong Le, A. Duong, Hai-Quan Vu, N. Pham
{"title":"Adaptive Hybrid Mean Shift and Particle Filter","authors":"Phong Le, A. Duong, Hai-Quan Vu, N. Pham","doi":"10.1109/RIVF.2009.5174615","DOIUrl":"https://doi.org/10.1109/RIVF.2009.5174615","url":null,"abstract":"The changing of dynamic models in object tracking can cause high errors in state estimation algorithms. In this paper, we propose a method, adaptive hybrid mean shift and particle filter (AHMSPF), to solve this problem. AHMSPF consists of three stages. First, the mean shift algorithm is employed to search an object candidate near the target state. Then, if this candidate is good enough, it will be used to adapt the particle filter parameters. Finally, the particle filter will estimate the target state based on these new parameters. Experimental results shown that our method has a better performance than the traditional particle filter.","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":"121721954","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}
引用次数: 2
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信