Results 151 to 160 of about 1,667,734 (380)
Advanced Engineering Materials, EarlyView.This study examines the mechanical properties of triply periodic minimal surfaces (TPMS)‐based lattices, analyzing 36 architectures in elastic and plastic regimes. It evaluates the applicability of beam‐based scaling laws to TPMS lattices. Rigidity arises from the alignment of members with the load direction and solid regions preventing rotation.
Lucía Doyle +2 more
wiley +1 more source
Entropy rate of higher-dimensional cellular automata
, 2012 We introduce the entropy rate of multidimensional cellular automata. This number is invariant under shift-commuting isomorphisms; as opposed to the entropy of such CA, it is always finite.
Blanchard, François, Tisseur, Pierre
core +2 more sources
Optical Cellular Automata : Architectural Principles [PDF]
, 1988 Pierre Chavel +3 more
openalex +1 more source
Quantum Cellular Automata from Lattice Field Theories [PDF]
arXiv, 2003 We apply the methods of lattice field theories to the quantization of cellular automata. We discuss the quantization of five main categories of cellular automata: bosonic, fermionic, supersymmetric, spin and quantum dot using path integral and operator formalisms of lattice field theories.
arxiv
Advanced Engineering Materials, EarlyView.This study models static recrystallization in interstitial free‐steel using coupled crystal plasticity and phase‐field simulations. The method directly links heterogeneous dislocation density to nucleation site prediction, eliminating reliance on empirical assumptions.
Alireza Rezvani +2 more
wiley +1 more source
Revisiting the Rice Theorem of Cellular Automata
, 2010 A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neighbors. It induces a dynamical system on the set of configurations, i.e.
Guillon, Pierre, Richard, Gaétan
core +5 more sources
Enumeration of number-conserving cellular automata rules with two inputs [PDF]
Journal of Cellular Automata 2 vol. 2 pp. 141-148 (2007), 2007 We show that there exists a one-to-one correspondence between the set of number-conserving cellular automata (CA) with $q$ inputs and the set of balanced sequences with $q$ terms. This allows to enumerate number-conserving CA. We also show that number-conserving rules are becoming increasingly rare as the number of states increases.
arxiv
Scalable Fabrication of Height‐Variable Microstructures with a Revised Wetting Model
Advanced Engineering Materials, EarlyView.Height‐variable microstructures are fabricated using a scalable CO2 laser machining approach, enabling precise control of wettability through structural gradients. Classical wetting models fail to capture height‐induced effects, necessitating a revised theoretical framework.
Prabuddha De Saram +2 more
wiley +1 more source
Issues on drawing the State Transition Diagram for arbitrary Cellular Automata [PDF]
arXiv, 2008 This paper proposes several algorithms and their Cellular Automata Machine (CAM) for drawing the State Transition Diagram (STD) of an arbitrary Cellular Automata (CA) Rule (any neighborhood, uniform/ hybrid and null/ periodic boundary) and length of the CA n. It also discusses the novelty, hardware cost and the complexities of these algorithms.
arxiv