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

筛选
英文 中文
GPU-acceleration of blowfish cryptographic algorithm 河豚密码算法的gpu加速
Kapil Earanky, H. Elmiligi, Musfiq Rahman
{"title":"GPU-acceleration of blowfish cryptographic algorithm","authors":"Kapil Earanky, H. Elmiligi, Musfiq Rahman","doi":"10.1109/PACRIM.2015.7334889","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334889","url":null,"abstract":"The demand for fast and secure cryptographic encryption techniques has been growing over the recent years. The introduction of the CUDA programming framework by NVIDIA allowed utilizing GPUs for general purpose computing. The use of GPUs in the cryptography domain has become quite popular ever since. In this paper, we present a CUDA implementation of the blowfish encryption algorithm. The algorithm has been designed to make use of the unified memory model introduced as a part of CUDA 6. Experimental results show that the unified implementation of the blowfish algorithm performs better than an efficient CPU implementation by a factor of 62X and performs twice better than a non-unified CUDA implementation of the algorithm. We also present possible solutions to achieve an optimal configuration for the target GPU to get the best performance.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124672028","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
Robust adversarial learning and invariant measures 鲁棒对抗学习和不变测度
S. Neville, M. Elgamal, Zahra Nikdel
{"title":"Robust adversarial learning and invariant measures","authors":"S. Neville, M. Elgamal, Zahra Nikdel","doi":"10.1109/PACRIM.2015.7334893","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334893","url":null,"abstract":"A number of open cyber-security challenges are arising due to the rapidly evolving scale, complexity, and heterogeneity of modern IT systems and networks. The ease with which copious volumes of operational data can be collected from such systems has produced a strong interest in the use of machine learning (ML) for cyber-security, provided that ML can itself be made sufficiently immune to attack. Adversarial learning (AL) is the domain focusing on such issues and an arising AL theme is the need to ensure that ML solutions make use of robust input measurement features (i.e., the data sets used for ML training must themselves be robust against adversarial influences). This observation leads to further open questions, including: “What formally denotes sufficient robustness?”, “Must robust features necessarily exist for all IT systems?”, “Do robust features necessarily provide complete coverage of the attack space?”, etc. This work shows that these (and other) open AL questions can be usefully re-cast in terms of the classical dynamical system's problem of needing to focus analyses on a system's invariant measures. This re-casting is useful as a large body of mature dynamical systems theory exists concerning invariant measures which can then be applied to cyber-security. To our knowledge this the first work to identify and highlight this potentially useful cross-domain linkage.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130841843","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
Enhancing Moving Objects in light field videos using 5-D IIR adaptive depth-velocity filters 利用5维IIR自适应深度-速度滤波器增强光场视频中的运动物体
C. Edussooriya, Len T. Bruton, P. Agathoklis
{"title":"Enhancing Moving Objects in light field videos using 5-D IIR adaptive depth-velocity filters","authors":"C. Edussooriya, Len T. Bruton, P. Agathoklis","doi":"10.1109/PACRIM.2015.7334829","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334829","url":null,"abstract":"The spectrum of an object moving in 5-D light field videos (also known as plenoptic videos) with constant velocity and at non-constant depth is analyzed. Based on this analysis, a novel 5-D IIR adaptive depth-velocity filter is proposed for enhancing such objects. The time-variant coefficients of the proposed 5-D IIR adaptive depth-velocity filter are derived in closed form. Numerical simulation results confirm the effectiveness of the proposed filter compared to 3-D IIR adaptive velocity filters and 4-D IIR adaptive depth filters.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130923949","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
Dynamic load balancing in multi-agent spatial simulation 多智能体空间仿真中的动态负载平衡
Bhargav A. Mistry, M. Fukuda
{"title":"Dynamic load balancing in multi-agent spatial simulation","authors":"Bhargav A. Mistry, M. Fukuda","doi":"10.1109/PACRIM.2015.7334824","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334824","url":null,"abstract":"This paper presents dynamic load balancing in a parallelizing library for multi-agent spatial simulation (named MASS). Our load-balancing algorithms calculate per-thread CPU load right after every function call and adjust a data size to be passed to each thread for the next function call. We implemented three different thread-based load-balancing algorithms, each using (1) an entire history, (2) a recent time window and (3) a slope of the CPU loads. The paper presents our implementation of these three algorithms in MASS as well as performance evaluation with two multithreaded applications: Wave2D and SugarScape. Furthermore, to demonstrate the slope-based algorithm's superiority to the other two, we compared them over a cluster of computing nodes.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116934033","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
Performance analysis of 64-bit Carry Lookahead Adders using conventional and hierarchical structure styles 使用传统和分层结构风格的64位进位前瞻加法器的性能分析
Abdulmajeed Alghamdi, F. Gebali
{"title":"Performance analysis of 64-bit Carry Lookahead Adders using conventional and hierarchical structure styles","authors":"Abdulmajeed Alghamdi, F. Gebali","doi":"10.1109/PACRIM.2015.7334813","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334813","url":null,"abstract":"This paper introduces performance analysis of 64-bit Carry Lookahead Adders using conventional and hierarchical structure styles. We evaluate conventional carry lookahead adder (CLA) and hierarchical carry lookahead adder (HCLA) using different parameters. Our design is targeted into FPGA Virtex 7 family. Area, delay, and area-delay product of all design choices are reported. In the experimental results, we reduced CLA delay and area using radix-2 which performed better than traditionally used radix-4 CLA. In addition, we showed that CLA using conventional structure has better performance than the hierarchical structure.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134124285","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
Multi-class acoustic event classification of hydrophone data 水听器数据的多类声事件分类
Gorkem Cipli, F. Sattar, P. Driessen
{"title":"Multi-class acoustic event classification of hydrophone data","authors":"Gorkem Cipli, F. Sattar, P. Driessen","doi":"10.1109/PACRIM.2015.7334883","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334883","url":null,"abstract":"In this paper, we address the problem of multi-class classification of hydrophone data for acoustic events using low-dimensional features. A new iterative multiclass classification scheme is proposed based on the combination of adaptive MFCC feature set and an improved HMM-GMM classifier. The adaptive window length for MFCC is important since for acoustic sounds in the ocean, the optimum window length may be different unlike the window length of 16 - 32 msec, which is optimum for speech signals. Further, in order to increase the classification performance, we perform the B-spline approximation to the generated Gaussians parameters of the multi model HMM-GMM classifier to enhance the separation of the decision region. Experimental results for the real recorded hydrophone data show that our improved iterative scheme efficiently classifies the acoustic events with high mean accuracy (96%), sensitivity (95%), and specificity (97%).","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132965810","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
Automated highlight generation from cricket broadcasts using ORB 使用ORB从板球广播中自动生成高光
D. Ringis, A. Pooransingh
{"title":"Automated highlight generation from cricket broadcasts using ORB","authors":"D. Ringis, A. Pooransingh","doi":"10.1109/PACRIM.2015.7334809","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334809","url":null,"abstract":"This paper investigates the use of the Oriented Fast, Rotated Brief (ORB) method to automatically detect the most significant broadcast view associated with cricket broadcasts: the Bowler Run-up Sequence (BRS) for cricket highlight generation. This method is computationally less expensive than other methods proposed for BRS detection. It is shown here that only a single frame is required for training to produce acceptable results as compared to other BRS detection methods. The ORB method produced a BRS detection rate of 98.26% and false detection rate of 5.70% and average matching time of 0.059 seconds. The fast training and matching makes this ideal for real time generation of highlight sand the detection is robust to sequences with high camera motion.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122685810","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
New graph-based text summarization method 新的基于图的文本摘要方法
S. alZahir, Qandeel Fatima, M. Cenek
{"title":"New graph-based text summarization method","authors":"S. alZahir, Qandeel Fatima, M. Cenek","doi":"10.1109/PACRIM.2015.7334869","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334869","url":null,"abstract":"The exponential growth of text data on the World Wide Web as well as on databases off line created a critical need for efficient text summarizers that significantly reduce its size while maintaining its integrity. In this paper, we present a new multigraph-based text summarizer method. This method is unique in that it produces a multi-edge-irregular-graph that represents words occurrence in the sentences of the target text. This graph is then converted into a symmetric matrix from which we can produce the ranking of sentences and hence obtain the summarized text using a threshold. To test our method performance, we compared our results with those from the most popular publicly available text summarization software using a corpus of 1000 samples from 6 different applications: health, literature, politics, religion, science and sports. The simulation results show that the proposed method produced better or comparable summaries in all cases. The proposed method is fast and can be implement for real time summarization.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129370837","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}
引用次数: 10
Analysis of via-resolver DNS TXT queries and detection possibility of botnet communications 通过解析器DNS TXT查询的分析和僵尸网络通信的检测可能性
Hikaru Ichise, Yong Jin, K. Iida
{"title":"Analysis of via-resolver DNS TXT queries and detection possibility of botnet communications","authors":"Hikaru Ichise, Yong Jin, K. Iida","doi":"10.1109/PACRIM.2015.7334837","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334837","url":null,"abstract":"Recent reports on Internet security have indicated that the DNS (Domain Name System) protocol is being used for botnet communication in various botnets; in particular, botnet communication based on DNS TXT record type has been observed as a new technique in some botnet-based cyber attacks. One of the most fundamental Internet protocols, the DNS protocol is used for basic name resolution as well as many Internet services, so it is not possible to simply block out all DNS traffic. To block out only malicious DNS TXT record based botnet communications, it would be necessary to distinguish them from legitimate DNS traffic involving DNS TXT records. However, the DNS TXT record is also used in many legitimate ways since this type is allowed to include any plain text up to a fairly long length. In this paper, we mainly focus on the usage of the DNS TXT record and explain our analysis using about 5.5 million real DNS TXT record queries obtained for over 3 months in our campus network. Based on the analysis findings, we discuss a new method to detect botnet communication. Our analysis results show that 330 unique destination IP addresses (cover approximately 22.1% of unknown usages of DNS TXT record queries) may have been involved in malicious communications and this proportion is a reasonable basis for network administrators to perform detailed manual checking in many organizations.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116802786","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
The Area Code Tree for nearest neighbour searching 最近邻搜索的区域代码树
Fatema Rahman, W. Osborn
{"title":"The Area Code Tree for nearest neighbour searching","authors":"Fatema Rahman, W. Osborn","doi":"10.1109/PACRIM.2015.7334826","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334826","url":null,"abstract":"In this paper, we propose the Area Code Tree for nearest neighbour searching. It is a trie-type structure that stores points of interest (POIs) that are represented in area code format. An area code is a sequence of digits that indicate the relative location in space of a POI. We present the area code calculation, insert, and nearest neighbour search algorithms. We also present the results of a preliminary evaluation on the nearest neighbour search performance. We find that the efficient search times make the Area Code Tree an excellent candidate for continuous nearest neighbour processing for location-based services.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115229983","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学术官方微信