• Industrial Engineering and Management Systems
• /
• v.12 no.3
• /
• pp.198-206
• /
• 2013

The team orienteering problem (TOP) or the multiple tour maximum collection problem can be considered as a generic model that can be applied to a number of challenging applications in logistics, tourism, and other fields. This problem is generally defined as the problem of determining P paths, in which the traveling time of each path is limited by $T_{max}$ that maximizes the total collected score. In the TOP, a set of N vertices i is given, each with a score $S_i$. The starting point (vertex 1) and the end point (vertex N) of all paths are fixed. The time $t_{ij}$ needed to travel from vertex i to j is known for all vertices. Some exact and heuristics approaches had been proposed in the past for solving the TOP. This paper proposes a new solution methodology for solving the TOP using the particle swarm optimization, especially by proposing a solution representation and its decoding method. The performance of the proposed algorithm is then evaluated using several benchmark datasets for the TOP. The computational results show that the proposed algorithm using specific settings is capable of finding good solution for the corresponding TOP instance.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.1
• /
• pp.269-276
• /
• 2015

This paper proves the Erd$\ddot{o}$s-Faber-Lov$\acute{a}$sz conjecture of the vertex coloring problem, which is so far unresolved. The Erd$\ddot{o}$s-Faber-Lov$\acute{a}$sz conjecture states that "the union of k copies of k-cliques intersecting in at most one vertex pairwise is k-chromatic." i.e., x(G)=k. In a bid to prove this conjecture, this paper employs a method in which it determines the number of intersecting vertices and that of cliques that intersect at one vertex so as to count a vertex of the minimum degree ${\delta}(G)$ in the Minimum Independent Set (MIS) if both the numbers are even and to count a vertex of the maximum degree ${\Delta}(G)$ in otherwise. As a result of this algorithm, the number of MIS obtained is x(G)=k. When applied to $K_k$-clique sum intersecting graphs wherein $3{\leq}k{\leq}8$, the proposed method has proved to be successful in obtaining x(G)=k in all of them. To conclude, the Erd$\ddot{o}$s-Faber-Lov$\acute{a}$sz conjecture implying that "the k-number of $K_k$-clique sum intersecting graph is k-chromatic" is proven.

• The Journal of Korean Academy of Prosthodontics
• /
• v.39 no.1
• /
• pp.58-70
• /
• 2001

For the successful treatment of complete denture, obtaining a good retention is essential. There are lots of factors affecting denture retention. Denture material, one of those factors affecting denture retention, was the subject of this study, and internal surface treatment also considered for the method of enhancing denture retention. Two resin(Lucitone $199^{(R)}$(heat cured resin) Vertex $CP^{(R)}$(self cured resin)) and two metal($Biosil^{(R)}$(Co-Cr alloy), $Vitallium^{(R)}$(Co-Cr alloy)) denture base materials were used for making test denture base. Newly developed device was used for measuring denture retention. After the retention was measured. We treated internal surface of test denture base with $50{\mu}m\;Al_2O_3$ powder, under 90psi, for 1 minute. Then the retention was measured again. The result was analyzed with K-S test, one-way ANOVA test and independent t-test to deter mine the significant differences as the 95% level of confidence. The results are as follows : In cases of without internal surface treatment, the retention was increased in order of $Vitallium^{(R)},\;Biosil^{(R)},\;Vertex CP^{(R)}$ and Lucitone $199^{(R)}$. Except between Vertex $CP^{(R)}$ and $Biosil^{(R)}$, retention of the other materials was significantly different (p<0.05). After the treatment of internal surface, the retention was increased in order of $Vitallium^{(R)},\;Biosil^{(R)},\;Lucno\;199^{(R)},\;Vertex\;CP^{(R)}$. Except between Lucitone $199^{(R)}$ and Vertex $CP^{(R)}$, $Vitallium^{(R)}$ and $Biosil^{(R)}$ the retention of remaining groups was significantly different each other (p<0.05). In the matter of each material, after the internal surface treatment the retention was increased with Vertex $CP^{(R)},\;Biosil^{(R)}\;and\;Vitallium^{(R)}$ and the value of differences were statistically significant. When we compare the retention of resin and metal denture base, the retention of both denture bases increased significantly with internal surface treatment, and resin denture base showed better retention. As the results show, selecting denture base material could be an important choice of complete denture treatment. To increase denture retention, internal surface treatment can be considered as a possible method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1937-1945
• /
• 1999

In paper, we propose a 3D polygonal mesh simplification technique based on vertex clustering. The proposed method differentiates the size of each cluster according to the local property of a 3D object. We determine the size of clusters by considering the normal vector of triangles and the vertex distribution. The subdivisions of cluster are represented by octree. In this paper, we use the Harsdorff distance between the original mesh and the simplified one as a meaningful error value. Because proposed method adaptively determine the size of cluster according to the local property of the mesh, it has smaller error as compared with the previous methods and represent the small regions on detail. Also it can generate a multiresolution model and selectively refine the local regions.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.2
• /
• pp.25-34
• /
• 2007

