• Annual Conference on Human and Language Technology
• /
• 2004.10d
• /
• pp.167-172
• /
• 2004

백과사전에서 정답을 찾기 위한 정보 중의 하나로 구조분석 정보를 이용하기 위하여 의존 관계 분석을 통해 정확한 구조분석에 대한 연구를 하였다. 정답을 찾기 위한 대상이 되는 용언과 논항의 관계를 파악하기 위해 먼저 의존관계 분석의 모호성 정도를 줄이기 위해 문장을 구묶음으로 나누었고 나눠진 구묶음에서 중심어와 중심어에 해당하는 의미코드를 추출하였다. 이렇게 구분된 구묶음 간의 의존관계를 파악하기 위하여 주로 격틀과 의미코드에 의존하는 의미자질, 거리 자질, 격관계 자질, 절형태 자질을 이용하여 의존관계 모호성을 해소하였다. 백과사전의 특성상 생략되는 성분과 연속 동사 처리를 하여 보다 정확하게 백과사전 QA시스템에서 정답을 찾을 수 있는 정보를 제공하도록 하였다. 실험결과 동사구와 명사구의 의존관계는 89.43의 성능을 보였고 의존관계에 격을 부여한 경우는 78.40%의 정확율, 백과사전 후처리에 해당하는 복원은 68.23의 성능을 보인다.

• Annual Conference on Human and Language Technology
• /
• 2004.10d
• /
• pp.131-137
• /
• 2004

본 논문에서는 구묶음과 구간분할에 기반하여 한국어 문장에서 명백한 의존관계를 파악 추출하는 기법에 대해 다룬다. 구묶음 기법은 문장에 나타나는 복합 명사, 본용언/보조용언. 의존명사 등을 묶어서 문장의 구조를 단순하게 만든다. 특히 문장에 다양한 형태로 나타나는 의존명사의 처리를 강화하여 구묶음을 효과적으로 할 수 있도록 하였다. 구간분할 기법은 긴 문장을 여러 개의 구간으로 나누어 각 구간을 구문분석 한다. 각 구간은 분할 이전보다는 단순화된 형태이기 때문에 긴 문장보다는 중의성이 줄어들어 견고한 구문분석을 할 수 있게 된다. 본 논문에서는 한국어 구문분석 시스템 개발의 1 단계 과정으로써 일단 중의성이 있는 상황이 아닌 명백한 의존관계를 수집하는 것을 목표로 한다. 본 논문에서는 실험을 통하여 구묶음과 구간분할 기법이 문장의 구조 중의성을 줄여 줌으로써 보다 많은 명백한 의존관계를 정확하게 추출할 수 있음을 보였다.

• Journal of Educational Research in Mathematics
• /
• v.25 no.2
• /
• pp.189-206
• /
• 2015

There has been a recurring call for using visual representations in textbooks to improve the teaching and learning of proportional reasoning. However, the quantity as well as quality of visual representations used in textbooks is still very limited. In this article, we analyzed visual representations presented in a Grade 6 textbook from two perspectives of proportional reasoning, multiple-batches perspective and variable-parts perspective, and discussed the potential of the double number line and the double tape diagram to help develop the idea 'things covary while something stays the same', which is critical to reason proportionally. We also classified situations that require proportional reasoning into five categories and provided ways of using the double number line and the double tape diagram for each category.

• The Journal of the Korea Contents Association
• /
• v.13 no.5
• /
• pp.311-321
• /
• 2013

This study is a qualitative research whose purpose was to analyze the experiences of training stress that trainees of mental health social worker were undergoing from the perspective of those trainees, ultimately providing them with a more effective way of clinical education. For this purpose, the study made a survey of 9 trainees who were getting through the training course of mental health social work provided by a relevant training agency. Data collection were focus group-based and conducted 1 to 2 times over about 2 hours. This researcher analyzed statements from the participants and, out of them, 85 were determined as meaningful. From these meaningful responses, the researcher constructed 32 meanings. And then, those meanings were classified according to their similarities and grouped into 9 themes, and finally categorized into 4 themes. More specifically, what were stressful to the subjects that they were experiencing in the training course of mental health social work could be largely categorized into 4 themes, or 'lots of trouble in interpersonal relations', 'too much tightness in training schedule', 'little consideration of them by the training agency', and 'poor organization of the training course'. Considering these findings, this study provided practical implications for the training of mental health social work.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.5
• /
• pp.48-61
• /
• 2017

An IaaS service of a cloud computing environment makes itself attractive for running large scale parallel application thanks to its innate characteristics that a user can utilize a desired number of high performance virtual machines without maintenance cost. The total execution time of a parallel application on a high performance computing environment depends on a task scheduling algorithm. Most studies on task scheduling algorithms on cloud computing environment try to reduce a user cost, and studies on task scheduling algorithms that try to reduce total execution time are rarely carried out. In this paper, we propose a task scheduling algorithm called an HAGD and a performance enhancement method called a group task duplication method of which the HAGD utilizes. The group task duplication method simplifies previous task duplication method, and the HAGD uses the group task duplication method or a task insertion method according to the characteristics of a computing environment and an application. We found that the proposed algorithm provides superior performance regardless of the characteristics in terms of normalized total execution time through performance evaluations.

• Journal of Korean Society of Transportation
• /
• v.21 no.1
• /
• pp.91-102
• /
• 2003

