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

Performance evaluation of time compression overlap-add radar systems based on order-statistics CFAR under convolution noise jamming 卷积噪声干扰下基于序统计量CFAR的时间压缩叠加雷达系统性能评价

2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) Pub Date : 2017-08-01 DOI: 10.1109/PACRIM.2017.8121924

Ahmed Youssef, P. Driessen, F. Gebali, B. Moa

{"title":"Performance evaluation of time compression overlap-add radar systems based on order-statistics CFAR under convolution noise jamming","authors":"Ahmed Youssef, P. Driessen, F. Gebali, B. Moa","doi":"10.1109/PACRIM.2017.8121924","DOIUrl":"https://doi.org/10.1109/PACRIM.2017.8121924","url":null,"abstract":"We introduce a new scheme that integrates the Time Compression OverLap-Add (TC-OLA) spread spectrum technique into radar systems, more specifically the Linear Frequency Modulation Pulse Compression (LFM-PC) radar. This technique increases the signal to noise ratio (SNR) and, as a consequence, enables a greater processing gain compared to the traditional radar LFM-PC systems. In addition, TC-OLA allows the radar designer to control the spreading of the signal and therefore provides a better immunity against powerful jamming techniques. In our simulation, we extend the conventional LFM-PC radar model by appropriately adding Time Compression (TC) and Overlap-add (OLA) blocks at the transmitter and receiver, respectively. The evaluation performance of the proposed system and the convention LFM are done under AWGN and under one of the smart jamming technique called Convolution Noise Jamming (CNJ) using different Constant False Alarm Rate (CFAR) algorithms, namely, Cell-Average (CA), Greatest-Of (GO), and Order-Statistics (OS) CFAR. Using the TC-OLA-based LFM radar system, we show that we have higher SNRs while preserving the same Doppler shift and target time delay as the conventional LFM radar system. Furthermore, the proposed radar model relies on high sample rates only after the conventional LFM radar transmitter blocks and before conventional LFM radar receiver blocks. Therefore, it does not require changing any parameters of the conventional radar blocks.","PeriodicalId":308087,"journal":{"name":"2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"28 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":"124878186","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 enhancement by combining visual clues to identify sign language motions 通过结合视觉线索来识别手语动作来提高性能

2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) Pub Date : 2017-08-01 DOI: 10.1109/PACRIM.2017.8121923

Y. Okayasu, Tatsunori Ozawa, Maitai Dahlan, Hiromitsu Nishimura, Hiroshi Tanaka

引用次数: 6

Data-flow implementation of concurrent asynchronous systems 并发异步系统的数据流实现

2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) Pub Date : 2017-08-01 DOI: 10.1109/PACRIM.2017.8121892

F. Gebali, Ali Alzahrani

引用次数: 0

Design and evaluation of page-swap protocols for a remote memory paging system 远程内存分页系统页面交换协议的设计与评估

2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) Pub Date : 2017-08-01 DOI: 10.1109/PACRIM.2017.8121933

Hikari Ohura, H. Midorikawa, K. Kitagawa, M. Kai

