• International Journal of Internet, Broadcasting and Communication
• /
• v.5 no.1
• /
• pp.14-17
• /
• 2013

RDF data is widely used for exchanging data nowadays to enable semantic web era. This leads to the need for storing and retrieving these data efficiently and effectively. Recently, the structure index in graph-based perspective is considered as a promising approach to deal with issues of complex query graphs. However, even though there are many researches based on structure indexing, there can be a better architectural approach instead of addressing the issue as a part. In this research, we propose architecture for storing, query processing and retrieving RDF data in efficient manner using structure indexing. Our research utilizes research results from iStore and 2 relation-based approaches and we focus on improving query processing to reduce the time of loading data and I/O cost.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.3
• /
• pp.637-646
• /
• 2011

Cho and Kim [4] and Kim [6] introduced the concept of the competition index of a digraph. Cho and Kim [4] and Akelbek and Kirkland [1] also studied the upper bound of competition indices of primitive digraphs. In this paper, we study the upper bound of competition indices of strongly connected digraphs. We also study the relation between competition index and ordinary index for a symmetric strongly connected digraph.

• ETRI Journal
• /
• v.5 no.3
• /
• pp.16-25
• /
• 1983

Increasing importance is being attached to the idea of measuring software characteristics. This paper deals with following things. First, a relation of program and flow graph is discussed. It describes a theoretic complexity measure and illustrates how it can be used to manage and control program complexity. Second, cyclomatic complexity measure is discussed. The complexity is independent of physical size and depends only on the decision structure of a program. Third, consider a knot which defines crossing point and provide the ordering of the nodes to make the transition from a two dimensional graph to a one dimensional program. A program modules that can improve FORTRAN IV program text is tested by knot counting and its control complexity is improved.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.05a
• /
• pp.52-55
• /
• 2001

퍼지 그래프는 그래프에 대한 정점들과 간선들의 소속정도를 표현할 수 있도록 일반 그래프를 확장한 그래프이다. 그러나 기준 퍼지 그래프는 명확한 정점들의 집합 위에서의 관계만을 표시할 수 있다. 본 논문에서는 퍼지 집합간의 관계를 표시할 수 있도록 확장된 레벨-2 퍼지 그래프를 제안한다. 본 논문에서는 레벨-2 퍼지 그래프를 정의하고 레벨-2 퍼지 그래프에서 수정되어야 하는 연산들과 레벨-2 퍼지 그래프의 특성에 대하여 소개한다. 제안된 레벨-2 퍼지 그래프는 퍼지 데이터 비교 및 퍼지 클러스터링 분야에 적용될 수 있다.

• 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.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.1
• /
• pp.54-68
• /
• 2001

This paper proposes a new algorithm that detects and separates the occluding and occluded objects in a 2D image. An input image is represented by the attributed graph where a node corresponds to a surface and an arc connecting two nodes describes the adjacency of the nodes in the image. Each end of arc is weighted by relation value which tells the number of edges connected to the surface represented by the node in the opposite side of the arc. In attributed graph, homogeneous nodes pertained to a same object always construct one of three special patterns which can be simply classified by comparison of relation values of the arcs. The experimental results have shown that the proposed algorithm efficiently separates the objects overlapped arbitrarily, and that this approach of separating objects before matching operation reduces the matching time significantly by simplifying the matching problem of overlapped objects as the one of individual single object.

• Journal of Korea Multimedia Society
• /
• v.12 no.7
• /
• pp.893-902
• /
• 2009

Many People are collecting and managing variable information(Image, Graphic, Animation, Text, music files etc.) about personal interests and holding them in common. Most users are using Microsoft Explorer to make a folder and classify many files. but It's difficult to understand the relation of the data instinctively. To resolve this problem, we adopt information visualization method (especially tree-graph control interface). We suggest an interface that all user can drawing a Graph easily and rapidly. So user can see the relations of their data instinctively and control the relation directly with our sketch-based interface.

• Journal of Acupuncture Research
• /
• v.25 no.6
• /
• pp.67-76
• /
• 2008

Objectives : The 7-zone-diagnostic system is a diagnostic device to predetermine bodily locations by measuring the energy of body. This study was to investigate the relation between the different patterns of Zone 1, 2, 3 of Factor AA in CP-6000A(VEGA, Germany), 7-zone-diagnostic system and clinical parameters. The purpose of this study was relation Korean traditional medicine and western medicine with the data from 7-zone-diagnostic system and the clinical parameters. Methods : This study was carried out with the data from some clinical parameters. We made three groups according to the Factor AA patterns of CP-6000A. The Factor AA pattern of Group A is that the red bar graph of zone 1, 2, 3 were higher than the normal range and the others were the normal range. The Factor AA pattern of Group B was that the red bar graph of zone 1, 2, 3 was the normal range and the others were the normal range. The Factor AA pattern of Group C was that the red bar graph of zone 1, 2, 3 was lower than the normal range and the others were the normal range. After the data from clinical parameters to correspond with conditions of each group were selected, the data from clinical parameters among each groups analyzed statistically. Results : The values of GOT, GPT, r-GPT, Triglyceride, BUN, Uric acid of group A was higher than group C. Gastroscope of group A and B was higher than group C. Conclusions : It is thought that the red bar graph of zone 1, 2, 3 is higher, the group has the higher energy and the energy has a character of fire(熱). Those patterns have a high risk of hyperlipermia and liver, stomach disease.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.11a
• /
• pp.100-103
• /
• 2010

In this paper we propose a method of detecting moving object in H.264/AVC bitstream by representing the $4{\times}4$ block partition units as nodes of graph. By constructing hierarchical graph by taking into account the relation between nodes and the spatial-temporal relations between graphs in frames, we are able to track small objects, distinguish two occluded objects, and identify objects that move and stop alternatively.

• Knowledge Management Research
• /
• v.10 no.2
• /
• pp.35-48
• /
• 2009

The paper proposes a quantitative causal ordering map (QCOM) to combine qualitative and quantitative methods in a framework. The procedures for developing QCOM consist of three phases. The first phase is to collect partially known causal dependencies from experts and to convert them into relations and causal nodes of a model graph. The second phase is to find the global causal structure by tracing causality among relation and causal nodes and to represent it in causal ordering graph with signed coefficient. Causal ordering graph is converted into QCOM by assigning regression coefficient estimated from path analysis in the third phase. Experiments with the prediction model of Korea stock price show results as following; First, the QCOM can support the design of qualitative and quantitative model by finding the global causal structure from partially known causal dependencies. Second, the QCOM can be used as an integration tool of qualitative and quantitative model to offerhigher explanatory capability and quantitative measurability. The QCOM with static and dynamic analysis is applied to investigate the changes in factors involved in the model at present as well discrete times in the future.