2010 5th International Symposium on Telecommunications最新文献_第10页

Modification of short length LT block coding technique by removing LT weaknesses with an equivalent matrix 用等效矩阵去除短长度LT分组编码弱点的改进

2010 5th International Symposium on Telecommunications Pub Date : 2010-12-01 DOI: 10.1109/ISTEL.2010.5734052

S. Hosseini, M. Akbari, A. Falahati

引用次数: 2

Robust phoneme recognition using MLP neural networks in various domains of MFCC features 基于MLP神经网络的多领域MFCC特征鲁棒性音素识别

2010 5th International Symposium on Telecommunications Pub Date : 2010-12-01 DOI: 10.1109/ISTEL.2010.5734123

S. Dabbaghchian, H. Sameti, Masoumeh P. Ghaemmaghami, B. BabaAli

引用次数: 9

A fuzzy description logic model for Intrusion Detection Systems 入侵检测系统的模糊描述逻辑模型

2010 5th International Symposium on Telecommunications Pub Date : 2010-12-01 DOI: 10.1109/ISTEL.2010.5734086

Zohreh Baniasadi, A. Sanei, M. Omidi

引用次数: 2

Application of ensemble models in web ranking 集成模型在网页排名中的应用

2010 5th International Symposium on Telecommunications Pub Date : 2010-12-01 DOI: 10.1109/ISTEL.2010.5734118

Homa Baradaran Hashemi, N. Yazdani, A. Shakery, Mahdi Pakdaman Naeini

