• Journal of Educational Research in Mathematics
• /
• v.24 no.3
• /
• pp.359-374
• /
• 2014

Students' difficulties and errors in relation to mathematical proofs are worth while to say one of the dilemmas in mathematics education. The potential elements of their difficulty are scattered over the process of proving in geometry as well as algebra. This study aims to investigate whether middle school students understand the context of algebraic proof including literal expressions. We applied 24 third-grade middle school students a test item which shows a proof including a literal expression and missing the conclusion. Over the half of them responded wrong answers based on only the literal expression without considering its context. Three of them were interviewed individually to show their thinking. As a result, we could find some characteristics of their thinking including the perspective on proof as checking the validity of algebraic expression and the gap between proving and understanding of proof etc. From these, we also discussed about several didactical implications.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.2
• /
• pp.68-77
• /
• 2003

The Least-Laxity First(or LLF) scheduling algorithm assigns the highest priority to a task with the least laxity, and has been proved to be optimal for a uni-processor and sub-optimal for a multi-processor. However, this algorithm Is Impractical to implement because laxity tie results in the frequent context switches among tasks. In this paper, a Modified Least-Laxity First on Multiprocessor(or MLLF/MP) scheduling algorithm is proposed to solve this problem, i.e., laxity tie results in the excessive scheduling overheads. The MLLF/MP is based on the LLF, but allows the laxity inversion. MLLF/MP continues executing the current running task as far as other tasks do not miss their deadlines. Consequently, it avoids the frequent context switches. We prove that the MLLF/MP is also sub-optimal in multiprocessor systems. By simulation results, we show that the MLLF/MP has less scheduling overheads than LLF.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.743-744
• /
• 2009

사용자가 방문한 웹 사이트와 연관된 광고를 웹 페이지에 실어주는 문맥광고 관련 연구가 광고 효율성 측면에서 최근 주목을 받고 있다. 이러한 문맥광고 관련 연구의 핵심은 웹 페이지와 웹 광고간의 연관성을 높여주는데 있는데, 연관성 향상 방안으로 최근 사용자 의도 분석을 통한 연관성 향상 기법이 많이 연구되고 있다. 그러나 기존 연구에서는 사용자가 로그인을 해야 하거나, 로그 정보를 일정기간이상 수집해야만 사용자 의도 분석이 가능 하다는 문제점이 존재 한다. 본 논문에서는 로그인이나 많은 양의 로그정보 수집 없이 한 세션 내에서 방문한 웹 페이지 로그만을 이용하여 개인화된 문맥 광고를 제공하는 문맥광고 기법을 제안한다. 실험 결과에서는 제안하는 기법이 기존의 광고 기법에 비해 사용자가 판단하는 웹 페이지와 웹 광고의 연관성 (precison) 이 기존의 기법에 비해 높아짐을 증명한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.4
• /
• pp.443-454
• /
• 1999

최소 여유시간 우선(Least-Laxity-First)스케쥴링 알고리즘은 여유시간이 작은 태스트가 높은 우선순위를 갖는 동적 우선순위 스케줄링 방법으로서 단일프로세서 시스템에서 최적임이 증명되었다. 그러나, 이 알고리즘은 최소 여유시간을 가진 태스크가 여러 개 존재하여 여유시간 충돌이 발생한 경우 이 태스크들 간에 빈번한 문맥교환이 발생하게 되는 문제점이 있어 실용적이지 못하다. 본 논문에서 제한하는 최소 여유시간 우선 기반의 최소선점을 갖는 스케줄링 알고리즘(Least-Laxity-First with Minimum Preemption 또는 LLF/MP)은 여유시간이 충돌했을 때에 문맥교환을 최소화함으로써 최소 여유시간 우선 스케줄링 알고리즘의 단점을 해결하였다. LLF/MP 스케줄링 알고리듬은 불필요한 문맥교환을 줄임으로써 시스템 오버헤드로 인한 시스템의 성능 저하를 방지할 수 있고 보다 많은 시스템 자원을 예측 불가능한 비주기적 태스크에게 할당할수 있다.

• Annual Conference on Human and Language Technology
• /
• 1998.10c
• /
• pp.20-27
• /
• 1998

기존의 어휘규칙기반 품사태거는 품사문맥이나 어휘확률만을 사용하는 통계적 품사태거에 의해 해결되지 않는 형태론적 중의성을 어휘문맥을 참조하는 어휘규칙을 사용함으로써 효과적으로 해결할 수 있었다. 그러나 어휘규칙을 수작업으로 획득하기 때문에 규칙 획득에 많은 시간이 소요되어 소량의 규칙만이 사용되었다. 본 논문에서는 품사부착말뭉치로부터 어휘규칙을 자동으로 획득하는 방법을 제안한다. 제안된 방법으로 자동획득된 어휘규칙을 사용하여 실험말뭉치의 66.1%를 98.8%의 정확률로 태깅하였다. 이로써 통계적 품사태거만을 사용할 때(95.43% 정확률) 보다 어휘규칙과 결합할 때(96.12% 정확률) 통계적 품사태거의 성능이 약 15.1%(0.69% 정확률)만큼 향상되었다. 또한 제안된 방법은 영어 품사태깅에 대해서도 효과적임이 실험을 통해 증명되었다.