Existing approaches that select an order for the join of three or more data streams have always used the simple heuristics. For their disadvantage - only one factor is considered and that is join selectivity or arrival rate, these methods lead to poor performance and inefficiency In some applications. The graph-based sliding window multi -join algorithm with optimal join sequence is proposed in this paper. In this method, sliding window join graph is set up primarily, in which a vertex represents a join operator and an edge indicates the join relationship among sliding windows, also the vertex weight and the edge weight represent the cost of join and the reciprocity of join operators respectively. Then the optimal join order can be found in the graph by using improved MVP algorithm. The final result can be produced by executing the join plan with the nested loop join procedure, The advantages of our algorithm are proved by the performance comparison with existing join algorithms.

• Journal of KIISE
• /
• v.43 no.10
• /
• pp.1131-1143
• /
• 2016

How can we effectively compress big graphs composed of billions of edges? By concentrating non-zeros in the adjacency matrix through vertex rearrangement, we can compress big graphs more efficiently. Also, we can boost the performance of several graph mining algorithms such as PageRank. SlashBurn is a state-of-the-art vertex rearrangement method. It processes real-world graphs effectively by utilizing the power-law characteristic of the real-world networks. However, the original SlashBurn algorithm displays a noticeable slowdown for large-scale graphs, and cannot be used at all when graphs are too large to fit in a single machine since it is designed to run on a single machine. In this paper, we propose a distributed SlashBurn algorithm to overcome these limitations. Distributed SlashBurn processes big graphs much faster than the original SlashBurn algorithm does. In addition, it scales up well by performing the large-scale vertex rearrangement process in a distributed fashion. In our experiments using real-world big graphs, the proposed distributed SlashBurn algorithm was found to run more than 45 times faster than the single machine counterpart, and process graphs that are 16 times bigger compared to the original method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.11
• /
• pp.1132-1142
• /
• 1991

This paper proposed a method of feature parameter extraction for shape information analysis of moving object. In the 2-D plane, moving object are extracted by the difference method. Feature parameters of moving object are chosen area, perimeter, a/p ratio, vertex, x/y ratio. We changed brightness variation from the range of 600Lux to the 1400Lux and then determined Permissible Error range of feature parameter due to the brightness variation. So as to verify the validity of proposed method, experiment are performed with a toy car and it's results showed that decision error was less than 6%.

• Earthquakes and Structures
• /
• v.11 no.3
• /
• pp.407-420
• /
• 2016

The aim of this study is to investigate the effect of vertical ground motion (VGM) on seismic behavior of reinforced concrete (RC) regular frame with construction joints, and determine more proper modeling method for cast-in-situ RC frame. The four-story RC frames in the regions of 7, 8 and 9 earthquake intensity were analyzed with nonlinear dynamic time-history method. Two different methods of ground motion input, horizontal ground motion (HGM) input only, VGM and HGM input simultaneously were performed. Seismic responses in terms of the maximum vertex displacement, the maximum inter-story drift distribution and the plastic hinge distribution were analyzed. The results show that VGM might increase or decrease the horizontal maximum vertex displacement depending on the value of axial load ratio of column. And it will increase the maximum inter-story drift and change its distribution. Finally, proper modeling method is proposed according to the distribution of plastic hinges, which is in well agreement with the actual earthquake damage.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1523-1526
• /
• 2002

In this paper, we propose a method fur measuring the dimensions of an arbitrary object using geometric relationship between a perspective projection image and a rectangular parallelepiped model. For recognizing the vertexes of the rectangular parallelepiped surrounding an arbitrary object, the method adopts a strategy that derives the equations for vertex recognition from the geometrical relationships for image formation between 2D image and the rectangular parallelepiped model. extracts from 2D image with vertical view features (or junctions) of minimum quadrangle circumscribing an arbitrary shape object, and then recognizes vertexes from the features with the equations. Finally, the dimensions of the object are calculated from these results of vertex recognition. By the experimental results, it is demonstrated that this method is very effective to recognize the vertexes of the arbitrary objects.

• Journal of Broadcast Engineering
• /
• v.10 no.4 s.29
• /
• pp.632-642
• /
• 2005

This paper presents a new vertex selection scheme for the polygon-based contour approximation. In the proposed method, the entire contour is partitioned into partial segments and they are approximated adaptively with variable accuracy. The approximation accuracy of each segment is controlled based on its relative significance. By computing the relative significance with the texture degradation in the approximation error region, the visual quality enhancement in the reconstructed frames can be achieved under the same amount of the contour data. For this purpose, a decision rule for $d_{max}$ is derived based on inter-region contrasts. In addition, an adaptive vertex selection method using the derived rule is proposed. Experimental results are presented to show the superiority of the proposed method over conventional methods.