http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Hiroshi Umeo,Kaori Ishida,Koutarou Tachibana,Naoki Kamikawa 대한전자공학회 2009 ITC-CSCC :International Technical Conference on Ci Vol.2009 No.7
The firing squad synchronization problem on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed for one-and two-dimensional cellular arrays. In the present paper, we reconstruct a real-coded transition rule set for an optimum-time synchronization algorithm for two-dimensional rectangle arrays proposed by Shinahr [1974], known as the first-in-the-world optimum-time synchronization algorithm for two-dimensional rectangle arrays. Based on our computer simulation, it is shown that the proposed rule set consists of 12849 transition rules and has a validity for the synchronization for any rectangle arrays of size m×n such that 2 ≤ m, n ≤ 500.
A Comparison of Sequence Generation Power in Cellular Automata
Naoki Kamikawa,Hiroshi Umeo 제어로봇시스템학회 2009 제어로봇시스템학회 국제학술대회 논문집 Vol.2009 No.8
Cellular automata(CA) are considered to be a non-linear model of complex systems, computability theory, mathematics and theoretical biology in which an infinite one-dimensional array of finitestate machines(cells) updates itself in a synchronous manner according to auniform local rule. The 1-bit inter-cellcommunication cellular automaton model(CA1?bit) is a subclass of CA whose inter-cell communication a tone step is restricted to 1-bit. The CA1?bit can be thought to be one of the most powerless and simplest model sin avariety of CAs. In this paper, we study a sequence generation problem on the CA and the CA1?bit. We make a comparison between CA and CA1?bit in regarding sequence generation power, and propose a new model of CA1?bit which operates in symmetrical input/output mode.
A Note on Three-Dimensional Firing Squad Synchronization Algorithm
Takuya Yamawaki,Takashi Amesara,Hiroshi Umeo 대한전자공학회 2008 ITC-CSCC :International Technical Conference on Ci Vol.2008 No.7
The firing squad synchronization problem on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed [1-10]. In the present paper, we propose an optimumtime firing squad synchronization algorithm for three-dimensional cellular automata. The algorithm can synchronize any threedimensional array of size mㆍnㆍℓ with a general at an arbitrary corner cell at exactly mㆍnㆍℓ+ max(m, n, ℓ)ㆍ4 steps. A lower bound in time complexity is also given.