• Journal of the Korea Society of Computer and Information
• /
• v.20 no.7
• /
• pp.41-47
• /
• 2015

The bandwidth minimization problem (BMP) has been classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. This paper suggests polynomial time heuristic algorithm is to find the solution of bandwidth minimization problem. To find the minimum bandwidth ${\phi}^*=_{min}{\phi}(G)$, ${\phi}(G)=_{max}\{{\mid}f(v_i)-f(v_j):v_i,v_j{\in}E\}$ for given graph G=(V,E), m=|V|,n=|E|, the proposed algorithm sets the maximum degree vertex $v_i$ in graph G into global central point (GCP), and labels the median value ${\lceil}m+1/2{\rceil}$ between [1,m] range. The graph G is partitioned into subgroup, the maximum degree vertex in each subgroup is set to local central point (LCP), and we adjust the label of LCP per each subgroup as possible as minimum distance from GCP. The proposed algorithm requires O(mn) time complexity for label to all of vertices. For various twelve graph, the proposed algorithm can be obtains the same result as known optimal solution. For one graph, the proposed algorithm can be improve on known solution.

• Journal of KIISE
• /
• v.42 no.12
• /
• pp.1561-1567
• /
• 2015

Abstract Semi-supervised learning is an area in machine learning that employs both labeled and unlabeled data in order to train a model and has the potential to improve prediction performance compared to supervised learning. Graph-based semi-supervised learning has recently come into focus with two phases: graph construction, which converts the input data into a graph, and label inference, which predicts the appropriate labels for unlabeled data using the constructed graph. The inference is based on the smoothness assumption feature of semi-supervised learning. In this study, we propose an enhanced label inference algorithm by incorporating the importance of each vertex. In addition, we prove the convergence of the suggested algorithm and verify its excellence.

• Journal of the Korea Computer Graphics Society
• /
• v.11 no.1
• /
• pp.31-39
• /
• 2005

음함수 표면을 이용한 모델링 방법은 부드러운 곡면을 나타내기에 적합하며 날카로운 부분을 표현하기 위해서는 CSG 연산을 적용한다. 기존의 방식을 이용해서 얻은 매쉬에서는 흔히 음함수의 표면과 상당한 오차를 가지는 매쉬 첨점(vertex)을 얻거나 겹쳐지는 삼각형 또는 날카로운 부분의 표현이 안 되는 점 등의 문제가 나타난다. 본 논문에서는 타원체의 특성을 이용해서 타원체 기반 음함수 표면을 정확하게 샘플링하고 동시에 날카로운 부분을 효과적으로 표현할 수 있는 매쉬를 얻기 위한 폴리곤화 방법을 제안한다. 이러한 목표를 위해 타원체의 투사 특성과 표면 법선 벡터의 연속 특성을 이용해서 음함수 표면 위에 정확하게 위치하는 첨점(vertex)의 위치를 찾고 날카로운 부분을 효과적으로 표현하기 위해 점진적인 방법으로 정확한 첨점(vertex) 위치를 찾는 방법을 제안한다. 지금까지 약점으로 지적되어 왔던 음함수 표면 모델링의 시각화 절차를 이 방법을 통해 개선함으로써 음함수 표면 모델링 기법이 제공하는 다른 장점들을 적극 활용할 수 있을 것으로 기대한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.773-775
• /
• 2013

In this paper, we consider the problem for finding a vertex sequence of the directed cycle graph from the individual neighborhood information on a reconfigurable mesh(in short, RMESH). This problem can be solved in linear time using a sequential algorithm. However, it is difficult to develop a sublinear time parallel algorithm for the problem because of its sequential nature. All kinds of polygons can be represented by directed cycles, hence a solution of the problem may be used to solving problems in which a polygon should be constructed from the adjacency information for each vertex. In this paper, we present a constant time $n{\times}n^2$ RMESH algorithm for the problem with n vertices.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1616-1623
• /
• 1996

