发布求助
文献互助 智能选刊 最新文献

2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing最新文献

筛选
英文 中文
A new routing protocol for reducing the probability of route breakage in Mobile Ad-hoc Networks 一种减少移动自组网中路由中断概率的新路由协议
2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2007-09-24 DOI: 10.1109/PACRIM.2007.4313265
S. Kalhor, M. Anisi, A. Haghighat
{"title":"A new routing protocol for reducing the probability of route breakage in Mobile Ad-hoc Networks","authors":"S. Kalhor, M. Anisi, A. Haghighat","doi":"10.1109/PACRIM.2007.4313265","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313265","url":null,"abstract":"A Mobile Ad-hoc Network is a kind of mobile wireless network in which every mobile node participates in routing operation. Such networks which use multi hop routing mechanism as the nodes may be out of their transmission range and may depend on each other for forwarding the packets to the destination. In this paper, we propose the problems that lead to link breakage in Most Forward Routing (MFR) protocol and also a new routing protocol for reducing the probability of link breakage. Our experimental results show that by using this protocol, the number of nodes which participate in routing operation, the number of exchanged messages and also the average time of route discovery will be reduced.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124727131","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}
引用次数: 2
Optical Flow in Dynamic Graph Cuts 动态图切割中的光流
2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2007-09-24 DOI: 10.1109/PACRIM.2007.4313231
N. Setiawan, D. Aurrahman, Chil-Woo Lee
{"title":"Optical Flow in Dynamic Graph Cuts","authors":"N. Setiawan, D. Aurrahman, Chil-Woo Lee","doi":"10.1109/PACRIM.2007.4313231","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313231","url":null,"abstract":"In this paper, we propose an approach to calculate optical flow by using dynamic graph cuts framework. We use several good ingredients to estimate optical flow. We combine occlusion model for visual correspondence problem (V. Kolmogorov and R. Zabih, 2001) and illumination invariant optical flow (D. Freedman and M.W. Turek, 2005) to achieve robustness given large occlusion and illumination changes. And we make use the dynamic algorithm from (P. Kohli and P.H.S. Torr, 2005) to estimates dynamically changing MRF models of labeling problems in computer vision. The dynamic algorithm is shown faster than standard counterpart, thus promising real time application of graph cuts techniques to estimate optical flow.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130639681","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}
引用次数: 1
A Feedback Method of Improving the Performance of a Document Vector Space Developed on a Feature Extraction Model 基于特征提取模型的改进文档向量空间性能的反馈方法
2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2007-09-24 DOI: 10.1109/PACRIM.2007.4313225
Kosuke Takano, Chen Xing, K. Masuda
{"title":"A Feedback Method of Improving the Performance of a Document Vector Space Developed on a Feature Extraction Model","authors":"Kosuke Takano, Chen Xing, K. Masuda","doi":"10.1109/PACRIM.2007.4313225","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313225","url":null,"abstract":"In this paper, we propose a basic algorithm for an automatic feedback method to reconstruct the document vector space that is developed based on a method referred to as feature extraction model (FEM). In the feedback method, we add and remove some terms that are used to construct the vector space so that retrieval results are improved, because the distributions of document vectors are arranged properly according to purposes of searchers. The efficiency and the feasibility of the proposed method are confirmed by several experiments.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123974064","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}
引用次数: 1
The Impact of the Register Update Unit Size on Multipath Execution 寄存器更新单元大小对多路径执行的影响
2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2007-09-24 DOI: 10.1109/PACRIM.2007.4313190
Chao-Chin Wu, Kuan-Chou Lai, En-Hao Liu, Jin-Yuan Chen
{"title":"The Impact of the Register Update Unit Size on Multipath Execution","authors":"Chao-Chin Wu, Kuan-Chou Lai, En-Hao Liu, Jin-Yuan Chen","doi":"10.1109/PACRIM.2007.4313190","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313190","url":null,"abstract":"Branch prediction is a key mechanism to boost the system performance of a superscalar processor. Though the prediction accuracy rate becomes higher and higher, the mispredicitons still lead to significant performance losses in a wide-issue deep-pipelined superscalar. To address the problem, the technique of multipath execution has been proposed previously, which is capable of executing both paths whenever a lower-confidence conditional branch is encountered. However, because the instructions from different paths share a single register update unit (RUU), they are interleaved in the RUU. In consequence, when a conditional branch is resolved and the instructions on the wrong paths are squashed, all the entries in the resulting holes cannot be reused until they are reclaimed at the commit stage. Since the RUU size is crucial to the performance, it is interesting to know how much can we speedup the performance if the squashed RUU entries can be reused as soon as possible. We have proposed a simple mechanism with very limited hardware resources to achieve this goal. Finally the preliminary simulation results are presented.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124058481","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}
引用次数: 1
An Improved Calibration Algorithm for ITS Based On Vision 一种改进的基于视觉的ITS标定算法
2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2007-09-24 DOI: 10.1109/PACRIM.2007.4313306
Fuqiang Liu, Jing Wang, L. Guo, Xinhong Wang
{"title":"An Improved Calibration Algorithm for ITS Based On Vision","authors":"Fuqiang Liu, Jing Wang, L. Guo, Xinhong Wang","doi":"10.1109/PACRIM.2007.4313306","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313306","url":null,"abstract":"In video surveillance for intelligent traffic management system (ITS), the nonlinear distortion of image will lead to the inaccurate parameter of traffic. This paper presents a new algorithm for global calibrate using information of road marking lines, which is a common feature in traffic surveillance scenes and is easy to obtain. The new algorithm is simple, available, effective, accurate, without knowing camera's interior and exterior parameters, complex setting, and vast storage of data. It also overcomes the limitations of the method based on grid mapping. Experiments proved that the algorithm can be applied not only to traffic surveillance system accurately and effectively, but also to other different industrial solutions based on computer vision.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131241021","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}
引用次数: 1
Fault Localization and Full Error Correction in Radix2 Signed Digit-Based Adders 基于Radix2签名数字加法器的故障定位与全错误校正
2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2007-09-24 DOI: 10.1109/PACRIM.2007.4313214
S. R. Alavi, K. Faez
{"title":"Fault Localization and Full Error Correction in Radix2 Signed Digit-Based Adders","authors":"S. R. Alavi, K. Faez","doi":"10.1109/PACRIM.2007.4313214","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313214","url":null,"abstract":"In this paper, a new methodology to increase fault-tolerant and full error correction capabilities in self-checking adders based on the radix 2 signed digit (SD) representation is presented. The full error correction ability is indebted to \"locality\" property of carry propagation in this type of adder, in which the carry propagation is confined to neighbor digits. The second motive of using these adders is their computational speed. In fact, because the parity of the augends is preserved, the error produced by a single stuck-at fault can be detected by parity checker. As \"locality\" property of carry propagation prevents dissemination of error yielded by permanent faults, therefore, the location of faulty digit is found by using a recomputation with shifted operands method. Finally, after fault localization, the full error correction is performed by using a recomputation with triple shifted operands method.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116275925","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}
引用次数: 4
Line Coding for Clock Recovery With Minimal Filtering 带最小滤波的时钟恢复行编码
2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2007-09-24 DOI: 10.1109/PACRIM.2007.4313266
Zuojian Song, Y. Takasaki
{"title":"Line Coding for Clock Recovery With Minimal Filtering","authors":"Zuojian Song, Y. Takasaki","doi":"10.1109/PACRIM.2007.4313266","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313266","url":null,"abstract":"Line codes for clock recovery with minimal filtering are investigated. First, it is explained that a 4T processing is preferable to conventional 4T/2T processing for a 1B4B/3B4B code from the standpoint of jitter reduction. Then 2B/4B codes are proposed where 3T and IT processings are applicable. It is shown that these new codes can not only simplify hardware but also lead to improved jitter characteristic as compared with existing schemes.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117180301","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}
引用次数: 2
Wireless Ad-hoc Networks Using Cooperative Diversity-based Routing in Fading Channel 衰落信道中基于合作分集路由的无线自组网
2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2007-09-24 DOI: 10.1109/PACRIM.2007.4313179
Nam-Soo Kim, Beongku An, Do-Hyeon Kim, Y. Lee
{"title":"Wireless Ad-hoc Networks Using Cooperative Diversity-based Routing in Fading Channel","authors":"Nam-Soo Kim, Beongku An, Do-Hyeon Kim, Y. Lee","doi":"10.1109/PACRIM.2007.4313179","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313179","url":null,"abstract":"We propose new routing scheme, Cooperative Diversity-based Routing (CDR) which utilize the cooperative space diversity for power saving and for performance enhancement of wireless ad-hoc networks. The end-to-end performance of the proposed routing, CDR, is analyzed based on the Haenggi's link model. The improved performance is compared with Multi-hop Relay Routing (MRR) by analytical methods. When the required outage probability is 1times10-3 at the destination node in ad-hoc networks with 7 nodes, we noticed that each node can save power consumption by 21.5 dB in average, by using our proposed CDR compared to MRR.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126142423","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}
引用次数: 7
Fractional Sampling OFDM/OQAM-IOTA on Multipath Channel with Long Delay Spread 长时延扩展多径信道OFDM/OQAM-IOTA分数采样
2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2007-09-24 DOI: 10.1109/PACRIM.2007.4313285
T. Tamura, Y. Sanada
{"title":"Fractional Sampling OFDM/OQAM-IOTA on Multipath Channel with Long Delay Spread","authors":"T. Tamura, Y. Sanada","doi":"10.1109/PACRIM.2007.4313285","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313285","url":null,"abstract":"Orthogonal frequency division multiplex (OFDM) modulation systems can completely prevent intersymbol interference due to multipath propagation by providing a guard interval which is longer than the maximum delay spread. If the delay spread exceeds the guard interval, on the other hand, intersymbol interference (ISI) and intercarrier interference (ICI) occur. This paper evaluates the performance of a fractional sampling (FS) OFDM/Offset QAM-IOTA system in which FS achieves diversity. It is shown that FS OFDM/Offset QAM-IOTA system suffers less from ISI and ICI due to the delayed path even if the delay spread exceeds the guard interval.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124703717","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}
引用次数: 1
Analysis of the Channel Access Mechanism in IEEE 802.11 Wireless Local Area Networks IEEE 802.11无线局域网中的信道访问机制分析
2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2007-09-24 DOI: 10.1109/PACRIM.2007.4313180
Hossam Fattah
{"title":"Analysis of the Channel Access Mechanism in IEEE 802.11 Wireless Local Area Networks","authors":"Hossam Fattah","doi":"10.1109/PACRIM.2007.4313180","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313180","url":null,"abstract":"IEEE 802.11 wireless network has spread widely during the past few years. This type of network employees a carrier-sense multiple access with collision-avoidance (CSMA/CA) scheme with exponential backoff procedure. In this paper, we present a performance analysis of IEEE 802.11 channel access mechanism. The analysis captures the details of the Distributed Function Coordination (DCF), such as the contention window size, inter-frame spacing, and packet exchange sequence, and obtains the throughput for such a network with multiple number of stations. The throughput is obtained when the station packet load varies. Two packet access mechanism, namely, the basic access mechanism and the RTS/CTS access mechanism are considered in the throughput analysis. Simulation results are presented to verify the analysis.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128423483","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信