• Annual Conference on Human and Language Technology
• /
• 2010.10a
• /
• pp.81-85
• /
• 2010

최근에 스마트 폰과 같은 모바일 플랫폼의 사용이 증가함에 따라, 모바일 플랫폼에서 사용자의 편의성을 증대시켜주는 시스템 및 프로그램에 대한 요구 사항이 커지고 있다. 본 논문에서는 한국어 E-mail로부터 회의 등의 일정에 관한 정보를 얻어내는 시스템 구조를 제안하고, 그 중 일정의 시간 정보에 대한 구현 및 성능을 제시한다. 본 논문에서는 일정을 서술하기 위해 필요할 것으로 생각되는 12가지의 정보 유형을 정의하였다. 또한, E-mail의 서술 형태를 개조식으로 서술된 부분과 비개조식으로 서술된 부분으로 분류하고, 개조식으로 서술된 부분에 대하여 시간과 관련된 2가지 정보를 추출 하였다. 실험 결과, 일정의 '시작 시간'에 대한 정보 추출의 경우 F-Measure 90.10% 일정의 '종료 시간'에 대한 정보 추출의 경우 F-Measure 84.07%를 달성하였다.

• Korean Institute of Interior Design Journal
• /
• no.19
• /
• pp.53-58
• /
• 1999

The goal of this paper is to understand the visual information process and the characteristics of behaviour of the architectural design process using visual protocol analysis through the actual experiment by the architect. The visual protocol analysis is developed on the basis of the theories of the visual information processing model and visual mental image, which can explain visual representation in architectural design process. A protocol study is reported in which the experimental data by architect is analyzed through the protocol analysis method. The whole design process is divided into the stage of 9 tasks which are classified into 18 visual representatiov. The results about visual cognition in cognitive science are reviewed and summarized, and these findings will help understand the architectural design nature.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.332-335
• /
• 2008

In this paper, based on H-tree, which is proposed as the basic data cube structure for multi-dimensional data stream analysis, we have done some analysis. We find there are a lot of redundant nodes in H-tree, and the tree-build method can be improved for saving not only memory, but also time used for inserting tuples. Also, to facilitate more fast and large amount of data stream analysis, which is very important for stream research, H^*-tree is designed and developed. Our performance study compare the proposed H^*-tree and H-tree, identify that H^*-tree can save more memory and time during inserting data stream tuples.

• International Commerce and Information Review
• /
• v.3 no.2
• /
• pp.193-214
• /
• 2001

본 논문에서는 일반적인 전자상거래 비즈니스 모델을 준용하여 "글로벌 B2B 전자상거래"로서의 사이버무역(Cyber Trade) 내지 전자무역(e-Trade)의 비즈니스 모델에 대한 개념, 유행 및 사례 등을 살펴보고 향후의 발전방향을 검토하였다. 특히 무역거래알선 사이트로 대표될 수 있는 무역 부문의 국내 e-마켓플레이스에 대한 심층적인 사례분석을 통해 고객 중심의 바람직한 사이버무역의 비즈니스 모델은 계약 이전은 물론 계약 이후의 모든 무역업무 처리에 필요한 각종 정보와 서류가 전자적으로 교환이 가능한 이른바 "단절없고 전 무역과정이 유통되는 네트워크(Seamless & Fully Circulated Network)"의 구축을 지향하고 있다는 점을 지적하고 있다. 이와 관련하여 인터넷과 EDI의 통합, 온라인과 오프라인의 통합, 국내와 외국과의 네트워크 통합 등이 매우 중요함을 강조하고 있다.

• Annual Conference on Human and Language Technology
• /
• 2023.10a
• /
• pp.571-576
• /
• 2023

본 연구에서는 인권의 측면에서 AI 모델이 향상된 답변을 제시할 수 있는 방안을 모색하기 위해서 AI가 인권의 문제를 고민하는 전문가와 자신의 문제를 해결하고자 하는 사용자 사이에서 어느 정도로 도움을 줄 수 있는가를 정량적, 정성적으로 검증했다. 구체적으로는 국가인권위원회의 결정례와 상담사례를 분석한 후 이를 바탕으로 좀 더 나은 답변은 무엇인지에 대해 고찰하기 위해서 인권과 관련된 질의 응답 세트를 만든다. 질의 응답 세트는 인권 코퍼스를 학습한 모델과 그렇지 않은 모델의 생성 결과를 바탕으로 한다. 또한 생성된 질의 응답 세트를 바탕으로 설문을 실시하여 전문적인 내용을 담은 문장에 대한 선호도를 분석한다. 본 논문은 대화형 생성 모델이 인권과 관련된 주제에 대해서도 선호되는 답변을 제시할 수 있는가에 대한 하나의 대안이 될 수 있을 것이다.

• The KIPS Transactions:PartA
• /
• v.13A no.3 s.100
• /
• pp.241-252
• /
• 2006

