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

PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.最新文献

筛选
英文 中文
Application of parametric window functions to the STDFT method for gene prediction 参数窗函数在STDFT基因预测中的应用
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517291
Stuart W. A. Bergen, A. Antoniou
{"title":"Application of parametric window functions to the STDFT method for gene prediction","authors":"Stuart W. A. Bergen, A. Antoniou","doi":"10.1109/PACRIM.2005.1517291","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517291","url":null,"abstract":"The application of different window functions to the STDFT method for gene prediction that identifies the well known period-three property is explored. Window functions are employed to suppress spectral noise originating from non-coding regions in the DNA sequence. Results are obtained on the choice of a suitable window and a method for tailoring a window to a particular gene is proposed.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115699249","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}
引用次数: 23
The effect of noise, fading and interference on the performance of scheduling algorithms in a cross-layer downlink model 跨层下行链路模型中噪声、衰落和干扰对调度算法性能的影响
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517252
D. Arora, P. Agathoklis
{"title":"The effect of noise, fading and interference on the performance of scheduling algorithms in a cross-layer downlink model","authors":"D. Arora, P. Agathoklis","doi":"10.1109/PACRIM.2005.1517252","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517252","url":null,"abstract":"A system model combining space time block coding and beamforming at the PHY layer along with various scheduling algorithms at the MAC layer is used to study the effect of noise, fading and interference on the performance of a system that simultaneously serves two users. System performance expressed in terms of capacity, is assessed for line of sight (LoS) and non-LoS (NLoS) environments, for a range of SNRs, and for different number of antenna elements that are used for combating interference via beamforming. As expected, system capacity is higher for higher SNRs and for direct LoS environments for all scheduling algorithms. The improvement in capacity is also achieved due to an increased number of antenna elements at the PHY layer that leads to narrower beam widths, and aid in minimizing the interference from other simultaneously served users. The scheduling algorithm proposed by D. Arora and P. Agathoklis (2005), that explicitly considers the angular spread between simultaneously served users for combating interference, performs consistently better than the greedy and the round-robin (RR) scheduling algorithms. The results suggest that jointly addressing the PHY and MAC layer issues is important for achieving maximal system performance.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117236516","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 CBR-streaming scheme for VBR-encoded videos 一种用于vbr编码视频的cbr流媒体方案
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517263
H. Kabir, E. Manning, G. Shoja
{"title":"A CBR-streaming scheme for VBR-encoded videos","authors":"H. Kabir, E. Manning, G. Shoja","doi":"10.1109/PACRIM.2005.1517263","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517263","url":null,"abstract":"Media files are required to use variable-bit-rate (VBR) encoding, such as MPEG-2, in order to get constant quality compressed video. However, it produces traffic burst, which makes streaming complicated. Large network latency and jitter cause long start-up delay and frequent unwanted pauses in media playback, respectively. In this paper, we have proposed a proxy based constant-bit-rate (CBR) streaming scheme that allows a server to transmit a VBR-encoded video at a fixed rate, close to its mean encoding bit rate, and deals with the network latency and jitter issues efficiently without caching an entire media file. We have used smoothing buffers at the proxy to eliminate jitter and traffic burst effects. We have used prefix buffers at the proxy to cache the prefixes of popular videos to minimize the start-up delay and to enable near mean bit rate streaming from the server as well as from the proxy. Simulation results are presented to demonstrate the effectiveness of our streaming scheme.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129508645","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
A scheduling scheme for continuous media data broadcasting with prefetching 一种带预取的连续媒体数据广播调度方案
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517246
T. Yoshihisa, M. Tsukamoto, S. Nishio
{"title":"A scheduling scheme for continuous media data broadcasting with prefetching","authors":"T. Yoshihisa, M. Tsukamoto, S. Nishio","doi":"10.1109/PACRIM.2005.1517246","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517246","url":null,"abstract":"Recently, broadcasting continuous media data such as movies and music has been attracted great attention. In continuous media data broadcasting, it is important for clients to play data continuously without any interruptions until the end of the data. Accordingly, various schemes for reducing the bandwidth needed to satisfy the continuity condition are proposed. Several schemes prefetch the precedent portions of the data and broadcast divided data via many channels. However, for hardware restrictions and implementation complexity, the number of available channels, from which clients can concurrently receive the data, has an upper limit. This depresses performances of existing schemes. In this paper, we propose a scheduling scheme for continuous media data broadcasting with prefetching. By considering the number of available channels, our proposed scheme reduces the necessary bandwidth effectively.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127409700","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
Limitations and capabilities of QoS support in IEEE 802.11 WLANs IEEE 802.11 wlan中QoS支持的限制和能力
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517369
J. Villalón, P. Cuenca, Luis Orozco-Barbosa
{"title":"Limitations and capabilities of QoS support in IEEE 802.11 WLANs","authors":"J. Villalón, P. Cuenca, Luis Orozco-Barbosa","doi":"10.1109/PACRIM.2005.1517369","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517369","url":null,"abstract":"The IEEE 802.11 wireless LAN (WLAN) is the most widely used standard nowadays for wireless LAN technology. However, the current standard does not provide QoS support required by the wide range of end applications (e.g., multimedia communications). In this work we first analyze the QoS limitations of legacy DCF and PCF IEEE 802.11 wireless MAC. Then, we also present the upcoming IEEE 802.11e standard being introduced. The IEEE 802.11e standard is a proposal defining the mechanisms for wireless LANs aiming to provide QoS support to time-sensitive applications, such as, voice and video communications. Finally, we carry out a comparative study of legacy DCF and the IEEE 802.11e (EDCA) upcoming standard, when supporting different services, such as voice, video, best-effort and background traffic.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"22 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129006662","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}
引用次数: 13
Analysis and design of AT&T's global PNNI network AT&T全球PNNI网络的分析与设计
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517242
W. Lai, E. Rosenberg, L. Amiri, M. Ball, Y. Levy, H. Shulman, Hui Tong, M. Ungar
{"title":"Analysis and design of AT&T's global PNNI network","authors":"W. Lai, E. Rosenberg, L. Amiri, M. Ball, Y. Levy, H. Shulman, Hui Tong, M. Ungar","doi":"10.1109/PACRIM.2005.1517242","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517242","url":null,"abstract":"This paper presents work done in the development and operation of the layer 2 infrastructure in AT&T's global network, one of the largest in size and geographic coverage. While conforming to ATM forum's private network-network interface (PNNI) standard, additional features were built in to ensure low latency, among other network objectives. The network uses preferred routing, connection mastership, and delay-based administrative-weights for optimal path selection. Peer-group splits are utilized to deal with network growth. Overbooking rules are used for capacity management to improve efficiency. Extensive modeling and analysis of the network was performed to validate these design features. Some of the techniques described herein would also be applicable to other technologies such as OSPF and MPLS.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130811132","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
Templates for reversible circuit simplification 可逆电路简化模板
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517363
Dmitri Maslov, D. M. Miller, G. Dueck
{"title":"Templates for reversible circuit simplification","authors":"Dmitri Maslov, D. M. Miller, G. Dueck","doi":"10.1109/PACRIM.2005.1517363","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517363","url":null,"abstract":"Even using quite powerful computers, it is still only feasible to find guaranteed optimal circuits for at most 3-input 3-output reversible Boolean functions. Hence, a number of heuristic synthesis methods have emerged. Application of such methods usually results in non-optimal circuit specifications, which can, potentially, be simplified. The template approach discussed in this paper is a local optimization technique for reversible circuit simplification that can be applied for general cost metrics. We present some results on the efficient construction, generalized classification, and completeness of a set of generalized Toffoli gate templates.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123163691","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
Performance evaluation of efficient algorithms for Tate pairing 高效Tate配对算法的性能评价
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517375
S. Matsuda, A. Inomata, Toshio Okamoto, E. Okamoto
{"title":"Performance evaluation of efficient algorithms for Tate pairing","authors":"S. Matsuda, A. Inomata, Toshio Okamoto, E. Okamoto","doi":"10.1109/PACRIM.2005.1517375","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517375","url":null,"abstract":"The properties of the Tate pairing are applied to various cryptographic systems. The problem is that the Tate pairing computation is expensive operation, and various methods for faster computation have been proposed. However their actual methods are not so clear. In this paper, we combined their methods and our technique for implementation to apply the program of computing Tate pairing. We evaluated the performance and compared the contribution of each method. There is a case, which yields slower computation caused by overheads of implementation. Consequently we obtained the result of 70% reduction of calculation of Tate pairing in total and showed that Tate pairing has practical applicability.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123325480","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
Performance evaluation of detour path selection scheme for MPLS traffic engineering MPLS流量工程绕行路径选择方案的性能评价
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517237
H. Tamura, K. Yuasa, K. Kawahara, Y. Oie
{"title":"Performance evaluation of detour path selection scheme for MPLS traffic engineering","authors":"H. Tamura, K. Yuasa, K. Kawahara, Y. Oie","doi":"10.1109/PACRIM.2005.1517237","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517237","url":null,"abstract":"Multi-protocol label switching (MPLS) allows several detour paths (label switched paths, LSPs) to be (pre-) established for some source-destination pair as well as its primary path of minimum hops. Thus, we should specify how to allocate an arrival flow to these two kinds of paths for effective traffic engineering (TE). So far, we have proposed and analytically evaluated the two-phase path management scheme with the random detour path selection in order to allocate an arrival flow to one of these paths for MPLS-TE. In this paper, we propose two more detour path selection schemes, namely, fixed detour path selection and least-loaded detour path selection, and compare the performance of the detour path selection schemes. Furthermore, we investigate the impact of the load imbalance on TE performance of our proposed scheme with the least-loaded detour path selection.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126419824","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 video editing support system using users' gazes 一个使用用户视线的视频编辑支持系统
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517247
T. Kimura, K. Sumiya, H. Tanaka
{"title":"A video editing support system using users' gazes","authors":"T. Kimura, K. Sumiya, H. Tanaka","doi":"10.1109/PACRIM.2005.1517247","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517247","url":null,"abstract":"Digital video cameras have become popular consumer items, and users are now able to create and view a lot of video contents. However, there is not an environment to view and edit them efficiently. That is, the editing environments available today are not easy enough for a general user to use all the tools effectively. Yet it seems logical that if people could edit video easily, they would produce more and more edited video. Thus, an easy-to-use editing environment would have mass appeal. In this paper, we propose an easy method of editing video contents by using the user's gaze when viewing a video. There are three factors with regard to editing video in it. With them we transform raw video contents together with information on multiple users' intentions into a semi-edited video. The semi-edited video is not a completely edited, but is ready to be easily edited by a method that can be extensively varied by repeated viewing. The paper discusses a prototype system that supports viewing such video and describes the method to recognize users' intentions.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126043388","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}
引用次数: 6
首页 上一页 下一页 尾页
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学术官方微信