Memory Size

H. Bingol
{"title":"Memory Size","authors":"H. Bingol","doi":"10.1017/9781108671644.014","DOIUrl":null,"url":null,"abstract":"It is a fact that there are many web pages for one to know all. Similarly there are many songs than we can keep in our mp3 players. It is not very difficult to increase examples of \"too many itemstoo little memory\" cases. We try to model the case where the memory is too small to keep all the items. We consider agents with a limited memory of size m. We let them interact by means of recommending web pages among the ones that they know. The giver agent \"remembers\" an item that is stored in its memory. The giver recommends the item to the taker agent. Since the taker does not have empty space in its memory, it \"forgets\" something and uses the emptied slot for the item recommended. We surprisingly observed that this process leads to many items become completely forgotten by the society while a few of them become extremely well known as the ratio of the memory size to the number of items decreases. We interpret this result as the emergence of fame. This may explain why there are so many web pages but only a small percentage is widely known. We also observed that some metrics such as the percentage of completely forgotten items, maximum fame, minimum fame changes linearly with the memory ratio.","PeriodicalId":433709,"journal":{"name":"Communication Complexity","volume":"395 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Communication Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1017/9781108671644.014","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

It is a fact that there are many web pages for one to know all. Similarly there are many songs than we can keep in our mp3 players. It is not very difficult to increase examples of "too many itemstoo little memory" cases. We try to model the case where the memory is too small to keep all the items. We consider agents with a limited memory of size m. We let them interact by means of recommending web pages among the ones that they know. The giver agent "remembers" an item that is stored in its memory. The giver recommends the item to the taker agent. Since the taker does not have empty space in its memory, it "forgets" something and uses the emptied slot for the item recommended. We surprisingly observed that this process leads to many items become completely forgotten by the society while a few of them become extremely well known as the ratio of the memory size to the number of items decreases. We interpret this result as the emergence of fame. This may explain why there are so many web pages but only a small percentage is widely known. We also observed that some metrics such as the percentage of completely forgotten items, maximum fame, minimum fame changes linearly with the memory ratio.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
内存大小
这是一个事实,有很多网页让一个人知道一切。同样,我们的mp3播放器里也放不下很多歌曲。增加“项目太多、内存太少”的例子并不难。我们尝试在内存太小而无法保存所有项目的情况下建立模型。我们考虑具有有限内存大小为m的代理。我们让它们通过在它们知道的网页中推荐网页的方式进行交互。赠送代理“记住”存储在其记忆中的物品。送礼人向受礼人推荐物品。由于接受者的内存中没有空的空间,它“忘记”了一些东西,并使用空的插槽来存储推荐的物品。我们惊奇地发现,这一过程导致许多项目被社会完全遗忘,而其中一些项目因记忆大小与项目数量的比例降低而变得非常出名。我们把这个结果解释为名声的出现。这也许可以解释为什么有这么多的网页,但只有一小部分是广为人知的。我们还观察到一些参数,如完全遗忘道具的百分比,最大名声,最小名声随着记忆比率呈线性变化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Numbers on Foreheads Index Deterministic Protocols Randomized Protocols Circuits and Proofs
×
引用
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