• Bulletin of the Korean Mathematical Society
• /
• v.50 no.2
• /
• pp.469-473
• /
• 2013

Let G = (V, E) be a graph and k be a positive integer. A $k$-dominating set of G is a subset $S{\subseteq}V$ such that each vertex in $V{\backslash}S$ has at least $k$ neighbors in S. A Roman $k$-dominating function on G is a function $f$ : V ${\rightarrow}$ {0, 1, 2} such that every vertex ${\upsilon}$ with $f({\upsilon})$ = 0 is adjacent to at least $k$ vertices ${\upsilon}_1$, ${\upsilon}_2$, ${\ldots}$, ${\upsilon}_k$ with $f({\upsilon}_i)$ = 2 for $i$ = 1, 2, ${\ldots}$, $k$. In the paper titled "Roman $k$-domination in graphs" (J. Korean Math. Soc. 46 (2009), no. 6, 1309-1318) K. Kammerling and L. Volkmann showed that for any graph G with $n$ vertices, ${{\gamma}_{kR}}(G)+{{\gamma}_{kR}(\bar{G})}{\geq}$ min $\{2n,4k+1\}$, and the equality holds if and only if $n{\leq}2k$ or $k{\geq}2$ and $n=2k+1$ or $k=1$ and G or $\bar{G}$ has a vertex of degree $n$ - 1 and its complement has a vertex of degree $n$ - 2. In this paper we find a counterexample of Kammerling and Volkmann's result and then give a correction to the result.

• Korean Journal of Cognitive Science
• /
• v.1 no.2
• /
• pp.317-346
• /
• 1989

A congnitive shape decomposition method that agrees with human intuition is proposed for the conceptual recognition from sillouettes of objects. Descriptions specifying the structure of shape in terms of meaningful parts and relations have cognitive power and anthropomorphism. In general, man-made objects have a lot of collinear lines and regularity. For the cognitive decomposition of man-made objects, many heuristic rules based on the cognitive experimentation are applied on the context of collinerarity and regularity. The cognitive shape decomposition for the natural shape is carried out by analyzing the possible configuraitions of vertices and line segments for one concave vertex. A cost function for the configuation is designed by weighted sum of five criteria such as, the length of split line segment, the number of split line segments at concave vertex, the proximity of concave vertex, and the correspondence of vertices. These criteria are vased on the property of human perception such as proximtiy, symmetry, and simplicity. The most promising vertex os selected among three set of visible vertices by evaluating the cost function. A number of experiments conducted on the different types of shapes shows that the results correspond with human intuition.

• Journal of the Korean Mathematical Society
• /
• v.45 no.6
• /
• pp.1613-1622
• /
• 2008

Let G be a graph with vertex set V(G) and edge set E(G), and let g, f be two nonnegative integer-valued functions defined on V(G) such that $g(x)\;{\leq}\;f(x)$ for every vertex x of V(G). We use $d_G(x)$ to denote the degree of a vertex x of G. A (g, f)-factor of G is a spanning subgraph F of G such that $g(x)\;{\leq}\;d_F(x)\;{\leq}\;f(x)$ for every vertex x of V(F). In particular, G is called a (g, f)-graph if G itself is a (g, f)-factor. A (g, f)-factorization of G is a partition of E(G) into edge-disjoint (g, f)-factors. Let F = {$F_1$, $F_2$, ..., $F_m$} be a factorization of G and H be a subgraph of G with mr edges. If $F_i$, $1\;{\leq}\;i\;{\leq}\;m$, has exactly r edges in common with H, we say that F is r-orthogonal to H. If for any partition {$A_1$, $A_2$, ..., $A_m$} of E(H) with $|A_i|=r$ there is a (g, f)-factorization F = {$F_1$, $F_2$, ..., $F_m$} of G such that $A_i\;{\subseteq}E(F_i)$, $1\;{\leq}\;i\;{\leq}\;m$, then we say that G has (g, f)-factorizations randomly r-orthogonal to H. In this paper it is proved that every (0, mf - (m - 1)r)-graph has (0, f)-factorizations randomly r-orthogonal to any given subgraph with mr edges if $f(x)\;{\geq}\;3r\;-\;1$ for any $x\;{\in}\;V(G)$.

• 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 the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.114-123
• /
• 2003

The current paper proposes a new vertex selection scheme for polygon-based contour coding. To efficiently characterize the shape of an object, we incorporate the curvature information in addition to the conventional maximum distance criterion in vertex selection process. The proposed method consists of "two-step procedure." At first, contour pixels of high curvature value are selected as key vortices based on the curvature scale space (CSS), thereby dividing an overall contour into several contour-segments. Each segment is considered as an open contour whose end points are two consecutive key vortices and is processed independently. In the second step, vertices for each contour segment are selected using progressive vertex selection (PVS) method in order to obtain minimum number of vertices under the given maximum distance criterion ( $D_{max}$$^{*}$). Furthermore, the obtained vortices are adjusted using the dynamic programming (DP) technique to optimal positions in the error area sense. Experimental results are presented to compare the approximation performances of the proposed and conventional methods.imation performances of the proposed and conventional methods.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.11
• /
• pp.5745-5751
• /
• 2013

