• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.1
• /
• pp.10-16
• /
• 2010

90/150 CA is a CA completely specified by using rule 90 and rule 150. Since 90/150 CA whose minimal and characteristic polynomials are identical has outstanding randomness, this CA is more attractive than LFSR. Sarkar proposed a scheme based on the 90 uniform CA and the 150 uniform CA. That scheme provided authentication by digital signature and other basic security requirements like confidentiality. In this paper we analyze 90 or 150 uniform CA and give a synthesis method of 2n-cell uniform CA and (2n+1)-cell uniform CA using a special n-cell 90/150 CA. And we propose an effective method of computation of characteristic polynomial corresponding to uniform CA.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.441-445
• /
• 2009

In this paper we propose the method of generating the maximum length sequence based on Self Programmable Cellular Automata. Recently there is a research trend such that increased CA dimensionality and PCA which applies different rules on the same cell at different time steps can make a sequence with a long period. By changing a cell's state transition rules to give the cell dynamic energy at each time step, we can make the period of a sequence longer and the randomness of a sequence higher.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.3
• /
• pp.593-600
• /
• 2018

Cellular automata (CA) have been applied to effective cryptographic system design. CA is superior in randomness to LFSR due to the fact that its state is updated simultaneously by local interaction. To apply these CAs to the cryptosystem, a study has been performed how to synthesize CA corresponding to given polynomials. In this paper, we analyze the recurrence relations of the characteristic polynomial of the 90 UCA and the characteristic polynomial of the 90/150 CA whose transition rule is <$00{\cdots}001$>. And we synthesize the 90/150 CA corresponding to the trinomials $x^{2^n}+x+1(n{\geq}2)$ satisfying f(x)=f(x+1) using the 90 UCA transition rule blocks and the special transition rule block. We also analyze the properties of the irreducible factors of trinomials $x^{2^n}+x+1$ and propose a 90/150 CA synthesis algorithm corresponding to $x^{2^n}+x^{2^m}+1(n{\geq}2,n-m{\geq}2)$.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.7 no.3
• /
• pp.118-125
• /
• 2004

The purpose of this study is to decide an appropriate neighborhood and a transition rule of cellular automata by analyzing the past growth process of urban areas in Gimhae. With cellular automata which can manage the change based on the dynamic model and time, this study analyzes the urban growth of Gimhae from 1987 to 2001. Also, through the simulation of different types for neighborhood and transition rules, we can find the appropriate neighborhood and the transition rule for Gimhae. In conclusion, the forecast of physical urban growth pattern is more accurate under conditions when the number of matrixes for the neighborhood is small, the shape of the neighborhood is rectangular, "${\alpha}$" value, which control the pace of urban growth, is low and the transition possibility ($P_{ij}$) is high.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.85-88
• /
• 2001

이 논문은 시간 데이터베이스에 능동 규칙 시스템을 결합한 능동적 시간 데이터베이스의 능동 규칙 및 실행 모델을 제안하며 그 모델을 설계 구현한다. 기존의 시간 데이터베이스 능동 규칙 연구들이 시간 릴레이션에 대한 조건-조치 형태의 규칙 지원에 머물렀던데 비하여 제안하는 능동 규칙 모델은 유효시간 및 트랜잭션 시간을 지원하는 이원 시간 릴레이션에 대해 SQL3 트리거의 기능 모두를 시간 데이터베이스 상에서 지원한다. 즉, 전이 릴레이션 및 전이 변수, 조건-조치의 류플 및 문 단위 수항을 포함한다. 또한, 능동 규칙의 유효시간 정의 및 유효시간 사건 등의 새로운 개념을 제시하고 시스템 구조 및 설계 구현에 대하여 기술한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.393-396
• /
• 2006

In this paper, we analyze the characteristic polynomials of 90/150 cellular automata which uses only 90, 150 rules as state-transition rules. In particular, we propose the method which the characteristic polynomial is represented as the exponential type of a primitive polynomial by synthesizing 90/150 CA.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.3
• /
• pp.41-54
• /
• 2001

This paper propose an active rule and its semantic model integrating active rule system into temporal database. Most of previous works have been focused on condition action(CA) rule for temporal relations. However, proposed active rule model supports full SQL:3 trigger functionalitics including transition variable and table as well as tuple-level and statement-level active rules in E CA granularity. A bi-temporal concept of active rule and valid time event are also proposed newlv.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.31-33
• /
• 2004

웹 사용에 대한 다음 요구 사항을 예측하기 위한 마이닝 방법으로 연관규칙이나 순차 패턴 등이 많이 사용되고 있지만, 이러한 방법들은 생성된 규칙들의 지지도(Support)나 신뢰도(Confidence)에 의한 예측만을 고려하기 때문에 정확한 예측을 하기 어려운 단점을 가지고 있다. 따라서, 본 논문에서는 빈도 수에 의한 Markov model을 기반으로 하여 웹 로그 파일에 저장된 사용자들의 행동 패턴에 따라 생성되어지는 여러 형태의 규칙 유형을 찾아내고, 사용 빈도 수를 이용한 전이 확률 행렬에 따른 다음 요구사항을 정확하게 예측할 수 있는 모델을 제시하고자 한다. 그 결과 여러 형태의 규칙 유형을 $K^{th}$ -order Markov 과정에서 효율적으로 발견해 낼 수 있다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.3
• /
• pp.493-499
• /
• 2008

Cellular Automata(CA) has been used as modeling and computing paradigm for a long time. And CA has been used to model many physical systems. While studying the models of such systems, it is seen that as the complexity of the physical system increase, the CA based model becomes very complex and becomes to difficult to track analytically. Also such models fail to recognize the presence of inherent hierarchical nature of a physical system. In this paper we give the characterization of Hierarchical Cellular Automata(HCA). Especially we analyze transition rules, characteristic polynomials and cyclic structures of HCA.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.11a
• /
• pp.294-299
• /
• 1999

CCSR은 CCS에 시간적인 개념이 추가된 실시간 명세 언어로 실시간 프로세스의 정적 분석에 이용되고 있다. CCSR은 프로세스 전이 규칙을 이용하여 프로세스 동작의 관심 부분만 하여 분석하기 때문에 전체 태스크(task)의 동작을 분석하는데 적용하기 어렵고, 전이규칙에 따른 상태 변화를 이해하기 어렵다. E-TCPN은 시간 요소가 첨가된 Petri Net의 변형된 형태로 실시간 시스템의 분석과 모델링을 위한 형식적(formal) 방법을 제공한다. 본 논문에서는 CCSR로 표현된 프로세스 동작을 E-TCPN 모델에 적용함으로써 실시간 시스템을 중요한 사건을 중심으로 전체 태스크의 동작 과정을 표현하고 프로세스의 수행 과정을 이해하기 쉽도록 CCSR을 변형하여, E-TCPN 명세 모델에 적용하고, 적용된 E-TCPN으로 스케줄링가능성 분석 알고리즘을 제안하고 구현하였다.