• (The)Study of the Eastern Classic
• /
• no.36
• /
• pp.229-264
• /
• 2009

This paper aims for a study on the theory that mind is Li(principle). The method of research is laid emphasis on searching for the historical development of the perception Theory in late Cho-Sun. First of all, I investigated a meaning of the perception theories of Ho-Rak school, that were criticized in the Cho-Sun academic world. The next, I investigated the theory of Li-ju-Ki-ja that was raised by Yi Sang Jung. He thought that Li is supervisor and Ki is assistance. And he put a construction on the Perception Theories of Toegye school. Yi Jin sang's theory of perception is the result of criticism against Ho-Rak school, and a fresh and in-depth construction of Yi Sang Jung's perception theory. His viewpoint was contradiction to the theory of Sim si Ki(the theory that Mind is made of Ki). And he rediscovered the human conscience that was born endowed from Heaven.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.2
• /
• pp.209-214
• /
• 2020

The equitable partitioning problem(EPP) is classified as [0/1] binary skill existence or nonexistence and integer skill levels such as [1,2,3,4,5]. There is well-known a polynomial-time optimal solution finding algorithm for binary skill EPP. On the other hand, tabu search a kind of metaheuristic has apply to integer skill level EPP is due to unknown polynomial-time algorithm for it and this problem is NP-hard. This paper suggests heuristic greedy algorithm with polynomial-time to find the optimal solution for integer skill level EPP. This algorithm descending sorts of skill level frequency for each field and decides the lower bound(LB) that more than the number of group, packing for each group bins first, than the students with less than LB allocates to each bin additionally. As a result of experimental data, this algorithm shows performance improvement than the result of tabu search.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.1
• /
• pp.99-106
• /
• 2009

Though edge detection, an important stage that significantly affecting the performance of image recognition, has been given numerous researches on its execution methods, it still remains as difficult problem and it is one of the components for image recognition applications while it is not the only way to identify an object or track a specific area. This paper, unlike gradient operator using edge detection method, found out edge pixel by referring to 2 neighboring pixels information in binary image and comparing them with pre-defined 4 edge pixels pattern, and detected binary image edge by determining the direction of the next edge detection exploring pixel and proposed method to detect binary image edge by repeating step of edge detection to detect another area edge. When recognizing image, if edge is detected with the use of gradient operator, thinning process, the stage next to edge detection, can be omitted, and with the edge detection algorithm executing time reduced compared with existing area edge tracing method, the entire image recognizing time can be reduced by applying real-time image recognizing system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.5
• /
• pp.15-20
• /
• 2023

Until now, Pollard's Rho algorithm has been known as the most efficient way for discrete algebraic problems to decrypt symmetric keys. However, the algorithm is being studied on how to further reduce the complexity of O(${\sqrt{p}}$) performance, along with the disadvantage of having to store the giant stride m=⌈${\sqrt{p}}$⌉ data. This paper proposes an array method for cycle detection in discrete logarithms. The proposed method reduces the number of updates of stack memory by at least 73%. This is done by only updating the array when (x_i<0.5x_i-1)∩(x_i<0.5(p-1)). The proposed array method undergoes the same number of modular calculation as stack method, but significantly reduces the number of updates and the execution time for array through the use of a binary search method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.5
• /
• pp.509-517
• /
• 2001

Full-search algorithm requires large amount of computation which causes time delay or very complex hardware architecture for real time implementation. In this paper, we propose a fast motion estimator based on bit-plane matching, which reduce the computational complexity and the hardware cost. In the proposed motion estimator, the conventional motion estimation algorithms are applied to the binary images directly extracted from the video sequence. Furthermore, in the proposed VLSI motion estimator, we employ a Pair of processing cores that calculate the motion vector continuously By controlling the data flow in a systolic fashion using the internal shift registers in the processing cores, we avoid using SRAM (local memory) so that we remove the time overhead for accessing the local memory and adopt lower-cost fabrication technology. We modeled and tested the proposed motion estimator in VHDL, and then synthesized the whole system which has been integrated in a 0.6-$\mu$m triple-metal CMOS chip of size 8.15 X 10.84$\textrm{mm}^2$.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.6
• /
• pp.538-542
• /
• 2001

DNA computing has been applied to the problem of getting an optimal soluting since Adleman's experiment. DNA computing uses strings with various length and four-type bases that makes more useful for finding a global optimal solutions of the complex multi-modal problems This paper presents DNA coding method finding optimal solution of the multi-modal function and compares the efficiency of this method with the genetic algorithms(GA). GA searches efffectively an optimal solution via the artificial evolution of individual group of binary string and DNA coding method uses DNA molecules and four-type bases denoted by the A(Ademine) C(Gytosine);G(Guanine)and T(Thymine). The selection, crossover, mutation operators are applied to both DNA coding algorithm and genetic algorithms and the comparison has been performed. The results show that the DNA based algorithm performs better than GA.

• 한국HCI학회:학술대회논문집
• /
• 2008.02b
• /
• pp.527-533
• /
• 2008

본 연구는 기존 RPG에서 주요한 재미 요소로 기능하던 성장 모티프가 MMORPG(Massive Multi-user Online Role Palying Game)에서 어떤 식으로 변형되어 나타나는 지 살펴본다. 성장과 역할 수행을 통해 재미를 얻는 게임인 MMORPG는 성장 서사에서 많이 나타나는 구조인 여정형 혹은 탐색형의 구조를 보편적으로 차용하고 있다. 그러나 기존 서사물에서 성장 모티프가 정체성 찾기와 같은 내면적인 변화를 나타내기 위해 구조를 차용하는 반면, 게임에서는 위의 구조를 통해 얻은 성장의 결과물을 수치의 증가나 외적 형태의 변화를 통해 나타낸다. 즉, 경험치나 아이템을 통해 성장이 수치화되어 나타나는 것이다. 이는 여정형 탐색담이라는 성장 서사의 보편적 구조에서 게임적인 특수성이 더해진 것이라 할 수 있다. 성장 소설만의 서사적 유형이란 바로 주인공의 변화 양상이 미숙에서 성숙으로, 불완전에서 완전으로, 결핍에서 충족으로 변화하는 과정을 담고 있는 이야기적 특질을 의미한다. 그러한 미숙하고 불완전한 존재가 변화하게 되는 계기와 과정, 그리고 그 결과로 구조화된 유형적 특질을 갖고 있는 소설 양식이 성장소설이라 할 수 있는 것이다. 이러한 구조화된 유형적 특질은 신화나 민담에서는 탐색담이나 여행담으로 나타난다. 게임에서의 성장은 캐릭터의 성장과 직결된다. 본격적으로 플레이어와 동일시되어 성장을 대리 경험적으로 체험하는 것은 D&D 온라인을 거쳐, 현재 MMORPG의 형태를 구현해낸 울티마 온라인이 이후부터이다. 세부적으로 구현된 세계와 온라인을 통해 생성된 방대한 네트워크 안에서 플레이어는 자신과 동일화된 캐릭터를 플레이하면서 대리경험을 하게 된다. 즉, 플레이어가 캐릭터의 성장에 작용하는 여러 가지 변수를 선택하고, 조작해가면서 자신만의 캐릭터를 생성해 나가면서, MMORPG가 구현하는 게임 세계에 구성원이자 일원이 되는 것이다. MORPG는 기존의 RPG의 선형적인 성장에 비해 복합적인 양상을 보여준다. 문화에서의 성장 서사에서 일반적으로 발견되는 여정형의 탐색담은 개발자 서사인 배경 스토리에서 나타나며, 레벨시스템과 이에 따른 공간의 배치에 따라 플레이어에게 직접적인 영향'을 끼친다. 영속적인 세계와 플레이어 간의 상호작용을 통해 일어나는 사용자 서사는 완결된 형태의 캐릭터를 무의미하게 만든다. 플레이어는 비선형적인 성장을 끊임없이 계속하게 되는 것이다.

• Journal of Broadcast Engineering
• /
• v.16 no.5
• /
• pp.861-872
• /
• 2011

Many fast block-matching algorithms (BMAs) in motion estimation field reduce computational complexity by screening the number of checking points. Although many fast BMAs reduce computations, sometimes they should endure matching errors in comparison with full-search algorithm (FSA). In this paper, a novel fast BMA for constrained one-bit transform (C1BT)-based motion estimation is proposed in order to decrease the calculations of the block distortion measure. Unlike the classical fast BMAs, the proposed algorithm shows a new approach to reduce computations. It utilizes the binomial distribution based on the characteristic of binary plane which is composed of only two elements: 0 and 1. Experimental results show that the proposed algorithm keeps its peak signal-to-noise ratio (PSNR) performance very close to the FSA-C1BT while the computation complexity is reduced considerably.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.31 no.6A
• /
• pp.399-408
• /
• 2011

Development of smart sensors for structural health monitoring and damage detection has been advanced remarkably in recent years. Nowadays fiber optic sensors, especially fiber Bragg grating (FBG) sensors, have attracted many researchers' interests for their attractive features, such as multiplexing capability, durability, lightweight, electromagnetic interference immunity. In this paper, a damage detection approach of jacket-type offshore structures by principal component analysis (PCA) technique using FBG sensors are presented. An experimental study for a tidal current power plant structure as one of the jacket-type offshore structures was conducted to investigate the feasibility of the proposed method for damage monitoring. It has been found that the PCA technique can efficiently eliminate environmental effects from measured data by FBG sensors, resulting more damage-sensitive features under various environmental variations.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06c
• /
• pp.534-539
• /
• 2010

OpenMP 프로그램의 수행 중에 발생하는 자료 경합과 같은 병행성 오류는 디버깅을 위하여 반드시 탐지되어야만 한다. 그러나 이를 탐지하는 것은 어려운 일이다. 접근사건의 발생 후 관계를 기반으로하는 경합 탐지 기법은 프로그램의 수행 중에 발생하는 스레드의 병행성 정보를 식별하기위한 레이블을 생성하고, 생성된 스레드의 레이블을 기반으로 공유변수에 접근하는 사건을 접근역사를 통해 감시함으로써 경합을 탐지한다. 이러한 경합 탐지의 방법에서 레이블 생성을 위한 NR 레이블링 기법은 병행성 정보생성 시에 지역자료 구조를 사용함으로써 병목현상이 발생하지 않으며, 접근역사에 저장하는 레이블의 크기가 상수 값을 갖는 공간적 효율성을 제공한다. 또한 부모스레드의 정보역사를 정렬된 리스트 형태로 가져 병행성 정보 비교 시에 이진탐색이 가능하므로 시간적 효율성을 가지는 우수한 기법이다. 그러나, NR 레이블링은 레이블의 생성시에 부모스레드의 정보역사를 유지하기 위해서 내포 병렬성의 깊이에 의존하는 시간적 비용이 요구된다. 본 논문에서는 부모스레드의 정보역사 유지를 위해 상수적인 시간 및 공간적 복잡도를 갖도록 NR 레이블링 기법을 개선한다. 합성 프로그램을 이용하여 실험한 결과에서 개선된 기법은 최대 병렬성의 증가에 따라 레이블의 생성과 유지시 기존의 기법보다 평균 4.5배 빠르고, 레이블링을 위해 평균 3배 감소된 기억공간을 요구하며, 내포 병렬성에 의존적이지 않음을 보인다.