• Journal of applied mathematics & informatics
• /
• 제16권1_2호
• /
• pp.559-569
• /
• 2004

In this paper we shall discuss the quasi-perfect automata associated with power automata. We shall give the fact that its power automaton is invertible if an automaton A is quasi-perfect. Moreover, some subgroups and normal subgroups of the characteristic semigroup X(M) will have the very interesting parts in their structures.

• 대한전기학회논문지:전력기술부문A
• /
• 제49권4호
• /
• pp.185-194
• /
• 2000

The learning automaton is an automaton to update systematically the strategy for enhancing the performance in response to the output results, and several schemes of learning automata have been presented. In this paper, S-model learning automata are applied in order to achieve the best compromise solution between an optimal solution for economic operation and an optimal solution for stable operation of the power system under the circumstance that the loads vary randomly. It is shown that learning automata are applied satisfactorily to the multiobjective optimization problem for obtaining the best tradeoff among the conflicting economy and stability objectives of power systems.

• Journal of applied mathematics & informatics
• /
• 제7권2호
• /
• pp.357-377
• /
• 2000

A parallel communicating automata system is an accepting device based on the communications between more automata working in parallel. It consists of several automata corking independently but communicating with each other by request. We survey several variants of parallel communicating automata systems with respect to their computational power. Other aspects like decidability and complexity matters are also briefly discussed. Some open problem sand directions for future research are finally pointed out.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제4권2호
• /
• pp.21-32
• /
• 2000

We study theoretical aspects of one-dimensional cellular automata over GF(q), where q is a power of a prime. Some results about the characteristic polynomials of such cellular automata are given. Intermediate boundary cellular automata are defined and related to the more common null boundary cellular automata.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 C
• /
• pp.1279-1281
• /
• 1999

The learning automaton is an automaton to update systematically the strategy for enhancing the performance in response to the output results, and several schemes of learning automata have been presented. In this paper, S-model learning automata are applied to achieving a best compromise solution between an optimal solution for economic operation and an optimal solution for stable operation of the power system under the circumstance that the loads vary randomly. It is shown that learning automata are applied satisfactorily to the multiobjective optimization problem for obtaining the best tradeoff among the conflicting economy and stability objectives of power systems.

• Journal of applied mathematics & informatics
• /
• 제16권1_2호
• /
• pp.571-583
• /
• 2004

In this paper we shall discuss the quasi-perfect automata associated with power automata. We shall give the fact that x(M)/ HX is normal subgroup of the characteristic semigroup x(M) if the automaton A is quasi-perfect and x(M)/HX = x$(M)_H$ if A is perfect. Moreover, it is a very interesting part that x$(M)_H$ is conjugate to x$(M)_{Ha}$ for every a $\in$ X. Also we shall give a characterization of Ha = Hb for x$(M)_H$.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.181-184
• /
• 1998

CAM-Brain is a model to develop neural networks based in cellular automata by evolution, and finally aims at a model as and artificial brain,. In order to show the feasibility of evolutionary engineering to develop an artificial brain we have attempted to evolve a module of CAM-Brain for the problem to control a mobile robot, In this paper, we present some recent results obtained by analyzing the behaviors of the evolved neural module. Several experiments reveal a couple of problems that should be solved when CAM-Brain evolves to control a mobile robot. so that some modification of the original model is proposed to solve them. The modified CAM-Brain has evolved to behave well in a simulated environment, and a thorough analysis proves the power of evolution.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2005년도 추계학술대회 및 정기총회
• /
• pp.3-9
• /
• 2005

The recent notion of Network Centric Warfare (NCW) emphasizes the ability to distribute right information at the right time to maximize the combat effectiveness. Accordingly, in the modern combat system the importance of non-physical element, such as communication system is increasing. However, an NCW-support communication network system is expensive. Therefore, it is essential to develop a proper combat system evaluation method to establish an efficient NCW-support combat system. Traditionally, combat system effectiveness is measured in terms of physical elements such as men and fire power. Obviously, such method is hardly applicable to a modern combat system To overcome this difficulty, we propose an evaluation model based on CA (Cellular Automata) simulation. A set of preliminary combat simulations show that CA simulation may be promising in evaluating non-physical element of a modem combat system.

• ETRI Journal
• /
• 제34권2호
• /
• pp.284-287
• /
• 2012

Quantum-dot cellular automata (QCA) is one of the few alternative computing platforms that has the potential to be a promising technology because of higher speed, smaller size, and lower power consumption in comparison with CMOS technology. This letter proposes an optimized full comparator for implementation in QCA. The proposed design is compared with previous works in terms of complexity, area, and delay. In comparison with the best previous full comparator, our design has 64% and 85% improvement in cell count and area, respectively. Also, it is implemented with only one clock cycle. The obtained results show that our full comparator is more efficient in terms of cell count, complexity, area, and delay compared to the previous designs. Therefore, this structure can be simply used in designing QCA-based circuits.

• 한국항행학회논문지
• /
• 제20권6호
• /
• pp.631-637
• /
• 2016

CMOS (complementary metal-oxide-semiconductor)의 소형화에 대한 한계를 극복할 수 있는 대체 기술 중 하나인 양자 셀룰라 오토마타 (QCA; quantum cellular automata)는 나노 단위의 셀들로 이루어져 있고, 전력의 소모량이 매우 적은 것이 특징이다. QCA를 이용한 다양한 회로들이 연구되고 있고, 그 중에서 XOR (exclusive-OR)게이트는 오류 검사 및 복구에 유용하게 사용되고 있다. 기존의 XOR 논리 게이트는 확장성이 부족하고, 클럭 구간의 수가 많이 소요되며, 실제 구현에 어려움이 있는 경우가 많다. 이러한 단점을 극복하기 위해 클럭 구간의 수를 단축한 다수결 게이트를 이용한 XOR 논리 게이트를 제안한다. 제안한 회로는 기존의 XOR 논리 게이트들과 비교 분석하고 그 성능을 검증한다.