Proceedings of the Third Forum on Research and Technology Advances in Digital Libraries,最新文献_第2页

Digital libraries meet electronic commerce: on-screen intellectual property 数字图书馆遇上电子商务:屏幕上的知识产权

Proceedings of the Third Forum on Research and Technology Advances in Digital Libraries, Pub Date : 1996-05-13 DOI: 10.1109/ADL.1996.502516

M. Lesk

引用次数: 4

A digital library system for periodicals distribution 期刊发行数字图书馆系统

Proceedings of the Third Forum on Research and Technology Advances in Digital Libraries, Pub Date : 1996-05-13 DOI: 10.1109/ADL.1996.502520

David M. Choy, C. Dwork, J. Lotspiech, Laura C. Anderson, Stephen K. Boyer, Richard Dievendorff, Thomas D. Griffin, Bruce A. Hoenig, M. J. Jackson, W. Kaka, James M. McCrossin, Alex M. Miller, R. Morris, Norman J. Pass

引用次数: 8

GeoChange: an experiment in wide-area database services for geographic information exchange GeoChange:用于地理信息交换的广域数据库服务试验

Proceedings of the Third Forum on Research and Technology Advances in Digital Libraries, Pub Date : 1996-05-13 DOI: 10.1109/ADL.1996.502512

P. Drew, Jerry Ying

引用次数: 5

Data compression using encrypted text 使用加密文本进行数据压缩

Proceedings of the Third Forum on Research and Technology Advances in Digital Libraries, Pub Date : 1900-01-01 DOI: 10.1109/ADL.1996.502523

R. Franceschini, A. Mukherjee

{"title":"Data compression using encrypted text","authors":"R. Franceschini, A. Mukherjee","doi":"10.1109/ADL.1996.502523","DOIUrl":"https://doi.org/10.1109/ADL.1996.502523","url":null,"abstract":"We present an algorithm for text compression. The basic idea of our algorithm is to define a unique encryption or signature of each word in the dictionary by replacing certain characters in the words by a special character \"*\" and retaining a few characters so that the word is still retrievable. For any encrypted text the most frequently used character is \"*\" and the standard compression algorithms can exploit this redundancy in an effective way. We advocate the following compression paradigm: given a compression algorithm A and a text T, we apply the same algorithm A on an encrypted text *T and retrieve the original text via a dictionary which maps the decompressed text *T to the original text T. We report better results for most widely used compression algorithms such as Huffman, LZW, arithmetic, unix compress, gnu-zip with respect to a text corpus. The compression rates using these algorithms are much better than the dictionary based methods reported in the literature. One basic assumption of our algorithm is that the system has access to a dictionary of words used in all the texts along with a corresponding \"cryptic\" dictionary. The cost of this dictionary is amortized over the compression savings for all the text files handled by the organization. If two organizations wish to exchange information using our compression algorithm, they must share a common dictionary. We compare our methods with other dictionary based methods and present future research problems.","PeriodicalId":217587,"journal":{"name":"Proceedings of the Third Forum on Research and Technology Advances in Digital Libraries,","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131014477","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