In cluster file systems, the availability of files has been supported by replicating entire files or generating parities on parity servers. However, those methods require very large temporal and spatial cost, and cannot handle massive failures situation on the file system. So we propose HA-PVFS, a cluster file system supporting high data availability adaptive to temporal locality. HA-PVFS restricts replication or parity generation to some important files, for that it employs an efficient algorithm to estimate file access patterns from limited information. Moreover, in order to minimize the performance degradation of the file system, it uses delayed update method and relay replication.

• Journal of KIISE:Software and Applications
• /
• v.36 no.1
• /
• pp.92-108
• /
• 2009

The Princeton WordNet (PWN), which was developed during last 20 years since the mid 80, aimed at representing a mental lexicon inside the human mind. Its potentiality, applicability and portability were more appreciated in the fields of NLP and KE than in cognitive psychology. The semantic and knowledge processing is indispensable in order to obtain useful information using human languages, in the CMC and HCI environment. The PWN is able to provide such NLP-based systems with 'concrete' semantic units and their network. Referenced to the PWN, about 50 wordnets of different languages were developed during last 10 years and they enable a variety of multilingual processing applications. This paper aims at describing PWN-referenced Korean Wordnet, KorLex 1.5, which was developed from 2004 to 2007, and which contains currently about 130,000 synsets and 150,000 word senses for nouns, verbs, adjectives, adverbs, and classifiers.

• The KIPS Transactions:PartB
• /
• v.14B no.1 s.111
• /
• pp.13-22
• /
• 2007

In this paper, we propose an audience counting method in an auditorium based on pattern comparison. The previous counting methods based on object detection can't exactly count the audience in real time because auditorium has coarse illumination condition and so many audiences. Therefore, in this paper, we count the audience in an auditorium with fixed seats by the method which the pattern from each reference seat is compared to the pattern from each input seat. Especially, to overcome limitations based on either illumination or noise, two pattern comparison methods are efficiently employed and combined. One is based on the amplitude projection, and the other is based on Walsh-Hadamard Kernel. Walsh-Hadamard Kernel has the characteristic which complements amplitude projection. Therefore, we ran achieve the accurate counting in the presence of coarse illumination and noise. The experimental results show that our method performs well on sequences of images acquired in an auditorium. We also verify a realistic possibility for other applications applying our method to the parking positioning system.

• Journal of Bio-Environment Control
• /
• v.8 no.3
• /
• pp.172-182
• /
• 1999

Leaf lettuce(Lacaug sativa L.) was cultivated in deep flow culture to investigate growth and yield in relation to different reusing method of nutrient solution after once cultivation. Five different treatments were allocated to the nutrient solutions - Control(total renewal of solution), NSS(nutrient solution supplement), U control, NSAC(nutrient solution analysis and compensation), NSAC and Humus supply(NSAC with supply of Humus). The pH of solution was kept stable below 7.0 during 4 successive culture in NSAC and NSAC and Humus supply. U was sharply declined in NSS as the number of cultivation was increased. Gmwth and yield of NSAC was similar to those of Control because nutrient elements were kept the balance to the better growth, while the lettuce grown in NSS and EC control was shown lower growth rate. In the nutrient solutions, Content of N $O_3$-N and N $H_4$-N were remarkably decreased after the cultivation in all treatments. Ca and Mg were shown to be accumulated in nutrient solution regardless of culture times and treatments. After the first culture in NSAC and Humus supply, total N and P$_2$ $O_{5}$ content in leaves were lower than any other treatments, but Ca content was higher. Those were not significant as following cultures, and no significant difference of K and Mg content were shown among the treatments.

• The KIPS Transactions:PartD
• /
• v.16D no.4
• /
• pp.475-486
• /
• 2009

Data cube plays an important role in multi-dimensional, multi-level data analysis. Meeting on-line analysis requirements of data stream, several cube structures have been proposed for OLAP on data stream, such as stream cube, flowcube, S-cube. Since it is costly to construct data cube and execute ad-hoc OLAP queries, more research works should be done considering efficient data structure, query method and algorithms. Stream cube uses H-cubing to compute selected cuboids and store the computed cells in an H-tree, which form the cuboids along popular-path. However, the H-tree layoutis disorderly and H-cubing method relies too much on popular path.In this paper, first, we propose $H^*$-tree, an improved data structure, which makes the retrieval operation in tree structure more efficient. Second, we propose an improved cubing method, $H^*$-cubing, with respect to computing the cuboids that cannot be retrieved along popular-path when an ad-hoc OLAP query is executed. $H^*$-tree construction and $H^*$-cubing algorithms are given. Performance study turns out that during the construction step, $H^*$-tree outperforms H-tree with a more desirable trade-off between time and memory usage, and $H^*$-cubing is better adapted to ad-hoc OLAP querieswith respect to the factors such as time and memory space.