• 한국과학교육학회지
• /
• 제29권8호
• /
• pp.978-989
• /
• 2009

이 연구에서는 학생들이 실험 결과를 그래프로 작성하고 해석하는 과정에서 범한 오류들을 과학 학업성취 수준에 따라 조사했다. 고등학교 2학년 140명을 대상으로 '기체의 압력과 부피의 관계'에 대한 그래프 작성 검사 및 해석 검사를 실시했다. 연구 결과, 대부분의 학생들이 그래프 작성 및 해석 과정에서 많은 오류를 보였다. 그래프 작성 과정에서는 '변수의 잘못된 해석', '그래프 기본 요소의 잘못된 표기', '자료의 잘못된 사용' 범주에서 총 16가지 오류 유형이 나타났다. '변수 적지 않음', '추세선을 꺾은선으로 표현', '자료 추가', '자료 삭제' 오류 유형은 과학 학업 성취 수준이 높은 학생들보다 낮은 학생들이 많이 범하였으나, '원점 표기하지 않음' 오류 유형은 반대로 나타났다. 그래프 해석 과정에서는 '자료의 잘못된 독해', '잘못된 내삽 외삽', '관계 잘못 설정' 범주에서 총9가지 오류 유형이 나타났다. '외삽 못함', '변수 사이의 관계 잘못 기술' 오류 유형은 과학 학업 성취 수준이 높은 학생들보다 낮은 학생들이 많이 범하였다. 그리고 이에 대한 교육적 함의를 논의하였다.

• Journal of applied mathematics & informatics
• /
• 제34권5_6호
• /
• pp.479-486
• /
• 2016

In this paper we define the edge version of harmonic index and harmonic polynomial of a graph G. We computed explicit formulas for the edge version of harmonic index and harmonic polynomial of many well known classes of graphs.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.1939-1944
• /
• 2003

This paper presents a global path planning algorithm based on a visibility graph method, and applies additionally various constraints for constructing the reduced visibility graph. The modification algorithm for generating the rounded path is applied to the globally shortest path of the visibility graph using the robot size constraint in order to avoid the obstacle. In order to check the visibility in given 3D map data, 3D CAD data with VRML format is projected to the 2D plane of the mobile robot, and the projected map is converted into an image for easy map analysis. The image processing are applied to this grid map for extracting the obstacles and the free space. Generally, the tree size of visibility graph is proportional to the factorial of the number of the corner points. In order to reduce the tree size and search the shortest path efficiently, the various constraints are proposed. After short paths that crosses the corner points of obstacles lists up, the shortest path among these paths is selected and it is modified to the combination of the line path and the arc path for the mobile robot to avoid the obstacles and follow the rounded path in the environment. The proposed path planning algorithm is applied to the mobile robot LCAR-III.

• Journal of Electrical Engineering and Technology
• /
• 제3권3호
• /
• pp.436-443
• /
• 2008

This paper presents a new method for building detection and reconstruction from aerial images. In our approach, we extract useful building location information from the generated disparity map to segment the interested objects and consequently reduce unnecessary line segments extracted in the low level feature extraction step. Hypothesis selection is carried out by using an undirected graph, in which close cycles represent complete rooftops hypotheses. We test the proposed method with the synthetic images generated from Avenches dataset of Ascona aerial images. The experiment result shows that the extracted 3D line segments of the reconstructed buildings have an average error of 1.69m and our method can be efficiently used for the task of building detection and reconstruction from aerial images.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
• /
• pp.1765-1770
• /
• 2006

본 논문에서는 반도체 fab 라인의 물류 설비를 event graph로 모델링 하는 방법론을 제안하고 있다. 최근 반도체 fab 라인 같은 대표적인 자본 집약적 제조라인에서는 운영단계에서 투입 계획, PM schedule 및 operation rule 등을 변화시켜 가며 평가 및 검증해 볼 수 있는 what-if simulation을 위한 line simulator의 필요성이 점점 높아지고 있다. 그러나 상용 simulator는 각 제조라인의 특성에 맞게 customization하는데 많은 시간과 비용이 소요될 뿐만 아니라 특성을 반영하는데 한계가 있다. 따라서 이러한 line simulator를 개발할 때 근간이 되는 설비의 simulation model이 필요하다. 이 때 설비들은 생산(processing) 및 물류(handling) 설비로 나눌 수 있는데, 본 논문에서는 반도체 fab 라인의 물류 설비 모델링 방법을 제시하고 실제 물류 설비를 모델링 해 봄으로써 그 효용성을 알아본다.

• 한국초등수학교육학회지
• /
• 제7권1호
• /
• pp.65-86
• /
• 2003

