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

2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing最新文献

筛选
英文 中文
The Impact of Google Hacking on Identity and Application Fraud 谷歌黑客攻击对身份和应用欺诈的影响
2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2007-09-24 DOI: 10.1109/PACRIM.2007.4313220
A. Abdelhalim, I. Traoré
{"title":"The Impact of Google Hacking on Identity and Application Fraud","authors":"A. Abdelhalim, I. Traoré","doi":"10.1109/PACRIM.2007.4313220","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313220","url":null,"abstract":"In the last several years, identity theft has been on the rise. The Internet represents an appealing place for fraudsters to collect a host of personal and financial data related to many innocent users. Using the collected data they can impersonate the users and commit different fraudulent activities including application fraud. Mining Internet data for fraudulent purposes is commonly referred to as (black hat) Google hacking. We discuss in this paper the impact of Google hacking on identity fraud, with an emphasis on fraudulent applications for identity certificates such as credit cards, passports, and so on. The discussion is based on the results of an experiment performed over the Internet by conducting some (white hat) Google hacking and collecting sensitive identity information for living as well as dead persons. We also outline the architecture of a security tool for detecting application fraud that is currently under development.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128603233","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}
引用次数: 9
Lossless Compression of Mammographic Images by Chronological Sifting of Prediction Errors 按时间顺序筛选预测误差的乳房x线影像无损压缩
2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2007-09-24 DOI: 10.1109/PACRIM.2007.4313176
A. Neekabadi, S. Samavi, N. Karimi, E. Nasr-Esfahani, S. A. Razavi, S. Shirani
{"title":"Lossless Compression of Mammographic Images by Chronological Sifting of Prediction Errors","authors":"A. Neekabadi, S. Samavi, N. Karimi, E. Nasr-Esfahani, S. A. Razavi, S. Shirani","doi":"10.1109/PACRIM.2007.4313176","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313176","url":null,"abstract":"Mammography is a low dose x-ray technique that's used to create an image of the breast. It is an efficient way for early detection of any cancerous changes and malignancy of lumps. Mammographic images are usually archived and in many cases are transferred on Internet. Therefore, compression of these images has attracted the attention of many researchers. In this paper an efficient method is proposed for lossless compression of mammographic images. Gradual compression of prediction errors in an iterative manner is the basic idea of the proposed method. The simulation results were compared with standard image compression routines such as JPEG-LS, JPEG2000, JBIG and PNG. The superiority of the proposed method was shown for compression of mammographic images.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121041641","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
Mixed-mode Implementation of Particle Filters 粒子滤波器的混合模式实现
2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2007-09-24 DOI: 10.1109/PACRIM.2007.4313312
R. Velmurugan, S. Subramanian, V. Cevher, J. McClellan, D.V. Anderson
{"title":"Mixed-mode Implementation of Particle Filters","authors":"R. Velmurugan, S. Subramanian, V. Cevher, J. McClellan, D.V. Anderson","doi":"10.1109/PACRIM.2007.4313312","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313312","url":null,"abstract":"In this paper, we develop new mixed-mode implementations for particle Biters and compare them to a digital implementation. The motivation for the mixed-mode implementation is to achieve low-power implementation of particle filters. The specific application considered is a bearings-only, single-target tracking algorithm. Specifically, we develop mixed-mode implementations that use analog components to realize nonlinear functions in the particle filter algorithm. The analog implementation of nonlinear functions uses low-power multiple-input translinear element (MITE) networks. Simulation results for one mixed-mode implementation of the bearings-only tracker show that the analog errors are low enough to support accurate tracking. Redesign of the mixed-mode implementation in a second form with more analog components will result in nearly twenty times less power dissipation.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121287983","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}
引用次数: 7
Generalized Cover-Free Families for Topology-Transparent Channel Assignment 拓扑透明信道分配的广义无覆盖族
2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2007-09-24 DOI: 10.1109/PACRIM.2007.4313253
C. Colbourn, P. Dukes, V. Syrotiuk
{"title":"Generalized Cover-Free Families for Topology-Transparent Channel Assignment","authors":"C. Colbourn, P. Dukes, V. Syrotiuk","doi":"10.1109/PACRIM.2007.4313253","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313253","url":null,"abstract":"In a network with a shared communication channel having limited transmission range, topology-transparent protocols support communication among neighbouring nodes, even when the only information a node has about its neighbourhood is the maximum number of active transmitters within range. Cover-free families provide the underlying schedules to allocate time slots for transmission to a node so as to maximize the number of active transmitters permitted while guaranteeing at least one collision-free slot. Scheduling can reduce contention by limiting the number of active transmitters. In this paper we generalize topology-transparent schemes to communication on multiple channels, in which each node is equipped with many radio interfaces. The goal is to ensure that for every transmitter and every receiver, some channel is shared by them but not interfered with by any other set of potential transmitters, provided that that set is not too large. This requirement is met by a generalized cover-free family.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116271662","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 PAPR Reduction Method using Constraint Code in Multicode CDMA System 基于约束码的多码CDMA系统PAPR降低方法
2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2007-09-24 DOI: 10.1109/PACRIM.2007.4313233
H. Ryu, Sang-Kyun Kim, Seung-Eun Lee, Chengxiang Wang
{"title":"A PAPR Reduction Method using Constraint Code in Multicode CDMA System","authors":"H. Ryu, Sang-Kyun Kim, Seung-Eun Lee, Chengxiang Wang","doi":"10.1109/PACRIM.2007.4313233","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313233","url":null,"abstract":"Multicode - Code Division Multiple Access (MC-CDMA) system is very good for the several kinds of service rates with various quality of service requirement because it can affordable by assigning multiple codes and controlling the flexible capacity. However, the so many multi-code signals are summed in the time domain so that it suffers from the serious problem of high peak to average power ratio (PAPR). Therefore, the expensive linear amplifier or large input back-off is necessary to overcome the problem but it makes power consumption of high power amplifier (HPA) very poor. In this paper, we propose a new method that can reduce PAPR efficiently by constraint codes based on the opposite correlation property of the incoming information data. PAPR reduction performance depends on the length and indices of constraint codes in the MC-CDMA system. There is a trade-off between PAPR reduction and the length of constraint codes. We also study the BER improvement in AWGN channel. The simulation results show that BER performance can be very close to the linear amplifier in two cases: 1) when the exact constraint codes are used without input back-off and 2) when a few constraint codes are used with small input back-off.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115757465","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
A Grid Computing System using Low Resource Compact Computers 使用低资源紧凑计算机的网格计算系统
2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2007-09-24 DOI: 10.1109/PACRIM.2007.4313197
T. Demiya, T. Yoshihisa, M. Kanazawa
{"title":"A Grid Computing System using Low Resource Compact Computers","authors":"T. Demiya, T. Yoshihisa, M. Kanazawa","doi":"10.1109/PACRIM.2007.4313197","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313197","url":null,"abstract":"Recently, grid computing has attracted great attention. In grid computing, by using multiple computers and executing processes in parallel, we can get powerful computational power. Grid computing systems often employ regular computers such as personal computers or workstations. However, we can exploit computational power more effectively by employing compact computers embedded to many home electronics such as refrigerators or air-conditioners. In this paper, we propose a grid computing system using compact computers. Generally, embedded compact computers almost always execute their assigned processes. Therefore, our proposed system controls their computational powers so that processes required by the grid computing system do not interrupt assigned processes for compact computers.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126590106","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
Groupwise Recursive Channel Estimation for Space-Frequency Block Coded OFDM Systems in Doubly Selective Fading Channels 双选择性衰落信道中空频分组编码OFDM系统的分组递归信道估计
2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2007-09-24 DOI: 10.1109/PACRIM.2007.4313307
S. Muruganathan, T. X. Lai, A. Sesay
{"title":"Groupwise Recursive Channel Estimation for Space-Frequency Block Coded OFDM Systems in Doubly Selective Fading Channels","authors":"S. Muruganathan, T. X. Lai, A. Sesay","doi":"10.1109/PACRIM.2007.4313307","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313307","url":null,"abstract":"In this paper, we propose two computationally efficient groupwise recursive channel estimation algorithms for channel encoded SFBC-OFDM systems in doubly (i.e., frequency and time) selective fading channels. The first of these algorithms is based on the recursive least squares (RLS) principle whereas the second one employs the minimum mean square error (MMSE) criterion. To reduce the computational complexity associated with the groupwise recursive channel estimation schemes, we propose an inverse QR decomposition (IQR) algorithm based on scaled Givens rotations. The performance of the proposed algorithms is evaluated via simulations and compared to the case with perfect channel state information (CSI) knowledge at the receiver. The simulations show that the proposed algorithms perform reasonably close to the perfect CSI case under various channel conditions.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130349529","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
A Structural Architecture for HW Packet Processing HW包处理的结构体系
2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2007-09-24 DOI: 10.1109/PACRIM.2007.4313249
H. Widiger, S. Kubisch, D. Timmermann
{"title":"A Structural Architecture for HW Packet Processing","authors":"H. Widiger, S. Kubisch, D. Timmermann","doi":"10.1109/PACRIM.2007.4313249","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313249","url":null,"abstract":"In modern network applications and especially in Access Networks, the demands towards functionality and throughput are rising permanently. Furthermore, telecommunication carriers have different and changing requirements towards Access Network equipment. They are thus demanding a great deal of flexibility in IP-DSLAMS. To satisfy these various needs, highly flexible and particularly high performing packet processors are required. We propose an architecture for hardware modules, which joins the advantages of software and hardware solutions targeting packet processing. Our architecture provides a powerful and fast solution due to hardware implementation. Furthermore, it enables flexible and adaptive packet processors for different needs and configurations comparable to a software solution based on a network processor. This is accomplished without any overhead of unnecessary functionality and without the difficulties, which occur when it comes to adjusting pure ASIC packet processors to different tasks. Our architectural approach thus provides a good solution for packet processing.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130353860","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
Optimizing Reconstruction Resolution for Weak-phase Object in Lensless Holographic Imaging 无透镜全息成像中弱相位物体重构分辨率优化
2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2007-09-24 DOI: 10.1109/PACRIM.2007.4313305
Jun Wan, A. A. Adeyemi, T. Darcie
{"title":"Optimizing Reconstruction Resolution for Weak-phase Object in Lensless Holographic Imaging","authors":"Jun Wan, A. A. Adeyemi, T. Darcie","doi":"10.1109/PACRIM.2007.4313305","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313305","url":null,"abstract":"This paper shows that the best reconstruction resolution for holographic imaging of weak-phase objects using a plane wave and charge-coupled device (CCD) recording is determined by the CCD pixel size. Resolution can be optimized by choosing an optimal distance from CCD plane to the object. Our numerical simulations quantify the relation between reconstruction resolution, CCD pixel size, total pixel number, and distance from phase object to CCD plane.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128031923","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
Development of a Co-Design Learning Environment 协同设计学习环境的开发
2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 2007-09-24 DOI: 10.1109/PACRIM.2007.4313250
S. McGinn, K. Kent
{"title":"Development of a Co-Design Learning Environment","authors":"S. McGinn, K. Kent","doi":"10.1109/PACRIM.2007.4313250","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313250","url":null,"abstract":"Embedded system applications in commercial products are quickly taking precedent as the ideal solution addressing the consumer push for smaller, more robust, low cost devices. Bearing this, it is essential that we as students of the technology acknowledge this demand for heterogeneous appliance, and adopt the practice of developing co-dependent applications. As it stands, commercially available development environments tend to come at substantial cost, exceeding the limitations of the student budget. With this work, we address the issue of high priced learning in providing a feasible solution, well suited for employing the theories of co-design and co-development.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131170039","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学术官方微信