The purpose of this study was to evaluate the effect of the surface treatment of MMA and TEGDMA concentration, silane coupling agent on the shear bond strength of denture base resin and denture reliners. Denture base resin surface was treated with MMA and TEGDMA concentration, silane coupling agent. After denture reliners were injected bond strength was measured. The results of MMA and TEGDMA concentration on the shear bond strength of Vertex self curing resin showed that the value of MMA 95% and TEGDMA 5%, MMA 90% and TEGDMA 10%, MMA 80% and TEGDMA 20% groups were higher than that of other group(P<0.05). MMA and TEGDMA concentration on the shear bond strength of Kooliner resin showed that the value of MMA 95% and TEGDMA 5%, MMA 90% and TEGDMA 10% were higher than that of other group(P<0.05). Silane coupling agent on the shear bond strength of Vertex self curing resin and Kooliner showed that the value of MMA 95% and silane coupling agent 5% groups was higher than that of other group(P<0.05). Therefore, we could conclude that appropriate chemical surface treatments are supposed to affect the bond of denture base resin and denture reliners.

• 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.

• Korean Journal of Optics and Photonics
• /
• v.28 no.4
• /
• pp.146-152
• /
• 2017

Alignment of the mirrors composing a space telescope is an important process for obtaining high optical resolution and performance of the camera system. The alignment of mirrors using cube mirrors requires a relative coordinate mapping between the mirror and the cube mirror before optical-system integration. Therefore, to align the spacecraft camera mirrors, the relative coordinates of the vertex of each mirror and the corresponding cube mirror must be accurately measured. This paper proposes a new method for finding the vertex position of a primary mirror, by using an optical fiber and alignment segments of a computer-generated hologram (CGH). The measurement system is composed of an optical testing interferometer and a multimode optical fiber. We used two theodolites to measure the relative coordinates of the optical fiber located at the mirror vertex with respect to the cube mirror, and achieved a measurement precision of better than $25{\mu}m$.

• The Journal of Korean Academy of Prosthodontics
• /
• v.41 no.2
• /
• pp.160-168
• /
• 2003

Statement of problem : Direct denture reline resins tend to discolor during service in the oral environment by intrinsic and extrinsic factor. Purpose : This study was designed to evaluate the color stability of direct denture reline resins. Material and methods : Mild Rebaron(GC Corp., Japan), Meta Base M(Sun medical Co., Japan), Mild Rebaron LC(GC Corp., Japan) and as a control group, Vertex SC(Dentimex Zeist, Holland) were chosen for this study. Ten specimens of each direct denture reline resins were fabricated. Treatment methods designed for this study were the coffee staining test(7days) and the accelerated aging test(100hours). The color changes before and after treatment were measured by Tristimulous colorimeter(Yasuda seiki seisakusho, Ltd. Japan) and analyzed. Results All the direct denture reline resins subjected to the coffee staining test and the accelerated aging test showed noticible difference in color change. After coffee staining test, Meta Base M showed the highest color change followed by Vertex SC. Mild Rebaron LC and Mild Rebaron. There were no statistical differences between Meta Base M and Vertex SC and between Mild Rebaron LC and Mild Rebaron(p>0.05). After accelerated aging test. Mild Rebaron LC showed the highest color change followed by Vertex SC, Meta Base M and Mild Rebaron. There were no statistical differences only between Mild Rebaron and Mata Base M(p>0.05) but among the others, there were statistical differences(p<0.05). Conclusion : Within the limitation of this study, all the direct denture reline resins subjected to the extrinsic and intrinsic factors showed noticible difference in color change, and there were differences among manufacturers.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.1
• /
• pp.227-235
• /
• 2015

In this paper, I propose a linear time algorithm devised to produce exact solution to NP-complete maximum clique problem. The proposed algorithm firstly, from a given graph G=(V,E), sets vertex $v_i$ of the maximum degree ${\Delta}(G)$ as clique's major vertex. It then selects vertex $v_j$ of ${\Delta}(G)$ among vertices $N_G(v_i)$ that are adjacent to $v_i$, only to determine $N_G(v_i){\cap}N_G(v_j)$ as candidate cliques w and $v_k$. Next it obtains $w=w{\cap}N_G(v_k)$ by sorting $d_G(v_k)$ in the descending order. Lastly, the algorithm executes the same procedure on $G{\backslash}w$ graph to compare newly attained cliques to previously attained cliques so as to choose the lower. With this simple method, multiple independent cliques would also be attainable. When applied to various regular and irregular graphs, the algorithm proposed in this paper has obtained exact solutions to all the given graphs linear time O(n).