元胞自动机的辨识

IF 0.1 4区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS Journal of Cellular Automata Pub Date : 2006-09-01 DOI:10.1201/9781315274355
Yifan Zhao, S. Billings
{"title":"元胞自动机的辨识","authors":"Yifan Zhao, S. Billings","doi":"10.1201/9781315274355","DOIUrl":null,"url":null,"abstract":"Although cellular automata have been widely studied as a class of the spatio temporal systems, very few investigators have studied how to identify the CA rules given observations of the patterns. A solution using a polynomial realization to describe the CA rule is reviewed in the present study based on the application of an orthogonal least squares algorithm. Three new neighbourhood detection methods are then reviewed as important preliminary analysis procedures to reduce the complexity of the estimation. The identification of excitable media is discussed using simulation examples and real data sets and a new method for the identification of hybrid CA is introduced.","PeriodicalId":55628,"journal":{"name":"Journal of Cellular Automata","volume":null,"pages":null},"PeriodicalIF":0.1000,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"109","resultStr":"{\"title\":\"The Identification of Cellular Automata\",\"authors\":\"Yifan Zhao, S. Billings\",\"doi\":\"10.1201/9781315274355\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Although cellular automata have been widely studied as a class of the spatio temporal systems, very few investigators have studied how to identify the CA rules given observations of the patterns. A solution using a polynomial realization to describe the CA rule is reviewed in the present study based on the application of an orthogonal least squares algorithm. Three new neighbourhood detection methods are then reviewed as important preliminary analysis procedures to reduce the complexity of the estimation. The identification of excitable media is discussed using simulation examples and real data sets and a new method for the identification of hybrid CA is introduced.\",\"PeriodicalId\":55628,\"journal\":{\"name\":\"Journal of Cellular Automata\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.1000,\"publicationDate\":\"2006-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"109\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Cellular Automata\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1201/9781315274355\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Cellular Automata","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1201/9781315274355","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 109

摘要

虽然元胞自动机作为一类时空系统已经得到了广泛的研究,但很少有研究者研究如何在观察到模式的情况下识别CA规则。本文基于正交最小二乘算法的应用,综述了一种用多项式实现来描述CA规则的解决方案。然后回顾了三种新的邻域检测方法,作为重要的初步分析程序,以降低估计的复杂性。利用仿真实例和实际数据集讨论了可激介质的识别问题,提出了一种识别混合CA的新方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
The Identification of Cellular Automata
Although cellular automata have been widely studied as a class of the spatio temporal systems, very few investigators have studied how to identify the CA rules given observations of the patterns. A solution using a polynomial realization to describe the CA rule is reviewed in the present study based on the application of an orthogonal least squares algorithm. Three new neighbourhood detection methods are then reviewed as important preliminary analysis procedures to reduce the complexity of the estimation. The identification of excitable media is discussed using simulation examples and real data sets and a new method for the identification of hybrid CA is introduced.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Cellular Automata
Journal of Cellular Automata 工程技术-计算机:理论方法
CiteScore
0.50
自引率
33.30%
发文量
0
审稿时长
>12 weeks
期刊介绍: The Journal of Cellular Automata publishes high-quality papers where cellular automata are studied theoretically or used as computational models of mathematical, physical, chemical, biological, social and engineering systems. A few examples are given in the list below, which is but a small sample of the areas of interest explored by this journal: Structure formation, heat conduction, self-reproduction, language recognition, evolutionary games, image processing, cryptography, random number generation, computational universality, traffic dynamics, neural networks, alternative discrete-physics models, population dynamics etc. Full length original papers, short communications, reviews and tutorial articles are welcome.
期刊最新文献
Cellular Automata: 15th International Conference on Cellular Automata for Research and Industry, ACRI 2022, Geneva, Switzerland, September 12–15, 2022, Proceedings Cellular Automata: 14th International Conference on Cellular Automata for Research and Industry, ACRI 2020, Lodz, Poland, December 2–4, 2020, Proceedings EnCash: an Authenticated Encryption scheme using Cellular Automata The Automatic Generation of an Efficient Floor Field for CA Simulations in Crowd Management Fractal Arrangement for 2D Cellular Automata and Its Implementation for Outer-Totalistic Rules
×
引用
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