• Journal of applied mathematics & informatics
• /
• v.4 no.1
• /
• pp.117-134
• /
• 1997

In this paper we introduce the notions of TL-subsystems strong TL-subsystems and discuss their basic properties.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.12
• /
• pp.198-204
• /
• 2003

The bone fracture healing is simulated by using one of the complex system rules, named cellular automata method. It is assumed that each cell has property of Bone, Cartilage or Fibrous connective tissue. Nine local rules are adopted to change the property of each cell against the mechanical stimulus, which consists of the strain energy density, and the existence of bone in the surroundings. Two dimensional sheep metatarsal model is considered and the bone fracture healing is simulated. The simulation results agree well with those obtained by using fuzzy logic model and experimental data. The cellular automata method found to be one of the simulation methods to express the bone fracture healing. The cellular automata method is expected to be effective in representing biological phenomenon.

• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2193-2196
• /
• 1998

Cellular automata are dynamical systems in which space and time are discrete, where each cell has a finite number of states and updates its states by interactive rules among the cell-neighborhood. From the characteristics of self-reproduction and self- organization, it is possible to create a neural network which has the specific patterns or structures dynamically. CAM-Brain is a kind of such neural network system which evolves its structure by adopting evolutionary computations like genetic algorithms (GA). In this paper, we suggest the evolution strategies for the structure of neural networks based on cellular automata.

• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.409-417
• /
• 2009

A definition of finite automaton (DFA and NDFA) with intuitionistic fuzzy (final) states is proposed. Acceptance of intuitionistic fuzzy regular language by the finite automaton (DFA and NDFA) with intuitionistic fuzzy (final) states are examined. It is found that the finite automaton (DFA and NDFA) with intuitionistic fuzzy (final) states is more suitable for recognizing intuitionistic fuzzy regular language than earlier model. The paper also gives an idea of intuitionistic fuzzy regular expressions through possible definitions.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.10 no.2
• /
• pp.94-102
• /
• 2011

In this paper, a novel drowsiness detection algorithm using eye-blink pattern is proposed. The proposed drowsiness detection model using finite automata makes it easy to detect eye-blink, drowsiness and sleep by checking the number of input symbols standing for closed eye state only. Also it increases the accuracy by taking vertical projection histogram after locating the eye region using the feature of horizontal projection histogram, and minimizes the external effects such as eyebrows or black-framed glasses. Experimental results in eye-blinks detection using the JZU eye-blink database show that our approach achieves more than 93% precision and high performance.

• The KIPS Transactions:PartA
• /
• v.14A no.4
• /
• pp.245-248
• /
• 2007

This paper provides some simple recursive formulas generation transition functions of finite cellular automata with triplet local transition functions under two states (0 and 1) and four different boundary conditions (0-0,0-1,1-0,1-1), and classify transition functions into several classes.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.39 no.3
• /
• pp.211-219
• /
• 2002

In this paper, a new architecture that can simultaneously process modular multiplication and squaring on GF(2$^{m}$ ) in m clock cycles by using the cellular automata is presented. This can be used efficiently for the design of the modular exponentiation on the finite field which is the basic computation in most public key crypto systems such as Diffie-Hellman key exchange, EIGamal, etc. Also, the cellular automata architecture is simple, regular, modular, cascadable and therefore, can be utilized efficiently for the implementation of VLSI.

• Structural Engineering and Mechanics
• /
• v.23 no.1
• /
• pp.29-42
• /
• 2006

This paper describes the design scheme of the three-dimensional structures based on the concept of the cellular automata simulation. The cellular automata simulation is performed according to the local rule. In this paper, the local rule is derived in the mathematical formulation from the optimization problem. The cell density is taken as the design variable. Two objective functions are defined for reducing the total weight of the structure and obtaining the fully stressed structure. The constraint condition is defined for defining the local rule. The penalty function is defined from the objective functions and the constraint condition. Minimization of the penalty function with respect to the design parameter leads to the local rule. The derived rule is applied to the design of the three-dimensional structure first. The final structure can be obtained successfully. However, the computational cost is expensive. So, in order to reduce the computational cost, the material parameters $c_1$ and $c_2$ and the value of the cell rejection criterion (CRC) are changed. The results show that the computational cost depends on the parameters and the CRC value.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.6
• /
• pp.111-123
• /
• 2004

A hash function is a function that takes bit strings of arbitrary length to bit string of fixed length. A cellular automata is a finite state machine and has the property of generating pseudorandom numbers efficiently by combinational logics of neighbour cells. In [1] and [7], hash functions based on cellular automata which can be implemented efficiently in hardware were proposed. In this paper, we show that we can find collisions of these hash functions with probability 0.46875 and 0.5 respectively.

• 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.