• Annual Conference on Human and Language Technology
• /
• 2019.10a
• /
• pp.537-539
• /
• 2019

구문 분석은 문장의 구조를 분석하는 자연어처리 분야로 그래프 기반 방법과 전이 기반 방법으로 나뉘어 연구되어 왔다. 본 논문에서는 그래프 기반 방식에서 높은 성능을 보이고 있는 Deep Biaffine 어텐션 모델에 별도의 High-Order 정보 추출 없이 Graph Neural Network(GNNs)을 이용하여 High-Order 정보를 학습할 수 있도록 확장한 Deep Biaffine 어텐션 GNNs을 적용하여 한국어 세종 구문 분석 셋에서 UAS : 94.44%, LAS : 92.55%의 성능을 달성하였으며 Dual Decomposition을 통해 전이 기반 한국어 구문 분석 모델과 결합하여 추가적인 성능 향상을 보였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.11a
• /
• pp.574-576
• /
• 2022

최근 여러 분야에서 그래프 신경망(graph neural network, GNN)이 활발히 연구되고 있다. 하지만 지금까지 대부분의 GNN 연구는 단일 GNN 모델의 성능을 향상하는 데 집중되었다. 본 논문에서는 앙상블(ensemble) 기법의 대표적 기법인 그래디언트 부스팅(gradient boosting)을 이용하여 GNN의 앙상블 모델을 만드는 방법을 제안한다. 제안 방법은 앞서 만들어진 GNN의 오차를 경사 하강법(gradient descent)을 이용하여 감소시키는 방향으로 다음 GNN을 생성한다. 이 과정을 반복하여 GNN의 최종 앙상블 모델을 얻는다. 실험에서 GNN의 대표적인 모델인 그래프 합성곱 신경망(graph convolutional network, GCN)에 제안 방법을 적용하여 앙상블 모델을 생성한 결과, 단일 GCN 모델에 비해 노드 분류 정확도가 11.3%p까지 증가하였음을 확인하였다.

• The KIPS Transactions:PartA
• /
• v.18A no.6
• /
• pp.225-232
• /
• 2011

Restricted Hypercube-Like (RHL) graphs are a graph class that widely includes useful interconnection networks such as crossed cube, Mobius cube, Mcube, twisted cube, locally twisted cube, multiply twisted cube, and generalized twisted cube. In this paper, we show that for an m-dimensional RHL graph G, $m{\geq}4$, with an arbitrary faulty edge set $F{\subset}E(G)$, ${\mid}F{\mid}{\leq}m-2$, graph $G{\setminus}F$ has a hamiltonian path between any distinct two nodes s and t if dist(s, V(F))${\neq}1$ or dist(t, V(F))${\neq}1$. Graph $G{\setminus}F$ is the graph G whose faulty edges are removed. Set V(F) is the end vertex set of the edges in F and dist(v, V(F)) is the minimum distance between vertex v and the vertices in V(F).

• Smart Structures and Systems
• /
• v.20 no.1
• /
• pp.99-114
• /
• 2017

In cognitive science, it is illustrated how the collective opinions of a group of individuals answers to questions involving quantity estimation. One example of this approach is introduced in this article as Star Graph (SG) algorithm. This graph describes the details of communication among individuals to share their information and make a new decision. A new labyrinthine network of neighbors is defined in the decision-making process of the algorithm. In order to prevent getting trapped in local optima, the neighboring networks are regenerated in each iteration of the algorithm. In this algorithm, the normal distribution is utilized for a group of agents with the best results (guidance group) to replace the existing infeasible solutions. Here, some new functions are introduced to provide a high convergence for the method. These functions not only increase the local and global search capabilities but also require less computational effort. Various benchmark functions and engineering problems are examined and the results are compared with those of some other algorithms to show the capability and performance of the presented method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.999-1007
• /
• 1999

