2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)最新文献

筛选
英文 中文
Improved coding gain of clipped OFDM signal using avalanche effect of AES block cipher 利用AES分组密码的雪崩效应提高截断OFDM信号的编码增益
M. Y. El-Ganiny, H. Elattar, M. Aboul-Dahab, Talaat A. Elgarf
{"title":"Improved coding gain of clipped OFDM signal using avalanche effect of AES block cipher","authors":"M. Y. El-Ganiny, H. Elattar, M. Aboul-Dahab, Talaat A. Elgarf","doi":"10.1109/PACRIM.2017.8121910","DOIUrl":"https://doi.org/10.1109/PACRIM.2017.8121910","url":null,"abstract":"Although Orthogonal Frequency Division Multiplexing (OFDM) seems to be a solution to achieve the demand of high data rates and immunity to the multipath fading channel, it has some drawbacks. High Peak to average power ratio (PAPR) is the most significant problem of these drawbacks. The main objective of this paper is to introduce a modified PAPR reduction technique named as samples clipping and then use a new channel coding approach to enhance the Bit Error Rate (BER) performance with a degree of complexity. This approach is performed by enhancing the cooperation between soft decision decoding and cryptography. This approach is also performed with Binary Phase Shift Key (BPSK) and Quadrature Phase Shift Key (QPSK) modulation techniques. The PAPR and BER performance calculations for the proposed system are investigated and validated by MATLAB simulation results. These results are evaluated under Additive White Gaussian Noise (AWGN) in addition to Rayleigh and Rician Fading channels.","PeriodicalId":308087,"journal":{"name":"2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124510317","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
A fast and scalable FPGA-based parallel processing architecture for K-means clustering for big data analysis 一个快速和可扩展的基于fpga的并行处理架构,用于大数据分析的K-means聚类
R. Raghavan, D. Perera
{"title":"A fast and scalable FPGA-based parallel processing architecture for K-means clustering for big data analysis","authors":"R. Raghavan, D. Perera","doi":"10.1109/PACRIM.2017.8121905","DOIUrl":"https://doi.org/10.1109/PACRIM.2017.8121905","url":null,"abstract":"The exponential growth of complex, heterogeneous, dynamic, and unbounded data, generated by a variety of fields including health, genomics, physics, climatology, and social networks pose significant challenges in data processing and desired speed-performance. Existing processor-based software-only algorithms are incapable of analyzing and processing this enormous amount of data, efficiently and effectively. Consequently, some kind of hardware support is desirable to overcome the challenges in analyzing big data. Big data analytics involves many important data mining tasks including clustering, which categorizes the data into meaningful groups based on the similarity or dissimilarity among objects. In this research work, we introduce an efficient FPGA-based parallel processing architecture for K-means Clustering, one of the most popular clustering algorithms. Experiments are performed on a benchmark dataset to evaluate the feasibility and efficiency of our hardware design. Our hardware architecture is generic, parameterized, and scalable to support larger and varying datasets as well as a varying number of clusters. Our hardware configuration with 32 processing elements (PEs) achieved 368 times speedup compared to its software counterpart.","PeriodicalId":308087,"journal":{"name":"2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"C-17 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121005243","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
A kernel-based solution for overload in mixed criticality multicore systems 基于核的混合临界多核系统过载解决方案
Mostafa A. Al-Dosuky, M. Safar, M. El-Kharashi
{"title":"A kernel-based solution for overload in mixed criticality multicore systems","authors":"Mostafa A. Al-Dosuky, M. Safar, M. El-Kharashi","doi":"10.1109/PACRIM.2017.8121913","DOIUrl":"https://doi.org/10.1109/PACRIM.2017.8121913","url":null,"abstract":"Mixing tasks of different criticality levels on the same processor has become common in modern embedded systems. Scheduling these complex systems on multicore processors is difficult, especially when targeting high utilization. The overload in mixed criticality systems is one of the important problems that faces system designers and may force them to lower the cores utilization to avoid this risky problem. If a fully utilized system is overloaded and no solution is applied, many of coming jobs will miss their deadlines and the system may stay overloaded all the time and never return back to its normal behavior. So, the overload must be transient and the system should guarantee that it can return back its normal behavior shortly after overload happens. In this paper, we present a kernel-based solution for the overload in mixed criticality systems using virtual time. A virtual timer delays the release time and deadlines of tasks in an overload state for a short time to guarantee that it can return back as quickly as possible to its normal behavior. The proposed solution avoids using any user space invocation, as it detects the overload and recovers from it completely inside the kernel space. Our experiments show that the time to recover from overload once it happens is decreased using our proposed technique.","PeriodicalId":308087,"journal":{"name":"2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"52 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132811083","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
Running a MPI program on web browsers 在浏览器上运行MPI程序
S. Okamoto, Masaki Kohana
{"title":"Running a MPI program on web browsers","authors":"S. Okamoto, Masaki Kohana","doi":"10.1109/PACRIM.2017.8121930","DOIUrl":"https://doi.org/10.1109/PACRIM.2017.8121930","url":null,"abstract":"This paper describes an implementation of a runtime environment for portable message-passing C programs with Message Passing Interface (MPI) library on web browsers. We have implemented core functions of the library. The runtime system runs several MPI programs without any modification. We confirm that the runtime performances of the programs are comparable to their native executions on some conditions.","PeriodicalId":308087,"journal":{"name":"2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116448975","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
User controlled object sharing between Java VM instances Java虚拟机实例之间的用户控制对象共享
A. Bierbrauer, K. Nasartschuk, Adam Richard, K. Kent, Peter Shipton
{"title":"User controlled object sharing between Java VM instances","authors":"A. Bierbrauer, K. Nasartschuk, Adam Richard, K. Kent, Peter Shipton","doi":"10.1109/PACRIM.2017.8121934","DOIUrl":"https://doi.org/10.1109/PACRIM.2017.8121934","url":null,"abstract":"String objects, the most commonly used objects in Java programs, are immutable (read-only) and easily identified. Previous analysis of sharing string objects in the Java Virtual Machine showed promising results, however it is clear that sharing a wider set of objects would result in better performance. Automatic object selection for sharing is non-trivial, because in the current state, only read-only objects can be shared. This attribute cannot easily be determined during runtime by an algorithm; the developer on the other hand can. This paper presents the development of an Application Programmer Interface (API) to allow programmers to use the Java Virtual Machine (JVM) internal sharing functionality. Furthermore, we present the usage of the sharing API using open-source software as real-world test cases. The evaluation shows that the balance between memory savings and start-up time overhead is reasonable.","PeriodicalId":308087,"journal":{"name":"2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124632146","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
Enhanced congestion control method for servers and network lines with DPI technology 使用DPI技术增强服务器和网络线路的拥塞控制方法
S. Kato, Kenichiro Hida, S. Kuribayashi
{"title":"Enhanced congestion control method for servers and network lines with DPI technology","authors":"S. Kato, Kenichiro Hida, S. Kuribayashi","doi":"10.1109/PACRIM.2017.8121903","DOIUrl":"https://doi.org/10.1109/PACRIM.2017.8121903","url":null,"abstract":"The use of Deep Packet Inspection (DPI) equipment in a network could simplify the conventional work load for system management and accelerate the control action. The authors proposed a congestion control method that uses a DPI device installed in a network to estimate overload conditions of servers or network links and, upon detecting an overload condition, resolves congestion by moving some virtual machines to other servers or rerouting some communication flows. However, since the previous paper was focused on confirming the effectiveness of using DPI technology, it assumed some restrictive conditions. This paper proposes to enhance the existing DPI-based congestion control, in order to select a solution optimal for the current conditions for cases where there are multiple candidates available for: virtual machines to be moved, physical servers to which virtual machines are to be moved, communication flows to be diverted, and routes to which communication flows are to be diverted. The paper also considers server congestion for cases where computing power congestion and bandwidth congestion occur simultaneously in a server, and link congestion for cases where the maximum allowable network delay of each communication flow is taken into consideration. Finally, the feasibility of the proposed methods is demonstrated by an evaluation system with a real DPI equipment.","PeriodicalId":308087,"journal":{"name":"2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115574031","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 highly efficient I/O-based out-of-core stencil algorithm with globally optimized temporal blocking 基于全局优化时间块的高效I/ based out-of-core模板算法
H. Midorikawa, Hideyuki Tan
{"title":"A highly efficient I/O-based out-of-core stencil algorithm with globally optimized temporal blocking","authors":"H. Midorikawa, Hideyuki Tan","doi":"10.1109/PACRIM.2017.8121909","DOIUrl":"https://doi.org/10.1109/PACRIM.2017.8121909","url":null,"abstract":"This paper proposes the most efficient I/O-based out-of-core stencil algorithm for large-capacity type of non-volatile memory (NVM), such as flash. The paper evaluates the performances of various out-of-core stencil algorithms and implementations designed for flash. The algorithms for flash are very different from existing algorithms designed for memory-and-cache, host-and-GPU, and local-and-remote nodes, in their schemes, data structures used in stencil computations, and the way of using blocking technique to increase data access locality for accelerating performance. The proposed algorithm achieves 80% of the performance of in-core computing using sufficient capacity of the main memory, even if available memory capacity is limited to 6.3% of the data size required in the stencil computation problem. In other words, the algorithm degrades performance within 20% for the stencil computation problem that requires 2TiB of data by using only 128GiB of main memory and flash SSDs whose access latency is much larger than that of DRAM.","PeriodicalId":308087,"journal":{"name":"2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125505118","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 impression estimation and visualization method for TV commercials 一种电视广告印象估计与可视化方法
T. Nakanishi, Keisuke Tamaru
{"title":"An impression estimation and visualization method for TV commercials","authors":"T. Nakanishi, Keisuke Tamaru","doi":"10.1109/PACRIM.2017.8121885","DOIUrl":"https://doi.org/10.1109/PACRIM.2017.8121885","url":null,"abstract":"In this paper, we present an impression estimation method for television commercials with a visualization method. Our method estimates the impressions viewers might have of a new proposal for a TV commercial written in text as weighted favorable factors and visualizes the estimated favorable factors. During the production of TV commercials, it is important to create commercials that clearly communicate the intended messages to viewers. Currently, some agents conduct questionnaire surveys regarding favorable factors for TV commercials. The surveys are being utilized for the production of commercials to meet viewer expectations. If it is possible to estimate the impressions viewers might have of a television commercial before it is broadcast, the producers will be able to quickly make television commercials according to their intentions and based on the estimated impressions. Using our method, and based on the questionnaire survey data of favorable factors for past TV commercials, this system can estimate and visualize the favorable factors as impressions of a new proposal for a TV commercial.","PeriodicalId":308087,"journal":{"name":"2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122938504","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
Deep learning for Amazon satellite image analysis 亚马逊卫星图像分析的深度学习
Lior Bragilevsky, I. Bajić
{"title":"Deep learning for Amazon satellite image analysis","authors":"Lior Bragilevsky, I. Bajić","doi":"10.1109/PACRIM.2017.8121895","DOIUrl":"https://doi.org/10.1109/PACRIM.2017.8121895","url":null,"abstract":"Machine learning can be the key to saving the world from losing football field-sized forest areas each second. As deforestation in the Amazon basin causes devastating effects both on the ecosystem and the environment, there is urgent need to better understand and manage its changing landscape. A competition was recently conducted to develop algorithms to analyze satellite images of the Amazon. Successful algorithms will be able to detect subtle features in different image scenes, giving us the crucial data needed to be able to manage deforestation and its consequences more effectively. This paper presents our entry to the competition, the results obtained, and possible improvements to the algorithm.","PeriodicalId":308087,"journal":{"name":"2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125681245","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
Knowledge extraction from creators of presentation slides on a slide sharing service 从幻灯片共享服务的演示幻灯片创建者那里提取知识
Hayato Tsukiji, Kosuke Takano
{"title":"Knowledge extraction from creators of presentation slides on a slide sharing service","authors":"Hayato Tsukiji, Kosuke Takano","doi":"10.1109/PACRIM.2017.8121914","DOIUrl":"https://doi.org/10.1109/PACRIM.2017.8121914","url":null,"abstract":"In this study, we present a method for extracting and representing knowledge of presentation slide creators based on the slide contents that are published on a slide sharing service. The proposed method regards the number of views, downloads, and likes from other users as the users rating for a presentation slide, and extract knowledge of the slide creator in terms of the usefulness and knowledge amount of the slide contents. In the experiment, we evaluate the feasibility of the proposed method by analyzing the presentation slides created by users on SlideShare, which is one of the most popular slide sharing service.","PeriodicalId":308087,"journal":{"name":"2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131599559","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学术文献互助群
群 号:481959085
Book学术官方微信