Results 121 to 130 of about 1,667,734 (380)
Unraveling simplicity in elementary cellular automata [PDF]
arXiv, 2014 We show that a large number of elementary cellular automata are computationally simple. This work is the first systematic classification of elementary cellular automata based on a formal notion of computational complexity. Thanks to the generality of communication complexity, the perspectives of our method include its application to other natural ...
arxiv
Journal of Applied Clinical Medical Physics, EarlyView.Abstract Purpose Four‐dimensional cone‐beam CT (4D CBCT) incorporates oversampling of 3D data to reconstruct multi‐phase CBCT data sets representing distinct phases of the breathing cycle based on a diaphragmatic correlate of respiratory motion. Motion artifacts and blurring can be reduced relative to three‐dimensional cone‐beam (3D CBCT), allowing ...
Colton Baley +4 more
wiley +1 more source
Symmetry, 2017 A complex system is a set of mutually interacting elements for which it is possible to construct a mathematical model. This article focuses on the cellular automata theory and the graph theory in order to compare various types of cellular automata and to
K. Małecki
semanticscholar +1 more source
Journal of Applied Clinical Medical Physics, EarlyView.Abstract Purpose To generate high‐quality stereotactic radiosurgery (SRS) plans for single cranial lesions using 4Pi planning technique and compare these to our clinical “status quo” plans. Methods Eighteen vestibular schwannoma (VS) patients previously planned with Varian Eclipse RapidArc and treated on a Varian TrueBeam using 6FFF MV photon beams ...
Ganesh Narayanasamy +4 more
wiley +1 more source
Advances in Mechanical Engineering, 2014 As an integrated kind of railway signal-control pattern, the four-aspect fixed autoblock system has been used in many train control systems. This paper takes the four-aspect fixed autoblock system as the research object and proposes the cellular automata
Junwei Zeng +4 more
doaj +1 more source
On the Measure Entropy of Additive Cellular Automata f∞
Entropy, 2003 We show that for an additive one-dimensional cellular automata f∞ on space of all doubly infinitive sequences with values in a finite set S = {0, 1, 2, ..., r-1}, determined by an additive automaton rule [equation] (mod r), and a f∞-invariant ...
Hasan Akın
doaj +1 more source
On “forgetful” cellular automata
Journal of Computer and System Sciences, 1975 Cellular automata are modified in such a way that states of a single automaton become unreachable if they have not been rereached during a certain period depending on a function : The automaton then will assume the quiescent state. These “forgetful” cellular automata may differ with respect to the function , the scheme by which the automata are ...
R. Vollmar, W. O. Höllerer
openaire +2 more sources
Journal of Applied Clinical Medical Physics, EarlyView.Abstract Purpose/objective We propose a novel lattice deployment for spatially fractionated radiotherapy (SFRT) treatments. In this approach, a larger diameter high‐dose sphere is centrally placed in the bulky tumor mass and surrounded by smaller diameter high‐dose spheres.
Joshua Misa +2 more
wiley +1 more source
Encryption based on reversible cellular automata
Tongxin xuebao, 2008 The reversible cellular automata is featured by its no information loss and parallel information processing. A new block cipher based on reversible second-order toggle cellular automata was proposed.
PING Ping +3 more
doaj +2 more sources
Eventually Number-Conserving Cellular Automata [PDF]
arXiv, 2004 We present a preliminary study of a new class of two-input cellular automata called eventually number-conserving cellular automata characterized by the property of evolving after a finite number of time steps to states whose number of active sites remains constant. Eventually number-conserving cellular automata are models of open systems of interacting
arxiv