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

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

筛选
英文 中文
Topology Optimization for DHT-Based Application Layer Multicast 基于dht的应用层组播拓扑优化
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.6169842
H. Nguyen, Huong Bui Thi Lan, N. Nguyen
{"title":"Topology Optimization for DHT-Based Application Layer Multicast","authors":"H. Nguyen, Huong Bui Thi Lan, N. Nguyen","doi":"10.1109/rivf.2012.6169842","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169842","url":null,"abstract":"In recent years, Distributed Hash Tables (DHTs) attract a lot of attentions since they have many advantages such as good routing performance, scalability, fault tolerance, load balancing. Those properties make DHTs are suitable for deploying multicast services at application layer. However, early DHT-based multicast systems are insufficient in addressing a number of technical issues such as heterogeneous node capacity, large-scale multicast and dynamic membership. In this paper, we propose BAM-Chord: Bandwidth Adaptive Multicast over Chord, a DHT-based multicast system that focuses on host heterogeneity, scalability and fault tolerance. In our system, when a node joins into the system, it will And out an appropriate position (i.e. node identifier) on a BAM-Chord ring and create links to neighbor nodes based on node's bandwidth capacity such that the multicast tree can be built efficiently and balanced. Therefore, our system can utilize bandwidth of every node to reduce the depth of the multicast tree and take advantages of DHTs in maintaining the multicast tree.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"9 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":"117013294","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
A Modified Regularized Non-Negative Matrix Factorization for MovieLens 一种改进的正则化非负矩阵分解方法
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.6169831
H. Nguyen, T. Dinh
{"title":"A Modified Regularized Non-Negative Matrix Factorization for MovieLens","authors":"H. Nguyen, T. Dinh","doi":"10.1109/rivf.2012.6169831","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169831","url":null,"abstract":"This paper studies the matrix factorization technique for recommendation systems. The problem is to modify and apply non-negative matrix factorization to predict a rating that a user is likely to rate for an item in MovieLens dataset. First, based on the original randomize non-negative matrix factorization, we propose a new algorithm that discovers the features underlying the interactions between users and items. Then, in the experimentation section, we provide the numerical results of our proposed algorithms performed on the well-known MovieLens dataset. Besides, we suggest the optimization parameters which should be applied for Matrix Factorization to get good results on MovieLens. Comparison with other recent techniques in the literature shows that our algorithm is not only able to get high quality solutions but it also works well in the sparse rating domains.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"27 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":"114241445","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 Heuristic Algorithm for Finding the Closest Trio of 3-Colored Points from a Given Set of 3-Colored Points on Plane 平面上给定的三色点集合中最接近的三色点三组的启发式算法
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.6169857
Trung Nguyen, D. Duong
{"title":"A Heuristic Algorithm for Finding the Closest Trio of 3-Colored Points from a Given Set of 3-Colored Points on Plane","authors":"Trung Nguyen, D. Duong","doi":"10.1109/rivf.2012.6169857","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169857","url":null,"abstract":"The problem considering in this paper is as follows: Given n red points, m green points and p blue points on plane, how to find a trio of red-green-blue points such that the distance between them is smallest. This problem could be solved by an exhaustive search algorithm: test all trios of 3 different colored points and find the closest one. However, this algorithm has a big complexity: O(nmp). In this paper, we will present a heuristic algorithm with a better complexity to solve this problem. The heuristic algorithm is based on 2D Voronoi diagram.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"10 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":"114466715","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 Optimal Algorithm of Estimation Channel Combining Kalman Filter with Adaptive Guard Interval for Mobile WiMAX Standard 移动WiMAX标准中卡尔曼滤波与自适应保护间隔相结合的信道估计优化算法
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.6169848
Duc Quang Nguyen, P. Liên, Nguyen-Manh Thang, L. Tra
{"title":"An Optimal Algorithm of Estimation Channel Combining Kalman Filter with Adaptive Guard Interval for Mobile WiMAX Standard","authors":"Duc Quang Nguyen, P. Liên, Nguyen-Manh Thang, L. Tra","doi":"10.1109/rivf.2012.6169848","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169848","url":null,"abstract":"Mobile WiMAX (worldwide interoperability for microwave access) system has been recently applied widely in wireless communication systems [1]. WiMAX uses OFDM as a technical platform because of high spectral efficiency[2],[3]. In this paper, the channel estimation algorithms are studied for mobile WiMAX system. The comb-pilot structure is used for channel estimation algorithms. We constructed an optimal algorithm of channel estimation based on Kalman filter combining with GI(guard interval) optimization algorithm and then compared with LS (least square) estimator, Kalman estimator-fixed GI. The results showed that the Kalman estimator combining with guard interval optimization algorithm had the best performance in this paper.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"52 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":"130127245","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
Video Monitoring System: Counting People by Tracking 视频监控系统:通过跟踪统计人数
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.6169871
Dat Nguyen, Loc Huynh, T. Dinh, T. Dinh
{"title":"Video Monitoring System: Counting People by Tracking","authors":"Dat Nguyen, Loc Huynh, T. Dinh, T. Dinh","doi":"10.1109/rivf.2012.6169871","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169871","url":null,"abstract":"We present a video monitoring system to count the number of people in an open area such as an airport, a bus station, or a shopping mall using a single camera. Our system automatically infers the number of people based on a novel multi-people tracker. The tracking framework is formulated as a data association problem, in which the people are detected in every frame and then all of the detection responses are associated to form the right track for each person. The detection step is carried out by an efficient state-of-the-art method while the data association is done by using a hierarchical framework, in which the detection responses form short tracklets, the short tracklets form longer ones, and so on. After that the number of people is counted based on the number of tracklets, from which the number of entered and exited people is also addressed. Beyond the scope of this system, we also aim to assign the right person into the right track instead of counting them only by proposing a novel appearance model to help re-identify a person, especially after heavy occlusion. This proposed solution is equivalent to addressing the problem of ID switching in multi-target tracking. The system is tested in both indoor and outdoor environments and in public datasets together with our new dataset. We also compare different components in our framework and other state- of-the-art trackers.","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":"130222420","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
Extraction of Discriminative Patterns from Skeleton Sequences for Human Action Recognition 基于人体动作识别的骨骼序列判别模式提取
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.6169822
Tran Thang Thanh, Fan Chen, K. Kotani, H. Le
{"title":"Extraction of Discriminative Patterns from Skeleton Sequences for Human Action Recognition","authors":"Tran Thang Thanh, Fan Chen, K. Kotani, H. Le","doi":"10.1109/rivf.2012.6169822","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169822","url":null,"abstract":"Emergence of novel techniques, such as the invention of MS Kinect, enables reliable extraction of human skeletons from action videos. Taking skeleton data as inputs, we propose an approach in this paper to extract the discriminative patterns for efficient human action recognition. Each action is considered to consist of a series of unit actions, each of which is represented by a pattern. Given a skeleton sequence, we first automatically extract the key-frames for unit actions, and then label them as different patterns. We further use a statistical metric to evaluate the discriminative capability of each pattern, and define the bag of reliable patterns as local features for action recognition. Experimental results show that the extracted local descriptors could provide very high accuracy in the action recognition, which demonstrate the efficiency of our method in extracting discriminative patterns.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"13 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":"127520999","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}
引用次数: 24
Using Machine Translation for Recognizing Textual Entailment in Vietnamese Language 用机器翻译识别越南语文本蕴涵
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.6169828
Minh Quang Nhat Pham, Minh Le Nguyen, Akira Shimazu
{"title":"Using Machine Translation for Recognizing Textual Entailment in Vietnamese Language","authors":"Minh Quang Nhat Pham, Minh Le Nguyen, Akira Shimazu","doi":"10.1109/rivf.2012.6169828","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169828","url":null,"abstract":"Recognizing Textual Entailment (RTE) is a fundamental task in Natural Language Understanding. The task is to determine whether the meaning of a text can be inferred from the meaning of the other one. This paper explores the use of Machine Translation (MT) in recognizing textual entailment in texts written in Vietnamese. We present two methods of using Machine Translation for Vietnamese RTE. The first method integrates a MT component into front-end of an English RTE system. The second method uses a MT component to produce English translation of Vietnamese RTE data, and both original Vietnamese data and its translation are used to learn an entailment classifier. Experimental results achieve on Vietnamese RTE corpus built from RTE3 data set suggest that Machine Translation can help to improve Vietnamese RTE.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"28 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":"125063640","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}
引用次数: 9
Mining Disjunctive Rules in Dynamic Graphs 动态图中的析取规则挖掘
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.6169829
Kim-Ngan Nguyen, M. Plantevit, Jean-François Boulicaut
{"title":"Mining Disjunctive Rules in Dynamic Graphs","authors":"Kim-Ngan Nguyen, M. Plantevit, Jean-François Boulicaut","doi":"10.1109/rivf.2012.6169829","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169829","url":null,"abstract":"Recently, a generalization of association rules that hold in n-ary Boolean tensors has been proposed. Moreover, preliminary results concerning their application to dynamic relational graph analysis have been obtained. We build upon such a formalization to design more expressive local patterns in this special case of dynamic graph where the set of vertices remains unchanged though edges that connect them may appear or disappear at the different timestamps. To design the pattern domain of the so-called disjunctive rules, we have to design (a) the pattern language, (b) interestingness measures which serve as the counterpart of the popular support and confidence measures in standard association rules, and (c) an efficient algorithm that may compute every rule that satisfies some primitive constraints like minimal frequencies or minimal confidences. The approach is tested on real datasets and we discuss the expressivity and the relevancy of some computed disjunctive rules.","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":"129149496","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
Vietnamese Parsing with an Automatically Extracted Tree-Adjoining Grammar 一种自动提取树相邻语法的越南语解析
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.6169832
Hong Phuong Le, Huyen Thi Minh Nguyen, A. Roussanaly
{"title":"Vietnamese Parsing with an Automatically Extracted Tree-Adjoining Grammar","authors":"Hong Phuong Le, Huyen Thi Minh Nguyen, A. Roussanaly","doi":"10.1109/rivf.2012.6169832","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169832","url":null,"abstract":"This paper presents the construction and evaluation of a deep syntactic parser based on Lexicalized Tree-Adjoining Grammars for the Vietnamese language. This is a complete system integrating necessary tools to process Vietnamese text, which permits to take as input raw texts and produce syntactic structures. A dependency annotation scheme for Vietnamese and an algorithm for extracting dependency structures from derivation trees are also proposed. At present, this is the first Vietnamese parsing system capable of producing both constituency and dependency analyses with encouraging performances: 69.33% and 73.21% for constituency and dependency analysis accuracy, respectively.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"69 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":"130745293","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}
引用次数: 21
Vietnamese Diacritics Restoration as Sequential Tagging 越南语变音符恢复作为顺序标记
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.6169816
N. Trung, Q. Nguyen, N. Phuong
{"title":"Vietnamese Diacritics Restoration as Sequential Tagging","authors":"N. Trung, Q. Nguyen, N. Phuong","doi":"10.1109/rivf.2012.6169816","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169816","url":null,"abstract":"Diacritics restoration is the process of restoring original script from diacritic-free script by correct insertion of diacritics. In this paper, this problem is casted as a sequential tagging task where each term is tagged with its own accents. We did careful evaluations on three domains of Vietnamese: writing language, spoken language and literature using two methods: conditional random fields (CRFs) and support vector machines (SVMs), and achieved promising results. We also investigated two levels of lexical: learning from letters and learning from syllables. Although the former performs poorly than the latter, it shows stable results in all three language domains. Therefore, the letter level approach is more useful when we have to deal with unknown words or when words in a sentence are reordered and repeated to achieve stylistic and artistic effect.","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":"132862082","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
首页 上一页 下一页 尾页
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学术官方微信