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

2011 First International Conference on Data Compression, Communications and Processing最新文献

筛选
英文 中文
Verification of a Batch of Bad Signatures by Using the Matrix-Detection Algorithm 利用矩阵检测算法验证一批不良签名
2011 First International Conference on Data Compression, Communications and Processing Pub Date : 2011-06-21 DOI: 10.1109/CCP.2011.46
Yi-Li Huang, Chu-Hsing Lin, Fang-Yie Leu
{"title":"Verification of a Batch of Bad Signatures by Using the Matrix-Detection Algorithm","authors":"Yi-Li Huang, Chu-Hsing Lin, Fang-Yie Leu","doi":"10.1109/CCP.2011.46","DOIUrl":"https://doi.org/10.1109/CCP.2011.46","url":null,"abstract":"Batch verification is a method devised to verify multiple signatures as a whole simultaneously. In literatures, we can see that some conventional batch verification schemes cannot effectively and efficiently identity bad signatures. Small Exponent test, a popular batch verification method, has its own problems, e.g., after a test, bad signatures still exist with some escape probabilities. In this paper, we propose a batch verification approach, called Matrix-Detection Algorithm (MDA for short), with which when a batch of signatures has less than four bad signatures or odd number of bad signatures, all bad signatures can be identified. Given 1024 signatures with 4 bad signatures, the maximum escape probability pmax of the MDA is 5.3×10-5 , and max p decreases as digital signatures or bad signatures increase. Analytic results show that the MDA is more secure and efficient than the SET.","PeriodicalId":167131,"journal":{"name":"2011 First International Conference on Data Compression, Communications and Processing","volume":"46 42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131190658","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
Backwards Search in Context Bound Text Transformations 上下文绑定文本转换中的向后搜索
2011 First International Conference on Data Compression, Communications and Processing Pub Date : 2011-06-21 DOI: 10.1109/CCP.2011.18
M. Petri, G. Navarro, J. Culpepper, S. Puglisi
{"title":"Backwards Search in Context Bound Text Transformations","authors":"M. Petri, G. Navarro, J. Culpepper, S. Puglisi","doi":"10.1109/CCP.2011.18","DOIUrl":"https://doi.org/10.1109/CCP.2011.18","url":null,"abstract":"The Burrows-Wheeler Transform (bwt) is the basis for many of the most effective compression and self-indexing methods used today. A key to the versatility of the bwt is the ability to search for patterns directly in the transformed text. A backwards search for a pattern P can be performed on a transformed text by iteratively determining the range of suffixes that match P. The search can be further enhanced by constructing a wavelet tree over the output of the bwt in order to emulate a suffix array. In this paper, we investigate new algorithms for search derived from a variation of the bwt whereby rotations are only sorted to a depth k, commonly referred to as a context bound transform. Interestingly, this bwt variant can be used to mimic a k-gram index, which are used in a variety of applications that need to efficiently return occurrences in text position order. In this paper, we present the first backwards search algorithms on the k-bwt, and show how to construct a self-index containing many of the attractive properties of a k-gram index.","PeriodicalId":167131,"journal":{"name":"2011 First International Conference on Data Compression, Communications and Processing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131219201","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
Wireless Connectivity for Remote Objective Monitoring of Bio-signals 生物信号远程目标监测的无线连接
2011 First International Conference on Data Compression, Communications and Processing Pub Date : 2011-06-21 DOI: 10.1109/CCP.2011.27
A. Aristama, W. Almuhtadi
{"title":"Wireless Connectivity for Remote Objective Monitoring of Bio-signals","authors":"A. Aristama, W. Almuhtadi","doi":"10.1109/CCP.2011.27","DOIUrl":"https://doi.org/10.1109/CCP.2011.27","url":null,"abstract":"In Remote Objective Monitoring of Bio-Signals(ROMOBS) project, an automated near real-time remote health-monitoring device is being developed. The goal of this device is to measure blood flow parameters (systolic/diastolic blood pressure, heart rate, etc.), report the measurement results to a medical centre, and get the response back to the outpatient, all in an autonomous fashion. The objective of this paper is to develop a communication protocol that will enable the measurement device to be efficiently and constantly connected to a server the medical staff works on. Steps toward completing this goal include figuring out the network scheme that would effectively do the job, while maintaining low level of complexity and complying with the requirements set by the project. It results in a hybrid Bluetooth/cellular wireless system that emerges as the primary choice of connectivity medium with an application that sits on the Bluetooth- and Java-enabled cell phone as the data carrier. This paper discusses the development progress, the technologies involved, and the creation process of an interactive and user-friendly ROMOBS application.","PeriodicalId":167131,"journal":{"name":"2011 First International Conference on Data Compression, Communications and Processing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133271752","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
Toward a Flexible, Environmentally Conscious, on Demand High Performance Computing Service 迈向灵活、环保、随需应变的高性能计算服务
2011 First International Conference on Data Compression, Communications and Processing Pub Date : 2011-06-21 DOI: 10.1109/CCP.2011.14
G. Barone, G. Bifulco, V. Boccia, D. Bottalico, L. Carracciuolo
{"title":"Toward a Flexible, Environmentally Conscious, on Demand High Performance Computing Service","authors":"G. Barone, G. Bifulco, V. Boccia, D. Bottalico, L. Carracciuolo","doi":"10.1109/CCP.2011.14","DOIUrl":"https://doi.org/10.1109/CCP.2011.14","url":null,"abstract":"This work is related with planning and implementation of an on demand computing service which is able to obtain a right trade-off among managment cost reduction, environmental sustainability and user satisfaction.","PeriodicalId":167131,"journal":{"name":"2011 First International Conference on Data Compression, Communications and Processing","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121844308","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
Quick Estimation of Data Compression and De-duplication for Large Storage Systems 大型存储系统数据压缩和重复数据删除的快速估计
2011 First International Conference on Data Compression, Communications and Processing Pub Date : 2011-06-21 DOI: 10.1109/CCP.2011.41
C. Constantinescu, Maohua Lu
{"title":"Quick Estimation of Data Compression and De-duplication for Large Storage Systems","authors":"C. Constantinescu, Maohua Lu","doi":"10.1109/CCP.2011.41","DOIUrl":"https://doi.org/10.1109/CCP.2011.41","url":null,"abstract":"Many new storage systems provide some form of data reduction. In a recent paper we investigate how compression and de-duplication can be mixed in primary storage systems serving active data. In this paper we try to answer the question someone would ask before upgrading to a new, data reduction enabled storage server: how much storage savings the new system would offer for the data I have stored right now? We investigate methods to quickly estimate the storage savings potential of customary data reduction methods used in storage systems: compression and full file de-duplication on large scale storage systems. We show that the compression ratio achievable on a large storage system can be precisely estimated with just couple percents (worst case) of the work required to compress each file in the system. Also, we show that full file duplicates can be discovered very quickly with only 4% error (worst case) by a robust heuristic.","PeriodicalId":167131,"journal":{"name":"2011 First International Conference on Data Compression, Communications and Processing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133873442","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
Wavelet Trees: From Theory to Practice 小波树:从理论到实践
2011 First International Conference on Data Compression, Communications and Processing Pub Date : 2011-06-21 DOI: 10.1109/CCP.2011.16
R. Grossi, J. Vitter, Bojian Xu
{"title":"Wavelet Trees: From Theory to Practice","authors":"R. Grossi, J. Vitter, Bojian Xu","doi":"10.1109/CCP.2011.16","DOIUrl":"https://doi.org/10.1109/CCP.2011.16","url":null,"abstract":"The emph{wavelet tree} data structure is a space-efficient technique for rank and select queries that generalizes from binary characters to an arbitrary multicharacter alphabet. It has become a key tool in modern full-text indexing and data compression because of its capabilities in compressing, indexing, and searching. We present a comparative study of its practical performance regarding a wide range of options on the dimensions of different coding schemes and tree shapes. Our results are both theoretical and experimental: (1)~We show that the run-length $delta$ coding size of wavelet trees achieves the 0-order empirical entropy size of the original string with leading constant 1, when the string's 0-order empirical entropy is asymptotically less than the logarithm of the alphabet size. This result complements the previous works that are dedicated to analyzing run-length $gamma$-encoded wavelet trees. It also reveals the scenarios when run-length $delta$ encoding becomes practical. (2)~We introduce a full generic package of wavelet trees for a wide range of options on the dimensions of coding schemes and tree shapes. Our experimental study reveals the practical performance of the various modifications.","PeriodicalId":167131,"journal":{"name":"2011 First International Conference on Data Compression, Communications and Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134086697","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}
引用次数: 28
A Rate-Allocation Based Multi-path Congestion Control Scheme for Event-Driven Wireless Sensor Networks 基于速率分配的事件驱动无线传感器网络多路径拥塞控制方案
2011 First International Conference on Data Compression, Communications and Processing Pub Date : 2011-06-21 DOI: 10.1109/CCP.2011.47
Y. Fang, You Chiou Shiuan
{"title":"A Rate-Allocation Based Multi-path Congestion Control Scheme for Event-Driven Wireless Sensor Networks","authors":"Y. Fang, You Chiou Shiuan","doi":"10.1109/CCP.2011.47","DOIUrl":"https://doi.org/10.1109/CCP.2011.47","url":null,"abstract":"In this paper, we proposed a rate-allocation based congestion control approach, called multi-path-congestion control method (MUCON for short), which enforcing high path availability of packet delivery for event-driven Wireless Sensor Networks (WSNs) consists of two parts. The first is constructing a spanning tree to connect all sensor nodes of a WSN to the sink for initial routing. The second is establishing a fair packet forwarding environment by employing multi-path and rate control to deliver packets through routing paths with a balanced manner. Experimental results show that this method can effectively improve a WSN's throughputs, shorten end-to-end delays and reduce packet loss rates.","PeriodicalId":167131,"journal":{"name":"2011 First International Conference on Data Compression, Communications and Processing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130856062","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 Centralized, Extensible, Multilayer Monitoring System for Distributed Infrastructures: The Atlas Tier2-Naples Experience 分布式基础设施的集中、可扩展、多层监控系统:Atlas Tier2-Naples的经验
2011 First International Conference on Data Compression, Communications and Processing Pub Date : 2011-06-21 DOI: 10.1109/CCP.2011.35
D. D. Prete, S. Pardi, G. Russo
{"title":"A Centralized, Extensible, Multilayer Monitoring System for Distributed Infrastructures: The Atlas Tier2-Naples Experience","authors":"D. D. Prete, S. Pardi, G. Russo","doi":"10.1109/CCP.2011.35","DOIUrl":"https://doi.org/10.1109/CCP.2011.35","url":null,"abstract":"Services and Infrastructures monitoring is a crucial issue in a distributed computing environment that involves all the Grid architecture layers, from the network to the single application service. In this paper we propose a multi layer model that aims to integrate monitoring applications of different subsystems and to offer management and resource presentation services to the end-user and to system administrator, through a set of middleware components. After a discussion about the principal requirements, in the paper we identify a set of different access levels, then we design a general and extensible environment, which provides a single entry point, with different views depending on the user privileges. As a case of study, we describe the monitoring system implemented for the distributed Atlas Tier2 at Naples, the monitored subsystem, the functionality and the technologies used to map the requirements in a real use case.","PeriodicalId":167131,"journal":{"name":"2011 First International Conference on Data Compression, Communications and Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130268449","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
Generalized Witness Sets 广义证人集
2011 First International Conference on Data Compression, Communications and Processing Pub Date : 2011-06-21 DOI: 10.1109/CCP.2011.12
G. Cohen, Sihem Mesnager
{"title":"Generalized Witness Sets","authors":"G. Cohen, Sihem Mesnager","doi":"10.1109/CCP.2011.12","DOIUrl":"https://doi.org/10.1109/CCP.2011.12","url":null,"abstract":"Given a set C of q-ary n-tuples and c 2 C, how many symbols of c suffice to distinguish it from the other elements in C ? This is a generalization of an old combinatorial problem, on which we present (asymptotically tight) bounds and variations.","PeriodicalId":167131,"journal":{"name":"2011 First International Conference on Data Compression, Communications and Processing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129288058","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
Applications of Compression to Content Based Image Retrieval and Object Recognition 压缩在基于内容的图像检索和对象识别中的应用
2011 First International Conference on Data Compression, Communications and Processing Pub Date : 2011-06-21 DOI: 10.1109/CCP.2011.51
A. D. Lillo, Ajay H. Daptardar, Kevin Thomas, J. Storer, G. Motta
{"title":"Applications of Compression to Content Based Image Retrieval and Object Recognition","authors":"A. D. Lillo, Ajay H. Daptardar, Kevin Thomas, J. Storer, G. Motta","doi":"10.1109/CCP.2011.51","DOIUrl":"https://doi.org/10.1109/CCP.2011.51","url":null,"abstract":"We present compression related methods that can be used within a larger system referred to as a passive assistant. The system receives information from a mobile device, as well as information from an image database such as Google Street View, and employs image processing to provide useful information about a local urban environment to a visually impaired user. The first stage acquires and computes accurate location information, the second stage performs texture and color analysis of a scene, and the third stage provides specific object recognition and navigation information.","PeriodicalId":167131,"journal":{"name":"2011 First International Conference on Data Compression, Communications and Processing","volume":"279 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127661431","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
首页 上一页 下一页 尾页
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学术官方微信