UWB signal reception can be accomplished by coherent or non-coherent receivers. Correlation receiver is a type of coherent receiver while energy detection (ED) receiver belongs to non-coherent type. In this paper, we evaluate their ranging performance using the channel profiles measured in a typical indoor office environment. The effects of ranging parameters such as search window length are also investigated. The results show that correlation receiver outperforms ED receiver in the line-of-sight (LOS) scenario and smaller integration interval gives better performance for ED. For the non-line-of-sight (NLOS) scenario, surprisingly, ED receiver outperforms correlation receiver and larger integration interval brings better performance for ED when the detection threshold exceeds certain level. The study also shows that regardless of the receiver types used, the resultant ranging errors for the LOS or NLOS environments can be described by unified models with the parameters being distance dependent.
{"title":"Experimental Evaluation of UWB Ranging Performance for Correlation and ED Receivers in Dense Multipath Environment","authors":"Chi Xu, C. Law","doi":"10.1109/FGCN.2007.121","DOIUrl":"https://doi.org/10.1109/FGCN.2007.121","url":null,"abstract":"UWB signal reception can be accomplished by coherent or non-coherent receivers. Correlation receiver is a type of coherent receiver while energy detection (ED) receiver belongs to non-coherent type. In this paper, we evaluate their ranging performance using the channel profiles measured in a typical indoor office environment. The effects of ranging parameters such as search window length are also investigated. The results show that correlation receiver outperforms ED receiver in the line-of-sight (LOS) scenario and smaller integration interval gives better performance for ED. For the non-line-of-sight (NLOS) scenario, surprisingly, ED receiver outperforms correlation receiver and larger integration interval brings better performance for ED when the detection threshold exceeds certain level. The study also shows that regardless of the receiver types used, the resultant ranging errors for the LOS or NLOS environments can be described by unified models with the parameters being distance dependent.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130722853","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 proposes a novel perceptually adaptive Lagrange multiplier (PALM) algorithm for further enhancing RDO performance that is based on HVS features. Two perceptual distortion sensitivity models are created to minimize the perceptual distortion rather than traditional MAE distortion. Lagrange multiplier is adjusted adaptively according to these perceptual models during the RDO process. Larger Lagrange multiplier is assigned to regions that are perceptually less sensitive to distortion so that the rate- reduction is weighted more than distortion reductions in these regions. While smaller Lagrange multiplier is arranged to the perceptual distortion sensitive regions. Experimental results show that the proposed PALM method effectively improves the subjective quality in the most perceptually prominent regions with no notable loss in PSNR.
{"title":"Perceptually Adaptive Lagrange Multiplier for Rate-Distortion Optimization in H.264","authors":"Chang Sun, Hongjun Wang, Hua Li, Tai-hoon Kim","doi":"10.1109/FGCN.2007.179","DOIUrl":"https://doi.org/10.1109/FGCN.2007.179","url":null,"abstract":"This paper proposes a novel perceptually adaptive Lagrange multiplier (PALM) algorithm for further enhancing RDO performance that is based on HVS features. Two perceptual distortion sensitivity models are created to minimize the perceptual distortion rather than traditional MAE distortion. Lagrange multiplier is adjusted adaptively according to these perceptual models during the RDO process. Larger Lagrange multiplier is assigned to regions that are perceptually less sensitive to distortion so that the rate- reduction is weighted more than distortion reductions in these regions. While smaller Lagrange multiplier is arranged to the perceptual distortion sensitive regions. Experimental results show that the proposed PALM method effectively improves the subjective quality in the most perceptually prominent regions with no notable loss in PSNR.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133691526","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 proposes a pitch modification technique based on the use of source filter model (SFM) by Linear Prediction. A complete solution for pitch modification is described, included estimation of model parameters, pitch detection, unvoiced/voiced (U/V) classification and speech synthesis at several pitch values. An automatic U/V classification based on the use of the zero crossing rate (ZCR) and the Energy computation is proposed. The satisfactory performance of this technique is evaluated by listening tests using sentences in Arabic Language. The limit range of pitch modification for natural synthesizing is found.
{"title":"Pitch Modification of Speech Signal Using Source Filter Model by Linear Prediction for Prosodic Transformations","authors":"F. Ykhlef, M. Guerti, M. Bensebti","doi":"10.1109/FGCN.2007.183","DOIUrl":"https://doi.org/10.1109/FGCN.2007.183","url":null,"abstract":"This paper proposes a pitch modification technique based on the use of source filter model (SFM) by Linear Prediction. A complete solution for pitch modification is described, included estimation of model parameters, pitch detection, unvoiced/voiced (U/V) classification and speech synthesis at several pitch values. An automatic U/V classification based on the use of the zero crossing rate (ZCR) and the Energy computation is proposed. The satisfactory performance of this technique is evaluated by listening tests using sentences in Arabic Language. The limit range of pitch modification for natural synthesizing is found.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"575 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133270060","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 deals with congestion control in which GRID network community has been interested. In order to solve problems of existing congestion control models like FOBS, this paper proposes the node availability-based congestion control model. The model monitors not only storage availability but also network availability of grid nodes to detect and control congestion. As using the fuzzy adaptive packet allocation mechanism, the model estimates congestion level of grid nodes and adjusts their packet transmission rate for stable and reliable data transfer in computational grid. Experiment results demonstrate that our model outperforms FOBS which is a typical congestion control model with the improved QoS.
{"title":"Node Availability-Based Congestion Control Model Using Fuzzy Logic for Computational Grid","authors":"S. Jang, I. Kim, J. S. Lee","doi":"10.1109/FGCN.2007.169","DOIUrl":"https://doi.org/10.1109/FGCN.2007.169","url":null,"abstract":"This paper deals with congestion control in which GRID network community has been interested. In order to solve problems of existing congestion control models like FOBS, this paper proposes the node availability-based congestion control model. The model monitors not only storage availability but also network availability of grid nodes to detect and control congestion. As using the fuzzy adaptive packet allocation mechanism, the model estimates congestion level of grid nodes and adjusts their packet transmission rate for stable and reliable data transfer in computational grid. Experiment results demonstrate that our model outperforms FOBS which is a typical congestion control model with the improved QoS.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133453218","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}
Quan Yu, Jun Zheng, Tielian Fu, Kejun Wu, Baoxian Zhang
OFDM is a promising technique for supporting cooperative transmission in mobile ad hoc networks (MANETs). To achieve a large diversity gain for combating fast time-varying and frequency-selective fading as well as tolerating imperfect synchronization among mobile nodes, we propose an asynchronous cooperative transmission scheme using distributed unitary space-frequency coded OFDM (USFC-OFDM), which has a lower decoding complexity with no need for any channel estimation and can provide better reliability and robustness when nodes move fast. A TDMA-based cooperative medium access control (CMAC) mechanism and an on-demand cooperative routing protocol are also proposed to support the USFC-OFDM scheme. Through simulation results, we show that the proposed USFC-OFDM scheme can significantly improve the network performance in terms of packet delivery ratio and bit error rate in highly dynamic MANET environments.
{"title":"Asynchronous Cooperative Transmission Using Distributed Unitary Space-Frequency Coded OFDM in Mobile Ad Hoc Networks","authors":"Quan Yu, Jun Zheng, Tielian Fu, Kejun Wu, Baoxian Zhang","doi":"10.1109/FGCN.2007.71","DOIUrl":"https://doi.org/10.1109/FGCN.2007.71","url":null,"abstract":"OFDM is a promising technique for supporting cooperative transmission in mobile ad hoc networks (MANETs). To achieve a large diversity gain for combating fast time-varying and frequency-selective fading as well as tolerating imperfect synchronization among mobile nodes, we propose an asynchronous cooperative transmission scheme using distributed unitary space-frequency coded OFDM (USFC-OFDM), which has a lower decoding complexity with no need for any channel estimation and can provide better reliability and robustness when nodes move fast. A TDMA-based cooperative medium access control (CMAC) mechanism and an on-demand cooperative routing protocol are also proposed to support the USFC-OFDM scheme. Through simulation results, we show that the proposed USFC-OFDM scheme can significantly improve the network performance in terms of packet delivery ratio and bit error rate in highly dynamic MANET environments.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132580276","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 this paper we show how to format the code of a SMIL multimedia document during the authoring stage in order to improve the data delivery during its execution. This allows to reduce the latency effects and to recover timely the requested data. The final code tends to manage more efficiently the request scheduling while considering bandwidth and buffer limitations. It is built from the former while adding pre-fetching commands whose parameters are computed thanks to the use of the SMIL document- extracted pattern. The latter considers the characteristics of each media, the inter-media synchronizations, and some time information.
{"title":"Efficient Bandwidth and Buffer Management for Multimedia Data Download","authors":"Abdelli Abdelkrim, N. Badache","doi":"10.1109/FGCN.2007.113","DOIUrl":"https://doi.org/10.1109/FGCN.2007.113","url":null,"abstract":"In this paper we show how to format the code of a SMIL multimedia document during the authoring stage in order to improve the data delivery during its execution. This allows to reduce the latency effects and to recover timely the requested data. The final code tends to manage more efficiently the request scheduling while considering bandwidth and buffer limitations. It is built from the former while adding pre-fetching commands whose parameters are computed thanks to the use of the SMIL document- extracted pattern. The latter considers the characteristics of each media, the inter-media synchronizations, and some time information.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133139108","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}
Jae-young Jo, Yoon-Ho Kim, Hee-jo Kang, Joo-shin Lee
This paper presents the easy way to compose musical composition for non-musicians. Firstly, we developed a chord-based music composition program, and then incorporated it into the auto-accompaniment program. Namely, the only way we have to do is to select a chord and put it to special program which called "the chord-based music composition program" and then the composition program creates the rest of the chords automatically. Consequently, non-musicians overwrite their own melodies in accordance with created chords. Finally, they can perform their own music with the sound of master-keyboard and other sound sources by using the auto-accompaniment program.
{"title":"Chord-Based Musical Composition and Incorporating it into Auto-Accompaniment Instrument","authors":"Jae-young Jo, Yoon-Ho Kim, Hee-jo Kang, Joo-shin Lee","doi":"10.1109/FGCN.2007.83","DOIUrl":"https://doi.org/10.1109/FGCN.2007.83","url":null,"abstract":"This paper presents the easy way to compose musical composition for non-musicians. Firstly, we developed a chord-based music composition program, and then incorporated it into the auto-accompaniment program. Namely, the only way we have to do is to select a chord and put it to special program which called \"the chord-based music composition program\" and then the composition program creates the rest of the chords automatically. Consequently, non-musicians overwrite their own melodies in accordance with created chords. Finally, they can perform their own music with the sound of master-keyboard and other sound sources by using the auto-accompaniment program.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"28 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116905698","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}
While security traditionally has been an important issue in information systems, the problem of the greatest concern today is related to the availability of information and continuity of services. Since people and organizations now rely on distributed systems in accessing and processing critical services and mission, the availability of information and continuity of services are becoming more important. Therefore the importance of implementing systems that continue to function in the presence of security breaches cannot be overemphasized. One of the solutions to provide the availability and continuity of information system applications is introducing an intrusion tolerance system. Security mechanism and adaptation mechanism can ensure intrusion tolerance by protecting the application from accidental or malicious changes to the system and by adapting the application to the changing conditions. In this paper we propose an intrusion tolerance model that improves the developmental structure while assuring security level. We also design and implement an adaptive intrusion tolerance system to verify the efficiency of our model by integrating proper functions extracted from CORBA security modules.
{"title":"Intrusion Tolerance Model for Electronic Commerce System","authors":"Young-Soo Kim, Kab-Seung Kou, Gang-soo Lee","doi":"10.1109/FGCN.2007.155","DOIUrl":"https://doi.org/10.1109/FGCN.2007.155","url":null,"abstract":"While security traditionally has been an important issue in information systems, the problem of the greatest concern today is related to the availability of information and continuity of services. Since people and organizations now rely on distributed systems in accessing and processing critical services and mission, the availability of information and continuity of services are becoming more important. Therefore the importance of implementing systems that continue to function in the presence of security breaches cannot be overemphasized. One of the solutions to provide the availability and continuity of information system applications is introducing an intrusion tolerance system. Security mechanism and adaptation mechanism can ensure intrusion tolerance by protecting the application from accidental or malicious changes to the system and by adapting the application to the changing conditions. In this paper we propose an intrusion tolerance model that improves the developmental structure while assuring security level. We also design and implement an adaptive intrusion tolerance system to verify the efficiency of our model by integrating proper functions extracted from CORBA security modules.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123673354","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}
Reliable server pooling (RSerPool) is a protocol framework for server redundancy and session failover, currently still under standardization by the IETF RSerPool WG. An important property of RSerPool is its lightweight architecture: server pool and session management can be realized with small CPU power and memory requirements. That is, RSerPool-based services can also be managed and provided by embedded systems. Currently, there has already been some research on the performance of the data structures managing server pools. But a generic, application- independent performance analysis - in particular also including measurements in real system setups - is still missing. Therefore, the aim of this paper is - after an outline of the RSerPool framework, an introduction to the pool management procedures and a description of our pool management approach - to first provide a detailed performance evaluation of the pool management structures themselves. Afterwards, the performance of a prototype implementation is analysed in order to evaluate its applicability under real network conditions.
{"title":"An Evalulation of the Pool Maintenance Overhead in Reliable Server Pooling Systems","authors":"T. Dreibholz, E. Rathgeb","doi":"10.1109/FGCN.2007.62","DOIUrl":"https://doi.org/10.1109/FGCN.2007.62","url":null,"abstract":"Reliable server pooling (RSerPool) is a protocol framework for server redundancy and session failover, currently still under standardization by the IETF RSerPool WG. An important property of RSerPool is its lightweight architecture: server pool and session management can be realized with small CPU power and memory requirements. That is, RSerPool-based services can also be managed and provided by embedded systems. Currently, there has already been some research on the performance of the data structures managing server pools. But a generic, application- independent performance analysis - in particular also including measurements in real system setups - is still missing. Therefore, the aim of this paper is - after an outline of the RSerPool framework, an introduction to the pool management procedures and a description of our pool management approach - to first provide a detailed performance evaluation of the pool management structures themselves. Afterwards, the performance of a prototype implementation is analysed in order to evaluate its applicability under real network conditions.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128584255","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 hypercube is one of the most versatile and efficient interconnection networks for parallel computation. Let Fv (respectively, Fe) be the set of faulty vertices (respectively, faulty edges) in an n-dimensional hypercube Qn. In this paper, we show that Qn - Fv - Fe contains a fault free path with length at least 2n - 2|Fv| - 1(or 2n - 2|Fv| - 2) between two arbitrary vertices of odd (or even) distance if |Fv| + |Fe| les n - 2, where n ges 3. Since Qn is bipartite of equal-size partite sets, the path is longest in the worst case. Furthermore, since Qn is regular of vertex-degree n, both the number of faults tolerated and the length of a longest fault-free path obtained are worst-case optimal.
{"title":"Longest Fault-Free Paths in Hypercubes with both Faulty Nodes and Edges","authors":"S. Hsieh, Che-Nan Kuo, Hui-Ling Huang","doi":"10.1109/FGCN.2007.163","DOIUrl":"https://doi.org/10.1109/FGCN.2007.163","url":null,"abstract":"The hypercube is one of the most versatile and efficient interconnection networks for parallel computation. Let F<sub>v</sub> (respectively, F<sub>e</sub>) be the set of faulty vertices (respectively, faulty edges) in an n-dimensional hypercube Q<sub>n</sub>. In this paper, we show that Q<sub>n</sub> - F<sub>v</sub> - F<sub>e</sub> contains a fault free path with length at least 2<sup>n</sup> - 2|F<sub>v</sub>| - 1(or 2<sup>n</sup> - 2|F<sub>v</sub>| - 2) between two arbitrary vertices of odd (or even) distance if |F<sub>v</sub>| + |F<sub>e</sub>| les n - 2, where n ges 3. Since Q<sub>n</sub> is bipartite of equal-size partite sets, the path is longest in the worst case. Furthermore, since Q<sub>n</sub> is regular of vertex-degree n, both the number of faults tolerated and the length of a longest fault-free path obtained are worst-case optimal.","PeriodicalId":254368,"journal":{"name":"Future Generation Communication and Networking (FGCN 2007)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128723937","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
扫码关注我们
求助内容：
应助结果提醒方式：