• Title/Summary/Keyword: line graph

Search Result 205, Processing Time 0.037 seconds

High School Students' Errors in Constructing and Interpreting Science Graph (고등학생들의 과학 그래프 작성 및 해석 과정에서 나타난 오류)

  • Kim, You-Jung;Choi, Gil-Soon;Noh, Tae-Hee
    • Journal of The Korean Association For Science Education
    • /
    • v.29 no.8
    • /
    • pp.978-989
    • /
    • 2009
  • In this study, we investigated high school students' errors in constructing and interpreting graph on experimental results by students' science achievement level. Two tests regarding constructing and interpreting graph about 'the relationship between the pressure and volume of a gas' were administered to 11th-graders (N=140). Analysis of the results revealed that most students exhibited many errors in the processes of constructing and interpreting graph. In the processes of constructing graph, there were 16 types of errors on the categories of 'misinterpreting the variables', 'mis-marking the graphical elements', and 'misusing the data'. The students of lower achievement level had more errors than those of higher achievement level in the four error types, that is, 'missing the variables', 'representing the best fit line using a broken line', 'adding the data', and 'neglecting the data'. However, the results were reversed in the error type of 'not marking the origin.' In the processes of interpreting graph, there were 9 types of errors on 'misreading the data', 'wrong interpolation and extrapolation', and 'establishing the wrong relationship'. The students of lower achievement level had more errors than those in the higher achievement level in the error types of 'wrong interpolation' and 'misdescribing the relationship between variables'. Educational implications of the findings are discussed.

EDGE VERSION OF HARMONIC INDEX AND HARMONIC POLYNOMIAL OF SOME CLASSES OF GRAPHS

  • NAZIR, RABIA;SARDAR, SHOAIB;ZAFAR, SOHAIL;ZAHID, ZOHAIB
    • Journal of applied mathematics & informatics
    • /
    • v.34 no.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.

A Shortest Path Planning Algorithm for Mobile Robots Using a Modified Visibility Graph Method

  • Lee, Duk-Young;Koh, Kyung-Chul;Cho, Hyung-Suck
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • 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.

  • PDF

3D Building Detection and Reconstruction from Aerial Images Using Perceptual Organization and Fast Graph Search

  • Woo, Dong-Min;Nguyen, Quoc-Dat
    • Journal of Electrical Engineering and Technology
    • /
    • v.3 no.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.

The Study of Event Graph Modeling for Material Handling System in Semiconductor Fab (반도체 fab 라인의 물류 설비 모델링 방법론에 대한 연구)

  • Lee Jin-Hwi;Choi Byoung-Kyu
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.05a
    • /
    • 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 라인의 물류 설비 모델링 방법을 제시하고 실제 물류 설비를 모델링 해 봄으로써 그 효용성을 알아본다.

  • PDF

An Analysis of Teaching Statistical Graphs in Elementary School Mathematics Textbooks (초등학교 수학 교과서에 나타난 통계 그래프 지도 방법 분석)

  • Lim Ji Ae;Kang Wan
    • Journal of Elementary Mathematics Education in Korea
    • /
    • v.7 no.1
    • /
    • pp.65-86
    • /
    • 2003
  • Mathematics textbooks are substitutive showing real characters of didactic transposition in pseudo-contextualization and pseudo-personalization. This study analyzed statistical graphs in elementary school mathematics textbooks according to the first to the 7th curriculum in Korea. It focused on the didactic principles used in those methods through those view of Didactic Transposition Theory. The features of the elementary school mathematics textbooks in Korea are investigated and described ethnomethodologically according to each curriculum periods in dividing bar graph, line graph, pictograph, graph of ratio, histogram. The teaching sequences and methods of the statistical graphs, order and methods of sub-learning activities, teaming data, matter of the learning activity indicator were summarized. Usually, the teaching sequences, excepting the graphs of ratio, statistical graphs are introduced in the second semester of each grade. The graph of ratio is introduced in the first semester of 6th grade. As a result of analysing sub-Loaming activities, using them increased from the first to the 7th curriculum and its form was fixed constructive and stable at the 4th curriculum textbooks. As a result of analysing the teaming data, the data of the social aspects are used more frequently and the data of the individual preferences trended more gradually. As a result of analysing the matter of the teaming activity indicators, concept-explanation question style were used more frequently. Statement-practice style and consideration style trended gradually. Concluding remarks are: First, the didactic transposition of the elementary school mathematics textbooks developed systematically according to the first to the 7th curriculum; Second, mathematics textbooks gradually introduced the positive learning style of activity and the learners' spontaneousness; Third, more concrete practice activities and reflective activities were variously introduced considering the level and interest of each elementary student.

  • PDF

Performance Improvement of Context-Sensitive Spelling Error Correction Techniques using Knowledge Graph Embedding of Korean WordNet (alias. KorLex) (한국어 어휘 의미망(alias. KorLex)의 지식 그래프 임베딩을 이용한 문맥의존 철자오류 교정 기법의 성능 향상)

  • Lee, Jung-Hun;Cho, Sanghyun;Kwon, Hyuk-Chul
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.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.

Efficient Classification of High Resolution Imagery for Urban Area

  • Lee, Sang-Hoon
    • Korean Journal of Remote Sensing
    • /
    • v.27 no.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.

시설배치문제의 의사결정지원 시스템 - 그래프이론의 접근

  • 이호준
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1989.10a
    • /
    • 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.

  • PDF

Generating the Parting-Line, Parting-Surface and Core/Cavity for an Injection Mold by using Face-Edge Graph (면-모서리 그래프를 이용한 사출 금형의 파팅 라인 및 파팅 서피스와 코어 캐비티 형상의 추출)

  • Lee, Cheol-Soo;Park, Gwang-Ryeol;Kim, Yong-Hoon
    • IE interfaces
    • /
    • v.13 no.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.

  • PDF