• The Korean Journal of Applied Statistics
• /
• v.27 no.3
• /
• pp.487-500
• /
• 2014

The elementary school curriculum includes some statistical concepts and many graphical methods. However, statistical concepts are difficult to understand; consequently, many of those graphs and numerical summaries are obtained by hand. We develop an intuitive statistics education package called Tong-Gramy focused on 5-8 graders to help students and teachers study statistics. This software covers numerical and graphical statistics that appear in 5-8 graders' textbooks. The graphs provided are dynamically linked to data and every graph is linked to every datum. The graphs of Tong-Gramy are dynamic graphs and morphing technology is used where applicable.

• The Journal of the Korea Contents Association
• /
• v.18 no.2
• /
• pp.438-449
• /
• 2018

Recently, various graph data have been utilized in various fields such as social networks and citation networks. As the graph changes dynamically over time, it is necessary to manage the graph historical data for tracking changes and retrieving point-in-time graphs. Most historical data changes partially according to time, so unchanged data is stored redundantly when data is stored in units of time. In this paper, we propose a graph history storage management method to minimize the redundant storage of time graphs. The proposed method continuously detects the change of the graph and stores the overlapping subgraph in intersection snapshot. Intersection snapshots are connected by a number of delta snapshots to maintain change data over time. It improves space efficiency by collectively managing overlapping data stored in intersection snapshots. We also linked intersection snapshots and delta snapshots to retrieval the graph at that point in time. Various performance evaluations are performed to show the superiority of the proposed scheme.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.13-16
• /
• 2007

본 논문에서는 동적 추천 기능이 있는 자바 기반 음악 추천 서버를 소개한다. 본 논문에서 소개하는 추천 서버는 각 음악 사이의 유사도를 그래프로 저장하는 그래프 기반 협동적 여과 방식을 사용하며, 독립된 서버로 구성되어 클라이언트와 정해진 프로토콜에 따라 통신하도록 구현되었다. 또한 이 추천 서버는 특정 사용자나 특정 음악의 정적인(static) 성향뿐 아니라 시간에 따라 달라지는 동적인(dynamic) 성향에 맞는 추천도 가능하도록 설계되었다. 정적 성향이란 어떤 사용자가 가지고 있는 음악에 대한 기본적인 취향을 나타내고, 동적 성향이란 특정한 상황이나 분위기에 따라 유동적으로 변하는 성향을 의미한다. 본 논문에서 소개하는 추천 서버는 정적 성향과 동적 성향에 대하여 각각 추천할 수 있는 기능을 가지고 있으며, 이러한 기능을 바탕으로 실제 사용자들의 음악 다운로드 데이터를 이용하여 추천 데모 사이트를 구축하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.2
• /
• pp.415-420
• /
• 2016

A graph G=(V,E) is called an interval graph with a set V of vertices representing intervals on a line such that there is an edge $(i,j){\in}E$ if and only if intervals i and j intersect. In this paper, we are concerned in the vertex connectivity, one of various characteristics of the graph. Specifically, the vertex connectivity of an interval graph is represented by the overlapping of intervals. Also we propose an efficient algorithm to compute the vertex connectivity on the fully dynamic environment in which the vertices or the edges are inserted or deleted. Using a special kind of interval tree, we show how to compute the vertex connectivity and to maintain the tree in O(logn) time when a new interval is added or an existing interval is deleted.

• Proceedings of the KIEE Conference
• /
• 2002.07d
• /
• pp.2583-2585
• /
• 2002

본 논문에서는 다양한 크기와 왜곡을 함유한 질의 얼굴 영상이 들어 왔을 때에도 적용 가능한 동적 링크 구조상에서 얼굴 인식에 관한 것이다. 기존의 동적 링크 구조상에서의 얼굴 인식 기술이 얼굴의 크기와 상관없이 일정한 크기의 그래프가 적용이 되기 때문에 얼굴의 크기가 다른 경우에는 인식을 하지 못하였다. 이러한 단점을 보완하고자 질의 영상의 얼굴 타원 정보를 이용하여 고정된 그래프에 맞게 얼굴 크기를 보정함으로써 기존의 우수한 성능을 유지함과 동시에 동적 링크상에서 다양한 크기와 왜곡을 가진 질의 얼굴 영상을 인식할 수 있도록 한 것이다.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.926-937
• /
• 1996

