压缩可溶性

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI:10.1109/SYNASC.2013.11

D. Simovici

{"title":"压缩可溶性","authors":"D. Simovici","doi":"10.1109/SYNASC.2013.11","DOIUrl":null,"url":null,"abstract":"We offer an experimental proof that the application of compression to data files can be used as a evaluation technique for minability of the data. This is based on the fact that the presence of patterns embedded in data has an influence of compressibility.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Minability through Compression\",\"authors\":\"D. Simovici\",\"doi\":\"10.1109/SYNASC.2013.11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We offer an experimental proof that the application of compression to data files can be used as a evaluation technique for minability of the data. This is based on the fact that the presence of patterns embedded in data has an influence of compressibility.\",\"PeriodicalId\":293085,\"journal\":{\"name\":\"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2013.11\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2013.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

我们提供了一个实验证明，将压缩应用于数据文件可以作为数据可分割性的评估技术。这是基于这样一个事实，即数据中嵌入的模式的存在会影响可压缩性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Minability through Compression

We offer an experimental proof that the application of compression to data files can be used as a evaluation technique for minability of the data. This is based on the fact that the presence of patterns embedded in data has an influence of compressibility.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

自引率

0.00%

发文量