• 로봇학회논문지
• /
• 제2권3호
• /
• pp.262-269
• /
• 2007

Hierarchical Planning based on Abstraction of World Elements and Operators(HiPAWO) is proposed for mobile robots task planning, where abstraction of world elements is used for hierarchical planning and abstraction of operators is used for hierarchical decomposition of abstracted actions. Especially, a hierarchical domain theory based on JAH(Joint of Action Hierarchy)-graph is proposed to improve efficiency of planning, where a number of same actions are included in both adjacent hierarchical levels of domain theories to provide relationships between adjacent hierarchical levels. To show the validities of our proposed HiPAWO, experimental results are illustrated and will be compared with two other classical planning methods.

• 한국초등과학교육학회지:초등과학교육
• /
• 제34권1호
• /
• pp.86-94
• /
• 2015

This study is to investigate how do elementary students' eye movements appear in cognitive process that they perceive science learning materials depending on motivation system of science learning. For this study we had a random sampling of 301, 6th grade students. And we had selected 32 students through the three tests for the final; motivation system test of science learning, a learning styles test, an Edinburgh inventory for handedness test. We were analysis the cognitive process during learning tasks for the selected student using eye-tracking equipment. The results of the research are as follows: First, when students see a science learning material, we found out that SL-BAS group that has tendency searched various areas than SL-BIS group in learning task. Second, results confirmed through the data of integrational count that students looked alternately texts, images and graphs in the learning material, SL-BIS group were more than SL-BAS group on integrated count, but they had a simple and insignificant eye movement. Especially SL-BAS students showed that integrated eye movement between texts, images and graphs in the learning material, and they explored important areas of the graph compared with SL-BIS group that there was no eye movement in graph. These results may be utilized as a useful resource for designing students' learning.

• 한국콘텐츠학회논문지
• /
• 제13권5호
• /
• pp.37-47
• /
• 2013

본 연구의 목적은 소셜 게임플레이에 대한 행동패턴을 분석하여 과업의 상호의존적인 게임플레이 법칙을 발견하는 것이다. 이를 위해 게임플레이와 관련된 선행연구를 고찰하고 과업의 상호의존적인 게임플레이에 적합한 게임을 선정하였다. 본 실험은 5명이 한 팀이 되는 파티를 구성하여 게임플레이를 실시하고 동시조서를 실시하며 플레이어들의 행동과 구두보고에 대한 비디오/오디오 데이터를 수집 하였다. 데이터 분석을 위해 비디오 관찰과 구두조서를 분석하고 결합 시퀀스 모형 과제 분석법을 중심으로 객관적인 코딩스킴을 개발하고 이를 토대로 플레이어의 행동을 분석하였다. 그 결과 4가지 패턴과 4가지 변형된 패턴 총 8가지 행동패턴이 발견되었다. 본 연구를 통해 5명의 게임플레이에 대한 통합형 행동그래프를 작성하여 협업이 적절한 지점과 잦은 실수와 실패가 발생한 지점을 파악 할 수 있었다. 이러한 소셜 게임플레이 행동그래프는 게임의 레벨 디자인과 밸런스 디자인이 적절한지를 평가하는 중요한 실무 디자인 지침이 될 것으로 기대된다.

• 한국정보과학회논문지:데이타베이스
• /
• 제28권3호
• /
• pp.418-429
• /
• 2001

현재의 지리 정보 시스템(GIS : Geographical Information System)은 컴퓨터 응용 시스템의 중요한 분야로서 도시 정보 시스템, 교통 정보 시스템 등에 활용되고 있다. 이들 응용 분야 는 대용량의 공간 데이터를 다루기 때문에 효율적인 공간 연산 수행을 위한 기본 연산자를 필요로 한다. 특히, 기본 연산자 중에서 공간 조인은 연산에 참여하는 객체의 수가 증가함에 따라 수행 시간이 지수적으로 증가하는 특성을 가지고 있으므로 빠른 응답 시간을 요구하는 시스템에는 부적합하다. 따라서 이러한 요구 사항을 만족시키기 위해서는 공간 조인의 효율 적인 병렬 수행이 필요하다. 본 논문에서는 공간 조인의 효율적인 병렬수행을 위하여 정적 부하 균등화를 위한 작업 생성 및 할당 방법을 제시한다. 이 방법은 공간 지역성을 고려하 여 작업을 생성하고, 비용 모댈을 통하여 작업량을 예측하여 표현한 뒤 작업 그래프로 나타 낸다. 그리고 생성된 작업 그래프를 그래프 분할 알고리즘을 통하여 균등하게 할당한다. 본 논문에서 제시된 방법은 독일 Parsytec 사의 CC16 병렬머쉰에서 실험한 결과로 볼 때, 기 존의 정적 할당을 통한 작업 생성 및 할당 방법에 비하여 각 프로세서간의 작업 수행시간의 편차를 줄임으로써 부하 균등화의 효과를 가져온다.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제55권3호
• /
• pp.383-396
• /
• 2016

This study investigated highschool students' brain waves on functional tasks such as a transition(F task) from equation to graph and the other transition(G task) vice versa. A total of 39 students participated in the study who attended a high school located in Gyunggi province. These students were divided into two groups, HMA and LMA by MASS test revised by Ko, & Yi (2012). The functional tasks for the stroop task to measure EEG were provided from a previous study, Seok(2015). The results indicated two groups on G tasks showed deeper and wider brain waves which demonstrated G tasks were more difficult than F tasks. However, HMA group had an effect of the non-psychological program which had given more chances on G tasks rather than F tasks within Students' Zone of Proximal Development. Also, HMA group's brain waves had more ranges in amplitude and width of waves. These results imply that the characteristics of students' brain waves with math anxiety are consistent to the previous studies.

