• 제목/요약/키워드: cellular-automata

검색결과 331건 처리시간 0.033초

Optimal lay-up of hybrid composite beams, plates and shells using cellular genetic algorithm

  • Rajasekaran, S.;Nalinaa, K.;Greeshma, S.;Poornima, N.S.;Kumar, V. Vinoop
    • Structural Engineering and Mechanics
    • /
    • 제16권5호
    • /
    • pp.557-580
    • /
    • 2003
  • Laminated composite structures find wide range of applications in many branches of technology. They are much suited for weight sensitive structures (like aircraft) where thinner and lighter members made of advanced fiber reinforced composite materials are used. The orientations of fiber direction in layers and number of layers and the thickness of the layers as well as material of composites play a major role in determining the strength and stiffness. Thus the basic design problem is to determine the optimum stacking sequence in terms of laminate thickness, material and fiber orientation. In this paper, a new optimization technique called Cellular Automata (CA) has been combined with Genetic Algorithm (GA) to develop a different search and optimization algorithm, known as Cellular Genetic Algorithm (CGA), which considers the laminate thickness, angle of fiber orientation and the fiber material as discrete variables. This CGA has been successfully applied to obtain the optimal fiber orientation, thickness and material lay-up for multi-layered composite hybrid beams plates and shells subjected to static buckling and dynamic constraints.

L-SYSTEM IN CELLUSAT AUTOMATA DESIGN OF ARTIFICIAL NEURAL DECISION SYSTEMS

  • Sugisaka, Masanori;Sato, Mayumi;Zhang, Yong-guang;Casti, John
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1995년도 Proceedings of the Korea Automation Control Conference, 10th (KACC); Seoul, Korea; 23-25 Oct. 1995
    • /
    • pp.69-70
    • /
    • 1995
  • This paper considers the applications of cellular automata in order to design self-organizing artificial neural decision systems such as self-organizing neurocomputer circuit, machines, and artifical life VLSI circuits for controlling mechanical systems. We consider the L-system and show the results of growth of plants in artificial life.

  • PDF

ACA Based Image Steganography

  • Sarkar, Anindita;Nag, Amitava;Biswas, Sushanta;Sarkar, Partha Pratim
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제2권5호
    • /
    • pp.266-276
    • /
    • 2013
  • LSB-based steganography is a simple and well known information hiding technique. In most LSB based techniques, a secret message is embedded into a specific position of LSB in the cover pixels. On the other hand, the main threat of LSB-based steganography is steganalysis. This paper proposes an asynchronous-cellular-automata(ACA)-based steganographic method, where secret bits are embedded into the selected position inside the cover pixel by ACA rule 51 and a secret key. As a result, it is very difficult for malicious users to retrieve a secret message from a cover image without knowing the secret key, even if the extraction algorithm is known. In addition, another layer of security is provided by almost random (rule-based) selection of a cover pixel for embedding using ACA and a different secret key. Finally, the experimental results show that the proposed method can be secured against the well-known steganalysis RS-attack.

  • PDF

셀룰러 오토마타를 이용한 LSB 곱셈기 설계 (Design of LSB Multiplier using Cellular Automata)

  • 하경주;구교민
    • 한국산업정보학회논문지
    • /
    • 제7권3호
    • /
    • pp.1-8
    • /
    • 2002
  • GF(2$^{m}$ )상에서 모듈러 곱셈은 공개키 암호 시스템과 같은 응용에서의 기본 연산으로 사용된다. 본 논문에서는 이와 같은 모듈러 곱셈 연산을 셀룰러 오토마타를 이용하여, GF(2$^{m}$ )상에서 m클럭 사이클만에 처리할 수 있는 연산기를 설계하였다. 이 곱셈기는 LSB 우선 방식으로 설계되었으며, 기존의 시스톨릭 구조를 이용한 곱셈기 보다 하드웨어 복잡도가 낮고 처리 시간이 빠른 장점이 있다. 그리고 설계된 곱셈기는 지수연산을 위한 하드웨어 설계에 효율적으로 이용될 수 있을 것이다.

  • PDF

선형 TPMACA의 0-tree의 0이 아닌 상태를 여원벡터로 갖는 셀룰라 오토마타 (Cellular Automata with a Complemented Vector as a Non-zero State in the 0-tree of a Linear TPMACA)

  • 조성진;김한두;최언숙
    • 한국멀티미디어학회논문지
    • /
    • 제4권4호
    • /
    • pp.356-362
    • /
    • 2001
  • 본 논문에서는 선형 TPMACA C의 0-tree에서 0이 아닌 상태를 여원벡터로 갖는 CA C'를 분석하여 C의 모든 상태가 C'의 어느 곳에 있는지를 밝혔다. 또한 C의 상태전이 그래프에서 한 경로만 알면 나머지 상태를 모두 알 수 있음을 밝혔다.

  • PDF

Watermarking Based on Complemented MLCA and 2D CAT

  • Li, Xiao-Wei;Yun, Jae-Sik;Cho, Sung-Jin;Kim, Seok-Tae
    • Journal of information and communication convergence engineering
    • /
    • 제9권2호
    • /
    • pp.212-216
    • /
    • 2011
  • Digital watermarking has gained importance in recent years in copyright protection and multimedia. This paper proposes a secure and novel watermarking system based on complemented Maximum Length Cellular Automata (MLCA) and Two-Dimension Cellular Automata Transform (2D CAT). In this watermarking scheme, the original watermark is first encrypted by complemented MLCA with the private keys, and then the encrypted watermark is embedded into the CAT domain of the cover image, at last use the inverse CAT for the transformed image, the watermarked image is obtained. Experiment results show that this new method is more secure and provides robust performance against watermarking attacks.

비선형 MLCA와 1D CAT를 이용한 의료영상 암호화 (Medical Image Encryption using Non-linear MLCA and 1D CAT)

  • 남태희
    • 한국멀티미디어학회:학술대회논문집
    • /
    • 한국멀티미디어학회 2012년도 춘계학술발표대회논문집
    • /
    • pp.336-339
    • /
    • 2012
  • 본 논문에서는 비선형 MLCA(Maximum Length Cellular Automata)와 1D CAT(One-Dimensional Cellular Automata Transform)를 이용하여 의료 영상 암호화 방법을 제안한다. 암호화 방법은 먼저, Wolfram Rule 행렬에 의해 전이행렬 T를 생성한다. 그 후, 암호화하려는 원 영상에 생성된 전이 행렬 T를 곱하여 원 영상의 픽셀 값을 변환한다. 또한 변환된 원 영상을 여원 벡터 F와 XOR 연산하여 비선형 MLCA가 적용된 영상으로 변환한다. 다음, 게이트웨이 값을 설정하여 1D CAT 기저함수를 생성한다. 그리고, 비선형 MLCA가 적용된 영상에 생성된 1D CAT 기저함수를 곱하여 암호화를 한다. 마지막으로 키 공간 분석을 통하여 제안한 방법이 높은 암호화 수준의 성질을 가졌음을 검증한다.

  • PDF