http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
송권수(Song Kwon Soo),강문설(Kang Moon Seol),고형대(Koh Hyeong Dae),오병균(Oh Byeong Kyun) 한국정보처리학회 1996 정보처리학회논문지 Vol.3 No.3
Information System for decision making process is indispensable in information society. The information system should be able to provide required information at anywhere and anytime to everybody. Especially, regional information system is required to reduce the gab among the regions and to distinguish the characteristic of each region.In this research a regional information system which is organized with the area of culture, living, and economy is implemented. The system provide various daily and industrial information to break the information unbalance. Also, it will increase the competitive power of regional economy and regional industry.
이진 트리의 최적 2-에지 번호매김에 대한 근사 알고리즘
고형대,임형석,박승배 木浦大學校 情報産業硏究所 1998 情報産業硏究誌 Vol.6 No.-
For a given graph G(V.E). labeling on the graph G is a one-to-one mapping of vertices V into distinct integers. d-edge labeling on the graph G is labeling such that each label is a power of d, when the edge label of an edge is the absolute difference between the labels fob end-vertices of edge. d-edge labelings on the special classes of tree such as full binary trees and binomial trees have benn investigated, but 2-edge labeling on arbitrary binary trees has not known up to now. In this thesis, we present the two approximation algorithms of 2-edge labeling on arbitrary binary tress. The time complexities of these algorithms are O(NlgoN) and O(N²logN), respectively. In addtion, we show that the second algorithm obtains the optimal solutions in the every case of experiments.