• Title/Summary/Keyword: cellular-automata

Search Result 332, Processing Time 0.032 seconds

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
    • /
    • v.16 no.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.10a
    • /
    • 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
    • /
    • v.2 no.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

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

  • 하경주;구교민
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.7 no.3
    • /
    • pp.1-8
    • /
    • 2002
  • Modular Multiplication in Galois Field GF(2/sup m/) is a basic operation for many applications, particularly for public key cryptography. This paper presents a new architecture that can process modular multiplication on GF(2/sup m/) per m clock cycles using a cellular automata. Proposed architecture is more efficient in terms of the space and time than that of systolic array. Furthermore it can be efficiently used for the hardware design for exponentiation computation.

  • PDF

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

  • 조성진;김한두;최언숙
    • Journal of Korea Multimedia Society
    • /
    • v.4 no.4
    • /
    • pp.356-362
    • /
    • 2001
  • In this paper, we show the behaviors of all states in C and the states in C', where C' is a complemented cellular automata whose the complemented vector is a nonzero state in the 0-tree of a linear TPMACA C. Also we show that if we know a path in the state-transition graph of C, then we can know the behavior of all states in 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
    • /
    • v.9 no.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.