• Journal of information and communication convergence engineering
• /
• 제9권6호
• /
• pp.689-694
• /
• 2011

Cellular automata are discrete dynamical systems, which provide the basis for the synthesis of complex emergent behavior. This paper proposes a new algorithm of digital watermarking based on cellular automata transform (CAT). The idea of two-dimensional CAT is introduced into the algorithm. After the original image is disassembled with 2D CAT, the watermark information is embedded into the Middle-frequency of the carrier picture. Cellular automata have a huge number of combinations, such as gateway values, rule numbers, initial configuration, boundary condition, etc. Using CAT, the robustness of the watermark will be tremendous strengthened as well as its imperceptibility. Experimental results show that this algorithm can resist some usual attacks such as compression, sharpening and so on. The proposed method is robust to different attacks and is more security.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년 학술대회 논문집 정보 및 제어부문
• /
• pp.139-141
• /
• 2006

Quantum-dot Cellular Automata (QCA) is one of the most promising next generation nano-electronic devices which will inherit the throne of CMOS which is the domineering implementation technology of large scale low power digital systems. In late 1990s, the basic operations of the QCA cell were already demonstrated on a hardware implementation. Also, design tools and simulators were developed. Nevertheless, its design technology is not quite ready for ultra large scale designs. This paper proposes a new approach which enables the QCA designs to inherit the verification methodologies and tools of CMOS designs, as well. First, a set of disciplinary rules strictly restrict the cell arrangement not to deviate from the predefined structures but to guarantee the deterministic digital behaviors. After the gate and interconnect structures of the QCA design are identified, the signal integrity requirements including the input path balancing of majority gates, and the prevention of the noise amplification are checked. And then the digital logic is extracted and stored in the OpenAccess common engineering database which provides a connection to a large pool of CMOS design verification tools. Towards validating the proposed approach, we designed a 2-bit QCA adder. The digital logic is extracted, translated into the Verilog net list, and then simulated using a commercial software.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.231-236
• /
• 1997

We propose the hybrid control for the path control of wheeled mobile robot system. To develop the hybrid control of mobile robot, the continuous dynamics of mobile robot are modeled by the switched systems. The abstract model and digital automata for the path control are developed. This hybrid control system has the 3-layered hierachical structure : digital automata as the higher process, mobile robot system as the lower process, and the interface as the interaction process between the continuous dynamics and the discrete dynamics. The control of following the desired-paths with edges are investigated as the applications by the computer simulation.

• 한국통신학회논문지
• /
• 제34권1C호
• /
• pp.105-112
• /
• 2009

본 논문에서는 다 해상도 특성을 갖는 2D 셀룰러 오토마타 변환 (2D Cellular Automata Transform)을 이용한 디지털 워터마킹 방법을 제안한다. 먼저 게이트웨이(gateway) 값들을 선택하여 기저함수를 만든 후 원 영상을 셀룰러 오토마타 영역으로 변환한다. 다음 변환 영역의 특정 부분에 랜덤 비트 옅을 워터마크로 삽입한다. 마지막으로 실험을 통하여 제안 방법의 충실도가 기존의 방법보다 높을 뿐만 아니라 JPEG 압축, 필터링, 첨예화, 노이즈 등 공격에도 강인성을 가지고 있음을 증명한다. 본 제안 방법에서 기저함수는 한 조의 게이트웨이 값들에 의해 유일하게 하나가 존재하며 가능한 게이트웨이 값들의 종류는 $2^{96}$개가 있기 때문에 뛰어난 안전성을 가진다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.1050-1052
• /
• 1987

This study presents mental model based on cognitive psychology and deals with implementation of associative comparator using learning automata with random access memories.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권9호
• /
• pp.4788-4813
• /
• 2019

