Pub Date : 2022-12-16DOI: 10.1007/s11047-022-09926-x
Zsolt Gazdag, Károly Hajagos
{"title":"On the power of membrane dissolution in polarizationless P systems with active membranes","authors":"Zsolt Gazdag, Károly Hajagos","doi":"10.1007/s11047-022-09926-x","DOIUrl":"https://doi.org/10.1007/s11047-022-09926-x","url":null,"abstract":"","PeriodicalId":49783,"journal":{"name":"Natural Computing","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2022-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46018515","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-10DOI: 10.1007/s11047-022-09928-9
M. Emmerich, A. Deutz, I. Yevseyeva
{"title":"Preface","authors":"M. Emmerich, A. Deutz, I. Yevseyeva","doi":"10.1007/s11047-022-09928-9","DOIUrl":"https://doi.org/10.1007/s11047-022-09928-9","url":null,"abstract":"","PeriodicalId":49783,"journal":{"name":"Natural Computing","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2022-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47544804","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-07DOI: 10.1007/s11047-022-09929-8
Jarkko Kari, Victor H. Lutfalla
We present Planar Rosa, a family of rhombus tilings with a 2n-fold rotational symmetry that are generated by a primitive substitution and that are also discrete plane tilings, meaning that they are obtained as a projection of a higher dimensional discrete plane. The discrete plane condition is a relaxed version of the cut-and-project condition. We also prove that the Sub Rosa substitution tilings with 2n-fold rotational symmetry defined by Kari and Rissanen do not satisfy even the weaker discrete plane condition. We prove these results for all even (ngeqslant 4). This completes our previously published results for odd values of n.
{"title":"Planar Rosa: a family of quasiperiodic substitution discrete plane tilings with 2n-fold rotational symmetry","authors":"Jarkko Kari, Victor H. Lutfalla","doi":"10.1007/s11047-022-09929-8","DOIUrl":"https://doi.org/10.1007/s11047-022-09929-8","url":null,"abstract":"<p>We present Planar Rosa, a family of rhombus tilings with a 2<i>n</i>-fold rotational symmetry that are generated by a primitive substitution and that are also discrete plane tilings, meaning that they are obtained as a projection of a higher dimensional discrete plane. The discrete plane condition is a relaxed version of the cut-and-project condition. We also prove that the Sub Rosa substitution tilings with 2<i>n</i>-fold rotational symmetry defined by Kari and Rissanen do not satisfy even the weaker discrete plane condition. We prove these results for all even <span>(ngeqslant 4)</span>. This completes our previously published results for odd values of <i>n</i>.</p>","PeriodicalId":49783,"journal":{"name":"Natural Computing","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2022-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138513863","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-11-26DOI: 10.1007/s11047-022-09930-1
Luca Mariot
Cellular automata (CA) are an interesting computational model for designing pseudorandom number generators (PRNG), due to the complex dynamical behavior they can exhibit depending on the underlying local rule. Most of the CA-based PRNGs proposed in the literature, however, suffer from poor diffusion since a change in a single cell can propagate only within its neighborhood during a single time step. This might pose a problem especially when such PRNGs are used for cryptographic purposes. In this paper, we consider an alternative approach to generate pseudorandom sequences through orthogonal CA (OCA), which guarantees a better amount of diffusion. After defining the related PRNG, we perform an empirical investigation of the maximal cycles in OCA pairs up to diameter (d=8). Next, we focus on OCA induced by linear rules, giving a characterization of their cycle structure based on the rational canonical form of the associated Sylvester matrix. Finally, we devise an algorithm to enumerate all linear OCA pairs characterized by a single maximal cycle, and apply it up to diameter (d=16) and (d=13) for OCA respectively over the binary and ternary alphabets.
{"title":"Enumeration of maximal cycles generated by orthogonal cellular automata","authors":"Luca Mariot","doi":"10.1007/s11047-022-09930-1","DOIUrl":"https://doi.org/10.1007/s11047-022-09930-1","url":null,"abstract":"<p>Cellular automata (CA) are an interesting computational model for designing pseudorandom number generators (PRNG), due to the complex dynamical behavior they can exhibit depending on the underlying local rule. Most of the CA-based PRNGs proposed in the literature, however, suffer from poor diffusion since a change in a single cell can propagate only within its neighborhood during a single time step. This might pose a problem especially when such PRNGs are used for cryptographic purposes. In this paper, we consider an alternative approach to generate pseudorandom sequences through <i>orthogonal CA</i> (OCA), which guarantees a better amount of diffusion. After defining the related PRNG, we perform an empirical investigation of the maximal cycles in OCA pairs up to diameter <span>(d=8)</span>. Next, we focus on OCA induced by linear rules, giving a characterization of their cycle structure based on the rational canonical form of the associated Sylvester matrix. Finally, we devise an algorithm to enumerate all linear OCA pairs characterized by a single maximal cycle, and apply it up to diameter <span>(d=16)</span> and <span>(d=13)</span> for OCA respectively over the binary and ternary alphabets.</p>","PeriodicalId":49783,"journal":{"name":"Natural Computing","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2022-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138542849","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-11-09DOI: 10.1007/s11047-022-09925-y
Péter Battyányi
{"title":"On the power of boundary rule application in membrane computing","authors":"Péter Battyányi","doi":"10.1007/s11047-022-09925-y","DOIUrl":"https://doi.org/10.1007/s11047-022-09925-y","url":null,"abstract":"","PeriodicalId":49783,"journal":{"name":"Natural Computing","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2022-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46394528","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-10-19DOI: 10.1007/s11047-022-09924-z
David Orellana-Martín, Luis Valencia-Cabrera, Bosheng Song, L. Pan, M. Pérez-Jiménez
{"title":"Tissue P systems with evolutional communication rules with two objects in the left-hand side","authors":"David Orellana-Martín, Luis Valencia-Cabrera, Bosheng Song, L. Pan, M. Pérez-Jiménez","doi":"10.1007/s11047-022-09924-z","DOIUrl":"https://doi.org/10.1007/s11047-022-09924-z","url":null,"abstract":"","PeriodicalId":49783,"journal":{"name":"Natural Computing","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2022-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47729140","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-10-18DOI: 10.1007/s11047-022-09922-1
Ludek Cienciala, Lucie Ciencialová, E. Csuhaj-Varjú
{"title":"About reversibility in sP colonies and reaction systems","authors":"Ludek Cienciala, Lucie Ciencialová, E. Csuhaj-Varjú","doi":"10.1007/s11047-022-09922-1","DOIUrl":"https://doi.org/10.1007/s11047-022-09922-1","url":null,"abstract":"","PeriodicalId":49783,"journal":{"name":"Natural Computing","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2022-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48655445","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-08DOI: 10.1007/s11047-022-09920-3
Marios Thymianis, Alexandros Tzanetos
{"title":"Is integration of mechanisms a way to enhance a nature-inspired algorithm?","authors":"Marios Thymianis, Alexandros Tzanetos","doi":"10.1007/s11047-022-09920-3","DOIUrl":"https://doi.org/10.1007/s11047-022-09920-3","url":null,"abstract":"","PeriodicalId":49783,"journal":{"name":"Natural Computing","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2022-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42048389","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-08DOI: 10.1007/s11047-022-09921-2
Mahrokh Javadi, Sanaz Mostaghim
{"title":"Analysis of inter and intra-front operations in multi-modal multi-objective optimization problems","authors":"Mahrokh Javadi, Sanaz Mostaghim","doi":"10.1007/s11047-022-09921-2","DOIUrl":"https://doi.org/10.1007/s11047-022-09921-2","url":null,"abstract":"","PeriodicalId":49783,"journal":{"name":"Natural Computing","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2022-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48710411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号