There are two goals in this paper. The one is development of existing CA(Cellular Automata) model to explain more realistic deceleration process to stop. The other is the application of the updated CA model to forecasting simulation to predict short term link travel time that takes a key rule in finding the shortest path of route guidance system of ITS. Car following theory of CA models don't makes not response to leading vehicle's velocity but gap or distance between leading vehicles and following vehicles. So a following vehicle running at free flow speed must meet steeply sudden deceleration to avoid back collision within unrealistic braking distance. To tackle above unrealistic deceleration rule, “Slow-to-stop” rule is integrated into NaSch model. For application to interrupted traffic flow, this paper applies “Slow-to-stop” rule to both normal traffic light and random traffic light. And vehicle packet method is used to simulate a large-scale network on the desktop. Generally, time series data analysis methods such as neural network, ARIMA, and Kalman filtering are used for short term link travel time prediction that is crucial to find an optimal dynamic shortest path. But those methods have time-lag problems and are hard to capture traffic flow mechanism such as spill over and spill back etc. To address above problems. the CA model built in this study is used for forecasting simulation to predict short term link travel time in Kangnam district network And it's turned out that short term prediction simulation method generates novel results, taking a crack of time lag problems and considering interrupted traffic flow mechanism.

• Annual Conference on Human and Language Technology
• /
• 2012.10a
• /
• pp.3-7
• /
• 2012

본 논문은 구문분석의 전처리로서 생략된 한국어 격조사의 복원 방법을 제안한다. 격조사 생략은 체언과 용언 사이의 관계가 아주 밀접하여 생략하여도 의사 전달에 문제가 없을 경우에 자주 발생한다. 이렇게 생략된 조사는 구문분석의 복잡도를 크게 높일 뿐 아니라 구문 분석의 오류의 원인이 되기도 한다. 본 논문에서는 구문구조 부착 말뭉치를 분석하여 생략된 조사는 그 체언과 용언 사이의 거리가 매우 가깝다는 사실을 발견하였고 이 성질을 이용해서 기계학습 방법을 이용해서 생략된 조사를 복원하는 방법을 제안한다. 본 논문에서는 ETRI 구문구조 부착 말뭉치를 이용해서 실험한 결과, 생략된 조사의 81%를 정확하게 복원할 수 있었다.

• Journal of the Korean Society for Library and Information Science
• /
• v.49 no.3
• /
• pp.333-349
• /
• 2015

This study examined the application of the FRBR model to newspapers and news articles. In order to meet the purpose that was mentioned above, we analyzed data items based on the level of newspapers and articles and discussed how the FRBR model may be applied. In terms of the level of a newspaper, each of newspapers, morning/evening paper, issue and edition are regarded as an individual work, and the relationship among them are considered to be the 'whole-part relationship'. Each article on the level of article basis was considered to be a work and was in a relationship of 'whole-part relationship' with the edition of each level of newspapers. Newspaper articles can be represented as texts, photographs, graphics, and tables, etc., and regarded as an individual work. Each work can be a part of the article on a newspaper or can be an independent article itself. Moreover, a uniform heading of each boxed article and running story is included in the work of each article and is forming a 'whole-part relationship'. Because of the changes of the newspaper name, the uniform title of each name regarded as a single binding. It is called the superwork and it is forming 'whole-part relationship' with each name.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.8
• /
• pp.361-366
• /
• 2017

For two given logical expressions and, when expression contains the same part of the logical expression as expression, substituting for that part of expression is called a substituted logic expression. If a substituted relation is established between the logical expressions, there is an advantage in that the number of literals used in the whole logical expression can be greatly reduced. However, if the substituted relation is not established, there is no simplification effect obtained from the substituted expression. Previous methods proposed a way to find substituted relations between logical expressions for the given logical expressions themselves, and to calculate substituted expressions if only substitution is possible. In this paper, a new method for performing substitution with addition and revision of logic terms is proposed in order to perform substitution, even though there is no substituted relation between two logic expressions. The proposed method is efficiently implemented using a matrix that finds terms to be added. Then, by covering the matrix that has added terms, substituted logic expressions are found. Experiment results show that the proposed method for several benchmark circuits can reduce the number of literals, compared to existing synthesis tools.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.741-744
• /
• 2005

효과적인 언어처리 시스템을 개발하기 위해서는 언어정보가 부착된 대량의 말뭉치가 필요하다. 그러나, 대량의 말뭉치를 구축하기 위해서는 많은 시간과 노력이 필요하다. 이와 같은 시간과 노력을 절약하기 위해서 일반적으로 말뭉치 구축 도구를 사용한다. 본 논문에서는 한국어 의존구조 말뭉치를 구축하기 위한 도구를 설계하고 구현하였다. 본 논문에서 개발된 구축 도구는 여러 가지 특징을 가지고 있다. 1) 특정 응용분야에 관계없이 두루 사용할 수 있다. 2) 분석 단계와 분석 오류를 연계하여 작업의 집중도를 높였다. 3) 가능한 한 오류는 축적되지 않도록 하여 구축된 말뭉치의 질을 크게 개선할 수 있었다. 4) 구축된 정보는 서로 공유할 수 있도록 하여 작업의 일관성을 극대화하였다. 5) 초보자로 사용자가 쉽게 도구를 사용할 수 있도록 인터페이스를 설계하였다. 본 논문에서 개발된 구축 도구를 이용하여 8 명의 연구원이 약 2 개월 (하루에 평균 4 시간)에 걸쳐서 10,000 문장의 의존구조 말뭉치를 구축할 수 있었다. 구축된 말뭉치에는 형태소 정보, 구묶음 정보, 의존구조 정보가 부착되어 있다.