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

The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)最新文献

筛选
英文 中文
Applying hidden topics in ranking social update streams on Twitter 在Twitter上的社交更新流排名中应用隐藏主题
The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF) Pub Date : 2013-11-01 DOI: 10.1109/RIVF.2013.6719890
T. Nguyen, Tri-Thanh Nguyen, Quang-Thuy Ha
{"title":"Applying hidden topics in ranking social update streams on Twitter","authors":"T. Nguyen, Tri-Thanh Nguyen, Quang-Thuy Ha","doi":"10.1109/RIVF.2013.6719890","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719890","url":null,"abstract":"As the number of users using Twitter1 increases, an user may have a lot of friends whose tweet (posting) list (also called as “social update stream” [5, 8, 18]) may overwhelm his/her homepage. This can lead to the situation where important tweets (i.e. the tweets the user is interested in) are pushed down on the list, thus, it takes time to find them. Social update stream ranking is a possible solution that puts important tweets on the top of the page, so that the user can easily read it. In this paper, we propose to apply hidden topics [1, 15, 20] in the Combined Regression Ranking algorithm [2] to rank social update streams. The proposed system works like a content based recommendation system. The experimental results show a significant improvement proving that our proposal is a suitable direction.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128197848","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
Enhancer prediction using distance aware kernels 使用距离感知核增强预测
The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF) Pub Date : 2013-11-01 DOI: 10.1109/RIVF.2013.6719867
Van-Thanh Hoang, Tu Minh Phuong
{"title":"Enhancer prediction using distance aware kernels","authors":"Van-Thanh Hoang, Tu Minh Phuong","doi":"10.1109/RIVF.2013.6719867","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719867","url":null,"abstract":"The regulation of gene expression is important for the development of living cells and their responses to environmental conditions. This mechanism is controlled, to a large extend, by transcription factors that bind to regulatory sequences, such as enhancers. The identification of enhancers is therefore important for understanding the regulatory networks within cells. In this paper, we propose new features and kernels that can be used with support vector machine (SVM) classifiers to predict enhancers from genomic sequences. These are based on general sequence features and kernels but are extended to incorporate the information about the distance between the features, thus can better capture the spatial preferences and combinatorial binding rules of transcription factors. Experiments on predicting enhancers in human and Caenorhabditis elegans show that, by combining the proposed features and kernels with SVM, our method achieves state-of-the-art accuracy and outperforms a leading enhancer prediction method.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116159936","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
DWT-Based Multi-Adaptive Image coding for Frame Memory Reduction in LCD Overdrive 基于dwt的多自适应图像编码用于LCD超速驱动的帧存储缩减
The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF) Pub Date : 2013-11-01 DOI: 10.1109/RIVF.2013.6719906
Tai Nguyen Huu, H. Thi, C. T. L. Dinh
{"title":"DWT-Based Multi-Adaptive Image coding for Frame Memory Reduction in LCD Overdrive","authors":"Tai Nguyen Huu, H. Thi, C. T. L. Dinh","doi":"10.1109/RIVF.2013.6719906","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719906","url":null,"abstract":"In this paper, DWT-Based Multi-Adaptive Image Coding (DBMAIC) is proposed to increase compression performance for Frame Memory Reduction in LCD Overdrive. The DBMAIC development is based on DWT-Based Adaptive Mode Selection (DAMS)[9] integrated with Adaptive-Threshold Technique (ATT). ATT is proposed to reduce blocking effect and increase adaptability of DAMS. Experimental results show that the performance of the proposed method is much better than DAMS and that of conventional schemes.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123816197","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
An ant colony optimization algorithm for solving Group Steiner Problem 求解群斯坦纳问题的蚁群优化算法
The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF) Pub Date : 2013-11-01 DOI: 10.1109/RIVF.2013.6719887
T. Nguyen, Phan-Thuan Do
{"title":"An ant colony optimization algorithm for solving Group Steiner Problem","authors":"T. Nguyen, Phan-Thuan Do","doi":"10.1109/RIVF.2013.6719887","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719887","url":null,"abstract":"Group Steiner Problem (GSP) is an important generalization of some basic NP-hard problems. Many complex real-world applications require solving the GSP in graphs modeling the topology of the given problem, such as: the design of Very Large Scale Integration (VLSI) circuits, the design of a minimal length irrigation network, and routing problems for wireless sensor networks. We show our design of a new algorithm based on an Ant Colony Optimization model to solve the GSP in general graphs. Our experimental results show that our method strongly outperforms the best other heuristic methods for GSP.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125212425","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
Improvement of naturalness for an HMM-based Vietnamese speech synthesis using the prosodic information 利用韵律信息改进基于hmm的越南语语音合成的自然度
The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF) Pub Date : 2013-11-01 DOI: 10.1109/RIVF.2013.6719907
Thanh-Son Phan, T. Duong, Anh-Tuan Dinh, T. Vu, C. Luong
{"title":"Improvement of naturalness for an HMM-based Vietnamese speech synthesis using the prosodic information","authors":"Thanh-Son Phan, T. Duong, Anh-Tuan Dinh, T. Vu, C. Luong","doi":"10.1109/RIVF.2013.6719907","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719907","url":null,"abstract":"Natural-sounding synthesized speech is goal of HMM-based Text-to-Speech systems. Besides using context dependent tri-phone units from a large corpus speech database, many prosody features have been used in full-context labels to improve naturalness of HMM-based Vietnamese synthesizer. In the prosodic specification, tone, part-of-speech (POS) and intonation information are considered not as important as positional information. Context-dependent information includes phoneme sequence as well as prosodic information because the naturalness of synthetic speech highly depends on the prosody such as pause, tone, intonation pattern, and segmental duration. In this paper, we propose decision tree questions that use context-dependent tones and investigate the impact of POS and intonation tagging on the naturalness of HMM-based voice. Experimental results show that our proposed method can improve naturalness of a HMM-based Vietnamese TTS through objective evaluation and MOS test.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127487488","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}
引用次数: 8
An efficient cascaded system for latent fingerprint recognition 一种高效的潜在指纹识别级联系统
The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF) Pub Date : 2013-11-01 DOI: 10.1109/RIVF.2013.6719879
Thi Huong Thuy Nguyen, H. Xuan, Ky Nguyen Ngoc, Le Minh Khoi
{"title":"An efficient cascaded system for latent fingerprint recognition","authors":"Thi Huong Thuy Nguyen, H. Xuan, Ky Nguyen Ngoc, Le Minh Khoi","doi":"10.1109/RIVF.2013.6719879","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719879","url":null,"abstract":"This paper proposes a cascaded scheme to improve the efficiency of latent fingerprint identification system. In this scheme, the feature set of latent fingerprint such as finger codes, basic patterns, ridge counts and minutia with their local structures are sequentially exploited in four cascaded layers. In the first layer, possible finger codes of latent fingerprint are recognized based on basic pattern features and then reordered to determine their database access priority. In the second layer, its minutiae are extracted and assessed to affine matching in the third layer. In the fourth layer, any case having too many candidates in the previous layer is further matched based on exploiting local structure in order to downsizing the result list. On the verification layer, the minutiae information and local structure of corresponding pairs are presented to human experts for further verification. Experimental results on C@FRIS database show that our proposed method obtains high matching accuracy and considerably low identification time.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125825238","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
Video sharing websites study Content characteristic analysis 视频分享网站研究内容特点分析
The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF) Pub Date : 2013-11-01 DOI: 10.1109/RIVF.2013.6719868
Nan Zhao, L. Baud, P. Bellot
{"title":"Video sharing websites study Content characteristic analysis","authors":"Nan Zhao, L. Baud, P. Bellot","doi":"10.1109/RIVF.2013.6719868","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719868","url":null,"abstract":"In this paper we present a recent study on video sharing websites. This study aims to understand their content characteristics. This could be useful to understand Internet users' behaviour and manage web resources in order to provide a better video sharing service. In our work, we improved an existing graph-sampling algorithm so that it could be more adapted to sample over the video sharing websites. We crawled over 13 millions videos on YouTube and DailyMotion. We re-classified YouTube and DailyMotion content with our new category system and analysed the content category distribution and popularity of these two websites. We find that content in the “Media” category takes a large proportion in both websites, and also that the content category popularity does not depend on its proportion. Besides we then analyse the video duration and figure out that most videos on the video sharing websites are short, within several minutes. We study video count of views as well and find that the distribution of video count of views can be approximated by a negative exponential distribution that is long-tailed. That is to say, most of videos have a small or medium count of views; only a few videos can have a count of views of a bigger order of magnitude.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128711896","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
Novel ultrasonic imaging modality based on circular integral data 基于圆积分数据的超声成像新模式
The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF) Pub Date : 2013-11-01 DOI: 10.1109/RIVF.2013.6719905
G. Rigaud, O. Olvera-Guerrero, M. Nguyen
{"title":"Novel ultrasonic imaging modality based on circular integral data","authors":"G. Rigaud, O. Olvera-Guerrero, M. Nguyen","doi":"10.1109/RIVF.2013.6719905","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719905","url":null,"abstract":"Among all the existing imaging technologies, ultra-sound imaging is the most widely used, due to its safe, cost-effectiveness, flexible and real-time nature. However for some object configurations involving geometric restrictions, the usual point by point scanning to image an object is not performing efficiently. We propose a solution to this problem based on the use of circular integral data generated along a circular path to reconstruct the image of the object under investigation. Similar circular integral data has occurred in Thermo/Opto/Photo-acoustic tomography as well as in Synthetic Aperture Radar (SAR) imaging where circular integral data is generated along a straight line path to image a landscape on the ground. We present the mathematical background of this new imaging technique, which has an exact reconstruction formula and give comparative simulation results to demonstrate its viability.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128712643","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
Interference compensation scheme using time domain replica signals for SP-MIMO/OFDM under large delay spread channel greater than GI 基于时域复制信号的SP-MIMO/OFDM大延迟扩频信道干扰补偿方案
The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF) Pub Date : 2013-11-01 DOI: 10.1109/RIVF.2013.6719863
Taichi Sakaue, T. Yoshimura, Y. Ida, C. Ahn, T. Omori, K. Hashimoto
{"title":"Interference compensation scheme using time domain replica signals for SP-MIMO/OFDM under large delay spread channel greater than GI","authors":"Taichi Sakaue, T. Yoshimura, Y. Ida, C. Ahn, T. Omori, K. Hashimoto","doi":"10.1109/RIVF.2013.6719863","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719863","url":null,"abstract":"In mobile communications, MIMO-OFDM transmission performance suffers severe degradation caused by the large delay spread channel greater than guard interval (GI). This is because the excess delay results in considerable inter-symbol interference (ISI) between adjacent symbols and inter-carrier-interference (ICI) among subcarrier in the same symbol. In the case of scattered pilot (SP), the interference of pilot signals causes the deterioration of channel estimation. In this paper, we propose the interference compensation scheme using the time domain replica signals.We make the time domain replica signals from detected signals and the excess channel impulse responses over GI. After compensation of the time domain replica signals and the received signals, we recalculate the channel state information (CSI) and the CSI is updated. Finally, we carry out the channel compensation with updated CSI for obtaining an accurate compensated signals.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133263080","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
首页 上一页
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学术文献互助群
群 号：481959085
Book学术官方微信