{"title":"Design and evaluation of page-swap protocols for a remote memory paging system","authors":"Hikari Ohura, H. Midorikawa, K. Kitagawa, M. Kai","doi":"10.1109/PACRIM.2017.8121933","DOIUrl":"https://doi.org/10.1109/PACRIM.2017.8121933","url":null,"abstract":"A remote memory paging system called a distributed large memory (DLM) has been developed, which uses remote-node memories in a cluster, as the main memory extension of a local node. The DLM is available for out-of-core processing, i.e., processing of large-size data that exceeds the main memory capacity in the local node. By using the DLM and memory servers, it is possible to run multi-thread programs written in OpenMP and pthread for large-scale problems on a computation node whose main memory capacity is smaller than the problem data size. A page swap protocol and its implementation are significant factors in the performance of remote memory paging systems. A current version of the DLM has a bottleneck in efficient page swapping because all communication managements between memory servers and the local computation node are allocated to one system thread. This paper proposes two new page swap protocols and implementations by introducing another new system thread to alleviate this situation. They are evaluated by a micro-benchmark, Stream benchmark, and a 7-point stencil computation program. As a result, the proposed protocol improves the performance degradation ratio, i.e., the performance using the DLM divided by the performance using only the local memory, from 57% in the former protocol to 78% in stencil computation, which processes data whose capacity is four times larger than the local memory capacity.","PeriodicalId":308087,"journal":{"name":"2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"37 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":"128315767","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}

引用次数: 5

No such thing as a “free launch”? Systematic benchmarking of containers 没有所谓的“免费发行”?对容器进行系统基准测试

2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) Pub Date : 2017-08-01 DOI: 10.1109/PACRIM.2017.8121922

Tianming Wei, Madhav Malhotra, Bing Gao, Tomas Bednar, Derek Jacoby, Y. Coady

{"title":"No such thing as a “free launch”? Systematic benchmarking of containers","authors":"Tianming Wei, Madhav Malhotra, Bing Gao, Tomas Bednar, Derek Jacoby, Y. Coady","doi":"10.1109/PACRIM.2017.8121922","DOIUrl":"https://doi.org/10.1109/PACRIM.2017.8121922","url":null,"abstract":"Docker containers have recently become an extremely popular means of building robust, modular systems. Essentially, many architectures leverage lightweight virtualization to manage micro-services. Surprisingly however, there are very few studies revealing the overheads, such as starting new containers in orchestration systems, such as Kubernetes. Though traditional Virtual Machines (VMs) can take on the order of minutes to launch, containers are much faster and the launch times can be on the order of seconds. These overheads typically considered to be negligible compared with the benefits of container-based systems, however, are the predictable? Our work investigates these costs in a systematic study within a private cloud platform. The evaluation outlines a process for studies of this kind. Our results confirm that launch times of VMs are in the range of minutes, whereas containers typically only take seconds. However, these results also show that launch times for new containers do not always scale linearly. Specifically, we identify our system organized by Minikube, a tool that eases local deployment of Kubernetes, introduces a penalty on launch times once the number of containers exceeds 80% of the maximum number of pods available for the cluster. This work demonstrates the presence of unexpected overheads and the need for our proposed systematic infrastructure for testing deployments of containerized services at scale.","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":"128270216","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

Marine mammal sound anomaly and quality detection using multitaper spectrogram and hydrophone big data 基于多锥度谱图和水听器大数据的海洋哺乳动物声音异常及质量检测

2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) Pub Date : 2017-08-01 DOI: 10.1109/PACRIM.2017.8121916

F. Sattar, C. McQuay, P. Driessen

引用次数: 1

A mechanistic model of memory level parallelism fed with cache miss rates 基于缓存缺失率的内存级并行机制模型

2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) Pub Date : 2017-08-01 DOI: 10.1109/PACRIM.2017.8121918

Qin Wang, Kecheng Ji, Ming Ling, Longxing Shi

{"title":"A mechanistic model of memory level parallelism fed with cache miss rates","authors":"Qin Wang, Kecheng Ji, Ming Ling, Longxing Shi","doi":"10.1109/PACRIM.2017.8121918","DOIUrl":"https://doi.org/10.1109/PACRIM.2017.8121918","url":null,"abstract":"Non-blocking caches, which are commonly utilized in modern out-of-order processors, could handle multiple outstanding memory requests simultaneously to reduce the penalties of long latency cache misses. Memory level parallelism (MLP), which refers to the number of memory requests concurrently held by Miss Status Handling Registers (MSHRs), is an indispensable factor to estimate cache performance. To achieve MLP efficiently, previous researches oversimplified the factors that need to be considered when constructing analytical models, especially for the influences of cache miss rate. By quantifying above cache miss rate effects, this paper proposes a mechanistic model of memory level parallelism, which performs more accurate than existing works. 15 benchmarks, chosen from Mobybench 2.0, Mibench 1.0 and MediaBench II, are adopted for evaluating the accuracy of our model. Compared to Gem5 cycle-accurate simulation results, the largest root mean square error is less than 11%, while the average one is around 7%. Meanwhile, the cache performance forecasting process can be sped up about 38 times compared to the Gem5 cycle-accurate simulations.","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":"130560523","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}

引用次数: 5

Aristotle: A flexible open-source software toolkit for semi-automated marking of programming assignments 一个灵活的开源软件工具包，用于半自动标记编程作业

2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) Pub Date : 2017-08-01 DOI: 10.1109/PACRIM.2017.8121888