{"title":"Application of ensemble models in web ranking","authors":"Homa Baradaran Hashemi, N. Yazdani, A. Shakery, Mahdi Pakdaman Naeini","doi":"10.1109/ISTEL.2010.5734118","DOIUrl":"https://doi.org/10.1109/ISTEL.2010.5734118","url":null,"abstract":"One of the most important parts of search engines is the ranking unit. Many different classical ranking algorithms based on content (such as TF-IDF and BM25) and connectivity (such as HITS and PageRank) have been used in web search engines to find pages in response to a user query. Although these algorithms have been developed to improve retrieval results, none of them can take advantage of power of contents as well as useful link structures. Thus, it remains a challenging research question how to effectively combine these available information to maximize search accuracy. In this study, we investigate the application of different ensemble models in ranking algorithms. Some of them are simple such as Sum, Product and Borda rule, and the others are more complicated methods. We present three complex ensemble approaches. The first one is OWA operator to merge the results of various ranking algorithms. In the second approach, a state-of-the-art method, simulated click-through data, is used to learn how to combine many content and connectivity features of web pages. Moreover, we present a modified version of SVM classifier customized for ranking problems as the third complex fusion approach. The proposed methods are evaluated using the LETOR and dotIR benchmark data sets. The experimental results show that in most of the cases ensemble methods give better results and the improvements are very encouraging. These results also show that the OWA and SVM fusion methods are promising respect to other ensemble models.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"73 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134354774","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

A low complexity and efficient face recognition approach in JPEG compressed domain using quantized coefficients 一种基于量化系数的JPEG压缩域低复杂度高效人脸识别方法

2010 5th International Symposium on Telecommunications Pub Date : 2010-12-01 DOI: 10.1109/ISTEL.2010.5734128

Alireza Sepas-Moghaddam, M. Moin, H. Rashidy Kanan

{"title":"A low complexity and efficient face recognition approach in JPEG compressed domain using quantized coefficients","authors":"Alireza Sepas-Moghaddam, M. Moin, H. Rashidy Kanan","doi":"10.1109/ISTEL.2010.5734128","DOIUrl":"https://doi.org/10.1109/ISTEL.2010.5734128","url":null,"abstract":"Computational and space complexities and storage space are amongst the most important issues in designing face recognition systems. A common method for storing images in face recognition systems is compressing images using JPEG standard. Usually, the compressed images are fully decompressed for recognition, so that the recognition process is done in decompressed domain. This procedure causes a high computational overhead. In this paper, we have studied the face recognition procedure using quantized coefficients in JPEG compressed domain for reducing the computational overhead caused by decompression process. In addition, in order to reduce the matching stage computational and space complexities, variance analysis and principle components analysis methods on quantized coefficients have been applied to reduce the dimension of images subspace. The experiments in this research have been done on four datasets of FERET database. Experimental results show that the proposed method outperforms existing methods in recognition rates, storage space, computational and space complexity aspects.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125753615","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

Analyzing delay limits of high-speed wireless ad hoc networks based on IEEE 802.11n 基于IEEE 802.11n的高速无线自组网时延限制分析

2010 5th International Symposium on Telecommunications Pub Date : 2010-12-01 DOI: 10.1109/ISTEL.2010.5734075

P. Teymoori, N. Yazdani, S. A. Hoseini, MohammadReza EffatParvar

{"title":"Analyzing delay limits of high-speed wireless ad hoc networks based on IEEE 802.11n","authors":"P. Teymoori, N. Yazdani, S. A. Hoseini, MohammadReza EffatParvar","doi":"10.1109/ISTEL.2010.5734075","DOIUrl":"https://doi.org/10.1109/ISTEL.2010.5734075","url":null,"abstract":"Recent advances in high-speed wireless LANs with physical layer (PHY) rates reaching 600Mbps make them ideal for multimedia applications. It has been shown that efficiency at medium access control (MAC) layer decreases with increasing the PHY rate. To achieve high efficiency, few researches have tried to use aggregation in which few packets are concatenated into a larger frame. The resultant frame is sent at once in order to reduce the media access protocol overhead. Unfortunately larger frames increase delays. Since demand for real-time data communication and delay-sensitive applications have become more critical, especially for high-speed networks, a thorough delay analysis is required to examine the effect of aggregation on delay in high-speed networks. In this paper, we propose an analytical model for examining packet delay in IEEE 802.11n networks in the saturation mode. To the best of our knowledge, this is the first work which focuses on packet delay analysis in the presence of aggregation. Analysis and simulation results show that packet delay increases in larger aggregation sizes, and IEEE 802.11n performs poorly in high rates in terms of packet delay. Moreover, based on two new metrics that we propose in the paper, it is shown that aggregation loses its effectiveness in higher rates.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123661653","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

Adaptive random puncturing based secure block turbo coding 基于自适应随机穿刺的安全块turbo编码

2010 5th International Symposium on Telecommunications Pub Date : 2010-12-01 DOI: 10.1109/ISTEL.2010.5734027

Mohammad Sadegh Daghighi, A. Payandeh, M. Aref

引用次数: 4

Determination of pitch range based on onset and offset analysis in modulation frequency domain 基于调制频域起始和偏置分析的基音范围确定

2010 5th International Symposium on Telecommunications Pub Date : 2010-12-01 DOI: 10.1109/ISTEL.2010.5734096

A. Mahmoodzadeh, H. R. Abutalebi, H. Soltanian-Zadeh, H. Sheikhzadeh

引用次数: 4

Alleviating the cold-start problem of recommender systems using a new hybrid approach 用一种新的混合方法缓解推荐系统的冷启动问题

2010 5th International Symposium on Telecommunications Pub Date : 2010-12-01 DOI: 10.1109/ISTEL.2010.5734161

Javad Basiri, A. Shakery, B. Moshiri, Morteza Zi Hayat

引用次数: 41

A hybrid mesh-tree peer-to-peer overlay structure for layered video streaming 用于分层视频流的混合网格树点对点覆盖结构

2010 5th International Symposium on Telecommunications Pub Date : 2010-12-01 DOI: 10.1109/ISTEL.2010.5734114

N. Tahghigh Jahromi, B. Akbari, A. Movaghar

引用次数: 8