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

2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)最新文献

筛选
英文 中文
Experimental study of Internet traffic modeling and bandwidth allocation 互联网流量建模与带宽分配的实验研究
2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233) Pub Date : 2001-08-26 DOI: 10.1109/PACRIM.2001.953701
Yen-Wen Chen
{"title":"Experimental study of Internet traffic modeling and bandwidth allocation","authors":"Yen-Wen Chen","doi":"10.1109/PACRIM.2001.953701","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953701","url":null,"abstract":"We analyze the characteristics of Internet traffic by considering its correlation properties. First, a simple measurement is performed, by using the autocorrelation technique, to illustrate the correlation properties of the HTTP/Web and the e-mail (SMTP) services. The ACF (autocorrelation factor) and PACF (partial ACF) measurements are applied to examine the correlation characteristics of the traffic correlation within consecutive hours. The measurement results indicate that correlation with one-hour lag is acceptable for both services. Then the autocorrelation of each service is performed, respectively, to understand the correlation property of these two services. The experiment results illustrate that the HTTP/Web service has much higher self-correlation, especially for one hour lag, than the e-mail service. Finally, a heuristic bandwidth allocation method is proposed by considering the correlation characteristics. The proposed method is suitable for the management of Internet bandwidth dynamically.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121174582","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
Frequency domain equalization for high data rate multipath channels 高数据速率多径信道的频域均衡
2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233) Pub Date : 2001-08-26 DOI: 10.1109/PACRIM.2001.953688
P. Dmochowski, P. McLane
{"title":"Frequency domain equalization for high data rate multipath channels","authors":"P. Dmochowski, P. McLane","doi":"10.1109/PACRIM.2001.953688","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953688","url":null,"abstract":"High data rate transmission over multipath channels requires equalizers of long impulse response. In such cases, frequency domain implementation of the block least mean square (BLMS) algorithm offers low complexity growth relative to time domain techniques. The work presented herein is devoted to a study of the fast BLMS (FBLMS) algorithm implemented in the frequency domain using overlap-save sectioning and the fast Fourier transform (FFT). We examine the bit error rate (BER) performance for high data rate quadrature phase shift keying (QPSK) transmission over a multipath channel as well as the computational complexity of the FBLMS equalizer in comparison to the time domain implementation. Finally, we show how normalizing the step size of the FBLMS algorithm according to the power distribution of the input process results in a significant improvement in the equalizer convergence relative to the time domain methods.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127238651","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}
引用次数: 16
Design and implementation of a mobile agent-based auction system 基于移动代理的拍卖系统的设计与实现
2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233) Pub Date : 2001-08-26 DOI: 10.1109/PACRIM.2001.953738
H.C. Chan, I. Ho, R.S.T. Lee
{"title":"Design and implementation of a mobile agent-based auction system","authors":"H.C. Chan, I. Ho, R.S.T. Lee","doi":"10.1109/PACRIM.2001.953738","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953738","url":null,"abstract":"The online auction is an important e-commerce application which enables the buying and selling of goods through a dynamic pricing strategy. This paper presents the design and implementation of a multi-access and multi-functional auction system. Users can access the auction system through the Web, WAP-enabled devices and agents, particularly mobile agents. The auction system supports different types of auctions, including English auction, Dutch auction, Yankee auction, Sealed Bid auction and Double auction. In particular, we discuss the mobile agent-based approach in detail by presenting the protocol for implementing different types of auctions.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132571232","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}
引用次数: 16
Weighted OFDM with block codes for wireless communication 带分组码的加权OFDM无线通信
2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233) Pub Date : 2001-08-26 DOI: 10.1109/PACRIM.2001.953664
I.A. Tasadduq, R. Rao
{"title":"Weighted OFDM with block codes for wireless communication","authors":"I.A. Tasadduq, R. Rao","doi":"10.1109/PACRIM.2001.953664","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953664","url":null,"abstract":"One of the major disadvantages with OFDM system is its high peak-to-average power ratio (PAPR). We investigate the potential of some of the well known linear block codes in reducing the PAPR. We present a method of biasing the codewords to minimize the PAPR. The influence of combined weighting and block coding on the PAPR is investigated. A class of block codes capable of both error correction and PAPR reduction together with several weighting functions is considered. We investigate the interplay of various weighting functions with block codes in order to minimize the PAPR. The proposed schemes reduce the PAPR significantly as is evident from the simulation results.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132751699","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}
引用次数: 22
On a Kaoh database system using fluency functions based automatic and jaggyless image coding 基于流畅性函数的Kaoh数据库系统的自动无锯齿图像编码
2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233) Pub Date : 2001-08-26 DOI: 10.1109/PACRIM.2001.953544
M. Suzuki, K. Kameyama, K. Toraichi, K. Katagishi, T. Yamamoto
{"title":"On a Kaoh database system using fluency functions based automatic and jaggyless image coding","authors":"M. Suzuki, K. Kameyama, K. Toraichi, K. Katagishi, T. Yamamoto","doi":"10.1109/PACRIM.2001.953544","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953544","url":null,"abstract":"Kaoh is one of historical materials which plays an important role in the field of historical document research in Japan. In the research of Kaoh,the historian must visit various places in Japan to compile them, which is a major difficulty in Kaoh research. In addition, there exist approximately 400,000 Kaohs in Japan. This paper proposes a Kaoh database system using fluency functionalized images, for the purpose of compiling the Kaoh images and sharing them among the researchers via the Internet. Fluency functionalized image is the type of image that the contours of each region in the image are approximated with fluency functions. From the experimental results, it was shown that the images kept the shape characteristics of Kaoh images even after affine-transforms, and that the data size were much smaller compared with the original bitmap images.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128308258","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
Cost effective value prediction microarchitecture using partial-tag and narrow-width operands 使用部分标签和窄宽度操作数的低成本值预测微架构
2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233) Pub Date : 2001-08-26 DOI: 10.1109/PACRIM.2001.953587
Byun-Soo Choi, Dong-Ik Lee
{"title":"Cost effective value prediction microarchitecture using partial-tag and narrow-width operands","authors":"Byun-Soo Choi, Dong-Ik Lee","doi":"10.1109/PACRIM.2001.953587","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953587","url":null,"abstract":"In this paper we investigate the implementation cost of value prediction methods for high performance microprocessors and propose a new value prediction microarchitecture with low cost. After simulation, we found that the proposed microarchitecture can decrease the implementation cost by 36% to 50% and with slight performance degradation (less than 5%).","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128411330","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
Parallelized search for the optimal/sub-optimal solutions of task scheduling problem taking account of communication overhead 考虑通信开销的任务调度问题的最优/次最优解并行搜索
2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233) Pub Date : 2001-08-26 DOI: 10.1109/PACRIM.2001.953589
M. Kai, T. Hatori
{"title":"Parallelized search for the optimal/sub-optimal solutions of task scheduling problem taking account of communication overhead","authors":"M. Kai, T. Hatori","doi":"10.1109/PACRIM.2001.953589","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953589","url":null,"abstract":"In order to achieve the efficient parallel processing on a given multiprocessor system, it is important to draw the performance of the multiprocessor system sufficiently. The task scheduling technique, in which the extracted task set from an application is assigned onto multiple processors to be executed in parallel in the minimum processing time, is very important key for the efficient parallel processing. In this paper, we first propose new priority levels with communication overhead to find better solutions of any scheduling problem in early stage of search. The new priority levels are useful to bound the branches of search tree to be efficiently cut off with better estimated lower estimation of scheduling length. Second, using the new priority levels, our search method performs depth-first search, which is full-search method and has the possibility to got an optimal solutions. In the case of large scale task graphs, full-search is impossible. However, even if the search processes are interrupted in any given time, it can find better solutions in the given time than past algorithms Third, in order to shorten the execution time of search process for the scheduling problem, we show parallel search methods and the results of the efficiency of the parallel search. The parallel search methods are implemented on HITACHI SR8000 multiprocessor system which has 8 processors by using MP.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131936924","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
On an image contour compression method using compactly supported sampling functions 研究了一种基于紧支持采样函数的图像轮廓压缩方法
2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233) Pub Date : 2001-08-26 DOI: 10.1109/PACRIM.2001.953575
P. Kwan, K. Toraichi, K. Wada, K. Kameyama, K. Katagishi, T. Sugiyama, F. Yoshikawa
{"title":"On an image contour compression method using compactly supported sampling functions","authors":"P. Kwan, K. Toraichi, K. Wada, K. Kameyama, K. Katagishi, T. Sugiyama, F. Yoshikawa","doi":"10.1109/PACRIM.2001.953575","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953575","url":null,"abstract":"We propose a novel image contour compression method using compactly supported sampling functions. To demonstrate the effectiveness of our method, we carried out experiments on a real life application using beef marbling images for an integrated database and display system to assist beef marbling evaluation. This method's applicability, however, is not limited to beef marbling images but can be extended to other applications having the need for image contour compression.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124567907","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}
引用次数: 3
Meta queries in parallel environment for databases 数据库并行环境中的元查询
2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233) Pub Date : 2001-08-26 DOI: 10.1109/PACRIM.2001.953730
S. Ogura, S. Kashikawa, T. Miura, I. Shioya
{"title":"Meta queries in parallel environment for databases","authors":"S. Ogura, S. Kashikawa, T. Miura, I. Shioya","doi":"10.1109/PACRIM.2001.953730","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953730","url":null,"abstract":"In this investigation we propose a framework suitable for parallel evaluation to meta queries in databases. Since execution of meta-objects costs high, people have never investigated such approach traditionally. Here we expect large granulation of meta-object evaluation, and outline the issue from the viewpoint of parallel processing to improve processes efficiency.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127650272","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}
引用次数: 0
A Java processor architecture with bytecode folding and dynamic scheduling 具有字节码折叠和动态调度的Java处理器体系结构
2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233) Pub Date : 2001-08-26 DOI: 10.1109/PACRIM.2001.953584
M. El-Kharashi, F. Elguibaly, K. Li
{"title":"A Java processor architecture with bytecode folding and dynamic scheduling","authors":"M. El-Kharashi, F. Elguibaly, K. Li","doi":"10.1109/PACRIM.2001.953584","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953584","url":null,"abstract":"This paper presents a novel processor architecture for executing Java bytecodes in hardware. Our processor is based on an instruction folding algorithm implemented with Tomasulo's scheduling algorithm. The architecture also provides dual processing capability to execute Java bytecodes as well as other binaries. This approach improves Java execution without sacrificing the generality of the processor.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121381912","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
首页 上一页 下一页 尾页
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学术官方微信