• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.3D
• /
• pp.329-334
• /
• 2009

The various behaviors of vehicular traffic flow are generated through both car-following and lane-changing behaviors of vehicles. Especially lane-usage varies by lane-changing behaviors. In the area of microscopic vehicle simulation, a lane-changing model connected to a car-following model parallel is essential to generate both various traffic flows relationships and laneusages. In Korea, some studies on car-following models have been reported, but few studies for lane-changing models stay in the beginning stage. In this paper, a two-lane changing model for the simulation modeling of large freeway network is introduced. The lane-changing model is developed based on CA (Cellular Automata) model. The developed model is parallel combined with an existing CA car-following model and tested on a closed link system. The results of simulation show that the developed model generates the various behaviors of lane usage, which existing CA lane-changing models could not generate. The presented model is expected to be used for the simulation of more various freeway traffic flows.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.05a
• /
• pp.236-240
• /
• 2000

A cellular automaton is well-known for self-organizing and dynamic behaviors in the field of artificial life. This paper addresses a new neuronic architecture called an evolvable cellular classifier which evolves with the genetic rules (chromosomes) in the non-uniform cellular automata. An evolvable cellular classifier is primarily based on cellular programing, but its mechanism is simpler because it utilizes only mutations for the main genetic operators and resembles the Hopfield network. Therefore, the desirable hi t-patterns could be obtained through evolutionary processes for just one individual agent. As a result, an evolvable hardware is derived which is applicable to classification of bit-string information.

• Journal of the Korean Mathematical Society
• /
• v.32 no.3
• /
• pp.573-582
• /
• 1995

J.Milnor[Mi2] has introduced the notion of directional entropy in his study of Cellular Automata. Cellular Automaton map can be considered as a continuous map from a space $K^Z^n$ to itself which commute with the translation of the lattice $Z^n$. Since the space $K^Z^n$ is compact, map S is uniformly continuous. Hence S is a block map(a finite code)[He]. (S is said to have a finite memory.) In the case of n = 1, we have a shift map, T on $K^Z$, and a block map S and they together generate a $Z^2$ action.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.4
• /
• pp.379-389
• /
• 2000

A cellular automaton is well-known for self-organizing and dynamic behavions in the filed of artifial life. This paper addresses a new neuronic architecture called an evolvable celluar classifier which evolves with the genetic rules (chromosomes) in the non-uniform cellular automata. An evolvable cellular classifier is primarily based on cellular programming, but its mechanism is simpler becaise it utilizes only mutations for the main genetic operators and resmbles the Hopfield network. Therefore, the desirable bit-patterns could be obtained through evolutionary processes for just one individual agent, As a rusult, an evolvable hardware is derived which is applicable to clessification of bit-string information.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.04a
• /
• pp.277-280
• /
• 2000

q가 소수의 거듭제곱의 형태일 때 GF(q)상에서의 1차원 셀룰라 오토마타의 여러 가지 특성들을 연구한다. 이러한 셀룰라 오토마타의 특성다항식에 관한 몇가지 특성들이 제시한다. Intermediate Boundary CA를 정의하고 Null Boundary CA와의 관계를 살펴본다.

• Proceedings of the PSK Conference
• /
• 2001.04a
• /
• pp.195.3-196
• /
• 2001

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.35-36
• /
• 2006

This paper presents an effective multiplier in GF($2^m$) based on programmable cellular automata (PCA) and uses a normal basis. The proposed architecture has the advantage of high regularity and a reduced latency. The proposed architecture can be used in the effectual hardware design of exponentiation, division, inversion architectures.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.27-31
• /
• 2003

본 논문은 그름 멤버들간의 안전한 통신을 위한 그룹키 관리(Group key management)에 대한 새로운 방법을 제안한다. 제안된 방식은 선형 셀룰러 오토마타를 이용해서 생성된 involution 특성을 갖는 기본 암호 프리미티브를 이용하여 비밀 공유키를 생성한다. 제안된 방식은 공모에 대한 위협을 근본적으로 방지할 수 있는 특징을 가지고 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7C
• /
• pp.663-670
• /
• 2009

In this paper, we propose the image encryption method which gradually uses NFSR(Non-linear Feedback Shift Register) and 20 CAT(Two-Dimensional Cellular Automata Transform). The encryption method is processed in the following order. First, NFSR is used to create a PN(pseudo noise) sequence, which matches the size of the original image. Then, the created sequence goes through a XOR operation with the original image and process the encipherment. Next, the gateway value is set to produce a 20 CAT basis function. The produced basis function is multiplied by encryption image that has been converted to process the 20 CAT encipherment. Lastly, the results of the experiment which are key space analysis, entropy analysis, and sensitivity analysis verify that the proposed method is efficient and very secure.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.9
• /
• pp.885-892
• /
• 2016

The nonlinear sequence generator called the shrinking generator was designed as nonlinear keystream generator composed by two maximum-length LFSRs. The shrunken sequences generated by the shrinking generator are included in the class of interleaved sequences and can be modelled as one of the output sequences of cellular automata (CA). In this paper, we propose a method for synthesizing a 90/150 CA-based sequence generator to generate a family of sequences with the same characteristic polynomial as the shrunken sequences.