Pub Date : 2011-07-13DOI: 10.1109/CEEC.2011.5995837
L. Carrea, R. C. Almeida, K. Guild
Bloom filters have been recently proposed as an efficient multicast forwarding mechanism for the information centric topic-based publish/subscribe network proposed within the framework of the PSIRP project. Although such mechanism presents several advantages, as for instance very simple forwarding decisions and small forwarding tables, one of the limitations is the possibility of false positive occurrences during the forwarding decisions. This results in packets to be sent along unexpected links and the consequently wastage of network bandwidth among other effects. Therefore, its frequency must be minimized. One of the crucial points to reduce false positives in Bloom Filters is carefully select the number of hash functions utilized to create them. In this paper, we propose a mathematical analysis of the false positives in the whole network with respect to the number of hash functions. In particular, the number of hash functions correspondent to a minimum of false positive for the whole network is evaluated. Results from the mathematical analysis are compared with numerical analysis.
{"title":"A qualitative method to optimise false positive occurrences for the in-packet Bloom filter forwarding mechanism","authors":"L. Carrea, R. C. Almeida, K. Guild","doi":"10.1109/CEEC.2011.5995837","DOIUrl":"https://doi.org/10.1109/CEEC.2011.5995837","url":null,"abstract":"Bloom filters have been recently proposed as an efficient multicast forwarding mechanism for the information centric topic-based publish/subscribe network proposed within the framework of the PSIRP project. Although such mechanism presents several advantages, as for instance very simple forwarding decisions and small forwarding tables, one of the limitations is the possibility of false positive occurrences during the forwarding decisions. This results in packets to be sent along unexpected links and the consequently wastage of network bandwidth among other effects. Therefore, its frequency must be minimized. One of the crucial points to reduce false positives in Bloom Filters is carefully select the number of hash functions utilized to create them. In this paper, we propose a mathematical analysis of the false positives in the whole network with respect to the number of hash functions. In particular, the number of hash functions correspondent to a minimum of false positive for the whole network is evaluated. Results from the mathematical analysis are compared with numerical analysis.","PeriodicalId":409910,"journal":{"name":"2011 3rd Computer Science and Electronic Engineering Conference (CEEC)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128765364","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}
Pub Date : 2011-07-01DOI: 10.1109/CEEC.2011.5995821
Ismail Amin Ali, M. Fleury, S. Moiron, M. Ghanbari
Intra-refresh is an efficient error resiliency technique that protects against temporal error propagation resulting from transmission errors. Classic periodic intra-coded frames can add some protection and additionally facilitate random access, but within mobile networks with bandwidth constraints their disadvantages may outweigh their advantages. By analyzing the received video quality across a variety of video clips it becomes apparent that, for semi-active video sequences, cyclic intra-coded line placement results in superior video quality in the face of errors. For more active sequences, the quality gain is reduced but, for an equivalent constant bitrate, usually remains better than periodic intra-coded frames. This suggests a video streaming scheme which is content-dependent, turning on intra-refresh MB line when channel conditions and content type warrant it.
{"title":"Content dependent intra-refresh placement for video streaming","authors":"Ismail Amin Ali, M. Fleury, S. Moiron, M. Ghanbari","doi":"10.1109/CEEC.2011.5995821","DOIUrl":"https://doi.org/10.1109/CEEC.2011.5995821","url":null,"abstract":"Intra-refresh is an efficient error resiliency technique that protects against temporal error propagation resulting from transmission errors. Classic periodic intra-coded frames can add some protection and additionally facilitate random access, but within mobile networks with bandwidth constraints their disadvantages may outweigh their advantages. By analyzing the received video quality across a variety of video clips it becomes apparent that, for semi-active video sequences, cyclic intra-coded line placement results in superior video quality in the face of errors. For more active sequences, the quality gain is reduced but, for an equivalent constant bitrate, usually remains better than periodic intra-coded frames. This suggests a video streaming scheme which is content-dependent, turning on intra-refresh MB line when channel conditions and content type warrant it.","PeriodicalId":409910,"journal":{"name":"2011 3rd Computer Science and Electronic Engineering Conference (CEEC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126112110","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}
Pub Date : 2011-07-01DOI: 10.1109/CEEC.2011.5995822
Mahmoud El-Haj, Udo Kruschwitz, C. Fox
In this paper we present our generic extractive Arabic and English multi-document summarisers. We also describe the use of machine translation for evaluating the generated Arabic multi-document summaries using English extractive gold standards. In this work we first address the lack of Arabic multi-document corpora for summarisation and the absence of automatic and manual Arabic gold-standard summaries. These are required to evaluate any automatic Arabic summarisers. Second, we demonstrate the use of Google Translate in creating an Arabic version of the DUC-2002 dataset. The parallel Arabic/English dataset is summarised using the Arabic and English summarisation systems. The automatically generated summaries are evaluated using the ROUGE metric, as well as precision and recall. The results we achieve are compared with the top five systems in the DUC-2002 multi-document summarisation task.
{"title":"Multi-document arabic text summarisation","authors":"Mahmoud El-Haj, Udo Kruschwitz, C. Fox","doi":"10.1109/CEEC.2011.5995822","DOIUrl":"https://doi.org/10.1109/CEEC.2011.5995822","url":null,"abstract":"In this paper we present our generic extractive Arabic and English multi-document summarisers. We also describe the use of machine translation for evaluating the generated Arabic multi-document summaries using English extractive gold standards. In this work we first address the lack of Arabic multi-document corpora for summarisation and the absence of automatic and manual Arabic gold-standard summaries. These are required to evaluate any automatic Arabic summarisers. Second, we demonstrate the use of Google Translate in creating an Arabic version of the DUC-2002 dataset. The parallel Arabic/English dataset is summarised using the Arabic and English summarisation systems. The automatically generated summaries are evaluated using the ROUGE metric, as well as precision and recall. The results we achieve are compared with the top five systems in the DUC-2002 multi-document summarisation task.","PeriodicalId":409910,"journal":{"name":"2011 3rd Computer Science and Electronic Engineering Conference (CEEC)","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122073496","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}
Pub Date : 2011-07-01DOI: 10.1109/CEEC.2011.5995826
D. Mahmoodi, H. Marvi, M. Taghizadeh, Ali Gholipour Soleimani, F. Razzazi, M. Mahmoodi
Age estimation based on human's speech features is an interesting subject in Automatic Speech Recognition (ASR) systems. There are some works in literature on speaker age estimation but it needs more new works especially for Persian speakers. In age estimation, like other speech processing systems, we encounter with two main challenges: finding an appropriate procedure for feature extraction, and selecting a reliable method for pattern classification. In this paper we propose an automatic age estimation system for classification of 6 age groups of various Persian speaker people. Perceptual Linear Predictive (PLP) and Mel-Frequency Cepstral Coefficients (MFCC) are extracted as speech features and SVM is utilized for classification procedure. Furthermore the effects of variations in parameter of kernel function, time of frame length in sampling process, the number of MFCC coefficients, and the order of PLP on system efficiency has been evaluated, and the results has been compared.
{"title":"Age estimation based on speech features and support vector machine","authors":"D. Mahmoodi, H. Marvi, M. Taghizadeh, Ali Gholipour Soleimani, F. Razzazi, M. Mahmoodi","doi":"10.1109/CEEC.2011.5995826","DOIUrl":"https://doi.org/10.1109/CEEC.2011.5995826","url":null,"abstract":"Age estimation based on human's speech features is an interesting subject in Automatic Speech Recognition (ASR) systems. There are some works in literature on speaker age estimation but it needs more new works especially for Persian speakers. In age estimation, like other speech processing systems, we encounter with two main challenges: finding an appropriate procedure for feature extraction, and selecting a reliable method for pattern classification. In this paper we propose an automatic age estimation system for classification of 6 age groups of various Persian speaker people. Perceptual Linear Predictive (PLP) and Mel-Frequency Cepstral Coefficients (MFCC) are extracted as speech features and SVM is utilized for classification procedure. Furthermore the effects of variations in parameter of kernel function, time of frame length in sampling process, the number of MFCC coefficients, and the order of PLP on system efficiency has been evaluated, and the results has been compared.","PeriodicalId":409910,"journal":{"name":"2011 3rd Computer Science and Electronic Engineering Conference (CEEC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121270661","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：