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

Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing最新文献

筛选
英文 中文
Multicarrier error correction using T-codes 使用t码的多载波纠错
Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2011-10-03 DOI: 10.1109/PACRIM.2011.6033011
U. Speidel, T. Gulliver, T. Shongwe
{"title":"Multicarrier error correction using T-codes","authors":"U. Speidel, T. Gulliver, T. Shongwe","doi":"10.1109/PACRIM.2011.6033011","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6033011","url":null,"abstract":"This paper considers a multicarrier communication system with n subchannels, each of which may be subject to insertion, deletion or inversion errors. A (variable-length) T-code is employed on each subchannel with two constraints: transmission of codewords starts simultaneously on all subchannels, and the codeword length ℓ is the same for all subchannels, i.e., codewords of different lengths may be used for each transmission in the time domain, but not in the frequency domain. This allows for the construction of an (n, K, d) error-correcting code over FQ, where Q ≤ mℓ, and mℓ is the number of codewords of length ℓ in the T-code.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115235867","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 learning repeated combinatorial auctions 关于重复组合拍卖的学习
Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2011-10-03 DOI: 10.1109/PACRIM.2011.6032900
Seiichi Arai, T. Miura
{"title":"On learning repeated combinatorial auctions","authors":"Seiichi Arai, T. Miura","doi":"10.1109/PACRIM.2011.6032900","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032900","url":null,"abstract":"In this work, we discuss how an intelligent agent learns in combinatorial auctions. It is well-known that finding the optimal allocation to maximize revenue is NP-complete, because this is a typical form of Set Package Problem (SPP). We introduce a framework of reinforcement learning to combinatorial auctions, and discuss how to obtain intelligence about bidding behavior. We show empirical convergence of knowledge within Q-learning framework. By this result, we target fully automated negotiation systems.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123890717","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
AC compiler for large data sequential processing using remote memory 使用远程内存进行大数据顺序处理的AC编译器
Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2011-10-03 DOI: 10.1109/PACRIM.2011.6032892
Shiyo Yoshimura, H. Midorikawa
{"title":"AC compiler for large data sequential processing using remote memory","authors":"Shiyo Yoshimura, H. Midorikawa","doi":"10.1109/PACRIM.2011.6032892","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032892","url":null,"abstract":"Prevailing 64bit-OS enables us to use a large memory address space in computer programming general. However, the actual physical memory becomes the limitation in utilizing it fully. When a program requires more memory than available physical memory in a computer, a traditional virtual memory system performs the page swap between a local hard disk and physical memory. Here, with the recent development in high-speed network, remote-memory access via networks becomes faster than accessing a local hard disk. We built the Distributed Large Memory System (DLM) to access vast remote memories in networks. The DLM is designed as a user-level software for high portability. The DLM provides a very large virtual memory using remote memories distributed over cluster nodes. This paper proposes a newly designed C compiler for the DLM. It provides an easy programming interface to use the abundant memory of the DLM with existing sequential programs, instead of developing parallel programs.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"280 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120898046","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
Multiplicative video watermarking with semi-blind maximum likelihood decoding for copyright protection 基于半盲最大似然解码的乘性视频水印版权保护
Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2011-10-03 DOI: 10.1109/PACRIM.2011.6032879
H. Khalilian, I. Bajić
{"title":"Multiplicative video watermarking with semi-blind maximum likelihood decoding for copyright protection","authors":"H. Khalilian, I. Bajić","doi":"10.1109/PACRIM.2011.6032879","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032879","url":null,"abstract":"This paper presents a new watermarking technique for uncompressed video. The video signal is first divided into non-overlapping pixel cubes. The spatial and temporal characteristic of each cube are analyzed and used as a criterion for data insertion. The 2-D wavelet transform is applied on each plane of the selected cubes. Data are multiplicatively embedded in the low band wavelet coefficients. To extract the watermark, a semi-blind maximum likelihood decoder is employed. For this purpose, the statistics of the cube's first principal component are used at the decoder as side information. Results show that this scheme is robust against linear collusion, frame swapping, frame dropping, noise insertion, median filtering, and several compression attacks.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121483541","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}
引用次数: 21
Assessing the performance of AODV, DYMO, and OLSR routing protocols in the context of larger-scale denser MANETs 评估AODV、DYMO和OLSR路由协议在更大规模密集的manet环境下的性能
Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2011-10-03 DOI: 10.1109/PACRIM.2011.6032974
D. Arora, E. Millman, S. Neville
{"title":"Assessing the performance of AODV, DYMO, and OLSR routing protocols in the context of larger-scale denser MANETs","authors":"D. Arora, E. Millman, S. Neville","doi":"10.1109/PACRIM.2011.6032974","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032974","url":null,"abstract":"Assessing the performance of mobile ad hoc network (MANET) routing protocols has typically been done within the context of networks with < 100 nodes/km2 where 150m to 200m per-node communication ranges are used. In such networks 1 to 2 hop communications dominate. A basic question, therefore, is how do these protocols perform in denser networks where multi-hop communications are innately required? Through the simulation study of a larger-scale denser 360-node multi-hop network, this work shows that, contrary to prior smaller-scale lower density MANET studies, AODV and DYMO outperforms OLSR within multi-hop networks. To the authors' knowledge this deficiency within OLSR has not been previously reported. These issues are of interest as the wide-scale adoption of smartphones have provided a pragmatic deployment platform for such larger-scale denser MANETs, particularly within urban cores and for non-cellular based network services.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116509803","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}
引用次数: 11
Solving the multiobjective environmental/economic dispatch problem with prohibited operating zones using NSGA-II 利用NSGA-II解决禁止作业区域的多目标环境/经济调度问题
Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2011-10-03 DOI: 10.1109/PACRIM.2011.6032909
R. King, H. Rughooputh, K. Deb
{"title":"Solving the multiobjective environmental/economic dispatch problem with prohibited operating zones using NSGA-II","authors":"R. King, H. Rughooputh, K. Deb","doi":"10.1109/PACRIM.2011.6032909","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032909","url":null,"abstract":"A thermal or hydro generating unit may have prohibited operating zones due to physical limitations of power plant components caused, for example, by vibrations in a shaft bearing which are amplified in a certain operating region. In this case, the unit can only operate above or below the prohibited operating zone. The effect of prohibited operating zones on the multiobjective environmental/economic dispatch problem is investigated in this paper. The IEEE 30-bus system with transmission losses has been considered with prohibited operating zones and simulation performed using the elitist Nondominated Sorting Genetic Algorithm (NSGA-II) for two constraint handling methods, namely penalty parameterless and decoder-based approaches. Simulation results show that both methods can equally handle this particular scenario in the environmental/economic dispatch problem. Different number of prohibited operating zones was considered for the six generators in the system yielding discontinuous and non-convex non-dominated fronts.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125065070","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}
引用次数: 17
Design and implementation of serializing method for non-procedural object transfer between JavaVMs javavm之间非过程对象传输的序列化方法的设计与实现
Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2011-10-03 DOI: 10.1109/PACRIM.2011.6032903
Daisuke Yamaguchi, Yuuki Akai, M. Kai
{"title":"Design and implementation of serializing method for non-procedural object transfer between JavaVMs","authors":"Daisuke Yamaguchi, Yuuki Akai, M. Kai","doi":"10.1109/PACRIM.2011.6032903","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032903","url":null,"abstract":"In a heterogeneous processing environment in a computer network where multiple PCs running JavaVM on them are connected to, it is very useful to make any class instance movable among any PCs. However, JavaVM can't inherently load and execute unknown classes dynamically which are not in the class path specified at startup of the JavaVM. In this research, we propose and develop a new mechanism to recognize and execute any unknown class dynamically by implementing a multi-tiered classloader, special object stream and dispatch mechanism for transferred objects. This proposed technology is useful and indispensable component technology for parallel distributed processing system based on mobile agent system with strong migration mobility. This technology makes it possible to implement various non-stop software services.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128538412","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
Hybrid search based association rule mining 基于混合搜索的关联规则挖掘
Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2011-10-03 DOI: 10.1109/PACRIM.2011.6032963
A. M. Ghanem, H. Sallam
{"title":"Hybrid search based association rule mining","authors":"A. M. Ghanem, H. Sallam","doi":"10.1109/PACRIM.2011.6032963","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032963","url":null,"abstract":"Association rule mining algorithms provide different search strategies to discover the frequent itemsets; however the problem of large search space is still hard to handle. The present paper suggests a novel hybrid search technique based on reducing the search space, I/O, and CPU times. This can improve the performance up to several orders of magnitude compared to APRIORI algorithm.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125879464","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
An analytical method considering bursty traffic for data transfer in high-speed networks 高速网络中考虑突发流量的数据传输分析方法
Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2011-10-03 DOI: 10.1109/PACRIM.2011.6032959
Keijiro Murakami, K. Baba, Takafumi Moriguchi
{"title":"An analytical method considering bursty traffic for data transfer in high-speed networks","authors":"Keijiro Murakami, K. Baba, Takafumi Moriguchi","doi":"10.1109/PACRIM.2011.6032959","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032959","url":null,"abstract":"Large-scale computing applications utilizing many computational nodes via networks have become executable because of high-speed network and computing technologies. Many such computing applications repeat calculations and synchronous data exchange among computational nodes alternately, so that much data is transferred among nodes at almost the same time, and network congestion occurs as a result. When we evaluate the performance of networks which accommodate bursty traffic in high-speed networks, conventional simulation techniques cannot observe the behavior and fluctuation of traffic. In this paper, we introduce a new hybrid-system model and use the improved model to observe the behavior of bursty traffic in high-speed networks. Through a computer simulation, we show that the proposed model can observe the behavior of the bursty traffic in high-speed networks in comparison with a conventional hybrid-system model which cannot.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121665141","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
Design and implementation of an Inflate acceleration core 膨胀加速核心的设计与实现
Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2011-10-03 DOI: 10.1109/PACRIM.2011.6032965
J. Libby, K. Kent
{"title":"Design and implementation of an Inflate acceleration core","authors":"J. Libby, K. Kent","doi":"10.1109/PACRIM.2011.6032965","DOIUrl":"https://doi.org/10.1109/PACRIM.2011.6032965","url":null,"abstract":"Latency found in user interfaces can seriously harm the experience of an end user. Long load times, and perceived sluggishness of systems can potentially cause users to abandon a system for one with a more responsive interface. This work will present the development of a decompression core that will be used in conjunction with Portable Network Graphics (PNGs) to accelerate the performance of a graphics intensive user interface. The goal of this project is to produce a decompression core that is capable of decompressing PNG graphics at, or above, hardware bound date transfer rates.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129056982","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
首页 上一页
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学术官方微信