標(biāo)題: Titlebook: Cellular Automata; 12th International C Samira El Yacoubi,Jaroslaw W?s,Stefania Bandini Conference proceedings 2016 Springer International [打印本頁] 作者: McKinley 時(shí)間: 2025-3-21 16:17
書目名稱Cellular Automata影響因子(影響力)
書目名稱Cellular Automata影響因子(影響力)學(xué)科排名
書目名稱Cellular Automata網(wǎng)絡(luò)公開度
書目名稱Cellular Automata網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Cellular Automata被引頻次
書目名稱Cellular Automata被引頻次學(xué)科排名
書目名稱Cellular Automata年度引用
書目名稱Cellular Automata年度引用學(xué)科排名
書目名稱Cellular Automata讀者反饋
書目名稱Cellular Automata讀者反饋學(xué)科排名
作者: 狂亂 時(shí)間: 2025-3-21 23:49
Collective Infotaxis with Reactive Amoebae: A Note on a Simple Bio-inspired Mechanismas emitters of waves or listeners, according to their local perceptions. We present a first study that shows that the model is worth considering and may provide a simple solution to coordinate a team to perform a distributed form of infotaxis.作者: altruism 時(shí)間: 2025-3-22 03:27
0302-9743 lling and Sim-ulation with Cellular Automata (5) Crowds, Tra?c and Cellular Automata –CT&CA (6) Agent-Based Simulation and Cellular Automata – ABS&CA..978-3-319-44364-5978-3-319-44365-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Arthr- 時(shí)間: 2025-3-22 07:46 作者: CAJ 時(shí)間: 2025-3-22 11:36 作者: GRACE 時(shí)間: 2025-3-22 16:11 作者: GRACE 時(shí)間: 2025-3-22 20:29 作者: 弄臟 時(shí)間: 2025-3-22 23:23
Conference proceedings 2016omata and Asynchronous Discrete Models - ACA. The second part of the volume contains three topics: (4) Modelling and Sim-ulation with Cellular Automata (5) Crowds, Tra?c and Cellular Automata –CT&CA (6) Agent-Based Simulation and Cellular Automata – ABS&CA..作者: 鞭子 時(shí)間: 2025-3-23 03:34
Ioanna Roussou,Emmanouil Stiakakisar CA, and the error-correction capability is determined by the resiliency of the global rule. As an example, we finally show how to implement the (7,?4,?3) cyclic Hamming code using a CA of radius ..作者: CANE 時(shí)間: 2025-3-23 05:42 作者: SEVER 時(shí)間: 2025-3-23 10:50 作者: 爭(zhēng)吵 時(shí)間: 2025-3-23 17:13 作者: Jacket 時(shí)間: 2025-3-23 21:16
Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata universality of another. It is proved by showing that a Fredkin gate, a universal reversible logic gate, can be simulated in it. From these results and by dualities, we can conclude six among the nine are universal. We also show the remaining three are non-universal. Thus, universality of all the reversible and conservative ETPCAs is clarified.作者: 反饋 時(shí)間: 2025-3-23 23:41 作者: 巨頭 時(shí)間: 2025-3-24 05:43 作者: Genteel 時(shí)間: 2025-3-24 08:47 作者: Verify 時(shí)間: 2025-3-24 12:26 作者: Condyle 時(shí)間: 2025-3-24 18:20 作者: Increment 時(shí)間: 2025-3-24 21:20
Wei-Lien Wang,Alexander J. Lazarparative study concerning ant-based algorithm and the standard DBSCAN approach shows that this proposal achieves results comparable to the best classical approach’s results. This approach shows that randomness improves the results in clustering offered by the AntTree algorithm.作者: ANIM 時(shí)間: 2025-3-24 23:50
The Role of Randomness in Self-aggregative AntTree Approachparative study concerning ant-based algorithm and the standard DBSCAN approach shows that this proposal achieves results comparable to the best classical approach’s results. This approach shows that randomness improves the results in clustering offered by the AntTree algorithm.作者: 招人嫉妒 時(shí)間: 2025-3-25 05:55
On a Universal Brownian Cellular Automata with 3 States and 2 Ruleshieved by embedding Priese’s delay-insensitive circuit elements, called the E-element and the K-element, on the cell space of a so-called Brownian CA, which is an asynchronous CA containing local configurations that conduct a random walk in the circuit topology.作者: JAMB 時(shí)間: 2025-3-25 08:57 作者: landmark 時(shí)間: 2025-3-25 13:09
Resilient Vectorial Functions and Cyclic Codes Arising from Cellular Automataboolean functions. In this paper, we investigate the cryptographic criteria of CA global rules by considering them as vectorial boolean functions. In particular, we prove that the 1-resiliency property of CA with bipermutive local rules is preserved on the corresponding global rules. We then unfold 作者: occult 時(shí)間: 2025-3-25 19:39 作者: olfction 時(shí)間: 2025-3-25 21:56 作者: Prologue 時(shí)間: 2025-3-26 03:11
The Garden of Eden Theorem for Cellular Automata on Group Sets with finite stabilisers. It states that the global transition function of such an automaton is surjective if and only if it is pre-injective. Pre-Injectivity means that two global configurations that differ at most on a finite subset and have the same image under the global transition function must作者: 爭(zhēng)論 時(shí)間: 2025-3-26 07:06
A Spatial Sensitivity Analysis of a Spatially Explicit Model for Myxomatosis in Belgium two decades for simulating such processes. Yet, a sensitivity analysis (SA) of such models is typically not performed, or model sensitivity is only studied over time on the basis of aggregated quantities, due to the lack of an appropriate framework. Taking a SEM for myxomatosis among European rabbi作者: DRAFT 時(shí)間: 2025-3-26 10:57 作者: Esalate 時(shí)間: 2025-3-26 15:19
The Role of Randomness in Self-aggregative AntTree Approachem of a partitioning the data. In this work, a role of randomness in AntTree-based approach is discussed in clustering application. This proposition integrates the random mechanism of inserting ants in the tree representation of partitioning and the concept of attraction of the specific connections 作者: opportune 時(shí)間: 2025-3-26 18:26 作者: 大門在匯總 時(shí)間: 2025-3-26 21:27 作者: 構(gòu)成 時(shí)間: 2025-3-27 02:15 作者: 2否定 時(shí)間: 2025-3-27 08:44
Collective Infotaxis with Reactive Amoebae: A Note on a Simple Bio-inspired Mechanism source with only sporadic detections. This problem arises in various situations, for instance when insects emit pheromones to attract their partners. A search mechanism named infotaxis was proposed to explain how agents may progressively approach the source by using only intermittent detections..He作者: orthodox 時(shí)間: 2025-3-27 12:59 作者: monochromatic 時(shí)間: 2025-3-27 15:19
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/222973.jpg作者: overrule 時(shí)間: 2025-3-27 19:18
https://doi.org/10.1007/978-3-319-44365-2agent based modeling; crowd dynamics; massively parallel systems; modeling and simulation; traffic simul作者: HACK 時(shí)間: 2025-3-27 22:08
978-3-319-44364-5Springer International Publishing Switzerland 2016作者: 起波瀾 時(shí)間: 2025-3-28 06:05
https://doi.org/10.1007/978-3-319-95192-8This paper investigates the potentiality of pseudo-random pattern generation of 1-dimensional 3-state cellular automata (CAs). Here, a pattern represents configuration of a CA of length .. We have identified 805 CAs which have great potentiality to act as pseudorandom pattern generator (PRPG).作者: compose 時(shí)間: 2025-3-28 08:06 作者: analogous 時(shí)間: 2025-3-28 12:13 作者: surrogate 時(shí)間: 2025-3-28 17:05
Pseudorandom Pattern Generation Using 3-State Cellular AutomataThis paper investigates the potentiality of pseudo-random pattern generation of 1-dimensional 3-state cellular automata (CAs). Here, a pattern represents configuration of a CA of length .. We have identified 805 CAs which have great potentiality to act as pseudorandom pattern generator (PRPG).作者: 察覺 時(shí)間: 2025-3-28 19:19
The Density Classification Problem in the Context of Continuous Cellular AutomataIn this paper, we discuss the well-known density classification problem in the context of Continuous Cellular Automata, and recall that this problem cannot be solved in the classical sense. Yet, by slightly relaxing the assumptions on the output specification, we can identify a rich family of rules solving the problem.作者: 外貌 時(shí)間: 2025-3-29 01:07
A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority AutomatonConsider the . problem for some automaton as the one consisting in determine, given an initial configuration, if there exists a nonzero probability that some selected site change states, when the network is updated picking one site at a time uniformly at random. We show that the . is in . for the two-dimensional, von Neumann neighborhood, ..作者: 詞匯記憶方法 時(shí)間: 2025-3-29 06:23 作者: 假 時(shí)間: 2025-3-29 10:07
FResCA: A Fault-Resistant Cellular Automata Based Stream Cipher fault injection in either the linear or nonlinear block of Grain can break the cipher. Fault attacks generally exploit the linear behaviour and the reversibility of the cipher states. Using Cellular Automata (CA), we propose a Grain-like cipher which is shown to be strong particularly against fault attacks.作者: MOAN 時(shí)間: 2025-3-29 11:43
Scalability of Non-uniform Cellular Automata Having only Point State Attractorsre number of cells keeping the CA’s dynamic behaviour unchanged. That is, a CA with . cell, converges to point state attractor from any seed also converges to point state attractor when another few cells are added. Using scalability of CA, a CA based scalable pattern classifier is introduced.作者: 神秘 時(shí)間: 2025-3-29 18:50
The Garden of Eden Theorem for Cellular Automata on Group Sets with finite stabilisers. It states that the global transition function of such an automaton is surjective if and only if it is pre-injective. Pre-Injectivity means that two global configurations that differ at most on a finite subset and have the same image under the global transition function must be identical.作者: GRAZE 時(shí)間: 2025-3-29 21:32
A Field Based Solution of Mazoyer’s FSSP Schemallular synchronization problem. Due to its very special nature among the numerous solutions to the problem, we emphasize the power of cellular fields to construct cellular programs: clear semantic construction, modularity, automatic synthesis of finite state machines.作者: 色情 時(shí)間: 2025-3-30 03:47
Nonlinear Ordinary Differential Equations,hieved by embedding Priese’s delay-insensitive circuit elements, called the E-element and the K-element, on the cell space of a so-called Brownian CA, which is an asynchronous CA containing local configurations that conduct a random walk in the circuit topology.作者: palette 時(shí)間: 2025-3-30 05:43
https://doi.org/10.1007/978-3-319-95243-7 fault injection in either the linear or nonlinear block of Grain can break the cipher. Fault attacks generally exploit the linear behaviour and the reversibility of the cipher states. Using Cellular Automata (CA), we propose a Grain-like cipher which is shown to be strong particularly against fault作者: 不能和解 時(shí)間: 2025-3-30 12:01 作者: septicemia 時(shí)間: 2025-3-30 15:06 作者: pacific 時(shí)間: 2025-3-30 20:16 作者: debacle 時(shí)間: 2025-3-31 00:23
Origin and Evolution of Biodiversity with finite stabilisers. It states that the global transition function of such an automaton is surjective if and only if it is pre-injective. Pre-Injectivity means that two global configurations that differ at most on a finite subset and have the same image under the global transition function must作者: 送秋波 時(shí)間: 2025-3-31 01:39
R. Henriksen,E. Gering,D. Wright two decades for simulating such processes. Yet, a sensitivity analysis (SA) of such models is typically not performed, or model sensitivity is only studied over time on the basis of aggregated quantities, due to the lack of an appropriate framework. Taking a SEM for myxomatosis among European rabbi作者: 乳白光 時(shí)間: 2025-3-31 06:05
Optimization of Energy Supply Systemson of interest so that the state of such region is near to a desired one. Many physical problems are modelled by means of cellular automata. It is therefore important to port control concepts to this discrete world. In this paper we address the problem of regional controllability of cellular automat