M. Adams

引用次数: 5

Securing email for the average users via a new architecture 通过新架构保护普通用户的电子邮件安全

2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) Pub Date : 2017-08-01 DOI: 10.1109/PACRIM.2017.8121931

Mehrdad Nourai, H. Levkowitz

{"title":"Securing email for the average users via a new architecture","authors":"Mehrdad Nourai, H. Levkowitz","doi":"10.1109/PACRIM.2017.8121931","DOIUrl":"https://doi.org/10.1109/PACRIM.2017.8121931","url":null,"abstract":"The ubiquity of the Internet and email, have provided a mostly insecure communication medium for the consumer. During the last few decades, we have seen the development of several ways to secure email messages. However, these solutions are inflexible and difficult to use for encrypting email messages to protect security and privacy while communicating or collaborating via email. Under the current paradigm, the arduous process of setting up email encryption is non-intuitive for the average user. The complexity of the current practices has also yielded to incorrect developers' interpretation of architecture which has resulted in interoperability issues. As a result, the lack of simple and easy-to-use infrastructure in current practices means that the consumers still use plain text emails over insecure networks. In this paper, we introduce and describe a novel, holistic model with new techniques for protecting email messages. The architecture of our innovative model is simpler and easier to use than those currently employed. We use the simplified trust model, which can relieve users from having to perform many complex steps to achieve email security. Utilizing the new techniques presented in this paper can safeguard users' email from unauthorized access and protect their privacy. In addition, a simplified infrastructure enables developers to understand the architecture more readily eliminating interoperability.","PeriodicalId":308087,"journal":{"name":"2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"6 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":"127839979","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

Complex event processing enrichment: Motivations and challenges 复杂事件处理丰富:动机和挑战

2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) Pub Date : 2017-08-01 DOI: 10.1109/PACRIM.2017.8121891

Alaa Alakari, K. F. Li, F. Gebali

{"title":"Complex event processing enrichment: Motivations and challenges","authors":"Alaa Alakari, K. F. Li, F. Gebali","doi":"10.1109/PACRIM.2017.8121891","DOIUrl":"https://doi.org/10.1109/PACRIM.2017.8121891","url":null,"abstract":"The complex event processing paradigm (CEP) has been introduced to detect and react to incoming events in many situations that require near real-time responses, though early detection and reaction to emerging scenarios is desirable and is an active research topic. One approach is to enrich CEP systems in a timely manner from diverse and heterogeneous knowledge sources. CEP enrichment is required to cope with today's business demands such as situational awareness while considering real-time constraints including low latency and high throughput. Existing studies either focus on surveying and evaluating techniques and approaches, or concentrate on specific challenges and requirements relevant to complex event enrichment. To our knowledge, none of these studies focus on motivations behind complex event enrichment and related general challenges. This paper aims to provide an in-depth and formal description on the rationales behind enriching CEP systems with external knowledge, and to investigate in existing literature, the correlation between these motivations and approaches to tackle the problems. In addition, challenges faced by complex event enrichment related to these motivations and approaches are highlighted and discussed.","PeriodicalId":308087,"journal":{"name":"2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"94 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":"115032415","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