推理算法中动态块与静态块的比较

A. Siahaan, S. Aryza, R. Rahim, Andre Hasudungan Lubis
{"title":"推理算法中动态块与静态块的比较","authors":"A. Siahaan, S. Aryza, R. Rahim, Andre Hasudungan Lubis","doi":"10.9790/0661-1904013943","DOIUrl":null,"url":null,"abstract":"In the Sequitur algorithm, the compression process is performed based on the number of characters having similar similarities. Similarities will be detected on every syllable in the entire text. Determination of the number of characters to be compared will affect the compression level of this algorithm. Using dynamic or static blocks can optimize the number of compressed characters and of course, it affects the speed of data transmission.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Comparison Between Dynamic And Static Blocks In Sequitur Algorithm\",\"authors\":\"A. Siahaan, S. Aryza, R. Rahim, Andre Hasudungan Lubis\",\"doi\":\"10.9790/0661-1904013943\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the Sequitur algorithm, the compression process is performed based on the number of characters having similar similarities. Similarities will be detected on every syllable in the entire text. Determination of the number of characters to be compared will affect the compression level of this algorithm. Using dynamic or static blocks can optimize the number of compressed characters and of course, it affects the speed of data transmission.\",\"PeriodicalId\":91890,\"journal\":{\"name\":\"IOSR journal of computer engineering\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IOSR journal of computer engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.9790/0661-1904013943\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IOSR journal of computer engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.9790/0661-1904013943","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在Sequitur算法中,压缩过程是根据具有相似度的字符的数量来执行的。在整个文本的每个音节上都会检测到相似之处。要比较的字符数的确定将影响该算法的压缩水平。使用动态或静态块可以优化压缩字符的数量,当然,它会影响数据传输的速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Comparison Between Dynamic And Static Blocks In Sequitur Algorithm
In the Sequitur algorithm, the compression process is performed based on the number of characters having similar similarities. Similarities will be detected on every syllable in the entire text. Determination of the number of characters to be compared will affect the compression level of this algorithm. Using dynamic or static blocks can optimize the number of compressed characters and of course, it affects the speed of data transmission.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Discrimination of neuropsychiatric disease using EEG and Neurophysiological Biomarker Toolbox (NBT) with Machine Learning SentiT: A Semi Real Time System for Interpreting Sentiment in Twitter A Quantitative Analysis of Infrastructural Security Concerns in Cloud Computing for Indian SMEs Pattern Discovery and Association Analysis To Identify Customer Vulnerable To HIV/AIDS: Case of Marie Stopes Gonder Branch Clinic The Structural Damages After Nepal Earthquakes
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1