이 논문은 재귀원형군 G(2^m , 2^k )를 그래프 이론적 관점에서 고찰하고 정점이 서로소인 사이클과 그래프 invariant에 관한 위상 특성을 제시한다. 재귀원형군은 1 에서 제안된 다중 컴퓨터의 연결망 구조이다. 재귀원형군 {{{{G(2^m , 2^k )가 길이 사이클을 가질 필요 충분 조건을 구하고, 이 조건하에서 G(2^m , 2^k )는 가능한 최대 개수의 정점이 서로소이고 길이가l`인 사이클을 가짐을 보인다. 그리고 정점 및 에지 채색, 최대 클릭, 독립 집합 및 정점 커버에 대한 그래프 invariant를 분석한다.Abstract In this paper, we investigate recursive circulant G(2^m , 2^k ) from the graph theory point of view and present topological properties of G(2^m , 2^k ) concerned with vertex-disjoint cycles and graph invariants. Recursive circulant is an interconnection structure for multicomputer networks proposed in 1 . A necessary and sufficient condition for recursive circulant {{{{G(2^m , 2^k ) to have a cycle of lengthl` is derived. Under the condition, we show that G(2^m , 2^k ) has the maximum possible number of vertex-disjoint cycles of length l`. We analyze graph invariants on vertex and edge coloring, maximum clique, independent set and vertex cover.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.703-722
• /
• 2016

Passive wireless devices have increasing civilian and military applications, especially in the scenario with wearable devices and Internet of Things. In this paper, we study indoor localization of a target equipped with radio-frequency identification (RFID) device in ultra-wideband (UWB) wireless networks. With known room layout, deterministic multipath components, including the line-of-sight (LOS) signal and the reflected signals via multipath propagation, are employed to locate the target with one transmitter and a single inaccurate receiver. A factor graph corresponding to the joint posterior position distribution of target and receiver is constructed. However, due to the mixed distribution in the factor node of likelihood function, the expressions of messages are intractable by directly applying belief propagation on factor graph. To this end, we approximate the messages by Gaussian distribution via minimizing the Kullback-Leibler divergence (KLD) between them. Accordingly, a parametric message passing algorithm for indoor passive localization is derived, in which only the means and variances of Gaussian distributions have to be updated. Performance of the proposed algorithm and the impact of critical parameters are evaluated by Monte Carlo simulations, which demonstrate the superior performance in localization accuracy and the robustness to the statistics of multipath channels.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.1
• /
• pp.63-73
• /
• 1988

In this paper, an algorithm is proposed to evaluate the source-to-terminal reliability, the probability that a source node can communicate with a terminal node, in a probabilistic derected graph. By using Satyanaratana's factoring $theorem^{(7)}$, the original graph can be partitioned into two reduced graphs obtained by contracting and deleting the edge connected to the source node in the probabilistic directed graph. The edge removal proposed in this paper and the general series-parallel reduction can then be applied to the reduced graph. This edge reduction can be applied recursively to the reduced graphs until a source node can be connected to a terminal node by one edge. A computer program which can be applied to evaluating the source-to-terminal reliability in a complex and large network has also been developed.

• KIPS Transactions on Software and Data Engineering
• /
• v.10 no.8
• /
• pp.319-330
• /
• 2021

Recently, in the field of open domain natural language question answering, multi-task, multi-hop question answering has been studied extensively. In this paper, we propose a novel deep neural network model using hierarchical graphs to answer effectively such multi-task, multi-hop questions. The proposed model extracts different levels of contextual information from multiple paragraphs using hierarchical graphs and graph neural networks, and then utilize them to predict answer type, supporting sentences and answer spans simultaneously. Conducting experiments with the HotpotQA benchmark dataset, we show high performance and positive effects of the proposed model.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.4
• /
• pp.51-60
• /
• 2007

In this study, we consider the minimum ADM problem which is the fundamental problem for the cost-effective design of SONET ADM embedded in WDM ring networks. To minimize the number of SONET ADMs, efficient algorithms for the routing and wavelength assignment are needed. We propose a mathematical model based on the graph theory for the problem and propose a branch-and-price approach to solve the suggested model effectively within reasonable time. By exploiting the mathematical structure of ring networks, we developed polynomial time algorithms for column generation subroutine at branch-and-bound tree. In a computer simulation study, the suggested approach can find the optimal solution for sufficient size networks and shows better performance than the greedy heuristic method.

• Journal of Korean Society of Occupational and Environmental Hygiene
• /
• v.10 no.2
• /
• pp.1-17
• /
• 2000

We investigated dissatisfaction of elements of local exhaust system, needs for local exhaust system, and information networks for local exhaust system from June 1998 to September 1999 using the questionnaire structured. It contained questions concerning general characteristics of factory and local exhaust system, troubles and dissatisfaction of elements of local exhaust system, and information networks for local exhaust system. The collected data were analyzed by descriptive statistics analysis. Information networks for local exhaust system were analyzed by multidimensional scaling using path distance of network analysis and by graph analysis using Krackplot. Among complaints of local exhaust system, that of duct has show the highest percentage of complaint. In the information network for local exhaust system, Seoul is positioned in the center of network with mediating role.