• Title/Summary/Keyword: error of graph

Search Result 178, Processing Time 0.028 seconds

Analysis on Signal Flow Graph of Slotted LIne (Slotted Line의 Signal Flow Graph 해석)

  • 박기수
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.6 no.3
    • /
    • pp.8-11
    • /
    • 1969
  • In the precision measurement of the voltage standing wave ratio (VSWR) or reflection coefficient by means of the slotted line technique, one of the important factors is the maximum error due to the discontinuities and multi-reflection in the slotted line. Particularly, this error becomes a critical factor when the VSWR or the reflection coefficient to be measured is very small. In this paper, the exact expression of this error is obtained by means of the Signal flow graph method.

  • PDF

Sampling Set Selection Algorithm for Weighted Graph Signals (가중치를 갖는 그래프신호를 위한 샘플링 집합 선택 알고리즘)

  • Kim, Yoon Hak
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.17 no.1
    • /
    • pp.153-160
    • /
    • 2022
  • A greedy algorithm is proposed to select a subset of nodes of a graph for bandlimited graph signals in which each signal value is generated with its weight. Since graph signals are weighted, we seek to minimize the weighted reconstruction error which is formulated by using the QR factorization and derive an analytic result to find iteratively the node minimizing the weighted reconstruction error, leading to a simplified iterative selection process. Experiments show that the proposed method achieves a significant performance gain for graph signals with weights on various graphs as compared with the previous novel selection techniques.

Analysis of the Types of Errors in Science Graph Construction Processes of Middle School Students (중학생들의 과학 그래프 작성 과정에서의 오류 유형 분석)

  • Kim, You-Jung;Moon, Se-Jeong;Kang, Hun-Sik;Noh, Tae-Hee
    • Journal of The Korean Association For Science Education
    • /
    • v.29 no.2
    • /
    • pp.168-178
    • /
    • 2009
  • In this study, we investigated the errors that students committed in the processes of constructing graphs on experimental results by the students' science achievement level. A test of constructing a graph about 'the relationship between the pressure and volume of a gas' was administered to 7th graders (N=145). Results revealed that most students committed errors in the processes of constructing the graph, showing 12 error types in the categories of 'Misinterpreting the variables', 'Mismarking the graphical elements', and 'Misusing the data'. The students in the lower achievement level had more errors than those in the higher achievement level in the two error types, that is 'representing the bar graph' and 'marking the scale in the presented data order', but the results were reversed in the three error types, that is 'marking the independent variable and dependent variable reversely', 'adding the data', and 'neglecting the data'. In the other error types, there were little differences in the frequencies of the errors by students' science achievement level.

Comparison of Objective Functions for Feed-forward Neural Network Classifiers Using Receiver Operating Characteristics Graph

  • Oh, Sang-Hoon;Wakuya, Hiroshi
    • International Journal of Contents
    • /
    • v.10 no.1
    • /
    • pp.23-28
    • /
    • 2014
  • When developing a classifier using various objective functions, it is important to compare the performances of the classifiers. Although there are statistical analyses of objective functions for classifiers, simulation results can provide us with direct comparison results and in this case, a comparison criterion is considerably critical. A Receiver Operating Characteristics (ROC) graph is a simulation technique for comparing classifiers and selecting a better one based on a performance. In this paper, we adopt the ROC graph to compare classifiers trained by mean-squared error, cross-entropy error, classification figure of merit, and the n-th order extension of cross-entropy error functions. After the training of feed-forward neural networks using the CEDAR database, the ROC graphs are plotted to help us identify which objective function is better.

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.

