• 한국정보과학회논문지:데이타베이스
• /
• 제31권3호
• /
• pp.320-330
• /
• 2004

XML에 대한 질의 언어는 데이타 그래프 내의 경로를 이용하여 질의를 표현한다. 특히, 경로에 패턴 (예를 들어, 정규식)을 사용함으로써, 데이타의 구조를 정확히 알지 못하더라도 질의가 가능하도록 한다. 이때, 패턴을 이용하는 질의는 데이타 그래프의 탐색범위를 크게 넓히게 된다. 기존의 XML색인 기법은 질의의 탐색범위를 줄이기 위해 데이타 그래프 내의 서로 동일한 경로들을 하나로 묶어 작은 크기의 색인 그래프를 생성하는 방법을 이용한다. 하지만 이러한 색인들은 많은 경우 색인의 크기가 데이터 그래프의 크기만큼 증가하게 되어 질의의 탐색범위를 줄이지 못하고, 따라서 효율적인 질의 처리를 보장하지 못한다. 본 논문에서는 데이타 내에 존재하는 모든 경로를 분할(partitioning)하고 질의 처리 시 질의에 맞는 분할 영역을 빠르게 찾아낼 수 있는 색인 그래프를 제안한다. 본 논문에서 제안하는 색인 그래프는 데이터 그래프의 크기와 상관없이 색인 그래프의 크기를 조절할 수 있다. 따라서 색인 그래프의 크기를 작게 구성함으로써 색인 그래프 탐색 비용을 크게 줄일 수 있다. 본 논문에서는, 실험을 통해 기존의 그래프 기반색인 기법들보다 본 논문의 색인 기법이 보다 효율적임을 보이고 색인의 크기 변화에 따른 성능 변화에 대해 알아본다.

• ETRI Journal
• /
• 제38권4호
• /
• pp.714-723
• /
• 2016

Considerable attention has been given to processing graph data in recent years. An efficient method for computing the node proximity is one of the most challenging problems for many applications such as recommendation systems and social networks. Regarding large-scale, mutable datasets and user queries, top-k query processing has gained significant interest. This paper presents a novel method to find top-k answers in a node proximity search based on the well-known measure, Personalized PageRank (PPR). First, we introduce a distribution state transition graph (DSTG) to depict iterative steps for solving the PPR equation. Second, we propose a weight distribution model of a DSTG to capture the states of intermediate PPR scores and their distribution. Using a DSTG, we can selectively follow and compare multiple random paths with different lengths to find the most promising nodes. Moreover, we prove that the results of our method are equivalent to the PPR results. Comparative performance studies using two real datasets clearly show that our method is practical and accurate.

• 한국자동차공학회논문집
• /
• 제5권5호
• /
• pp.73-85
• /
• 1997

An automatic transmission is an important element of automotive power systems that allows a driving convenience. Compared to a manual transmission, however, it has a few problems in efficiency, shift feel, and maintenance. To improve these, it is imperative to understand the dynamics of automatic transmissions. This paper develops a dynamically-correct model of an automatic transmission, using the bond graph method. The bond graph method is ideally suited for modeling power systems, because the method is based on generalized power variables. The bond graph method is capable of providing correct dynamic constraints and kinematic constraints, as well as the governing differential equations of motion. The bond graph method is applied to 1-4 in-gear ranges, as well as various upshifts and downshifts of an automatic transmission, which allows an accurate simulation of an automatic transmission. Conventional automatic transmission models have no dynamic constraint, which do not allow correct simulation studies.

• 대한수학회보
• /
• 제46권6호
• /
• pp.1051-1060
• /
• 2009

In this paper, we give topological properties of collection of prime ideals in 2-primal near-rings. We show that Spec(N), the spectrum of prime ideals, is a compact space, and Max(N), the maximal ideals of N, forms a compact $T_1$-subspace. We also study the zero-divisor graph $\Gamma_I$(R) with respect to the completely semiprime ideal I of N. We show that ${\Gamma}_{\mathbb{P}}$ (R), where $\mathbb{P}$ is a prime radical of N, is a connected graph with diameter less than or equal to 3. We characterize all cycles in the graph ${\Gamma}_{\mathbb{P}}$ (R).

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 2001년도 하계학술대회 논문집
• /
• pp.791-794
• /
• 2001

We described a method resonant mode identification in dielectric-disc loaded cylindrical cavity resonators. The characteristic equation is solved by using the ContourPlot graph of Mathematica. Contour graph method uses graphical method. It is comparable with numerical method. The numerical method is very difficult a mode identification. The analysis based on the approximated electromagnetic representation. This kinds of studies only concentrated on the calculation of resonant frequencies, and a mode identification of resonant frequencies have not been covered. But, the contour graph method to analyze the characteristic equations is simple and all parts of resonant frequency graph can be easily drawn, it is possible to calculate precise resonant frequencies and to identify the mode of resonant frequencies.

