Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies最新文献

筛选
英文 中文
Enhancing the Quality of Inserted 3D Object into a Video 提高插入到视频中的3D对象的质量
Trinh Hien Anh, D. Nhung, Ha Manh Toan
{"title":"Enhancing the Quality of Inserted 3D Object into a Video","authors":"Trinh Hien Anh, D. Nhung, Ha Manh Toan","doi":"10.1109/RIVF.2019.8713724","DOIUrl":"https://doi.org/10.1109/RIVF.2019.8713724","url":null,"abstract":"Inserting 3d object into a real video is one of major task in an augmented reality system. To enhance the real quality, inserted object usually added with the environment effects. In this paper, we proposed a technique to enhance the quality of inserted object by adding its shadow. Experiments show the effectiveness of our proposal method.","PeriodicalId":171525,"journal":{"name":"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132845600","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
Hardware Implementation of the Efficient SOR-Based Massive MIMO Detection for Uplink 基于sor的上行链路高效海量MIMO检测的硬件实现
Chong Nhat Cuong, T. Tran, D. Lam
{"title":"Hardware Implementation of the Efficient SOR-Based Massive MIMO Detection for Uplink","authors":"Chong Nhat Cuong, T. Tran, D. Lam","doi":"10.1109/RIVF.2019.8713667","DOIUrl":"https://doi.org/10.1109/RIVF.2019.8713667","url":null,"abstract":"In Massive MIMO's uplink, the signal detection algorithms such as minimum mean square error (MMSE), zero-forcing (ZF) achieve nearly optimal result, but they use inverse matrix in design, the complexity in calculation is very large. In this paper, we propose an efficient algorithm based on the SOR (Successive over Relaxation) algorithm with the better performance than the conventional SOR-based algorithm. The obtained result shows that the performance of the efficient SOR-based algorithm is better than the conventional SOR-based algorithm and close to MMSE algorithm. Besides, we propose the hardware architecture for the proposed SOR-hased algorithm.","PeriodicalId":171525,"journal":{"name":"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126881004","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 Deep Learning Method for Lung Segmentation on Large Size Chest X-Ray Image 基于深度学习的大尺寸胸部x射线图像肺分割方法
H. T. Huynh, Vo Nguyen Nhat Anh
{"title":"A Deep Learning Method for Lung Segmentation on Large Size Chest X-Ray Image","authors":"H. T. Huynh, Vo Nguyen Nhat Anh","doi":"10.1109/RIVF.2019.8713648","DOIUrl":"https://doi.org/10.1109/RIVF.2019.8713648","url":null,"abstract":"","PeriodicalId":171525,"journal":{"name":"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122145960","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}
引用次数: 10
Identifying reduplicative words for Vietnamese word segmentation 越南语分词中重复词的识别
T. Anh, N. Thai, Dao Thanh Tinh, N. Quan
{"title":"Identifying reduplicative words for Vietnamese word segmentation","authors":"T. Anh, N. Thai, Dao Thanh Tinh, N. Quan","doi":"10.1109/RIVF.2015.7049878","DOIUrl":"https://doi.org/10.1109/RIVF.2015.7049878","url":null,"abstract":"This paper proposes a method based on linguistic word-formation rules and dictionaries for determining reduplicative words in Vietnamese. The key idea for identifying whether adjacent syllables in a text can form a reduplicative word based on its formation rules. For 2-syllable reduplicative words, this paper uses rules that describe the repeating and the opposing between pairs of initial consonants, rhymes and tones. Then the method is expanded to identify reduplicative words that have 3 or 4 syllables from 2-syllable ones for the Vietnamese word segmentation task. Experimental results showed that the F1-score was improved to 98.61% and that word segmentation errors were reduced significantly, 1.26%.","PeriodicalId":171525,"journal":{"name":"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121257307","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
Soft Input Trust Output 软输入信任输出
N. Zivic
{"title":"Soft Input Trust Output","authors":"N. Zivic","doi":"10.1109/rivf.2012.6169843","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169843","url":null,"abstract":"The scenario is considered, where a message with its Message Authentication Code is transmitted over a noisy channel. The usage of a forward error correcting channel code is assumed, which reduces the error rate, but no repeat mechanism to correct the remaining errors (ARQ). The uncorrected errors cause the rejection of messages with a wrong MAC. This paper introduces the extension of „hard“ verification of MACs, whose result is „true“ or „false“, to „soft“ verification, that outputs a trust level as verification result. This allows the acceptance of corrected messages and their MACs, even if a few bits of the MAC are different from the expected value. This is comparable to the situation that handwritten signatures are accepted as long as they are not too different from a reference. The costs are a loss of trust, which has to be considered. Therefore “Trust Output” is accompanied with the output of the verification process. A definition of „Trust Level” will be given, together with an algorithm of „soft” verification, which provides such Trust Output. This algorithm is based on a Soft Output channel decoder, which provides a reliability value for each bit, which is used as soft input for the proposed algorithm. Therefore we call the algorithm „Soft Input Trust Output”. Simulation results show an essential improvement of the acceptance rate of MACs at the cost of a reduced trust level. The reduction can be calculated and the maximum permitted reduction of the trust level can be preset. Keywords-component; Data integrity, MAC, H_MAC, Forward Error Correction, SISO channel decoder, Hamming distance, Soft Input Decryption, trust level","PeriodicalId":171525,"journal":{"name":"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies","volume":"135 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":"126805792","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 Intermediate Library for Multi-GPUs Computing Skeletons 多gpu计算骨架的中间库
D. Le, Huu-Duc Nguyen, T. Pham, Huy Hoang Ngo, Minh Thap Nguyen
{"title":"An Intermediate Library for Multi-GPUs Computing Skeletons","authors":"D. Le, Huu-Duc Nguyen, T. Pham, Huy Hoang Ngo, Minh Thap Nguyen","doi":"10.1109/rivf.2012.6169863","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169863","url":null,"abstract":"","PeriodicalId":171525,"journal":{"name":"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies","volume":"8 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":"127779698","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
A Knowledge-Driven Educational Decision Support System 知识驱动的教育决策支持系统
Thi Ngoc Chau Vo, Hua Phung Nguyen
{"title":"A Knowledge-Driven Educational Decision Support System","authors":"Thi Ngoc Chau Vo, Hua Phung Nguyen","doi":"10.1109/rivf.2012.6169819","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169819","url":null,"abstract":"Education always plays an important role in building up every country around the world. Hence, educational decision making support is significant to students, educators, and educational organizations. The support will be more valuable if a lot of relevant data and knowledge mined from data are available for educational managers in their decision making process. Nevertheless, educational decision support system development is non-trivial and different from organization to organization due to the peculiar features of each educational organization. Besides, an academic credit system is nowadays very widely-used in many educational organizations. Due to the flexibility of a credit system of education, applying data mining techniques to educational data for knowledge discovery is challenging. In this paper, we propose a knowledge-driven educational decision support system for education with a semester credit system by taking advantage of educational data mining. During system development, we have figured out that knowledge discovery from educational data in a semester credit system is full of many problems remaining unsolved with a semester credit system. Tackling those problems, our resulting system can provide educational managers with actionable knowledge discovered from educational data. Such knowledge-driven decision support is helpful for educational managers to make more appropriate and reasonable decisions about student’s study and further give support to students for their graduation. Above all, a waste of effort, time, and money can be avoided accordingly for both students and educators. Keywords-educational decision support system; knowledgedriven decision support system; data-driven decision support system; educational data mining; actionable knowledge","PeriodicalId":171525,"journal":{"name":"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies","volume":"64 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":"121285822","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}
引用次数: 25
eBATMAN: An Emulator-BAsed Testbed for Studying Mobile Ad-Hoc Network Security eBATMAN:一种基于模拟器的移动自组织网络安全研究测试平台
Trung Nguyen, Hoai-Nam Nguyen, Y. Shinoda
{"title":"eBATMAN: An Emulator-BAsed Testbed for Studying Mobile Ad-Hoc Network Security","authors":"Trung Nguyen, Hoai-Nam Nguyen, Y. Shinoda","doi":"10.1109/RIVF.2010.5632442","DOIUrl":"https://doi.org/10.1109/RIVF.2010.5632442","url":null,"abstract":"Doing research on mobile ad hoc network (MANET) security involves several constraints, some of which are wireless environment's attributes, such as bandwidth and delay, and the correctness of network topology. Testing and evaluating using real wireless devices are costly and somehow impractical, so many tools have been developed in order to create media by which researchers can deeply investigate different aspects of network security. On software view, recently simulators gain much attention because they provide very detailed low-level models to network behaviors; however, they lack of some physical wireless characteristics. On the other hand, hardware view, emulators are presented to solve the shortcomings posed by simulators by providing a virtual wireless network at low level, and to support real code pieces that can be executed. In this paper, we propose a testbed supporting a highly realistic wireless environment for evaluation of MANET security. One of the features which best distinguishes our testbed from other is that it provides ability to emulate a MANET from layer 2 up while other ones cannot. Furthermore, our testbed integrates flexible configurability as well as deployment and it has effective mechanisms to generate different attacking scenarios. At last, the quality of our testbed is also shown in its ability to offer readiness in deploying various kinds of attack methods thus easier for us to evaluate jobs done.","PeriodicalId":171525,"journal":{"name":"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116644548","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
Structure of Association Rule Set Based on Min-Min Basic Rules 基于最小最小基本规则的关联规则集结构
Tin C. Truong, Anh N. Tran, Thong Tran
{"title":"Structure of Association Rule Set Based on Min-Min Basic Rules","authors":"Tin C. Truong, Anh N. Tran, Thong Tran","doi":"10.1109/RIVF.2010.5633246","DOIUrl":"https://doi.org/10.1109/RIVF.2010.5633246","url":null,"abstract":"In this paper, we partition the association rule set into disjoint equivalence rule classes. Each of them contains rules having the same confidence and then it is split into basic and consequence rule sets based on the order relation on it. Basic rule set, which includes minimal elements according to this relation, is directly found by our algorithm MG_BARS. In addition, by adding appropriate eliminable itemsets to both sides of basic rules in our algorithm MG_CARS, the consequence rules are completely and non-repeatedly generated and are confidence-preserved. Results of the experiments proved the efficiency of the above algorithms.","PeriodicalId":171525,"journal":{"name":"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114758092","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
Automating a Real-World University Timetabling Problem with Tabu Search Algorithm 用禁忌搜索算法自动求解现实世界大学排课问题
Khang Nguyen, Dang Nguyen, Khon Trieu, Nuong Tran
{"title":"Automating a Real-World University Timetabling Problem with Tabu Search Algorithm","authors":"Khang Nguyen, Dang Nguyen, Khon Trieu, Nuong Tran","doi":"10.1109/RIVF.2010.5632720","DOIUrl":"https://doi.org/10.1109/RIVF.2010.5632720","url":null,"abstract":"University timetabling problem is hard combinatorial optimization problem that has been considered by several metaheuristics researchers. This paper applies Tabu Search algorithm, which is one of the most popular metaheuristics that have efficiently solved many hard combinatorial problem like timetabling, to a real-world university timetabling problem in Vietnam. The algorithm is tested on nine real-world instances and experimental results are generally better than handmade timetables being used in practice","PeriodicalId":171525,"journal":{"name":"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132943382","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
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学术官方微信