• 정보과학회 논문지
• /
• 제42권10호
• /
• pp.1222-1230
• /
• 2015

무릎 자기공명영상에서 전방십자인대의 분할은 밝기값의 불균일성 및 주변 조직들과의 유사 밝기값 특성으로 인해 기존 분할기법의 적용에 한계가 있다. 본 논문에서는 지역적 정렬을 통한 확률아틀라스 생성 및 반복적 그래프 컷을 통한 다중아틀라스 기반 전방십자인대 분할기법을 제안한다. 첫째, 전역 및 지역적 다중아틀라스 강체정합을 통해 전방십자인대의 확률아틀라스를 생성한다. 둘째, 생성된 확률아틀라스를 이용하여 최대사후추정 및 그래프 컷을 통하여 전방십자인대 초기 분할을 수행한다. 셋째, 마스크 기반 강체정합을 통한 형상정보 개선 및 반복적 그래프 컷을 통해 전방십자인대 분할 개선을 수행한다. 제안방법의 성능평가를 위하여 육안평가 및 정확성평가를 수행하였으며, 평가 결과 제안방법의 Dice 유사도는 75.0%, 평균표면거리는 1.7화소, 제곱근표면거리는 2.7화소로서 기존 그래프 컷 방법에 비하여 전방 십자인대의 분할정확도가 각각 12.8%, 22.7%, 및 22.9% 향상된 것으로 나타났다.

• 한국초등과학교육학회지:초등과학교육
• /
• 제31권3호
• /
• pp.321-333
• /
• 2012

The purpose of this study was to examine elementary school students' characteristics and difficulties in drawing and interpreting a line graph, and to present educational implications. Twenty five students(4th grader: 6, 5th grader: 9, and 6th grader: 10) at an elementary school participated in this study. We used a student's task which was about graphing on a given data table and interpreting his/her graph. The data table was on heating 200mL and 500mL of water and measuring their temperature at regular time intervals. We collected multiple source of data, and data analyzed based on the sub-variables of TOGS. The some results of this study are as follows: First, five children (20.0%), especially two of 10 sixth graders (20.0%), could not construct a line graph about a given data table. Second, twenty students (80.0%) had the ability on 'Scaling axes' and on 'Assigning variables to the axes', however, only a student understood why the time is on the longitudinal axis and the temperature is on the vertical axis. Third, in the case of 'Plotting points', twelve children (48.0%) could drew two graphs on a coordinate. Fourth, in the case of 'Selecting the corresponding value for Y (or X)', twenty student had little difficulty. on 'Describing the relationship between variables', seventeen students (68.0%) understood the relationship between time and temperature of water, and the relationship between temperature and amount of water. Finally, eleven students (44%) had the ability on 'Interrelating and extrapolation graphs.' Educational implications are also presented in this paper.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권7호
• /
• pp.1252-1273
• /
• 2011

In Web Service Composition (WSC) area, services selection aims at selecting an appropriate candidate from a set of functionally-equivalent services to execute the function of each task in an abstract WSC according to their different QoS values. In despite of many related works, few of previous studies consider transactional constraints in QoS-aware WSC, which guarantee reliable execution of Composite Web Service (CWS) that is composed by a number of unpredictable web services. In this paper, we propose a novel global selection-optimal approach in WSC by considering both transactional constraints and end-to-end QoS constraints. With this approach, we firstly identify building rules and the reduction method to build layer-based Directed Acyclic Graph (DAG) model which can model transactional relationships among candidate services. As such, the problem of solving global optimal QoS utility with transactional constraints in WSC can be regarded as a problem of solving single-source shortest path in DAG. After that, we present Graph-building algorithms and an optimal selection algorithm to explain the specific execution procedures. Finally, comprehensive experiments are conducted based on a real-world web service QoS dataset. The experimental results show that our approach has better performance over other competing selection approaches on success ratio and efficiency.

• Architectural research
• /
• 제12권1호
• /
• pp.9-14
• /
• 2010

The present study explored the applicability of Visibility Graph Analysis (VGA) techniques to workplace design research. Six types of VGA measures in Depthmap encompassing visual connectivity, three types of visual integration, mean depth, and visual entropy were employed for the analysis of individual privacy for task concentration and group relationship behavior in the open-plan office environment. Data comprised 136 workers in 6 open-plan offices filled with low-paneled (1.2-1.5m) cubicle workspaces. For the statistical analysis, Spearman's rho correlations and t-tests were applied for the spatial and behavioral measures. The results showed that workspace VGA measures have a potential to be useful information to account for workers' concentration privacy and, limitedly, also informal relationships with team members. Visual entropy values especially offer reliable information to predict various aspects of office workers' privacy behavior while visual integration can be used to account for the workers' sense of trust in group relations. The study also discussed the limitation of VGA applications to the workplace context.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2011년도 하계학술대회
• /
• pp.437-438
• /
• 2011

Spectral segmentation is a major trend in image segmentation. Specially, constrained spectral segmentation, inspired by the user-given inputs, remains its challenging task. Since it makes use of the spectrum of the affinity matrix of a given image, its overall quality depends mainly on how to design the graphical model. In this work, we propose a sparse, multi-layer graphical model, where the pixels and the over-segmented regions are the graph nodes. Here, the graph affinities are computed by using the must-link and cannot-link constraints as well as the likelihoods that each node has a specific label. They are then used to simultaneously cluster all pixels and regions into visually coherent groups across all layers in a single multi-layer framework of Normalized Cuts. Although we incorporate only the adjacent connections in the multi-layer graph, the foreground object can be efficiently extracted in the spectral framework. The experimental results demonstrate the relevance of our algorithm as compared to existing popular algorithms.