• Proceedings of the Korean Society of Computer Information Conference
• /
• 2009.01a
• /
• pp.189-192
• /
• 2009

게임에서 주인공 캐릭터나 MPC(Non Player Character)가 목적지까지의 경로를 찾는 것은 매우 중요하다. 또한 캐릭터가 이동 중 다양한 오브젝트와 벽을 만나면 이를 회피해야 하며 최단 경로로 이동해야 한다. 본 논문에서는 게임 맵에서 캐릭터의 길 찾기 방법으로 유전 알고리즘을 이용하는 방법을 제안하였다. 특히, 유전 알고리즘의 구성요소 중해 집합을 구성하는 염색체 인코딩 방법을 제안하였다. 본 논문에서 제안한 염색체의 인코딩은 캐릭터의 이동 방향을 비트 스트링으로 표현하였다. 캐릭터가 현재 위치에서 이동할 수 있는 방향은 8 방향이다. 따라서 하나의 방향을 표현하기 위해서는 3비트의 이진스트링으로 나타낼 수 있다. 하나의 해를 나타내는 염색체는 3비트의 이진 스트링을 맵을 나타내는 그래프의 노드 수만큼 할당하여 구성할 수 있다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.4
• /
• pp.187-201
• /
• 1998

In ATM networks with high capacity, the effect of failures on transmission links or nodes can be catastrophic, so that the issue of survivability is of great importance. In this paper. we consider the routing problem for working and backup virtual paths(VPs). To accomplish a higher survivability. routing the two kinds of VPs should be taken into account at the same time because backup VP routing depends on the working VP routing. A coevolutionary algorithm is employed to solve the problem for simultaneously routing of working and backup VPs. To develop an efficient coevolutionary algorithm for the problem. structure of populations, encoding method, neighborhood, and genetic operators are studied in this paper. The results of extensive experiments are reported. The performance comparison of the proposed algorithm with a conventional genetic algorithm and existing heuristics shows that our approach is promising.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.2
• /
• pp.101-114
• /
• 2000

Multicasting is the simultaneous transmission of data to multiple destinations. In multicast ATM networks the effect of failures on transmission links or nodes can be catastrophic so that the issue of survivability is of great importance. However little attention has been paid to the problem of multicast restoration. This paper presents an efficient heuristic technique for routing backup virtual paths in ulticast networks with link failure. Genetic algorithm is employed here as a heuristic. In the application of genetic algorithm to the problem, a new genetic encoding and decoding method and genetic operators are proposed in this paper. The other several heuristics are also presented in order to assess the performance of the proposed algorithm. Experimental results demonstrate that our algorithm is a promising approach to solving the problem.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.4
• /
• pp.35-45
• /
• 2000

The vertex-based boundary encoding scheme is widely used in object-based video coding area and computer graphics due to its scalability with natural looking approximation. Existing single framebased vertex encoding algorithm is not efficient for temporally correlated video sequences because it does not remove temporal redundancy. In the proposed method, a vertex point is selected from not only the boundary points of the current frame but also the vertex points of the previous frame to remove temporal redundancy of shape information in video sequences. The problem of selecting optimal vertex points is modeled as finding shortest path in the directed acyclic graph with weight The boundary is approximated by a polygon which can be encoded with the smallest number of bits for maximum distortion. The temporal redundancy between two successive frames is efficiently removed with the proposed scheme, resulting in lower bit-rate than the conventional algorithms.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.6 s.336
• /
• pp.39-48
• /
• 2005

This paper proposes a reconfigurable coprocessor for communication systems, which can perform high speed computations and various functions. The proposed reconfigurable coprocessor can easily implement communication operations, such as scrambling, interleaving, convolutional encoding, Viterbi decoding, FFT, etc. The proposed architecture has been modeled by VHDL and synthesized using the SEC 0.18$\mu$m standard cell library. The gate count is about 35,000 gates and the critical path is 3.84ns. The proposed coprocessor can reduced about $33\%$ for FFT operations and complex MAC, $37\%$ for Viterbi operations, and $48\%\~84\%$ for scrambling and convolutional encoding for the IEEE 802.11a WLAN standard compared with existing DSPs. The proposed coprocessor shows Performance improvements compared with existing DSP chips for communication algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.181-188
• /
• 2005

Chinese Postman Problem (CPP) is a problem that finds a shortest tour traversing all edges or arcs at least once in a given network. The Chinese Postman Problem on Mixed networks (MCPP) is a Practical generalization of the classical CPP and it has many real-world applications. The MCPP has been shown to be NP-complete. In this paper, we transform a mixed network into a symmetric network using virtual arcs that are shortest paths by Floyd's algorithm. With the transformed network, we propose a Genetic Algorithm (GA) that converges to a near optimal solution quickly by a multi-directional search technique. We study the chromosome structure used in the GA and it consists of a path string and an encoding string. An encoding method, a decoding method, and some genetic operators that are needed when the MCPP is solved using the Proposed GA are studied. . In addition, two scaling methods are used in proposed GA. We compare the performance of the GA with an existing Modified MDXED2 algorithm (Pearn et al. , 1995) In the simulation results, the proposed method is better than the existing methods in case the network has many edges, the Power Law scaling method is better than the Logarithmic scaling method.