A graph traversal technique is a certain pattern of visiting nodes of a graph. Many special traversal techniques have been applied to solve graph related problems. For example, the depth first search technique has been used for finding strongly onnected components of a directed graph or biconnected components of a general graph. The distributed protocol to implement his depth first search technique on the distributed network can be divided into a fixed topology problem where there is no topological change and a dynamic topology problem which has some topological changes. Therefore, in this paper, we present a more efficient distributed depth first search protocol with fixed topology and a resilient distributed depth first search protocol where there are topological changes for the distributed network. Also, we analysed the message and time complexity of the presented protocols and showed the improved results than the complexities of the other distributed depth first search protocols.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.3
• /
• pp.437-444
• /
• 2014

In this paper, we introduce a Graph based Binary Code Execution Path Exploration Platform. In the graph, a node is defined as a conditional branch instruction, and an edge is defined as the other instructions. We implemented prototype of the proposed method and works well on real binary code. Experimental results show proposed method correctly explores execution path of target binary code. We expect our method can help Software Assurance, Secure Programming, and Malware Analysis more correct and efficient.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.11
• /
• pp.2367-2372
• /
• 2009

Recently, Many studies have been progressing to path-finding adapted dynamic information on the Terminal Based Navigation System(TBNS). The algorithms proposed are based on $A^*$ algorithm. Path-finding algorithms which use heuristic function may occur a problem of the increase of exploring cost. Path-finding with an abstract graph which expresses real road network as a simple graph is proposed for reducing dependency of heuristic and exploring cost. In this paper, two abstract graph that are different method of construction, Homogeneous Node merging($AG^H$) and Connected Node Merging($AG^C$), are implemented. In result of evaluation of performance, $AG^C$ has better performance than $AG^H$ at construction cost and the number of node access but $AG^C$ has worse performance than AGH at exploring cost.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.245-248
• /
• 2009

Recently, Many studies have been progressing to path-finding with dynamic information on the Terminal Based Navigation System(TBNS). However, the most of existing algorithms are based on $A{\ast}$ algorithm. Path-finding algorithms which use heuristic function may occur a problem of the increase of exploring cost in case of that there is no way determined by heuristic function or there are 2 way more which have almost same cost. In this paper, two abstract graph(AG) that are different method of construction, Homogeneous Node merging($AG^H$) and Connected Node Merging($AG^C$), are implemented. The abstract graph is a simple graph of real road network. The method of using the abstract graph is proposed for reducing dependency of heuristic and exploring cost. In result of evaluation of performance, $AG^C$ has better performance than $AG^H$ at construction cost but $AG^C$ has worse performance than $AG^H$ exploring cost.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.11a
• /
• pp.121-124
• /
• 2000

하이퍼텍스트 구조를 가진 웹문서들은 HTML 태그를 사용하여 문서들을 링크한다. 웹사이트가 점점 더 커짐에 따라 새로운 웹사이트를 디자인하고, 일일이 웹 페이지들을 만들고 그들간의 링크를 만들어 다시 갱신하는 작업은 몹시도 지루한 작업이 되었다. 웹문서를 그래프로 표현함으로써, 웹 사용자들이 요청한 자료로의 빠른 접근을 가능하게 해 주기 위하여 페이지의 조직을 동적으로 바꾸거나 문서들간의 링크의 구조를 바꾸어 줄 경우 웹사이트 관리를 편리하게 해주는 것이 가능하고, 자동적으로 웹문서들을 재조정하는 것이 가능하다. 본 논문에서는, HTML 문서에서 문서를 연결해주는 태그인 으로 구성된 태그들을 추출하여, 이 태그들을 방향을 가진 링크로 간주하여 웹 페이지들을 그래프로 표현한다. 이 그래프 구조에서 링크를 재조정함으로써 사이트들에서 페이지의 조작을 동적으로 구성하고, 사용자들에게 편리함을 제공하는 링크를 제시한다.