• Annual Conference on Human and Language Technology
• /
• 2004.10d
• /
• pp.25-31
• /
• 2004

단서구문 및 어휘 쌍 확률 등을 이용하면 일정한 영역의 문서에서 사용된 용어의 원인이 되거나 결과를 나타나는 관련어들을 찾을 수 있다. 본 논문에서는 이러한 각 용어의 선행 원인과 후행 결과를 인과관계 정보라고 정의한다. 인과관계 정보가 유사한 용어들은 서로 유사한 개념에 속한다고 가정한다면, 용어의 직/간접적 인과관계로서 용어 온톨로지에서 그 용어가 속할 집합을 결정하는데 도움을 줄 수 있다. 본 논문에서는 각 용어의 인과관계가 용어 군집화를 위한 유용한 문맥 정보의 하나라는 것을 실험을 통해 증명하였다. 속성으로 사용된 인과관계는 대용량의 코퍼스로부터 비지도식 학습방법을 통해 자동 습득하였으며, 그 정확도는 74.84%를 보였다. 1659개 용어에 대한 군집화 실험 결과 70.02%의 정확도를 보였으며, 어휘 유사도만을 사용한 경우에 비해 32.9%의 적용도 향상을 보였다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.6 s.312
• /
• pp.43-51
• /
• 2006

This paper proposes a metrics for example matching under the example-based machine translation for English-Korean machine translation. Our metrics served as similarity measure is based on edit-distance algorithm, and it is employed to retrieve the most similar example sentences to a given query. Basically it makes use of simple information such as lemma and part-of-speech information of typographically mismatched words. Edit-distance algorithm cannot fully reflect the context of matched word units. In other words, only if matched word units are ordered, it is considered that the contribution of full matching context to similarity is identical to that of partial matching context for the sequence of words in which mismatching word units are intervened. To overcome this drawback, we propose the context-weighting scheme that uses the contiguity information of matched word units to catch the full context. To change the edit-distance metrics representing dissimilarity to similarity metrics, to apply this context-weighted metrics to the example matching problem and also to rank by similarity, we normalize it. In addition, we generalize previous methods using some linguistic information to one representative system. In order to verify the correctness of the proposed context-weighted metrics, we carry out the experiment to compare it with generalized previous methods.

• Journal of KIISE:Databases
• /
• v.36 no.5
• /
• pp.366-373
• /
• 2009

In this paper, we propose a similarity search algorithm for image databases. One of the central problems regarding content-based image retrieval (CBIR) is the semantic gap between the low-level features computed automatically from images and the human interpretation of image content. Many search algorithms used in CBIR have used the Minkowski metric (or $L_p$-norm) to measure similarity between image pairs. However those functions cannot adequately capture the aspects of the characteristics of the human visual system as well as the nonlinear relationships in contextual information. Our new search algorithm tackles this problem by employing new similarity measures and ranking strategies that reflect the nonlinearity of human perception and contextual information. Our search algorithm yields superior experimental results on a real handwritten digit image database and demonstrates its effectiveness.

• Journal of the Korea Convergence Society
• /
• v.9 no.1
• /
• pp.419-431
• /
• 2018

In this paper, we propose a novel method for monitoring mood trend of Twitter users by analyzing their daily tweets for a long period. Then, to more accurately understand their tweets, we analyze all types of content in tweets, i.e., texts and emoticons, and images, thus develop a multimodal sentiment analysis method. In the proposed method, two single-modal analyses first are performed to extract the users' moods hidden in texts and images: a lexicon-based and learning-based text classifier and a learning-based image classifier. Thereafter, the extracted moods from the respective analyses are combined into a tweet mood and aggregated a daily mood. As a result, the proposed method generates a user daily mood flow graph, which allows us for monitoring the mood trend of users more intuitively. For evaluation, we perform two sets of experiment. First, we collect the data sets of 40,447 data. We evaluate our method via comparing the state-of-the-art techniques. In our experiments, we demonstrate that the proposed multimodal analysis method outperforms other baselines and our own methods using text-based tweets or images only. Furthermore, to evaluate the potential of the proposed method in monitoring users' mood trend, we tested the proposed method with 40 depressive users and 40 normal users. It proves that the proposed method can be effectively used in finding depressed users.

• Korean Journal of Cognitive Science
• /
• v.21 no.4
• /
• pp.459-480
• /
• 2010

A dialogue system includes various morphological analyses for recognizing a user's intention from the user's utterances. However, a user can represent various intentions via emotional states in addition to morphological expressions. Thus, a user's emotion recognition can analyze a user's intention in various manners. This paper presents a new method to automatically recognize a user's emotion for a dialogue system. For general emotions, we define nine categories using a psychological approach. For an optimal feature set, we organize a combination of sentential, a priori, and context features. Then, we employ a support vector machine (SVM) that has been widely used in various learning tasks to automatically classify a user's emotions. The experiment results show that our method has a 62.8% F-measure, 15% higher than the reference system.