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

2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future最新文献

筛选
英文 中文
Gabor Wavelet-Based Appearance Models 基于Gabor小波的外观模型
2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future Pub Date : 2012-03-15 DOI: 10.1109/rivf.2012.6169865
Kha Gia Quach, C. Duong, Khoa Luu, H. Le
{"title":"Gabor Wavelet-Based Appearance Models","authors":"Kha Gia Quach, C. Duong, Khoa Luu, H. Le","doi":"10.1109/rivf.2012.6169865","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169865","url":null,"abstract":"There has been considerable research in the last several years based on the principles of Active Appearance Models (AAMs). AAM is a robust methodology for general image (object) descriptions that incorporates shape and texture information. In this work, we extend the basic AAMs by developing a new method for texture description for the application of human facial modeling and synthesizing. The premise is to develop a better texture based model for the face that incorporates specific facial information such as wrinkling, micro-features (e.g., moles, scares, freckles, etc.), and aging features (e.g., sagging, hollowing of checks, weight gain, etc.) This paper proposes a new improvement in texture synthesis-Gabor Wavelet-based Appearance Model. The experimental results demonstrate the potential of this approach for face-based applications.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115391872","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}
引用次数: 3
Exploiting Non-Parallel Corpora for Statistical Machine Translation 利用非平行语料库进行统计机器翻译
2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future Pub Date : 2012-03-15 DOI: 10.1109/rivf.2012.6169833
Cuong Hoang, Anh-Cuong Le, Phuong-Thai Nguyen, T. Ho
{"title":"Exploiting Non-Parallel Corpora for Statistical Machine Translation","authors":"Cuong Hoang, Anh-Cuong Le, Phuong-Thai Nguyen, T. Ho","doi":"10.1109/rivf.2012.6169833","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169833","url":null,"abstract":"Constructing a corpus of parallel sentence pairs is an important work in building a Statistical Machine Translation system. It impacts deeply how the quality of a Statistical Machine Translation could achieve. The more parallel sentence pairs we use to train the system, the better translation's quality it is. Nowadays, comparable non-parallel corpora become important resources to alleviate scarcity of parallel corpora. The problem here is how to extract parallel sentence pairs automatically but accurately from comparable non-parallel corpora, which are usually very \"noisy\". This paper presents how we can apply the reinforcement-learning scheme with our new proposed algorithm for detecting parallel sentence pairs. We specify that from an initial set of parallel sentences in a domain, the proposed model can extract a large number of new parallel sentence pairs from non-parallel corpora resources in different domains, concurrently increasing the system's translation ability gradually.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117204256","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
An Experimental Study about Efficiency of the Approximation Algorithms for Minimum Latency Problem 最小延迟问题近似算法效率的实验研究
2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future Pub Date : 2012-03-15 DOI: 10.1109/rivf.2012.6169860
H. Ban, N. D. Nghia
{"title":"An Experimental Study about Efficiency of the Approximation Algorithms for Minimum Latency Problem","authors":"H. Ban, N. D. Nghia","doi":"10.1109/rivf.2012.6169860","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169860","url":null,"abstract":"Minimum Latency Problem is a class of combinational optimization problems which have many practical applications. In general, the problem is proved to be NP-hard and unless P = NP, a polynomial time approximation scheme is unlikely to exist. Therefore, using approximation algorithm is a suitable approach for solving the problem. In recent times, several approximation algorithms were proposed. However, efficiency of the algorithms was only evaluated in a theoretical manner. They did not indicate real approximation ratio, running time in reality and there is a lack of comparison between the algorithms from experiments. In addition, quality of lower bound, which was an important part of the algorithms, was not mentioned. In an approach to fulfill these omissions, we implemented the algorithms on several test data to evaluate and compare real efficiency of them in terms of real ratio, running time and quality of lower bound.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114141610","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
An Approach to Word Sense Disambiguation in English-Vietnamese-English Statistical Machine Translation 英越英统计机器翻译中词义消歧方法研究
2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future Pub Date : 2012-03-15 DOI: 10.1109/rivf.2012.6169839
Quy T. Nguyen, An Nguyen, Dinh Dien
{"title":"An Approach to Word Sense Disambiguation in English-Vietnamese-English Statistical Machine Translation","authors":"Quy T. Nguyen, An Nguyen, Dinh Dien","doi":"10.1109/rivf.2012.6169839","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169839","url":null,"abstract":"The most difficult problem of machine translation (MT) in general and statistical machine translation (SMT) in particular is to select the correct meaning of the polysemous words. Their correct meaning mainly depends on the context and the topic of the text. Therefore, to improve the quality of SMT by resolving semantic ambiguity of words, we integrate more knowledge about the topic of the text, part-of-speech (POS) and morphology. We applied this model to English-Vietnamese- English SMT system and BLEU scores increased over 6% compared with the baseline general SMT system, which was not integrated information about the topic or other language knowledge.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116876453","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
Heuristics to Solve a Real-World Asymmetric Vehicle Routing Problem with Side Constraints 具有侧约束的非对称车辆路径问题的启发式求解
2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future Pub Date : 2012-03-15 DOI: 10.3233/FI-2014-990
S. Pham, V. Gascon, T. Dinh
{"title":"Heuristics to Solve a Real-World Asymmetric Vehicle Routing Problem with Side Constraints","authors":"S. Pham, V. Gascon, T. Dinh","doi":"10.3233/FI-2014-990","DOIUrl":"https://doi.org/10.3233/FI-2014-990","url":null,"abstract":"To maintain patients at home as most as possible, healthcare services are nowadays quite diversified. We present the case of a public medical clinic offering activities, mostly to the elderly, at a daycare center. Users are brought into the daycare center by bus or by taxi. The global problem consists in defining routes to pick up users while assigning them to time slots in the week. At first sight this problem could be viewed as an asymmetric multiple vehicle routing problem. However many additional constraints must be considered. In this paper, we propose 2 approaches: the first one is the combination of sweep algorithm and negotiation heuristic, and the second one is a modified version of the saving heuristic. These two algorithms are tested on 10 problem instances. Experimental results and their comparison are presented.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124960424","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
On Relationship between Quality of Experience and Quality of Service Metrics for IMS-Based IPTV Networks 基于ims的IPTV网络体验质量与服务质量指标的关系研究
2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future Pub Date : 2012-03-15 DOI: 10.1109/rivf.2012.6169844
T. Truong, Tai-Hung Nguyen, H. Nguyen
{"title":"On Relationship between Quality of Experience and Quality of Service Metrics for IMS-Based IPTV Networks","authors":"T. Truong, Tai-Hung Nguyen, H. Nguyen","doi":"10.1109/rivf.2012.6169844","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169844","url":null,"abstract":"To let the service system react quickly on customers' perception or user experience while using the service, mapping functions between QoE and QoS are strongly required in purpose of building up an intelligent QoE control system upon adjusting QoS parameters. This paper studies the changing behavior of QoE with respect to changes of QoS parameters in the context of video streaming service in an IMS-based IPTV network. QoE in both terms of Mean Opinion Scores and VQM is studied as functions of loss, jitter, and delay. The QoE-QoS correlation could be a significant first step to build a smart QoE monitoring and control mechanism as an added value to promote the IMS- based IPTV network.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130594484","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
Which Behavior Is Best in a Fire Evacuation: Simulation with the Metro Supermarket of Hanoi 火灾疏散中哪种行为最好:以河内地铁超市为例的模拟
2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future Pub Date : 2012-03-15 DOI: 10.1109/rivf.2012.6169851
M. Nguyen, Hô Tuòng Vinh, Thi Ngoc Anh Nguyen, Jean-Daniel Zucker
{"title":"Which Behavior Is Best in a Fire Evacuation: Simulation with the Metro Supermarket of Hanoi","authors":"M. Nguyen, Hô Tuòng Vinh, Thi Ngoc Anh Nguyen, Jean-Daniel Zucker","doi":"10.1109/rivf.2012.6169851","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169851","url":null,"abstract":"A problem arises in many fire evacuations, especially in a public site like a supermarket: what is better, following the one's own path, following the crowd, or following the evacuation signs which indicate the evacuation direction? This paper presents a model and simulations of these three behaviors in the realistic environment of the Metro supermarket of Hanoi. The simulations indicate that in case of a fire evacuation of the Metro supermarket of Hanoi: the average time to escape in case of following the evacuation signs is shorter and the power lost is lower than following the own path or following the crowd. Additionally, in the general view, following the evacuation signs got higher the % of survivals and lower the % of death than following the one's own path or following the crowd.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130602141","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
A Novel Technological Imaging Process Using Ionizing Radiation Properties 一种利用电离辐射特性的新型成像技术
2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future Pub Date : 2012-03-15 DOI: 10.1109/rivf.2012.6169873
M. Nguyen, Christian Faye, G. Rigaud, T. Truong
{"title":"A Novel Technological Imaging Process Using Ionizing Radiation Properties","authors":"M. Nguyen, Christian Faye, G. Rigaud, T. Truong","doi":"10.1109/rivf.2012.6169873","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169873","url":null,"abstract":"Diverse imaging technologies have been invented during the last decades to uncover the hidden parts of objects of interest for diagnostic, evaluation, accident prevention, etc. The key issue is to produce a faithful image of details buried in the bulk of matter. In this work we describe a new way to achieve this goal by cleverly exploiting the propagation property of gamma radiation in material medium. The proposed scanning device is simple and can rapidly collect measurements necessary to reconstruct the sought image. The relevance and reliability of this procedure is demonstrated by efficient algorithms and numerical simulations.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116273881","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}
引用次数: 4
An Improvement of Minimized Assumption Generation Method for Component-Based Software Verification 基于构件的软件验证最小假设生成方法的改进
2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future Pub Date : 2012-03-15 DOI: 10.1109/rivf.2012.6169862
Pham Ngoc Hung, Viet-Ha Nguyen, Toshiaki Aoki, T. Katayama
{"title":"An Improvement of Minimized Assumption Generation Method for Component-Based Software Verification","authors":"Pham Ngoc Hung, Viet-Ha Nguyen, Toshiaki Aoki, T. Katayama","doi":"10.1109/rivf.2012.6169862","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169862","url":null,"abstract":"The minimized assumption generation has been recognized as an improved method of the assume-guarantee verification for generating minimal assumptions. This method is not only fitted to component-based software but also has a potential to solve the state space explosion problem in model checking. However, the computational cost for generating the minimal assumption is very high so the method is difficult to be applied in practice. This paper presents an optimization as a continuous work of the minimized assumption generation method in order to reduce the complexity of the method. The key idea of this method is to find a smaller assumption in a sub-tree of the search tree containing the candidate assumptions using the depth-limited search strategy. With this approach, the improved method can generate smaller assumptions with a lower computational cost and consumption memory than the minimized method. The generated assumptions are also effective for rechecking the systems at much lower computational cost in the context of software evolution. We have implemented a tool supporting the improved method. Experimental results are also presented and discussed.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134280603","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}
引用次数: 7
An Operational Meta-Model for Handling Multiple Scales in Agent-Based Simulations 基于智能体的多尺度模拟的操作元模型
2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future Pub Date : 2012-03-15 DOI: 10.1109/rivf.2012.6169849
Duc-An Vo, A. Drogoul, Jean-Daniel Zucker
{"title":"An Operational Meta-Model for Handling Multiple Scales in Agent-Based Simulations","authors":"Duc-An Vo, A. Drogoul, Jean-Daniel Zucker","doi":"10.1109/rivf.2012.6169849","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169849","url":null,"abstract":"There is a growing interest for multi-scale agent-based modeling. The research community has made several efforts in proposing agent-based simulators or meta-models, which accommodate for multi-scale agent-based modeling. Unfortunately, the proposed simulators are often tight to a specific model. And the proposed meta-models exist only as formal proposals without a concrete implementation supported by an operational modeling language. The lack of a common operational meta-model and an associated operational modeling language raises the question of reusability and increase the danger of \"re-inventing the wheel\" when one develops new models. Moreover, the operational semantics of such multi-scale models may differ without having defined a solid theoretical ground. Our research aims at proposing a generic meta-model for multi-scale agent-based modeling. In our approach, we revisit the fundamental notions of agent modeling (agent/environment/scheduler) in order to support a recursive representation of these notions in an agent-based model. To test the operational semantic of the proposed model, we implement this meta-model as an agent-based modeling language in the GAMA simulation platform. This paper presents such a meta- model and how its concepts can be used to formalize multi-scale agent-based models.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"3 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133700947","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}
引用次数: 30
下一页 尾页
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学术官方微信