In this paper, we look at the combined effect of spatial and temporal correlation on low complexity max log MAP detector in the scenario of interference suppression. We consider narrowband MIMO channel which experiences spatially and temporally correlated wide sense stationary Rayleigh fading. Employing moment generating function (MGF)-based approach, we derive upper bounds of coded pairwise error probability (PEP) and study the effect of spatial and temporal correlation in the presence of non Gaussian interference. Analytical results are then validated by simulations.
{"title":"Effect of Temporal Correlation in the Presence of Spatial Correlation on Interference Suppression","authors":"Rizwan Ghaffar, R. Knopp","doi":"10.1109/ICDT.2010.36","DOIUrl":"https://doi.org/10.1109/ICDT.2010.36","url":null,"abstract":"In this paper, we look at the combined effect of spatial and temporal correlation on low complexity max log MAP detector in the scenario of interference suppression. We consider narrowband MIMO channel which experiences spatially and temporally correlated wide sense stationary Rayleigh fading. Employing moment generating function (MGF)-based approach, we derive upper bounds of coded pairwise error probability (PEP) and study the effect of spatial and temporal correlation in the presence of non Gaussian interference. Analytical results are then validated by simulations.","PeriodicalId":322589,"journal":{"name":"2010 Fifth International Conference on Digital Telecommunications","volume":"22 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120862055","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}
C. Burileanu, Andi Buzo, Cristina Sorina Petre, Diana Ghelmez-Haneş, H. Cucu
This paper presents studies and early results with the scope to build a robust spontaneous speech recognition system in Romanian language. We have tried to give solutions to several issues that have arisen like building a large and accurate database within a reasonable time. A short description of the database is given and some statistics are collected in order to show its evolution in several stages of the project. Embedded training technique has been used for training triphones. As a consequence, the alignment problem has been studied and a solution is proposed for it. The final purpose of these attempts is to obtain substantial results in speech recognition for Romanian language that can be used as baseline for further results.
{"title":"Romanian Spoken Language Resources and Annotation for Speaker Independent Spontaneous Speech Recognition","authors":"C. Burileanu, Andi Buzo, Cristina Sorina Petre, Diana Ghelmez-Haneş, H. Cucu","doi":"10.1109/ICDT.2010.9","DOIUrl":"https://doi.org/10.1109/ICDT.2010.9","url":null,"abstract":"This paper presents studies and early results with the scope to build a robust spontaneous speech recognition system in Romanian language. We have tried to give solutions to several issues that have arisen like building a large and accurate database within a reasonable time. A short description of the database is given and some statistics are collected in order to show its evolution in several stages of the project. Embedded training technique has been used for training triphones. As a consequence, the alignment problem has been studied and a solution is proposed for it. The final purpose of these attempts is to obtain substantial results in speech recognition for Romanian language that can be used as baseline for further results.","PeriodicalId":322589,"journal":{"name":"2010 Fifth International Conference on Digital Telecommunications","volume":"01 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124424112","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}
With the migration from analog systems to digital systems, video surveillance is widely used now in safety and security systems. The number of cameras is so high now that the operators surveying each video stream are not sufficient. Many companies currently propose systems that analyze the video stream for sending automatically event messages for intrusion, abnormal comportment or situation. We develop a framework with web services, enterprise Java Beans [6] and a complex event processor bean to manage all video event messages. This new framework allows the integration of new generation of video surveillance systems with more flexibility, scalability, interoperability and productivity.
{"title":"A Service Oriented Framework Architecture for Intelligent Video Surveillance Systems","authors":"D. Ravier","doi":"10.1109/ICDT.2010.30","DOIUrl":"https://doi.org/10.1109/ICDT.2010.30","url":null,"abstract":"With the migration from analog systems to digital systems, video surveillance is widely used now in safety and security systems. The number of cameras is so high now that the operators surveying each video stream are not sufficient. Many companies currently propose systems that analyze the video stream for sending automatically event messages for intrusion, abnormal comportment or situation. We develop a framework with web services, enterprise Java Beans [6] and a complex event processor bean to manage all video event messages. This new framework allows the integration of new generation of video surveillance systems with more flexibility, scalability, interoperability and productivity.","PeriodicalId":322589,"journal":{"name":"2010 Fifth International Conference on Digital Telecommunications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132436239","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 paper presents a novel multiwavelet-based stereo correspondence matching technique. A multiwavelet transform is first applied to a pair of stereo images to decorrelate the images into a number of approximation (baseband) and detail subbands. Information in the basebands is less sensitive to shift variability of the multiwavelet transform. Basebands of each input image carry different spectral content of the image. Therefore, using the basebands to generate the disparity map is likely to produce more accurate results. A global error energy minimization technique is employed to generate a disparity map for each baseband of the stereo pairs. Information in the resulting disparity maps is then combined using a Fuzzy algorithm to construct a dense disparity map. A filtering process is finally applied to smooth the disparity map and reduce its erroneous matches. Middlebury stereo test images are used to generate experimental results. Results show that the proposed technique produces smoother disparity maps with less mismatch errors compared to applying the same global error energy minimization technique to wavelet transformed image data.
{"title":"Stereo Correspondence Matching Using Multiwavelets","authors":"P. B. Zadeh, C. Serdean","doi":"10.1109/ICDT.2010.37","DOIUrl":"https://doi.org/10.1109/ICDT.2010.37","url":null,"abstract":"this paper presents a novel multiwavelet-based stereo correspondence matching technique. A multiwavelet transform is first applied to a pair of stereo images to decorrelate the images into a number of approximation (baseband) and detail subbands. Information in the basebands is less sensitive to shift variability of the multiwavelet transform. Basebands of each input image carry different spectral content of the image. Therefore, using the basebands to generate the disparity map is likely to produce more accurate results. A global error energy minimization technique is employed to generate a disparity map for each baseband of the stereo pairs. Information in the resulting disparity maps is then combined using a Fuzzy algorithm to construct a dense disparity map. A filtering process is finally applied to smooth the disparity map and reduce its erroneous matches. Middlebury stereo test images are used to generate experimental results. Results show that the proposed technique produces smoother disparity maps with less mismatch errors compared to applying the same global error energy minimization technique to wavelet transformed image data.","PeriodicalId":322589,"journal":{"name":"2010 Fifth International Conference on Digital Telecommunications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133876464","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 studies the effects of the prefilter bandwidth in the sequential symbol synchronizers based on pulse comparation at half rate.We consider three different prefilter bandwidth namely B1=•, B2=2.tx and B3=1.tx, where tx is the bit rate.We consider also four synchronizers, where two operate at the rate with versions manual (b-m) and automatic (b-a) and two operate at half rate with versions manual (b-m/2) and automatic (b-a/2).The objective is to study the synchronizers and evaluate the output jitter UIRMS (Unit Interval Root Mean Square) versus the input SNR (Signal Noise Ratio).
{"title":"Prefilter Bandwidth Effects in Sequential Symbol Synchronizers Based on Pulse Comparation at Half Rate","authors":"A. Reis, J. F. Rocha, A. Gameiro, J. P. Carvalho","doi":"10.1109/ICDT.2010.38","DOIUrl":"https://doi.org/10.1109/ICDT.2010.38","url":null,"abstract":"This work studies the effects of the prefilter bandwidth in the sequential symbol synchronizers based on pulse comparation at half rate.We consider three different prefilter bandwidth namely B1=•, B2=2.tx and B3=1.tx, where tx is the bit rate.We consider also four synchronizers, where two operate at the rate with versions manual (b-m) and automatic (b-a) and two operate at half rate with versions manual (b-m/2) and automatic (b-a/2).The objective is to study the synchronizers and evaluate the output jitter UIRMS (Unit Interval Root Mean Square) versus the input SNR (Signal Noise Ratio).","PeriodicalId":322589,"journal":{"name":"2010 Fifth International Conference on Digital Telecommunications","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121121555","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 fundamental operational principle of the Bit-Torrent protocol is based on peers sharing partial data. That is, peers download data they don’t have, while uploading data they have already downloaded. The protocol allows peers to get some data to get them started. Free-riders exploit such aspects of the protocol to maximize their downloads and minimize uploads, resulting in crippling the system and benefiting only themselves. This paper looks at free-riding in detail, and presents experimental results that show the benefits of an enhancement to mitigate free-riding.
{"title":"Mitigating Free-Riding on BitTorrent Networks","authors":"Tim Ge, S. Manoharan","doi":"10.1109/ICDT.2010.18","DOIUrl":"https://doi.org/10.1109/ICDT.2010.18","url":null,"abstract":"The fundamental operational principle of the Bit-Torrent protocol is based on peers sharing partial data. That is, peers download data they don’t have, while uploading data they have already downloaded. The protocol allows peers to get some data to get them started. Free-riders exploit such aspects of the protocol to maximize their downloads and minimize uploads, resulting in crippling the system and benefiting only themselves. This paper looks at free-riding in detail, and presents experimental results that show the benefits of an enhancement to mitigate free-riding.","PeriodicalId":322589,"journal":{"name":"2010 Fifth International Conference on Digital Telecommunications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130146376","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}
D. Z. Rodríguez, R. L. Rosa, Pedro Hélio Medeiros de Lima
The increasing use of mobile devices in wireless environments led to many studies about power-aware algorithms and protocols to improve the lifetime of device’s battery. This paper studies the implementation and testing of a new power-aware algorithm, PSWA, associated with a Cache System, and tested with the WRP routing protocol, in a Mobile Ad hoc Network scenario. A scheme that does not use the sleep schedule for the nodes it was used, nodes automatically fall asleep if they do not deal with data and routes. In the simulation scenario the WRP was chosen because it has a better performance in real-time traffic, and this type of traffic is commonly used today. The simulation results show an important decrease in energy consumption close to 10% with the association of the new power-aware algorithm.
{"title":"New Cache System-Based Power-Aware Algorithm in MANET","authors":"D. Z. Rodríguez, R. L. Rosa, Pedro Hélio Medeiros de Lima","doi":"10.1109/ICDT.2010.24","DOIUrl":"https://doi.org/10.1109/ICDT.2010.24","url":null,"abstract":"The increasing use of mobile devices in wireless environments led to many studies about power-aware algorithms and protocols to improve the lifetime of device’s battery. This paper studies the implementation and testing of a new power-aware algorithm, PSWA, associated with a Cache System, and tested with the WRP routing protocol, in a Mobile Ad hoc Network scenario. A scheme that does not use the sleep schedule for the nodes it was used, nodes automatically fall asleep if they do not deal with data and routes. In the simulation scenario the WRP was chosen because it has a better performance in real-time traffic, and this type of traffic is commonly used today. The simulation results show an important decrease in energy consumption close to 10% with the association of the new power-aware algorithm.","PeriodicalId":322589,"journal":{"name":"2010 Fifth International Conference on Digital Telecommunications","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131663497","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}
Personal Network (PN) is a person-centric network, which creates a distributed environment of a person and provides access to personal resources and services regardless the location of the person. A Federation of Personal Networks (Fednet) is a group-oriented network of PNs. Since behind each PN there is a person, i.e., the PN owner, the cooperation of the PNs reflects the social behavior of the PN owners and therefore a Fednet can be seen as a social network of PNs. In this paper, we look at the Fednets from the ‘social’ angle and discuss how the Fednets can benefit from using reputation. We propose a reputation-based framework for Fednets and present ideas on applying reputation information for service management and reward mechanisms in Fednets to improve the quality of cooperation between the PNs.
个人网络(PN)是一个以人为中心的网络，它创造了一个分布式的个人环境，并提供了对个人资源和服务的访问，而不管这个人在哪里。个人网络联盟(Federation of Personal Networks, Fednet)是一种面向群体的pn网络。由于每个PN的背后都有一个人，即PN的所有者，因此PN的合作反映了PN所有者的社会行为，因此Fednet可以看作是PN的社会网络。在本文中，我们从“社会”的角度来看待联邦储备银行，并讨论联邦储备银行如何从使用声誉中受益。我们提出了一个基于声誉的联邦网点框架，并提出了将声誉信息应用于联邦网点的服务管理和奖励机制的想法，以提高各网点之间的合作质量。
{"title":"Reputation-Based Service Management and Reward Mechanisms in Fednets to Improve the Quality of Cooperation between Personal Networks","authors":"Malohat Ibrohimovna, S. Groot","doi":"10.1109/ICDT.2010.26","DOIUrl":"https://doi.org/10.1109/ICDT.2010.26","url":null,"abstract":"Personal Network (PN) is a person-centric network, which creates a distributed environment of a person and provides access to personal resources and services regardless the location of the person. A Federation of Personal Networks (Fednet) is a group-oriented network of PNs. Since behind each PN there is a person, i.e., the PN owner, the cooperation of the PNs reflects the social behavior of the PN owners and therefore a Fednet can be seen as a social network of PNs. In this paper, we look at the Fednets from the ‘social’ angle and discuss how the Fednets can benefit from using reputation. We propose a reputation-based framework for Fednets and present ideas on applying reputation information for service management and reward mechanisms in Fednets to improve the quality of cooperation between the PNs.","PeriodicalId":322589,"journal":{"name":"2010 Fifth International Conference on Digital Telecommunications","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131533144","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}
As communications services are evolving, users are increasingly faced with a confusion of devices, subscriptions and numbers. Consumers are growing to expect ubiquitous, constant connectivity and access to all manner of information applications. Service providers, large and small, must simultaneously find ways to offset the declines in traditional sources of revenues while drive top-line growth. Fixed Mobile Convergence (FMC) solutions are promising to offers advantages for both consumers and service providers and is gaining momentum in the marketplace as operators are realizing the market opportunities for creating new revenue-generating services. FMC solutions are promising to deliver the long awaited hand off of calls/calling features between wire-line and wireless networks. This article first defines the concept of FMC and it then several prominent concepts in the fixed mobile-convergence are analyzed. The article l addresses the business model, architecture, competitive and technological issues and summarizes the progress being made toward this network evolution.
{"title":"FMC: The Convergence of Networks, Devices and Services","authors":"A. Yarali, Anna Cherry, B. Ahsant","doi":"10.1109/ICDT.2010.20","DOIUrl":"https://doi.org/10.1109/ICDT.2010.20","url":null,"abstract":"As communications services are evolving, users are increasingly faced with a confusion of devices, subscriptions and numbers. Consumers are growing to expect ubiquitous, constant connectivity and access to all manner of information applications. Service providers, large and small, must simultaneously find ways to offset the declines in traditional sources of revenues while drive top-line growth. Fixed Mobile Convergence (FMC) solutions are promising to offers advantages for both consumers and service providers and is gaining momentum in the marketplace as operators are realizing the market opportunities for creating new revenue-generating services. FMC solutions are promising to deliver the long awaited hand off of calls/calling features between wire-line and wireless networks. This article first defines the concept of FMC and it then several prominent concepts in the fixed mobile-convergence are analyzed. The article l addresses the business model, architecture, competitive and technological issues and summarizes the progress being made toward this network evolution.","PeriodicalId":322589,"journal":{"name":"2010 Fifth International Conference on Digital Telecommunications","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133508742","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}
Ring Road NoC (R2NoC), which was motivated by smooth flow of traffic in interconnected ring roads, is the base for this paper. Router design and routing algorithm for R2NoC is much simpler. In this paper we have developed the R2NOC's algorithm of routing in two ways. One of them is finding the shortest way between source and destination (θ algorithm) and as the second improvement, when we have a congestion or a link is broken, the CR (Congestion Resistant) algorithm will find another way to send the packet and we maintain that this way is shortest safe way and because of that, our algorithm is congestion resistant.
{"title":"Congestion resistant routing algorithm for a congestion resistant ring road network on chip","authors":"A. M. Shafiee, P. Sadr, F. Dehghani","doi":"10.1109/ICDT.2010.11","DOIUrl":"https://doi.org/10.1109/ICDT.2010.11","url":null,"abstract":"Ring Road NoC (R2NoC), which was motivated by smooth flow of traffic in interconnected ring roads, is the base for this paper. Router design and routing algorithm for R2NoC is much simpler. In this paper we have developed the R2NOC's algorithm of routing in two ways. One of them is finding the shortest way between source and destination (θ algorithm) and as the second improvement, when we have a congestion or a link is broken, the CR (Congestion Resistant) algorithm will find another way to send the packet and we maintain that this way is shortest safe way and because of that, our algorithm is congestion resistant.","PeriodicalId":322589,"journal":{"name":"2010 Fifth International Conference on Digital Telecommunications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116913045","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
扫码关注我们
求助内容：
应助结果提醒方式：