Mobile setting’s particularities and limitations are serious. In fact, enhancing the mobile browsing user experience is feasible only if perceptual and contextual considerations are employed. A case study of a context-aware location-based application is designed and implemented in this paper. It is capable to identify and to depict on the map user’s current location, to search and detect routes (and to mark on the map the user’s preferred route while he is in move), to display various user personal points of interest/attractions, along user’s current route, and to edit user’s personal selections regarding attractions. It is a customized application, based on Microsoft MapPoint Web Service technology, since each user receives information which is strictly related to his identity. Users are certainly may benefit from such personalized services and have access only to information of specific context without being annoyed with needless operations.
移动环境的特殊性和局限性是严重的。事实上，增强移动浏览用户体验是可行的，只有在感知和上下文考虑的情况下。本文设计并实现了一个基于上下文感知的位置应用程序。它能够识别并在地图上描绘用户当前的位置，搜索和检测路线(并在地图上标记用户移动时的首选路线)，沿着用户当前路线显示各种用户个人兴趣点/景点，并编辑用户关于景点的个人选择。它是一个基于Microsoft MapPoint Web Service技术的定制应用程序，因为每个用户接收的信息都与他的身份严格相关。用户当然可以从这种个性化服务中受益，并且只访问特定上下文的信息，而不会被不必要的操作所困扰。
{"title":"Mobile Commerce Application Development: Implementing Location-Aware Information Services","authors":"C. Georgiadis","doi":"10.1109/AICT.2009.64","DOIUrl":"https://doi.org/10.1109/AICT.2009.64","url":null,"abstract":"Mobile setting’s particularities and limitations are serious. In fact, enhancing the mobile browsing user experience is feasible only if perceptual and contextual considerations are employed. A case study of a context-aware location-based application is designed and implemented in this paper. It is capable to identify and to depict on the map user’s current location, to search and detect routes (and to mark on the map the user’s preferred route while he is in move), to display various user personal points of interest/attractions, along user’s current route, and to edit user’s personal selections regarding attractions. It is a customized application, based on Microsoft MapPoint Web Service technology, since each user receives information which is strictly related to his identity. Users are certainly may benefit from such personalized services and have access only to information of specific context without being annoyed with needless operations.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115722476","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}
This work study four symbol phase synchronizers namely the analog, hybrid, combinational and sequential.These four synchronizers will be tested with three different input sequences (deterministic and pseudo random). The sequences are the deterministic P1=21 (one and zero ‘1-0’), the deterministic P2=22 (two ones and two zeros ‘11-00’) and the pseudo random P7=27-1. The objective is to study the four synchronizers and to avaluate their jitter UI-RMS (Unit Interval Root Mean Squared) versus input SNR (Signal- Noise Ratio), when the input sequence changes between P1, P2 and P7.
{"title":"Symbol Phase Synchronizers Tested with Different Input Sequences","authors":"A. Reis, J. F. Rocha, A. Gameiro, J. P. Carvalho","doi":"10.1109/AICT.2009.36","DOIUrl":"https://doi.org/10.1109/AICT.2009.36","url":null,"abstract":"This work study four symbol phase synchronizers namely the analog, hybrid, combinational and sequential.These four synchronizers will be tested with three different input sequences (deterministic and pseudo random). The sequences are the deterministic P1=21 (one and zero ‘1-0’), the deterministic P2=22 (two ones and two zeros ‘11-00’) and the pseudo random P7=27-1. The objective is to study the four synchronizers and to avaluate their jitter UI-RMS (Unit Interval Root Mean Squared) versus input SNR (Signal- Noise Ratio), when the input sequence changes between P1, P2 and P7.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124792914","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}
The paper presents a new method for determining traffic characteristics of multi-stage switching networks with threshold mechanisms. The proposed method makes it possible to calculate point-to-group blocking probability in switching networks with multirate traffic. The basis of the proposed method is an effective availability conception. The results of analytical calculations are compared with simulation data.
{"title":"Point-to-Group Blocking Probability in Switching Networks with Threshold Mechanisms","authors":"M. Głąbowski, M. Sobieraj","doi":"10.1109/AICT.2009.22","DOIUrl":"https://doi.org/10.1109/AICT.2009.22","url":null,"abstract":"The paper presents a new method for determining traffic characteristics of multi-stage switching networks with threshold mechanisms. The proposed method makes it possible to calculate point-to-group blocking probability in switching networks with multirate traffic. The basis of the proposed method is an effective availability conception. The results of analytical calculations are compared with simulation data.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121080486","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}
Aymen Ayari, H. Khedher, M. Ayadi, H. Ez‐zahraouy, S. Tabbane
In this work, we have studied the behavior and mobility of a cellular network subscriber who belong to a determined class such as (personal employee, student, retired and others) between different areas. Our contribution in this work is a proposition of a mobility model that reproduce in deterministic case, the possible traffic of cellular network subscriber between specified areas with different velocity. Our model incorporate many parameters, such as area size, the number of subscribers, areas types, subscribers types, moving velocity and the direction of users moving. The result obtained show us that the behavior of mobile station in a cellular network can be approximated to a vehicular traffic model.
{"title":"Modeling of Cellular Network Subscriber Mobility","authors":"Aymen Ayari, H. Khedher, M. Ayadi, H. Ez‐zahraouy, S. Tabbane","doi":"10.1109/AICT.2009.80","DOIUrl":"https://doi.org/10.1109/AICT.2009.80","url":null,"abstract":"In this work, we have studied the behavior and mobility of a cellular network subscriber who belong to a determined class such as (personal employee, student, retired and others) between different areas. Our contribution in this work is a proposition of a mobility model that reproduce in deterministic case, the possible traffic of cellular network subscriber between specified areas with different velocity. Our model incorporate many parameters, such as area size, the number of subscribers, areas types, subscribers types, moving velocity and the direction of users moving. The result obtained show us that the behavior of mobile station in a cellular network can be approximated to a vehicular traffic model.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121502666","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}
In a previous study we proposed a modified version of the recursive least-square (RLS) adaptive algorithm suitable for fixed-point implementation. Using an asymptotically unbiased estimator for the algorithm's cost function we reduced the dynamic range of this parameter. In this paper, we extend the procedure for the case of QR-decomposition-based least-squares lattice (QRD-LSL) adaptive algorithm, a "fast" member of RLS family, with good numerical properties. The reduced dynamics of the algorithm’s parameters leads to facility for fixed-point implementation. The simulations performed on a fixed-point digital signal processor (DSP) sustain the practical aspects of the theoretical findings.
{"title":"QRD-LSL Adaptive Alogrithms Suitable for Fixed-Point Implementation","authors":"C. Paleologu, A. Enescu, S. Ciochină, F. Albu","doi":"10.1109/AICT.2009.34","DOIUrl":"https://doi.org/10.1109/AICT.2009.34","url":null,"abstract":"In a previous study we proposed a modified version of the recursive least-square (RLS) adaptive algorithm suitable for fixed-point implementation. Using an asymptotically unbiased estimator for the algorithm's cost function we reduced the dynamic range of this parameter. In this paper, we extend the procedure for the case of QR-decomposition-based least-squares lattice (QRD-LSL) adaptive algorithm, a \"fast\" member of RLS family, with good numerical properties. The reduced dynamics of the algorithm’s parameters leads to facility for fixed-point implementation. The simulations performed on a fixed-point digital signal processor (DSP) sustain the practical aspects of the theoretical findings.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126887217","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}
We will study the effects of the analog and digital previous pulse on the synchronizer jitter.We consider two previous pulse (analog or digital) with filter followed of the synchronizer. The synchronizer is one of four carrier PLL (Phase Lock Loop) namely the analog, the hybrid, the combinational and the sequential.The main objective is to observe for the various carrier PLL, their output jitter UIRMS (Unit Interval Root Mean Squared) versus input SNR (Signal to Noise Ratio).
{"title":"Effects of the Analog and Digital Previous Pulse with Filter on the Synchronizer","authors":"A. Reis, J. F. Rocha, A. Gameiro, J. P. Carvalho","doi":"10.1109/AICT.2009.31","DOIUrl":"https://doi.org/10.1109/AICT.2009.31","url":null,"abstract":"We will study the effects of the analog and digital previous pulse on the synchronizer jitter.We consider two previous pulse (analog or digital) with filter followed of the synchronizer. The synchronizer is one of four carrier PLL (Phase Lock Loop) namely the analog, the hybrid, the combinational and the sequential.The main objective is to observe for the various carrier PLL, their output jitter UIRMS (Unit Interval Root Mean Squared) versus input SNR (Signal to Noise Ratio).","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134489911","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}
Mohammed I. Asseri, S. L. Goff, C. Tsimenidis, B. Sharif
Directed Selected Mapping (dSLM) is a well known Peak-to-Average Power Ratio (PAPR) reduction scheme for Multiple-Input Multiple-Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) systems. Although such technique provides an extremely effective PAPR reduction, the receiver has not been previously considered in previous research under the assumption of no side information. The transmission data with side information is considered as a drawback, especially when this technique increases the data rate due to the use of channel codes. This also results in a high system complexity and transmission delay. In this proposal, dSLM recovery is modified for Zero-Forcing (ZF) and Zero-Forcing-Vertical Bell Labs Layered Space-Time (ZF-V-BLAST) schemes. The contribution in this paper is twofold; firstly, the transmitted phase vector is recovered without side information whilst maintaining bit error rate performance. Secondly, receiver complexity is reduced.
定向选择映射(dSLM)是多输入多输出(MIMO)正交频分复用(OFDM)系统中一种众所周知的峰均功率比(PAPR)降低方案。虽然这种技术提供了非常有效的PAPR降低，但在以前的研究中，在没有侧信息的假设下，接收器尚未被考虑。带有侧信息的传输数据被认为是一个缺点，特别是当该技术由于使用信道码而增加数据速率时。这也导致了系统的高复杂性和传输延迟。在这个方案中，dSLM恢复被修改为零强迫(ZF)和零强迫-垂直贝尔实验室分层时空(ZF- v - blast)方案。本文的贡献是双重的;首先，在保持误码率性能的同时，恢复传输的相位矢量，使其不含侧信息。其次，降低了接收方的复杂度。
{"title":"Efficient Recovery of dSLM in MIMO-OFDM without Side Information","authors":"Mohammed I. Asseri, S. L. Goff, C. Tsimenidis, B. Sharif","doi":"10.1109/AICT.2009.33","DOIUrl":"https://doi.org/10.1109/AICT.2009.33","url":null,"abstract":"Directed Selected Mapping (dSLM) is a well known Peak-to-Average Power Ratio (PAPR) reduction scheme for Multiple-Input Multiple-Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) systems. Although such technique provides an extremely effective PAPR reduction, the receiver has not been previously considered in previous research under the assumption of no side information. The transmission data with side information is considered as a drawback, especially when this technique increases the data rate due to the use of channel codes. This also results in a high system complexity and transmission delay. In this proposal, dSLM recovery is modified for Zero-Forcing (ZF) and Zero-Forcing-Vertical Bell Labs Layered Space-Time (ZF-V-BLAST) schemes. The contribution in this paper is twofold; firstly, the transmitted phase vector is recovered without side information whilst maintaining bit error rate performance. Secondly, receiver complexity is reduced.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130489488","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}
Video based applications and services usually require at some stage a reliable video quality evaluation method that can give an estimate for the human perceived video quality. While most research is performed in the area of human visual system modeling, we propose a quality metric which first estimates the perceptually important areas using the key elements that attract the attention: color contrast, object size, orientation and eccentricity. The visual attention model implemented here performs as a bottom-up attentional mechanism. For the salient areas detected, a distortion measure is then computed using a specialized no-reference metric. We propose an embedded reference-free video quality metric and show that it outperforms the standard peak signal to noise ratio in evaluating the perceived video quality. The results are also shown to correlate with the subjective results obtained for several test sequences.
{"title":"Perceptual Video Quality Assessment Based on Salient Region Detection","authors":"C. Oprea, I. Pirnog, C. Paleologu, R. Udrea","doi":"10.1109/AICT.2009.46","DOIUrl":"https://doi.org/10.1109/AICT.2009.46","url":null,"abstract":"Video based applications and services usually require at some stage a reliable video quality evaluation method that can give an estimate for the human perceived video quality. While most research is performed in the area of human visual system modeling, we propose a quality metric which first estimates the perceptually important areas using the key elements that attract the attention: color contrast, object size, orientation and eccentricity. The visual attention model implemented here performs as a bottom-up attentional mechanism. For the salient areas detected, a distortion measure is then computed using a specialized no-reference metric. We propose an embedded reference-free video quality metric and show that it outperforms the standard peak signal to noise ratio in evaluating the perceived video quality. The results are also shown to correlate with the subjective results obtained for several test sequences.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115153552","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}
M. Stefanovic, D. Krstić, J. Anastasov, S. Panic, A. Matovic
In this paper the performance analysis of signal-to-interference ratio (SIR) based Selection Combining (SC) diversity system over α-μ fading distributed and correlated channels is presented. Formulae for the output SIR’s probability density function (pdf) and cumulative distribution function (cdf) are derived. Also, the results presented in the paper include all important scenarios of triple SC diversity systems, which is main contribution of this paper. Analytical and numerical results are obtained for triple SC pointing out the effects of fading severity and correlation on the system performances.
{"title":"Analysis of SIR-based Triple SC System over Correlated Alpha-Mu Fading Channels","authors":"M. Stefanovic, D. Krstić, J. Anastasov, S. Panic, A. Matovic","doi":"10.1109/AICT.2009.58","DOIUrl":"https://doi.org/10.1109/AICT.2009.58","url":null,"abstract":"In this paper the performance analysis of signal-to-interference ratio (SIR) based Selection Combining (SC) diversity system over α-μ fading distributed and correlated channels is presented. Formulae for the output SIR’s probability density function (pdf) and cumulative distribution function (cdf) are derived. Also, the results presented in the paper include all important scenarios of triple SC diversity systems, which is main contribution of this paper. Analytical and numerical results are obtained for triple SC pointing out the effects of fading severity and correlation on the system performances.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"270 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116497424","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}
Bandwidth reservation in mobile wireless networks is a very challenging task due to the instability of radio channels, node mobility and lack of coordination between mobile nodes. Previously proposed reservation MAC protocols reserve a slot to each real-time source assuming that the source will use the reserved slot in each super-frame. Since different applications may have different bandwidth requirements, the previous assumption may result in bandwidth wasting. In this paper, we propose BRPHT protocol which reserves bandwidth to traffic sources based on their individual bandwidth requirements. Different nodes may share the same slot, thus our protocol avoids wasting bandwidth in the presence of multimedia applications with different bandwidth requirements. Simulation results illustrate the effectiveness of our protocol.
{"title":"Bandwidth Reservation for Heterogeneous Traffics in Mobile Wireless Networks","authors":"G. Boudour, C. Teyssié, Z. Mammeri","doi":"10.1109/AICT.2009.53","DOIUrl":"https://doi.org/10.1109/AICT.2009.53","url":null,"abstract":"Bandwidth reservation in mobile wireless networks is a very challenging task due to the instability of radio channels, node mobility and lack of coordination between mobile nodes. Previously proposed reservation MAC protocols reserve a slot to each real-time source assuming that the source will use the reserved slot in each super-frame. Since different applications may have different bandwidth requirements, the previous assumption may result in bandwidth wasting. In this paper, we propose BRPHT protocol which reserves bandwidth to traffic sources based on their individual bandwidth requirements. Different nodes may share the same slot, thus our protocol avoids wasting bandwidth in the presence of multimedia applications with different bandwidth requirements. Simulation results illustrate the effectiveness of our protocol.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123824727","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
扫码关注我们
求助内容：
应助结果提醒方式：