초등학교 수학 교과서에 나타난 통계 그래프의 지도 방법을 1차에서 7차까지 각 시기별로 ① 지도 방법 및 시기, ② 학습 세분 활동의 제시 순서와 방법, ③ 학습 소재, ④ 학습 활동 지시어의 유형 등의 네 가지 관점에서 분석하였다. 비율그래프를 제외한 나머지 통계 그래프에 관한 내용은 대체로 각 학년의 2학기에서 지도되었다. 비율그래프는 6학년 1학기에서 주로 지도 되었다. 학습활동의 세부화는 1차에서 7차까지 점차 증가하면서 4차부터 구조적이고 안정적인 형태로 정착되었다. 학습 소재는 사회적 특성에 대한 것이 가장 많이 사용되었고, 개인적 선호도에 대한 것이 점차 증가하는 추세이다. 학습 활동 지시어의 유형은 개념 이해 질문형이 많이 제시되었고, 점차 진술 및 조작형과 사고형이 증가하는 추세를 보였다.

• 한국멀티미디어학회논문지
• /
• 제25권3호
• /
• pp.493-501
• /
• 2022

This paper is a study on context-sensitive spelling error correction and uses the Korean WordNet (KorLex)[1] that defines the relationship between words as a graph to improve the performance of the correction[2] based on the vector information of the word embedded in the correction technique. The Korean WordNet replaced WordNet[3] developed at Princeton University in the United States and was additionally constructed for Korean. In order to learn a semantic network in graph form or to use it for learned vector information, it is necessary to transform it into a vector form by embedding learning. For transformation, we list the nodes (limited number) in a line format like a sentence in a graph in the form of a network before the training input. One of the learning techniques that use this strategy is Deepwalk[4]. DeepWalk is used to learn graphs between words in the Korean WordNet. The graph embedding information is used in concatenation with the word vector information of the learned language model for correction, and the final correction word is determined by the cosine distance value between the vectors. In this paper, In order to test whether the information of graph embedding affects the improvement of the performance of context- sensitive spelling error correction, a confused word pair was constructed and tested from the perspective of Word Sense Disambiguation(WSD). In the experimental results, the average correction performance of all confused word pairs was improved by 2.24% compared to the baseline correction performance.

• 대한원격탐사학회지
• /
• 제27권6호
• /
• pp.717-728
• /
• 2011

An efficient method for the unsupervised classification of high resolution imagery is suggested in this paper. It employs pixel-linking and merging based on the adjacency graph. The proposed algorithm uses the neighbor lines of 8 directions to include information in spatial proximity. Two approaches are suggested to employ neighbor lines in the linking. One is to compute the dissimilarity measure for the pixel-linking using information from the best lines with the smallest non. The other is to select the best directions for the dissimilarity measure by comparing the non-homogeneity of each line in the same direction of two adjacent pixels. The resultant partition of pixel-linking is segmented and classified by the merging based on the regional and spectral adjacency graphs. This study performed extensive experiments using simulation data and a real high resolution data of IKONOS. The experimental results show that the new approach proposed in this study is quite effective to provide segments of high quality for object-based analysis and proper land-cover map for high resolution imagery of urban area.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1989년도 추계학술발표회 발표논문초록집; 이화여자대학교, 서울; 23 Sep. 1989
• /
• pp.77-85
• /
• 1989

The purpose of this research entails the study of the multicriteria graph-theoretic Facility Layout Problem(FLP), the development of a Decision Support System(DSS), and a sensitivity analysis for graph Theoretic heuristics. The graph theoretic FLP Decision Support System gives decision makers or planners more information as a guide in producing their final layouts. This information is provided by a variety of final result scores, so called upper bound values, based on different options and different criteria. The increased information provided will give decision makers more confidence in design a block plan. One case is presented to demonstrate the applicability of the system to real-world problem. Finally, applicabilities of the DSS to other format layouts, such as GT layout and JIT's U-line, are briefly mentioned.

• 산업공학
• /
• 제13권4호
• /
• pp.591-598
• /
• 2000

In this paper, an efficient algorithm is proposed to find parting lines(PL) and generate parting surfaces(PS) for an injection mold design. We used a Face-Edge Graph which can be made by B-rep information of solid model. The graph is useful for finding the peripheral-loop edges for PL and the inner-loop edges for hole-patch. The PS can be generated automatically by selecting pre-defined direction lines. We can create a core and cavity molds by trimming the raw stock block with the PS and the upper/lower faces of a product model. We implemented proposed method with Unigraphics API functions and C language, and tesed on Unigraphics V15.