Pub Date : 2023-08-25DOI: 10.1007/s11047-023-09959-w
Pierre-Alain Toupance, B. Chopard, L. Lefévre
{"title":"System reduction: an approach based on probabilistic cellular automata","authors":"Pierre-Alain Toupance, B. Chopard, L. Lefévre","doi":"10.1007/s11047-023-09959-w","DOIUrl":"https://doi.org/10.1007/s11047-023-09959-w","url":null,"abstract":"","PeriodicalId":49783,"journal":{"name":"Natural Computing","volume":" ","pages":""},"PeriodicalIF":2.1,"publicationDate":"2023-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47755868","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 : 2023-08-24DOI: 10.1007/s11047-023-09956-z
Luca Mariot, Luca Manzoni
Abstract Most of the approaches published in the literature to construct S-boxes via Cellular Automata (CA) work by either iterating a finite CA for several time steps, or by a one-shot application of the global rule. The main characteristic that brings together these works is that they employ a single CA rule to define the vectorial Boolean function of the S-box. In this work, we explore a different direction for the design of S-boxes that leverages on Orthogonal CA (OCA), i.e. pairs of CA rules giving rise to orthogonal Latin squares. The motivation stands on the facts that an OCA pair already defines a bijective transformation, and moreover the orthogonality property of the resulting Latin squares ensures a minimum amount of diffusion. We exhaustively enumerate all S-boxes generated by OCA pairs of diameter $$4 le d le 6$$ 4≤d≤6 , and measure their nonlinearity. Interestingly, we observe that for $$d=4$$ d=4 and $$d=5$$ d=5 all S-boxes are linear, despite the underlying CA local rules being nonlinear. The smallest nonlinear S-boxes emerges for $$d=6$$ d=6 , but their nonlinearity is still too low to be used in practice. Nonetheless, we unearth an interesting structure of linear OCA S-boxes, proving that their Linear Components Space is itself the image of a linear CA, or equivalently a polynomial code. We finally classify all linear OCA S-boxes in terms of their generator polynomials.
文献中发表的大多数通过元胞自动机(CA)构建s -box的方法要么是在几个时间步上迭代有限的CA，要么是通过一次应用全局规则来实现。将这些作品结合在一起的主要特征是它们使用单个CA规则来定义s盒的向量布尔函数。在这项工作中，我们探索了利用正交CA (OCA)设计s盒的不同方向，即产生正交拉丁方的CA规则对。其动机是基于OCA对已经定义了一个双射变换，而且所得到的拉丁平方的正交性保证了最小的扩散量。我们穷极枚举由直径为$$4 le d le 6$$ 4≤d≤6的OCA对产生的所有s -box，并测量其非线性。有趣的是，我们观察到，对于$$d=4$$ d = 4和$$d=5$$ d = 5，尽管底层CA局部规则是非线性的，但所有s盒都是线性的。最小的非线性s盒出现在$$d=6$$ d = 6，但其非线性仍然太低，无法在实际中使用。尽管如此，我们还是发现了一个有趣的线性OCA s -box结构，证明了它们的线性分量空间本身就是线性CA的图像，或者等价地说是多项式编码。最后，我们根据它们的生成器多项式对所有线性OCA s盒进行分类。
{"title":"A classification of S-boxes generated by orthogonal cellular automata","authors":"Luca Mariot, Luca Manzoni","doi":"10.1007/s11047-023-09956-z","DOIUrl":"https://doi.org/10.1007/s11047-023-09956-z","url":null,"abstract":"Abstract Most of the approaches published in the literature to construct S-boxes via Cellular Automata (CA) work by either iterating a finite CA for several time steps, or by a one-shot application of the global rule. The main characteristic that brings together these works is that they employ a single CA rule to define the vectorial Boolean function of the S-box. In this work, we explore a different direction for the design of S-boxes that leverages on Orthogonal CA (OCA), i.e. pairs of CA rules giving rise to orthogonal Latin squares. The motivation stands on the facts that an OCA pair already defines a bijective transformation, and moreover the orthogonality property of the resulting Latin squares ensures a minimum amount of diffusion. We exhaustively enumerate all S-boxes generated by OCA pairs of diameter $$4 le d le 6$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mn>4</mml:mn> <mml:mo>≤</mml:mo> <mml:mi>d</mml:mi> <mml:mo>≤</mml:mo> <mml:mn>6</mml:mn> </mml:mrow> </mml:math> , and measure their nonlinearity. Interestingly, we observe that for $$d=4$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mi>d</mml:mi> <mml:mo>=</mml:mo> <mml:mn>4</mml:mn> </mml:mrow> </mml:math> and $$d=5$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mi>d</mml:mi> <mml:mo>=</mml:mo> <mml:mn>5</mml:mn> </mml:mrow> </mml:math> all S-boxes are linear, despite the underlying CA local rules being nonlinear. The smallest nonlinear S-boxes emerges for $$d=6$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mi>d</mml:mi> <mml:mo>=</mml:mo> <mml:mn>6</mml:mn> </mml:mrow> </mml:math> , but their nonlinearity is still too low to be used in practice. Nonetheless, we unearth an interesting structure of linear OCA S-boxes, proving that their Linear Components Space is itself the image of a linear CA, or equivalently a polynomial code. We finally classify all linear OCA S-boxes in terms of their generator polynomials.","PeriodicalId":49783,"journal":{"name":"Natural Computing","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135420923","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 : 2023-08-17DOI: 10.1007/s11047-023-09955-0
Lis Arufe, R. Rasconi, A. Oddi, Ramiro Varela, Miguel A. González
{"title":"Solving quantum circuit compilation problem variants through genetic algorithms","authors":"Lis Arufe, R. Rasconi, A. Oddi, Ramiro Varela, Miguel A. González","doi":"10.1007/s11047-023-09955-0","DOIUrl":"https://doi.org/10.1007/s11047-023-09955-0","url":null,"abstract":"","PeriodicalId":49783,"journal":{"name":"Natural Computing","volume":" ","pages":""},"PeriodicalIF":2.1,"publicationDate":"2023-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45700548","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 : 2023-08-05DOI: 10.1007/s11047-023-09953-2
Hernán Díaz, J. J. Palacios, Inés González-Rodríguez, C. R. Vela
{"title":"Fast elitist ABC for makespan optimisation in interval JSP","authors":"Hernán Díaz, J. J. Palacios, Inés González-Rodríguez, C. R. Vela","doi":"10.1007/s11047-023-09953-2","DOIUrl":"https://doi.org/10.1007/s11047-023-09953-2","url":null,"abstract":"","PeriodicalId":49783,"journal":{"name":"Natural Computing","volume":" ","pages":""},"PeriodicalIF":2.1,"publicationDate":"2023-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46604675","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 : 2023-07-09DOI: 10.1007/s11047-023-09951-4
Ángel Beade, Manuel Rodríguez, José Santos
{"title":"Evolutionary feature selection approaches for insolvency business prediction with genetic programming","authors":"Ángel Beade, Manuel Rodríguez, José Santos","doi":"10.1007/s11047-023-09951-4","DOIUrl":"https://doi.org/10.1007/s11047-023-09951-4","url":null,"abstract":"","PeriodicalId":49783,"journal":{"name":"Natural Computing","volume":" ","pages":""},"PeriodicalIF":2.1,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48240539","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 : 2023-07-04DOI: 10.1007/s11047-023-09945-2
Aurélien Naldi, Adrien Richard, Elisa Tonello
Boolean networks are popular tools for the exploration of qualitative dynamical properties of biological systems. Several dynamical interpretations have been proposed based on the same logical structure that captures the interactions between Boolean components. They reproduce, in different degrees, the behaviours emerging in more quantitative models. In particular, regulatory conflicts can prevent the standard asynchronous dynamics from reproducing some trajectories that might be expected upon inspection of more detailed models. We introduce and study the class of networks with linear cuts, where linear components—intermediates with a single regulator and a single target—eliminate the aforementioned regulatory conflicts. The interaction graph of a Boolean network admits a linear cut when a linear component occurs in each cycle and in each path from components with multiple targets to components with multiple regulators. Under this structural condition the attractors are in one-to-one correspondence with the minimal trap spaces, and the reachability of attractors can also be easily characterized. Linear cuts provide the base for a new interpretation of the Boolean semantics that captures all behaviours of multi-valued refinements with regulatory thresholds that are uniquely defined for each interaction, and contribute a new approach for the investigation of behaviour of logical models.
{"title":"Linear cuts in Boolean networks","authors":"Aurélien Naldi, Adrien Richard, Elisa Tonello","doi":"10.1007/s11047-023-09945-2","DOIUrl":"https://doi.org/10.1007/s11047-023-09945-2","url":null,"abstract":"<p>Boolean networks are popular tools for the exploration of qualitative dynamical properties of biological systems. Several dynamical interpretations have been proposed based on the same logical structure that captures the interactions between Boolean components. They reproduce, in different degrees, the behaviours emerging in more quantitative models. In particular, regulatory conflicts can prevent the standard asynchronous dynamics from reproducing some trajectories that might be expected upon inspection of more detailed models. We introduce and study the class of networks with linear cuts, where linear components—intermediates with a single regulator and a single target—eliminate the aforementioned regulatory conflicts. The interaction graph of a Boolean network admits a linear cut when a linear component occurs in each cycle and in each path from components with multiple targets to components with multiple regulators. Under this structural condition the attractors are in one-to-one correspondence with the minimal trap spaces, and the reachability of attractors can also be easily characterized. Linear cuts provide the base for a new interpretation of the Boolean semantics that captures all behaviours of multi-valued refinements with regulatory thresholds that are uniquely defined for each interaction, and contribute a new approach for the investigation of behaviour of logical models.</p>","PeriodicalId":49783,"journal":{"name":"Natural Computing","volume":"3 3","pages":""},"PeriodicalIF":2.1,"publicationDate":"2023-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138524482","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 : 2023-06-29DOI: 10.1007/s11047-023-09947-0
Julio Aracena, Florian Bridoux, Luis Gómez, Lilian Salinas
In this paper, we deal with the following decision problem: given a conjunctive Boolean network defined by its interaction digraph, does it have a limit cycle of a given length k? We prove that this problem is NP-complete in general if k is a parameter of the problem and is in P if the interaction digraph is strongly connected. The case where k is fixed, but the interaction digraph is not strongly connected, remains open. Furthermore, we study some variations of the decision problem: given a conjunctive Boolean network, does there exist a block-sequential (resp. sequential) update schedule such that there is a limit cycle of length k? We prove that these problems are NP-complete for any fixed constant $$k ge 2$$ .
在本文中，我们处理以下决策问题:给定一个由其交互有向图定义的合布尔网络，它是否具有给定长度k的极限环?我们证明了如果k是问题的一个参数，那么这个问题一般是np完全的，如果相互作用有向图是强连通的，那么这个问题在P内。k是固定的，但是相互作用有向图不是强连接的情况，仍然是开放的。此外，我们还研究了决策问题的一些变体:给定一个合布尔网络，是否存在一个块顺序网络?序列更新计划使得存在长度为k?我们证明了这些问题对于任意固定常数$$k ge 2$$都是np完全的。
{"title":"Complexity of limit cycles with block-sequential update schedules in conjunctive networks","authors":"Julio Aracena, Florian Bridoux, Luis Gómez, Lilian Salinas","doi":"10.1007/s11047-023-09947-0","DOIUrl":"https://doi.org/10.1007/s11047-023-09947-0","url":null,"abstract":"In this paper, we deal with the following decision problem: given a conjunctive Boolean network defined by its interaction digraph, does it have a limit cycle of a given length k? We prove that this problem is NP-complete in general if k is a parameter of the problem and is in P if the interaction digraph is strongly connected. The case where k is fixed, but the interaction digraph is not strongly connected, remains open. Furthermore, we study some variations of the decision problem: given a conjunctive Boolean network, does there exist a block-sequential (resp. sequential) update schedule such that there is a limit cycle of length k? We prove that these problems are NP-complete for any fixed constant $$k ge 2$$ .","PeriodicalId":49783,"journal":{"name":"Natural Computing","volume":"154 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135049954","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 : 2023-06-20DOI: 10.1007/s11047-023-09949-y
B. Wolnik, Adam Dzedzej, M. Dziemiańczuk, Aleksander Wardyn, B. De Baets
{"title":"An exploration of reversible septenary number-conserving cellular automata: a survey of known methods","authors":"B. Wolnik, Adam Dzedzej, M. Dziemiańczuk, Aleksander Wardyn, B. De Baets","doi":"10.1007/s11047-023-09949-y","DOIUrl":"https://doi.org/10.1007/s11047-023-09949-y","url":null,"abstract":"","PeriodicalId":49783,"journal":{"name":"Natural Computing","volume":"22 1","pages":"463 - 475"},"PeriodicalIF":2.1,"publicationDate":"2023-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47569404","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号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：