A study on the Analysis and the Correction of third-year Middle School Students Error Related to Graph of Quadratic Function (이차함수 그래프에 관련된 중학교 3학년 학생들이 범하는 오류와 교정)

  • Gu, Young Hwa;Kang, Young Yug;Ryu, Hyunah
    • East Asian mathematical journal
    • /
    • v.30 no.4
    • /
    • pp.451-474
    • /
    • 2014
  • The purpose of this study is to analyze error patterns third-year middle school students make on quadratic function graph problems and to examine about the possible correct them by providing supplementary tutoring. To exam the error patterns that occur during problem solving processes, to 82 students, We provided 25 quadratic function graph problems in the preliminary-test. The 5 types of errors was conceptual errors, false intuition errors, incorrect use of conditions in problems, technical errors, and errors from slips or carelessness. Statistical analysis of the preliminary-test and post-test shows that achievement level was higher in the post-test, after supplementary tutoring, and the t-test proves this to be meaningful data. According to the per subject analyses, the achievement level in the interest of symmetry, parallel translation, and general graph, respectively, were all higher in the post-test than the preliminary-test and this is meaningful data as well. However, no meaningful relation could be found between the preliminary-test and the post-test on other subjects such as graph remodeling and relations positions of the parabola. For the correction of errors, try the appropriate feedback and various teaching and learning methods.

Calculating Error Reduction with Graph Restructuring in Loop Folding

  • Nishitani, Yoshi;Harashima, Katsumi;Kutsuwa, Toshirou
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.657-660
    • /
    • 2000
  • This paper proposes a Data-Flow-Graph (DFG) restructuring to reduce calculating errors in loop folding scheduling. The prime cause of calculating error is rounding errors due to the restriction of the operation digit of functional units. This rounding error is increased more by using multipliers than adders, so reducing the number of multiplications and putting off them as much as possible reduce rounding errors. The proposed approach reduces the number of multiplications by restructuring DFG in loop folding.

  • PDF

LINEAR AND NON-LINEAR LOOP-TRANSVERSAL CODES IN ERROR-CORRECTION AND GRAPH DOMINATION

  • Dagli, Mehmet;Im, Bokhee;Smith, Jonathan D.H.
    • Bulletin of the Korean Mathematical Society
    • /
    • v.57 no.2
    • /
    • pp.295-309
    • /
    • 2020
  • Loop transversal codes take an alternative approach to the theory of error-correcting codes, placing emphasis on the set of errors that are to be corrected. Hitherto, the loop transversal code method has been restricted to linear codes. The goal of the current paper is to extend the conceptual framework of loop transversal codes to admit nonlinear codes. We present a natural example of this nonlinearity among perfect single-error correcting codes that exhibit efficient domination in a circulant graph, and contrast it with linear codes in a similar context.

Author Graph Generation based on Author Disambiguation (저자 식별에 기반한 저자 그래프 생성)

  • Kang, In-Su
    • Journal of Information Management
    • /
    • v.42 no.1
    • /
    • pp.47-62
    • /
    • 2011
  • While an ideal author graph should have its nodes to represent authors, automatically-generated author graphs mostly use author names as their nodes due to the difficulty of resolving author names into individuals. However, employing author names as nodes of author graphs merges namesakes, otherwise separate nodes in the author graph, into the same node, which may distort the characteristics of the author graph. This study proposes an algorithm which resolves author ambiguities based on co-authorship and then yields an author graph consisting of not author name nodes but author nodes. Scientific collaboration relationship this algorithm depends on tends to produce the clustering results which minimize the over-clustering error at the expense of the under-clustering error. In experiments, the algorithm is applied to the real citation records where Korean namesakes occur, and the results are discussed.

An Analysis on Error Types of Graphs for Statistical Literacy Education: Ethical Problems at Data Analysis in the Statistical Problem Solving (통계적 소양 교육을 위한 그래프 오류 유형 분석: 자료 분석 단계에서의 통계 윤리 문제)

  • Tak, Byungjoo;Kim, Dabin
    • Journal of Elementary Mathematics Education in Korea
    • /
    • v.24 no.1
    • /
    • pp.1-30
    • /
    • 2020
  • This study was carried out in order to identify the error types of statistical graphs for statistical literacy education. We analyze the meaning of using graphs in statistical problem solving, and identify categories, frequencies, and contexts as the components of statistical graphs. Error types of representing categories and frequencies make statistics consumers see incorrect distributions of data by subjective point of view of statistics producers and visual illusion. Error types of providing contexts hinder the interpretation of statistical information by concealing or twisting the contexts of data. Moreover, the findings show that tasks provide standardized frame already for drawing graphs in order to avoid errors and pay attention to the process of drawing the graph rather than statistical literacy for analyzing data. We suggest some implications about statistical literacy education, ethical problems, and knowledge for teaching to be considered when teaching the statistical graph in elementary mathematics classes.