Natural Computing最新文献_第4页

System reduction: an approach based on probabilistic cellular automata 系统约简：一种基于概率元自动机的方法

IF 2.1 4区计算机科学

Natural Computing Pub Date : 2023-08-25 DOI: 10.1007/s11047-023-09959-w

Pierre-Alain Toupance, B. Chopard, L. Lefévre

引用次数: 0

A classification of S-boxes generated by orthogonal cellular automata 基于正交元胞自动机的s -box分类

4区计算机科学

Natural Computing Pub Date : 2023-08-24 DOI: 10.1007/s11047-023-09956-z

Luca Mariot, Luca Manzoni

{"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}

引用次数: 0

Solving quantum circuit compilation problem variants through genetic algorithms 用遗传算法求解量子电路编译问题的变体

IF 2.1 4区计算机科学

Natural Computing Pub Date : 2023-08-17 DOI: 10.1007/s11047-023-09955-0

Lis Arufe, R. Rasconi, A. Oddi, Ramiro Varela, Miguel A. González

引用次数: 0

Fast elitist ABC for makespan optimisation in interval JSP 快速精英ABC的最大时间跨度优化间隔JSP

IF 2.1 4区计算机科学

Natural Computing Pub Date : 2023-08-05 DOI: 10.1007/s11047-023-09953-2

Hernán Díaz, J. J. Palacios, Inés González-Rodríguez, C. R. Vela

引用次数: 0

Evolutionary feature selection approaches for insolvency business prediction with genetic programming 基于遗传规划的破产企业预测进化特征选择方法

IF 2.1 4区计算机科学

Natural Computing Pub Date : 2023-07-09 DOI: 10.1007/s11047-023-09951-4

Ángel Beade, Manuel Rodríguez, José Santos

引用次数: 0

Precise makespan optimization via hybrid genetic algorithm for scientific workflow scheduling problem 基于混合遗传算法的科学工作流调度问题的精确完工时间优化

IF 2.1 4区计算机科学

Natural Computing Pub Date : 2023-07-08 DOI: 10.1007/s11047-023-09950-5

Pablo Barredo, Jorge Puente

引用次数: 0

Linear cuts in Boolean networks 布尔网络中的线性切割

IF 2.1 4区计算机科学

Natural Computing Pub Date : 2023-07-04 DOI: 10.1007/s11047-023-09945-2

Aurélien Naldi, Adrien Richard, Elisa Tonello

{"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}

引用次数: 3

Complexity of limit cycles with block-sequential update schedules in conjunctive networks 联合网络中具有块顺序更新调度的极限环的复杂性

4区计算机科学

Natural Computing Pub Date : 2023-06-29 DOI: 10.1007/s11047-023-09947-0

Julio Aracena, Florian Bridoux, Luis Gómez, Lilian Salinas

引用次数: 1

An exploration of reversible septenary number-conserving cellular automata: a survey of known methods 可逆七元数守恒元胞自动机的探索：已知方法综述

IF 2.1 4区计算机科学

Natural Computing Pub Date : 2023-06-20 DOI: 10.1007/s11047-023-09949-y

B. Wolnik, Adam Dzedzej, M. Dziemiańczuk, Aleksander Wardyn, B. De Baets

引用次数: 0

Associating parallel automata network dynamics and strictly one-way cellular automata 关联并行自动机网络动力学与严格单向元胞自动机