• International Journal of Advanced Culture Technology
• /
• v.6 no.1
• /
• pp.42-49
• /
• 2018

In this study, we tried to reveal the state of stillness of Cho Ji-Hoon's poem "Silent Night 1" as a healing modifier. The language of poem is synaptically linked to the calmness emotion of the human body, seeking a principle that leads to a state of healing. Therefore, this study was carried out for the purpose of applying the principle to literary therapy program. The silent signal embedded in the poem is encoded into the signals of the sound as it is synapsed to the human body. Encoding of auditory nerves by poem lines is like a Morse code that word and word leave in the human body. The action potential of the auditory nerve is further activated by the potential difference between the word and the word represented by the neural network, such as a Morse code, which is accessed to the human body by such a path. There is worked as amplified potential difference between the words perceived by a sound which is synapsed to the human body and by a silence which is synapsed to the human body. The phenomenon of the words approaching the human body and setting the absence of sound and amplifying the sound is because the words amplifies the Morse codes in the human neural network. At this time, the signals overlap each other. Thereby this poem is increasing the amplitude of the sound. This overlapping of auditory signals appears and amplifies the catharsis. If this Cho Ji-Hoon Poem's principle is applied to literary therapy program in the future, more effective treatment will be done.

• Journal of Microbiology
• /
• v.43 no.4
• /
• pp.325-330
• /
• 2005

Rhodococcus sp. strain YU6 was isolated from soil for the ability to grow on o-xylene as the sole carbon and energy source. Unlike most other o-xylene-degrading bacteria, YU6 is able to grow on p-xylene. Numerous growth substrate range experiments, in addition to the ring-cleavage enzyme assay data, suggest that YU6 initially metabolizes 0- and p-xylene by direct aromatic ring oxidation. This leads to the formation of dimethylcatechols, which was further degraded largely through meta-cleavage path-way. The gene encoding meta-cleavage dioxygenase enzyme was PCR cloned from genomic YU6 DNA using previously known gene sequence data from the o-xylene-degrading Rhodococcus sp. strain DK17. Subsequent sequencing of the 918-bp PCR product revealed a $98\%$ identity to the gene, encoding meth-ylcatechol 2,3-dioxygenase from DK17. PFGE analysis followed by Southern hybridization with the catechol 2,3-dioxygenase gene demonstrated that the gene is located on an approximately 560-kb megaplasmid, designated pJY J1

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.11
• /
• pp.66-76
• /
• 2009

The motion estimation in video encoding system occupies the biggest part. So, we require the motion estimator with efficient structure for real-time operation. And for motion estimator's implementation, it is desired to design hardware module of an exclusive use that perform the encoding process at high speed. This paper proposes motion estimation detection block(MED), 41 SADs(Sum of Absolute Difference) calculation block, minimum SAD calculation and motion vector generation block based on parallel processing. The parallel processing can reduce effectively the amount of the operation. The minimum SAD calculation and MED block uses the pre-computation technique for reducing switching activity of the input signal. It results in high-speed operation. The MED and 41 SADs calculation blocks are composed of adder tree which causes the problem of critical path. So, the structure of adder tree has changed the most commonly used ripple carry adder(RCA) with carry skip adder(CSA). It enables adder tree to operate at high speed. In addition, as we enabled to easily control key variables such as control signal of search range from the outside, the efficiency of hardware structure increased. Simulation and FPGA verification results show that the delay of MED block generating the critical path at the motion estimator is reduced about 19.89% than the conventional strukcture.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.4
• /
• pp.774-780
• /
• 2017

This paper proposes an efficient binary arithmetic encoder hardware architecture for CABAC encoding, which is an entropy coding method of HEVC. CABAC is an entropy coding method that is used in HEVC standard. Entropy coding removes statistical redundancy and supports a high compression ratio of images. However, the binary arithmetic encoder causes a delay in real time processing and parallel processing is difficult because of the high dependency between data. The operation of the proposed CABAC BAE hardware structure is to separate the renormalization and process the conventional iterative algorithm in parallel. The new scheme was designed as a four-stage pipeline structure that can reduce critical path optimally. The proposed CABAC BAE hardware architecture was designed with Verilog HDL and implemented in 65nm technology. Its gate count is 8.07K and maximum operating speed of 769MHz. It processes the four bin per clock cycle. Maximum processing speed increased by 26% from existing hardware architectures.