• International Journal of CAD/CAM
• /
• 제6권1호
• /
• pp.99-104
• /
• 2006

Engineering graph plays an important role in design and manufacture, such as architecture, machinery, manufacture, military. However, almost no persons consider the security and copyright of two-dimensional engineering graph. A novel method for two-dimensional engineering graph watermark based U system is proposed in this paper. Watermarks generated by this technique can be successfully extracted even after rotation, translation and scaling transform.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
• /
• pp.529-532
• /
• 1988

This paper proposes a graph matching algorithm based on simulated annealing, which assures the globally optimal solution for circuit partitioning for the placement in the rectilinear region occurring as a result of the pre-placement of some macro cells, or onto the nonplanar surface in some military or space applications. The circuit graph ($G_{C}$) denoting the circuit topology is formed by a hierarchical bottom-up clustering of cells, while another graph called region graph ($G_{R}$) represents the geometry of a planar rectilinear region or a nonplanar surface for circuit placement. Finding the optimal many-to-one vertex mapping function from $G_{C}$ to $G_{R}$, such that the total mismatch cost between two graphs is minimal, is a combinatorial optimization problem which was solved in this work for various examples using simulated annealing.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
• /
• pp.687-690
• /
• 1988

Algorithms that represent given pattern in the form of an ARG (Attributed relational graph) using not only structural relations but also symbolic or numerical attributes, and then recognize that pattern by graph matching process are presented in this paper. Based on definitions of pattern deformational models, algorithms that can find GPECI(Graph preserved error correcting isomorphism). SGECI(subgraph ECI) and DSECI(Double subgraph ECI) are proposed and comparisons among these algorithms are described. To be useful in performig practical tasks, efficient schemes for extraction of ARG representation fron raw image are needed. In this study, given patterns are restricted within objects having distinct skeleton, and then the information which is necessary for recognition and analysis is successfully extracted.

• 한국전기전자재료학회논문지
• /
• 제15권1호
• /
• pp.37-45
• /
• 2002

We described a method of resonant mode identification in dielectric-disc loaded cylindrical cavity resonators. The characteristic equations are solved using the ContourPlot graph of Mathematica. Contour graph method uses graphical method. It is comparable with numerical method. The numerical method is very difficult mode identification. The analysis is based on the approximated electromagnetic representation which is only concentrated on the calculation of resonant frequencies, and a mode identification of resonant frequencies has not been covered. However, It is possible to calculate precise resonant frequencies and to identify the mode of resonant frequencies using the contour graph method. The contour graph method is not a method using approximated representation of electromagnetic field variation at the outer area of dielectric in the resonators. It is a method using enact representation.

• 디자인융복합연구
• /
• 제14권4호
• /
• pp.133-150
• /
• 2015

본 연구는 1946년부터 2012년까지 총 5211건의 UN총회 투표데이터를 활용하여 국가 간의 관계를 기간별, 이슈별 등 다양한 관점에서 분석할 수 있는 인터랙티브(Interactive) 시각화 방법을 제안하였다. 연구를 위해 국가 간 유사도 매트릭스를 고안하고, 두 가지의 시각화 방법을 개발하였다. 첫 번째는 연도별로 UN 총회의 투표에 참여한 국가 간의 관계를 사회 연결망 그래프 형태로 표현한 네트워크 그래프(Network Graph)시각화이며, 두 번째는 특정 국가를 중심으로 다른 국가 간의 관계를 분석하거나 시간에 따른 국가 간의 투표 성향 변화를 동시에 분석할 수 있도록 고안된 Proximity based Circular 시각화이다. 본 연구는 기존의 투표 데이터를 활용한 분석 사례에서 시도되지 않았던 다양한 관점에서 네트워크 분석을 하기 위해 선과 원형 그래프가 결합된 Proximity based Circular 시각화를 제안하고 이를 구현하였다는 점에서 큰 의의가 있다. 또한 두 개의 시각화에 대한 비교 실험을 실시하여 각 시각화의 상호 보완점을 도출 하였다. 연구 결과로는 Proximity based Circular 시각화가 개별 국가 노드에 대한 정보를 더 잘 나타내며, 네트워크 그래프(Network Graph)시각화는 전체 데이터의 특성과 여러 데이터 간의 성향을 더 잘 나타낸다는 결과를 도출하였다. 따라서 UN국가의 투표 성향 데이터를 분석하기 위해서는 두 개의 시각화를 병행하여 사용하는 경우가 데이터 간의 관계 파악에 가장 도움이 된다는 결론을 제시하였다.