In general, in order to recognize and modelling the 3-D object, it is necessary to have the method to express the shape of 3-D object. In case of 2-D like silhouette image, the extraction of vertex on the boundary of the object can be obtained by using the 2-D curvature function. But, in case of 3-D curvature function that can calculate the surface curvature values of 3-d object doesn't exist, it is difficult to express the share of 3-D object. Therefore, in this paper, a new method is presented. With this presented method, the approximated surface curvature values and vertex of 3-D object can be obtained effectively using the principle of 2-D curvature and the least square method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.141-148
• /
• 2005

Simplification of 3D models is becoming necessary with popularity of 3D graphics over mobile or the internet channels with limited channel capacity. Surfaces of a 3D model are usually approximated by a series of triangular meshes, and vertex contraction method is employed widely to minimize the deviation from the original model. Determination of the best position after contraction depends on the calculation of simplification error. We propose a new measure for computing the error so that the simplified model represents the original faithfully. We demonstrate the improved results with real 3D models.

• Kyungpook Mathematical Journal
• /
• v.48 no.2
• /
• pp.287-302
• /
• 2008

The vertex set of a digraph D is denoted by V (D). A c-partite tournament is an orientation of a complete c-partite graph. A digraph D is called cycle complementary if there exist two vertex disjoint cycles $C_1$ and $C_2$ such that V(D) = $V(C_1)\;{\cup}\;V(C_2)$, and a multipartite tournament D is called weakly cycle complementary if there exist two vertex disjoint cycles $C_1$ and $C_2$ such that $V(C_1)\;{\cup}\;V(C_2)$ contains vertices of all partite sets of D. The problem of complementary cycles in 2-connected tournaments was completely solved by Reid [4] in 1985 and Z. Song [5] in 1993. They proved that every 2-connected tournament T on at least 8 vertices has complementary cycles of length t and ${\mid}V(T)\mid$ - t for all $3\;{\leq}\;t\;{\leq}\;{\mid}V(T)\mid/2$. Recently, Volkmann [8] proved that each regular multipartite tournament D of order ${\mid}V(D)\mid\;\geq\;8$ is cycle complementary. In this article, we analyze multipartite tournaments that are weakly cycle complementary. Especially, we will characterize all 3-connected c-partite tournaments with $c\;\geq\;3$ that are weakly cycle complementary.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.2
• /
• pp.112-123
• /
• 1990

This paper presents a vertex-detecting of Hanguel patterns using nested contour shape. Inputed binary character patterns are transformed by distance transformation method and make a new file of transferred data by analysis of charactersitcs. A new vertex-detecting algorithm for recognizing Hanguel patterns using the two data files is proposed. This algorithm is able to reduce the projecting parts of Hanguel pattern, separate the connecting parts between different strokes, set the code number by transformed value of coorked features. It makes the output of results in order to apply the Hanguel recognition.

• Journal of the Society of Naval Architects of Korea
• /
• v.31 no.3
• /
• pp.31-37
• /
• 1994

When a lot of input data are not distributed uniformly n a chord-span direction or when the given shape is complicated, it is very difficult to obtain an inverse matrix which represents the smooth Bi-cubic B-spline surface of the initial shape. To overcome this problem, we suggest image Surface Expansion Method(ISE Method) which is suggested for vertex creation of B-spline curves and surfaces. Its basic concept, convergency and verification are shown. Also B-spline curves and Surfaces represented by ISE Method were compared with those represented by the existing method which is based on the inverse matrix method, the pseudoinverse matrix method and the chord length approximation method for vertex yielding. Ship Hull Forms which have Knuckle, Bulbous Bow, Transom and Stern frame were represented by the ISE Method.

• The Journal of Natural Sciences
• /
• v.12 no.1
• /
• pp.1-9
• /
• 2002

Let G be a connected graph on n vertices. The pebbling number of graph G, f(G), is the least m such that, however m pebbles are placed on the vertices of G, we can move a pebble to any vertex by a sequence of moves, each move taking two pebbles off one vertex and placing one on an adjacent vertex. In this paper, we compute the pebbling number of the Petersen Graph. We also show that the pebbling number of the categorical Product G.H is (m+n)h where G is the complete bipartite graph $K_{m,n}$ and H is the complete graph with $h(\geq4)$ vertices.