• Korean Journal of Mathematics
• /
• 제14권1호
• /
• pp.47-55
• /
• 2006

This paper presents an image analysis technique using connected components by applying SPA (shortest path algorithm) from graph theory. Software implementation of Floyd-Warshall transitive matrix labelling method is discussed. Results are also presented.

• 호남수학학술지
• /
• 제30권4호
• /
• pp.589-602
• /
• 2008

As a survey-type article, the paper reviews various digital topological utilities from digital covering theory. Digital covering theory has strongly contributed to the calculation of the digital k-fundamental group of both a digital space(a set with k-adjacency or digital k-graph) and a digital product. Furthermore, it has been used in classifying digital spaces, establishing almost Van Kampen theory which is the digital version of van Kampen theorem in algebrate topology, developing the generalized universal covering property, and so forth. Finally, we remark on the digital k-surface structure of a Cartesian product of two simple closed $k_i$-curves in ${\mathbf{Z}}^n$, $i{\in}{1,2}$.

• 로봇학회논문지
• /
• 제12권3호
• /
• pp.339-349
• /
• 2017

In this paper, we present a finite-time sliding mode control (FSMC) with an integral finite-time sliding surface for applying the concept of graph theory to a distributed wheeled mobile robot (WMR) system. The kinematic and dynamic property of the WMR system are considered simultaneously to design a finite-time sliding mode controller. Next, consensus and formation control laws for distributed WMR systems are derived by using the graph theory. The kinematic and dynamic controllers are applied simultaneously to compensate the dynamic effect of the WMR system. Compared to the conventional sliding mode control (SMC), fast convergence is assured and the finite-time performance index is derived using extended Lyapunov function with adaptive law to describe the uncertainty. Numerical simulation results of formation control for WMR systems shows the efficacy of the proposed controller.

• 제어로봇시스템학회논문지
• /
• 제20권12호
• /
• pp.1225-1230
• /
• 2014

This paper investigates the group average-consensus and group formation-consensus problems for first-order multi-agent systems. The control protocol for group consensus is designed by considering the positive adjacency elements. Since each intra-group Laplacian matrix cannot be satisfied with the in-degree balance because of the positive adjacency elements between groups, we decompose the Laplacian matrix into an intra-group Laplacian matrix and an inter-group Laplacian matrix. Moreover, average matrices are used in the control protocol to analyze the stability of multi-agent systems with a fixed and undirected communication topology. Using the graph theory and the Lyapunov functional, stability analysis is performed for group average-consensus and group formation-consensus, respectively. Finally, some simulation results are presented to validate the effectiveness of the proposed control protocol for group consensus.

• 한국통신학회논문지
• /
• 제41권11호
• /
• pp.1608-1618
• /
• 2016

본 논문에서는 군용 통신망에 대한 주파수 지정 문제를 그래프 이론 관점에서 접근하여 해결하는 방법을 소개한다. 선행 연구에서 제안한 알고리즘을 본 문제에 맞게 구현하였으며, 새로운 알고리즘을 제안하여 얻은 해의 성능이 최적의 값에 거의 근접함을 증명하였다. 또한, 이중 편파 안테나의 편파를 동시에 배정하여 주파수 지정 문제 해의 성능을 극대화하는 알고리즘을 소개하였다.

• 한국통신학회논문지
• /
• 제40권9호
• /
• pp.1719-1721
• /
• 2015

주파수 자동지정 알고리즘은 빈번한 환경 변화에 따라 주파수 재지정이 요구되는 군용 통신에서 중요하게 고려되고 있다. 본 논문에서는 주파수 자동지정 문제를 그래프 이론 관점에서 해결한다. 그래프의 색칠 이론을 기반으로 한 알고리즘을 제시하여 기존의 탐욕 알고리즘 보다 사용되는 주파수 개수를 0.77배 감소시키는 성능 향상을 확인하였다. 또한, 주파수 범위와 재사용률 간의 맞교환을 통하여 원하는 성능을 얻을 수 있는 하이브리드 알고리즘을 제시하였다.

• 한국산업융합학회 논문집
• /
• 제14권3호
• /
• pp.105-111
• /
• 2011

Landmark Spots in 2D gel electrophoresis are used in many methods of 2DEG spot matching. Landmark Spots are obtained manually and it is a bottle neck in the entire protein analysis process. Automated landmark spots detection is a very crucial topic in processing a massive amount of 2DGE data. In this paper, Automated landmark spot detection is proposed using point pattern matching and graph theory. Neighbor spots are defined by a graph theory to use and only a centered spot and its neighbor spots are considered for spot matching. Normalized Hausdorff distance is introduced as a criterion for measuring degree of similarity. In the conclusion, the method proposed in this paper can get about 50% of the total spot pairs and the accuracy rate is almost 100%, which the requirements of landmark spots are fully satisfied.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권7호
• /
• pp.2649-2666
• /
• 2015

In the dynamic cloud computing environment, to ensure, under the terms of service-level agreements, the maximum efficiency of resource utilization, it is necessary to investigate the online dynamic management of virtual machine resources and their operational application systems/components. In this study, the feasibility and properties of the division of virtual machine resources on the cloud platform, using the virtual machine cluster as the management unit, are investigated. First, the definitions of virtual machine clusters are compared, and our own definitions are presented. Then, the feasibility of division using the virtual machine cluster as the management unit is described, and the isomorphism and reconfigurability of the clusters are proven. Lastly, from the perspectives of clustering and cluster segmentation, the dynamics of virtual machines are described and experimentally compared. This study aims to provide novel methods and approaches to the optimization management of virtual machine resources and the optimization configuration of the parameters of virtual machine resources and their application systems/components in large-scale cloud computing environments.

• 한국정보통신학회논문지
• /
• 제16권12호
• /
• pp.2755-2761
• /
• 2012

본 논문에서는 Eccentricity를 이용한 차선 검출 알고리듬을 제안한다. 차선 검출 알고리듬은 자동차 운전자의 안정성을 증가시키는 차선 이탈 경보 시스템 등에 활용될 수 있다. 차선 검출율을 개선하기 위하여 그래프 이론에서 소개되는 Eccentricity를 정의하고, 이를 차선 검출 알고리듬에 이용하여 Eccentricity를 계산하였다. 직선도로인 경우 Eccentricity는 1이고 1차 함수로 구현이 가능하다. 그래서 시간 복잡도와 공간 복잡도를 개선하였고, 아울러 기존의 방법들보다 차선 검출율이 향상됨을 확인하였다.

• 한국환경복원기술학회지
• /
• 제21권2호
• /
• pp.53-64
• /
• 2018

This study aims to quantitatively evaluate the conservation priorities of unexecuted urban parks in Seoul both from an ecological and public perspective. To this end, two methodologies, ecological network analysis based on graph and circuit theory and accessibility analysis, were employed in order to assess ecological connectivity of and public accessibility to unexecuted parks, respectively. This study applied linkage-mapping methods (shortest path and current flow betweenness centrality) of connectivity analysis to an integrated map of landscape permeability. The population-weighted accessibility to unexecuted parks was measured based on a negative exponential distance decay function. As a result, for both ecological connectivity and accessibility, Gwanaksan, Suraksan, and Bulamsan urban natural parks are found to be the most important (rank 1-3) to be conserved. For these sites, inner park areas with conservation priorities for connectivity and accessibility were identified. The findings of the study can be used for giving conservation priority to the unexecuted urban parks in terms of long-term sustainable urban planning.