In this paper, we introduce concepts of optimal and near optimal secret data hiding schemes. We present a new digital image steganography approach based on the Galois field $GF(p^m)$ using graph and automata to design the data hiding scheme of the general form ($k,N,{\lfloor}{\log}_2p^{mn}{\rfloor}$) for binary, gray and palette images with the given assumptions, where k, m, n, N are positive integers and p is prime, show the sufficient conditions for the existence and prove the existence of some optimal and near optimal secret data hiding schemes. These results are derived from the concept of the maximal secret data ratio of embedded bits, the module approach and the fastest optimal parity assignment method proposed by Huy et al. in 2011 and 2013. An application of the schemes to the process of hiding a finite sequence of secret data in an image is also considered. Security analyses and experimental results confirm that our approach can create steganographic schemes which achieve high efficiency in embedding capacity, visual quality, speed as well as security, which are key properties of steganography.

• 한국게임학회 논문지
• /
• 제2권2호
• /
• pp.52-59
• /
• 2002

이 논문에서는 FSM과 확률적 FSM, NFA 등이 게임에서 NPC의 행동 지정에 쓰인 방식을 소개하고, 기존 방법에서 확률적 FSM이나 NFA의 단점을 보완할 수 있는 새로운 확률적 FSM 방식을 제안한다. 즉, 확률 유한오토마타의 추론 방식을 이용하여 다양한 NPC나 컴퓨터 플레이어의 인성이나 특성을 자동적으로 게임에 반영하기 위한 방법을 제안한다. 이 방법으로 수 많은 게이머들의 인성이나 특성을 자동적으로 파악하여, 실제 게임에서 사용되는 NPC나 컴퓨터 플레이어에게 부여해 줄 수 있고, 또한 NPC들의 인성을 다양하게 부여함으로써 게임의 재미를 더 향상시킬 수가 있다.

• 한국정보과학회논문지:시스템및이론
• /
• 제31권1_2호
• /
• pp.112-117
• /
• 2004

본 논문에서는 유한 체 $GF(2^m)$상에서 셀룰라 오토마타 (Cellular Automata)의 구조에 적합한 곱셈기 구조를 제안한다. 제안된 LSB 우선 곱셈 구조는 AOP(All One Polynomial)를 기약 다항식으로 사용하며, m＋1의 지연시간과 $ 1-D_{AND}＋1-D{XOR}$의 임계경로를 갖는다. 특히 정규성, 모듈성, 병렬성을 가지기 때문에 VLSI구현에 효율적이고 나눗셈기, 지수기 및 역원기를 설계하는 데 기본 구조로 사용될 수 있다 또한, 이 구조는 유한 체 상에서 Diffie-Hellman 키 교환 프로토콜, 디지털 서명 알고리즘, 및 ElGamal 암호화와 같이 잘 알려진 공개키 정보 보호 서비스를 위한 기본 구조로 사용될 수 있다.

• 디지털산업정보학회논문지
• /
• 제13권4호
• /
• pp.153-162
• /
• 2017

Advances in communication technologies and the decreasing cost of computers have made distributed computer systems an attractive alternative for satisfying the information needs of large organizations. This paper presents a distributed algorithm for performance improvement through load balancing and file migration in distributed systems. We employed a sender initiated strategy for task migration and used learning automata with several internal states for file migration. A task can be migrated according to the load information of a computer. A file is migrated to the destination processor when it is in the right boundary state. We also described an analytical model for load balancing with file migration to verify the proposed algorithm. Analytical and simulation results show that our algorithm is very well-suited for distributed system environments.

• 한국멀티미디어학회논문지
• /
• 제24권3호
• /
• pp.406-415
• /
• 2021

The worldwide spread of the Internet and the digital information revolution have resulted in a rapid increase in the use and transmission of multimedia information due to the rapid development of communication technologies. It is important to protect images in order to prevent problems such as piracy and illegal distribution. To solve this problem, I propose a new digital color image encryption algorithm in this paper. I design a new pseudo-random number generator based on 1D five-neighborhood maximum length cellular automata (FN-MLCA) to change the pixel values of the plain image into unpredictable values. And then I use a 3D chaotic cat map to effectively shuffle the positions of the image pixel. In this paper, I propose a method to construct a new MLCA by modeling 1D FN-MLCA. This result is an extension of 1D 3-neighborhood CA and shows that more 1D MLCAs can be synthesized. The safety of the proposed algorithm is verified through various statistical analyses.