• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.587-595
• /
• 1994

The use of flight training simulators has been increased remarkably during the past 20 years stimulated by the benefit that simulators can contribute to safety and training efficiency. Simulators have incorporated higher and higher levels of reality to provide more realistic training. Now, however, users are beginning to question how such reality is enough. Especially, it has raised question about the need for a notion system in the aircraft simulator. To help answer this question, this report describes notion cue requirements and types of motion system, and finally presents the assessment of the effectiveness of three different notion system alternatives.

• The Journal of the Korea Contents Association
• /
• v.7 no.7
• /
• pp.50-59
• /
• 2007

This paper describes a question analysis and expansion based on semantics for on efficient information retrieval. Results of all information retrieval systems include many non-relevant documents because the index cannot naturally reflect the contents of documents and because queries used in information retrieval systems cannot represent enough information in user's question. To solve this problem, we analyze user's question semantically, determine the answer type, and extract semantic features. And then we expand user's question using them and syntactic structures which are used to represent the answer. Our similarity is to rank documents which include expanded queries in high position. Especially, we found that an efficient document retrieval is possible by a question analysis and expansion based on semantics on natural language questions which are comparatively short but fully expressing the information demand of users.

• Journal of information and communication convergence engineering
• /
• v.7 no.4
• /
• pp.419-430
• /
• 2009

Reading comprehension (RC) systems are to understand a given text and return answers in response to questions about the text. Many previous studies extract sentences that are the most similar to questions as answers. However, texts for RC tests are generally short and facts about an event or entity are often expressed in multiple sentences. The answers for some questions might be indirectly presented in the sentences having few overlapping words with the questions. This paper proposes a conceptual graph matching method towards RC tests to extract answer strings. The method first represents the text and questions as conceptual graphs, and then extracts subgraphs for every candidate answer concept from the text graph. All candidate answer concepts will be scored and ranked according to the matching similarity between their sub-graphs and question graph. The top one will be returned as answer seed to form a concise answer string. Since the sub-graphs for candidate answer concepts are not restricted to only covering a single sentence, our approach improved the performance of answer extraction on the Remedia test data.

• ETRI Journal
• /
• v.42 no.6
• /
• pp.899-911
• /
• 2020

The data in tables are accurate and rich in information, which facilitates the performance of information extraction and question answering (QA) tasks. TableQA, which is based on tables, solves problems by understanding the table structure and searching for answers to questions. In this paper, we introduce both novice and intermediate Korean TableQA tasks that involve deducing the answer to a question from structured tabular data and using it to build a question answering pair. To solve Korean TableQA tasks, we use S3-NET, which has shown a good performance in machine reading comprehension (MRC), and propose a method of converting structured tabular data into a record format suitable for MRC. Our experimental results show that the proposed method outperforms a baseline in both the novice task (exact match (EM) 96.48% and F1 97.06%) and intermediate task (EM 99.30% and F1 99.55%).

• Journal of the Korean Data and Information Science Society
• /
• v.13 no.1
• /
• pp.35-45
• /
• 2002

For improving the quality of survey dat a of sensitive character, we suggest a conditional in direct survey method. In th at method, only the respondents who answer directly to the less sensitive question respond indirectly to the more sensitive one by using the one sample unrelated question randomized response technique with the known $\pi_y$, the true proportion of unrelated group Y. We extend it to two sample method when $\pi_y$ is unknown. We also consider the case that people who possess less sensitive character answer untruthfully. Finally we compare our method with the methods of Greenberg et al. and Carr et al..

• Korean Journal of English Language and Linguistics
• /
• v.3 no.2
• /
• pp.157-180
• /
• 2003

Why should quantifiers float\ulcorner This is the question that this paper sets out to answer. In the past, research concentrated on how the theory should account for the non-constituency of a quantificational determiner and the NP it quantifies over. Successful as they might have been, those theories have little, if anything to offer as an answer to the question why quantifiers would float. Here we sketch a theory that puts the scopal properties of FQs (already observed by Dowty and Brodie, 1984) in the center of their properties. We construct a theory in which FQs are simple scope markers and float when differential scope needs to be marked.

• Bulletin of the Korean Mathematical Society
• /
• v.39 no.2
• /
• pp.289-297
• /
• 2002

It was shown by L. Polterovich ([3]) that if L is a totally real submanifold of a symplectic manifold $(M,\omega)$ and L is parallelizable then L is normal. So we try to find an answer to the question of whether there is a compatible almost complex structure J on the symplectic vector bundle $TM$\mid$_{L}$ such that $TL{\cap}JTL=0$ assuming L is normal and parallelizable. Although we could not reach an answer, we observed that the claim holds at the vector space level. And related to the question, we showed that for a symplectic vector bundle $(M,\omega)$ of rank 2n and $E=E_1{\bigoplus}E_2$, where $E=E_1,E_2$are Lagrangian subbundles of E, there is an almost complex structure J on E compatible with ${\omega}$ and $JE_1=E_2$. And finally we provide a necessary and sufficient condition for a given embedding into a symplectic manifold to be normal.

• Journal of the Korean Mathematical Society
• /
• v.42 no.4
• /
• pp.847-856
• /
• 2005

M. Junger, G. Reinelt, and W. R. Pulleyblank asked the following questions ([2]). (1) Is it true that every simple planar 2-edge connected bipartite graph has a 3-partition in which each component consists of the edge set of a simple path? (2) Does every simple planar 2-edge connected graph have a 3-partition in which every component consists of the edge set of simple paths and triangles? The purpose of this paper is to provide a positive answer to the second question for simple outerplanar 2-vertex connected graphs and a positive answer to the first question for simple planar 2-edge connected bipartite graphs one set of whose bipartition has at most 4 vertices.

• Bulletin of the Korean Mathematical Society
• /
• v.27 no.2
• /
• pp.127-131
• /
• 1990

Let f:R.rarw.R be a continuous function on the real line R, and denote the n-th iterate of f by f$^{n}$ :f$^{1}$=f and f$^{n}$ =f.f$^{n-1}$ for n>1. A point x.mem.R is a periodic point of f of period k>0 if f$^{k}$ (x)=x but f$^{i}$ (x).neq.x for all 01, then it must also have a fixed point, by the intermediate Theorem. Also the question has an intriguing answer which was found by ths Russian mathematician Sharkovky [6] in 1964.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.676-678
• /
• 2002

질의 응답 시스템(Question Answering: QA)에서 정답 유형 부류(Answer Type Taxonomy: ATT)란 사용자 질문 분석을 위한 미 부류 체계를 의미하는 것으로, ATT의 크기가 클수록 시스템의 성능은 높아진다. ATT를 확장하기 위해서는, 개체(Named Entity)에 의미 범주를 결정하는 개체 분류기(Named Entity Tagger의 분류 체계가 세분되어야 하는데, 기존의 개체 분류기는 한문서 내에서 그 개체의 분류를 시도하기 때문에, 분류를 위한 문맥 정보의 양이 부족하여, 정확하고 상세한 분류를 기대하기 힘들다. 본 논문에서는 동일 개체에 대한 문맥 정보를 수집하기 위해, 그 개체가 나타나는 다른 문서들을 검색하는 개체 피드백 Named Enti쇼 Feedback)이라는 기법을 사용한다. 개체가 상세히 분류됨에 따라 ATT도 확장될 수 있었으며, 이렇게 확장된 ATT상에서의 정답 추출은 baseline보다 약 7%정도의 성능 향상을 보여, 개체 피드백의 효과를 확인할 수 있었다.