نتایج جستجو برای: cellular automata
تعداد نتایج: 454824 فیلتر نتایج به سال:
State-of-the-art deep classifiers are intriguingly vulnerable to universal adversarial perturbations: single disturbances of small magnitude that lead misclassification most inputs. This phenomena may potentially result in a serious security problem. Despite the extensive research this area, there is lack theoretical understanding structure these perturbations. In image domain, certain visual s...
This paper deals with the development of two symmetric encryption algorithms on basis cellular automata: a block cipher, that is based AES and uses three-dimensional automata; stream exploits hardware-software entropy generation (tracking keystrokes mouse pointer movement), as well developed hash function, “cryptographic sponge” architecture SHA-3, modified by automata transformations. The ciph...
We prove that the limit dynamics of any finite automata network under parallel update schedule correspond exactly to fixed points a so-called strictly one-way cellular automaton. This correspondence is proven be exact, as automaton can transformed into corresponding network, latter former. transformation operated using output functions, which have been developed in author’s previous works.
پیاده سازی (quantum-dot cellular automata) qca بوسیله یک بلوک منطقی قابل پیکربندی (clb) برای یک fpga
این تحقیق در زمینه ی نشان دادن پیاده سازی یک fpga (field programmable gate array) توسط کاربرد جالب تکنولوژی qca (quantum-dot cellular automata) است. ساختار نسبتا همگن آنها اجازه ی ساخت در مقیاس نانو را به ما خواهد داد. بعلاوه، ماهیت همه منظوره ی fpga می تواند اجازه ی پیاده سازی خیلی از کاربرد ها را با استفاده از تکنیک qca به ما بدهد. ساخت و پیاده سازی fpga امروزه در دو زمینه بررسی می شود : 1) ب...
The mainframe of this work has been the study of cellular automata as very simple SIMD systems. We introduce some variations over the basic definition of cellular automata in order to compare these new models with other models of cellular automata. The neighborhoodvarying cellular automata is shown to be as powerful as time-varying cellular automata. The dynamically reconfigurable cellular auto...
We present a compositional algebraic framework to describe the evolution of quantum fields in discretised spacetimes. show how familiar notions from Relativity and causality can be recovered purely order-theoretic way causal order events spacetime, with no direct mention analysis or topology. formulate theory-independent over orders compositional, functorial way. draw strong connection Algebrai...
The main goal of this paper is to develop tools for constructing different kinds of abstract automata based on cellular automata. We call this engineering problem cellular engineering. Different levels of computing systems and models are considered. The emphasis is made on the toplevel model called a grid automaton. Our goal is to construct grid automata using cellular automata. To achieve this...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید