• Journal of the Korean Society of Food Culture
• /
• v.31 no.4
• /
• pp.269-285
• /
• 2016

This study aimed to compare and analyze two respective versions of Jusikbangmun: Nogajae's and National Library of Korea. Types and composition of recipes, archives, classification of names and contents, techniques, tools, and measurement were analyzed. Nogajae's, owned by the Yuwagong family, has established sources while the writer and its publication year are unknown. The other version from the National Library of Korea, on the other hand, has a clear publication year (February, Year Jeongmi) while writer is unclear. In terms of its archive, Nogajae's is twice the size as that of the National Library of Korea, which is the same percentage (85.42%) as that from Nogajae's. However, six types of liquor have been written in its 2 books, respectively, and no overlaps occurred. Considering the Korean alphabet, Nogajae's was published earlier. Nogajae's and the one from the National Library of Korea have 104 kinds of foods (118 times) and 50 kinds of foods (51 times), respectively.

• Journal of the Korean Society for Library and Information Science
• /
• v.2
• /
• pp.1-46
• /
• 1971

A comparative study on analytico-synthetic systems and enumerative systems which have been used in Korea was dealt. The writer tries to compare the adaptability of both systems for Korean author notations. The following topics are discussed in detail: 1) The objectives of the book numbers. 2) Korean alphabet as author numbers. a) Brevity, simplicity and the possibility of expansion. b) A study on the defects of the analytico-synthetic notation devised by Professor Jai Chul Lee. c) A study on the pronounceability and the ambiguity. 3) A comparative study on filing efficiency of the Professor Lee's author marks and the writer's.

• Proceedings of the KIEE Conference
• /
• 2002.07d
• /
• pp.2755-2757
• /
• 2002

In this paper, we propose a now architecture for hardware implementation of digital neural network. By adopting flexible ladder-style bus and internal connection network into traditional SIMD-type digital neural network architecture, the proposed architecture enables fast processing that is based on parallelism, while does not abandon the flexibility and extensibility of the traditional approach. In the proposed architecture, users can change the network topology by setting configuration registers. Such reconfigurability on hardware allows enough usability like software simulation. We implement the proposed design on real FPGA, and configure the chip to multi-layer perceptron with back propagation for alphabet recognition problem. Performance comparison with its software counterpart shows its value in the aspect of performance and flexibility.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.5
• /
• pp.1-9
• /
• 1985

In this paper, a new methods which decomposes the handwritten-Hangout shape panerns into subpatterns and recognizes the decomposed subpatterns are proposed. the feature vcfices arc detected by searching boundary of the shape pattern and a topolo-gical structure is represented by a bridge links and contact links between the feature vertices. From the tpcological structure, Hangout shape patterns are decomposed into the subpatterns of 44-Korean alphabet. The 학obol and the local attributes are extracted from the subpattrrns and the subpatterns are recognized by matching those attributes with the dictionary. It is assured that this method is more effect and reasonable for deformed handwrioen Hangout shape patterns. Experimental results show that recognition rate is 99(%) and recogni-tion time is also reduced as those using the thinning process.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1780-1783
• /
• 2002

A problem of signal transmitted and received in OFDM systems is considered. In particular, an efficient solution to the problem of blind channel estimation based on Maximum Likelihood (ML) principle has been investigated. The paper proposes a new upper-bound cost, used in conjunction with a standard branch and bound integer programming technique for solving the ML problem. The tighter upper-bound cost exploits a finite-alphabet property of the transmitted signal. The proposed upper-bound cost was found to greatly speed up the ML algorithm, thus reducing computational complexity. Experimental results and discussion are included.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1001-1004
• /
• 1993

The Multisensor Fusion Problem (MFP) deals with the methodologies involved in effectively combining together homogeneous or non-homegeneous information obtained from multiple redundant or disparate sensors in order to perform a task more accurately, efficiently, and reliably. The inherent uncertainties in the sensory information are represented using Fuzzy Numbers, -numbers, and the Uncertainty-Reductive Fusion Technique (URFT) is introduced to combine the multiple sensory information into one consensus -number. The MFP is formulated from the Information Theory perspective where sensors are viewed as information sources with a fixed output alphabet and systems are modeled as a network of information processing and processing and propagating channels. The performance of the URFT is compared with other fusion techniques in solving the 3-Sensor Problem.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.5
• /
• pp.277-282
• /
• 2003

In this paper we propose Using Higher Order Neuron on the Supervised Learning Machine of the Kohonen Feature Map. The architecture of proposed model adopts the higher order neuron in the input layer of Kohonen Feature Map as a Supervised Learning Machine. It is able to estimate boundary on input pattern space because or the higher order neuron. However, it suffers from a problem that the number of neuron weight increases because of the higher order neuron in the input layer. In this time, we solved this problem by placing the second order neuron among the higher order neuron. The feature of the higher order neuron can be mapped similar inputs on the Kohonen Feature Map. It also is the network with topological mapping. We have simulated the proposed model in respect of the recognition rate by XOR problem, discrimination of 20 alphabet patterns, Mirror Symmetry problem, and numerical letters Pattern Problem.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2656-2659
• /
• 2001

본 논문은 교사 있는 학습기의 Kohonen Feature Map에 고차 뉴런을 도입, 고차 뉴런을 이용한 Kohonen의 자기 조직화 맵을 제안한다. 일반적인 Kohonen Feature Map의 특징은 입력신호를 받아 출력 면(Kohonen Feature Map) 내의 특정한 위치 주위에 집중하는 메커니즘으로 즉, 국소집중 반응을 구하는 구조이다. 본 논문에서는 종래형의 Kohonen Feature Map의 특징을 보유하며 교사 있는 학습기의 Kohonen Feature Map에 고차 뉴런을 도입하여 국소집중반응 및 특징 축출이 용이하도록 네트워크 구조를 개선한 것이다. 특히, 일차 뉴런의 문제점인 비선형 분리 문제에 대하여 교사 있는 학습기의 Kohonen Feature Map의 입력층에 고차 뉴런을 도입함으로 비선형 분리 가능한 형태의 네트워크 구조로 형성하였다. 그러나, 일반적인 고차 뉴런의 문제점을 보안하기 위해 본 논문에서는 오직 2차 뉴런만을 생성하였으며 중복되는 뉴런을 최대한 억제하였다. 본 제안 모델의 특성을 살펴보기 위해 XOR문제와 20개의 Alphabet을 식별하는 패턴인식 시뮬레이션을 했으며, 본 제안 모델의 범화능력을 알아보기 위하여 Mirror Symmetry를 사용하여 계산기 시뮬레이션을 했다. 그 결과, 본 제안 모델이 종래형의 네트워크 구조보다 뛰어난 인식률을 얻을 수 있었다.

• The Journal of Information Technology and Database
• /
• v.7 no.1
• /
• pp.67-82
• /
• 2000

In this paper we have developed a message transfer protocol, CMP, which improves MSP's message processing capability. The proposed method has taken into account document classification to improve the efficiency of message processing. The difference between the conventional MSP and CMP has been addressed. The CMP's performance has been shown by various experiments including number, alphabet, Korean letter, Chinese letter, music sound and compression file transmission. And security capability of both protocols has been compared based on the specification of FIPS 140-2. The CMP's overall performance is shown to be superior to that of MSP on the processing speed in the performance perspective and on the function of cryptographic module interface and cryptographic key management in the security perspective respectively.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.627-630
• /
• 2001

정보화 시대를 살아가는 구성원중 하나인 청각 및 언어 장애인들의 경우, 정보 전달 및 소통이 필요한 일상 생활은 물론, 교육 현장에서도 어려움을 겪고 있는 것이 현실이다. 따라서 이러한 어려움을 극복하기 위해 장애인 보조 시스템의 개발이 진행되고 있으나 그 결과는 아직 미미하다. 본 논문은 청각 및 언어 장애인들에게 컴퓨터와의 상호 작용을 통해 정보 전달을 지원할 수 있는 시스템을 구축하여 더 나은 교육 환경을 제공하는데 그 목적이 있다. 즉, 사이버 공간에서 수화하는 아바타를 통해 정보를 전달하는 시스템을 설계하고 구축한다. 그 첫 번째 단계로써 입력 장치를 통해 받아들인 단어를 자소별로 변환한 뒤, 3D 지화 애니메이션으로 표현하였으며, 이 연구 결과는 수화 아바타 시스템의 기반이 될 것이다.