• The Journal of Korean Academy of Prosthodontics
• /
• v.40 no.5
• /
• pp.525-535
• /
• 2002

The purposes of this study were to evaluate the adherence of bacteria on various denture base resin materials and effects of chitosan, added to denture base materials on bacterial adherence. PMMA denture base resin such as heat-cured Vertex-RS, self-cured Vertex-SC and 4-META denture base resin such as heat-cured Meta-Dent, self-cured Meta-Fast were used in this study Samples were divided into two groups the denture base resin with chitosan, without chitosan Streptococcus mutans and Lactobacillus casei were used in this study. The surface of samples was observed by SEM. When chitosan was added to M17 and MRS broth, viable cell count of bacteria was reduced. Viable cell count of Streptococcus mutans on the samples decreased as follows : Meta-Dent, Vertex-SC, Meta-Fast, Vertex-RS. Viable cell count of Lactobacillus casei on the samples decreased as follows: Vertex-RS, Meta-Dent, Meta-Fast, Vertex-SC. The resin with chitosan showed lower adherence of bacteria than without chitosan. The images of SEM showed that the surface of the resin with chitosan was rougher than that of without chitosan. These results showed that the denture base resin materials with chitosan have rougher surface than without chitosan, but less bacteria adhered on them.

• Communications of the Korean Mathematical Society
• /
• v.35 no.1
• /
• pp.1-12
• /
• 2020

A pathos block line cut-vertex graph of a tree T, written P BL_c(T), is a graph whose vertices are the blocks, cut-vertices, and paths of a pathos of T, with two vertices of P BL_c(T) adjacent whenever the corresponding blocks of T have a vertex in common or the edge lies on the corresponding path of the pathos or one corresponds to a block B_i of T and the other corresponds to a cut-vertex c_j of T such that c_j is in B_i; two distinct pathos vertices P_m and P_n of P BL_c(T) are adjacent whenever the corresponding paths of the pathos P_m(v_i, v_j) and P_n(v_k, v_l) have a common vertex. We study the properties of P BL_c(T) and present the characterization of graphs whose P BL_c(T) are planar; outerplanar; maximal outerplanar; minimally nonouterplanar; eulerian; and hamiltonian. We further show that for any tree T, the crossing number of P BL_c(T) can never be one.

• The Journal of Korean Academy of Prosthodontics
• /
• v.34 no.3
• /
• pp.611-619
• /
• 1996

The purpose of this study was to evaluate the fitness of 4 kinds of resin record base materials. The record base materials used on the edentulous cast in this study were Triad VLC resin (Dentsply International Inc., U.S.A.), custom tray resin (Kerr Ltd., U.S.A.), heat-cure resin (Dentimex Co., Holland), and self-cure resin (Dentimex Co., Holland). The gap width between record base and cast were measured in the ridge crest and midpalatal area with microhardness tester. The results obtained were as follows : 1. Among the 4 kinds of record base, heat-cure Vertex fitted best on the cast. Triad and Fomatray fitted better than self-cure Vertex. Self-cure Vertex had the poorest fit. 2. The quality of the fit of the record base varied at different locations on the cast. The record base fit better in the ridge crest than midpalatal area. 3. In the midpalatal area, there's no significant difference in the fit of Fomatray, Triad and heat-cure Vertex. They all fit better than self-cure Vertex. 4. In the ridge crest, heat-cure Vertex fit better than any other record base.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.22 no.4
• /
• pp.169-180
• /
• 2019

Shorelines should be extracted with consistency because they are the reference for determining the shape of a country. Even in the same area, inconsistent minimum vertex intervals cause inconsistencies in the coastline length, making it difficult to acquire reliable primary data for national policy decisions. As the shoreline length cannot be calculated consistently for shorelines produced by determining the arbitrary distance between points below 1m, a methodology to calculate consistent shoreline length using the minimum vertex interval is proposed herein. To compare our results with the shoreline length published by KHOA(Korea Hydrographic and Oceanographic Agency) and analyze the change in shoreline length according to the minimum vertex interval, target sites was selected and the grid overlap of the shoreline was determined. Based on the comparison results, minimum grid sizes and the minimum vertex interval can be determined by deriving a polynomial function that estimates minimum grid sizes for determining consistent shoreline lengths. By comparing public shoreline lengths with generalized shoreline lengths using various grid sizes and by analyzing the characteristics of the shoreline according to vertex intervals, the minimum vertex intervals required to achieve consistent shoreline lengths could be estimated. We suggest that the minimum vertex interval methodology by quantitative evaluation of the determined grid size may be useful in calculating consistent shoreline lengths. The proposed method by minimum vertex interval determination can help derive consistent shoreline lengths and increase the reliability of national shorelines.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.2
• /
• pp.415-420
• /
• 2016

A graph G=(V,E) is called an interval graph with a set V of vertices representing intervals on a line such that there is an edge $(i,j){\in}E$ if and only if intervals i and j intersect. In this paper, we are concerned in the vertex connectivity, one of various characteristics of the graph. Specifically, the vertex connectivity of an interval graph is represented by the overlapping of intervals. Also we propose an efficient algorithm to compute the vertex connectivity on the fully dynamic environment in which the vertices or the edges are inserted or deleted. Using a special kind of interval tree, we show how to compute the vertex connectivity and to maintain the tree in O(logn) time when a new interval is added or an existing interval is deleted.

• Journal of Broadcast Engineering
• /
• v.2 no.2
• /
• pp.136-145
• /
• 1997

As a 3D mesh model consists of a lot of vertices and polygons and each vertex position is represented by three 32 bit floating-point numbers in a 3D coordinate, the amount of data needed for representing the model is very excessive. Thus, in order to store and/or transmit the 3D model efficiently, a 3D model compression is necessarily required. In this paper, a 3D model compression method using PRVQ (predictive residual vector quantization) is proposed. Its underlying idea is based on the characteristics such as high correlation between the neighboring vertex positions and the vectorial property inherent to a vertex position. Experimental results show that the proposed method obtains higher compression ratio than that of the existing methods and has the advantage of being capable of transmitting the vertex position data progressively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.451-457
• /
• 2009

Most of objects in computer graphics may be represented by a form of mesh. The exact computation of vertex normal vectors is essential for user to apply a variety of geometric operations to the mesh and get more realistic rendering results. Most of the previous algorithms used a weight which resembles a local geometric property of a vertex of a mesh such as the interior angle, the area, and so on. In this paper, we propose an efficient algorithm for computing the normal vector of a vertex in meshes. Our method uses the conformal mapping which resembles synthetically the local geometric properties, and the mean value coordinates which may smoothly represent a relationship with the adjacent vertices. It may be confirmed by experiment that the normal vector of our algorithm is more exact than that of the previous methods.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.1
• /
• pp.31-46
• /
• 2021

Let a and b be positive integers, and let V (G), ��(G), and ��2(G) be the vertex set of a graph G, the minimum degree of G, and the minimum degree sum of two non-adjacent vertices in V (G), respectively. An even [a, b]-factor of a graph G is a spanning subgraph H such that for every vertex v ∈ V (G), dH(v) is even and a ≤ dH(v) ≤ b, where dH(v) is the degree of v in H. Matsuda conjectured that if G is an n-vertex 2-edge-connected graph such that $n{\geq}2a+b+{\frac{a^2-3a}{b}}-2$, ��(G) ≥ a, and ${\sigma}_2(G){\geq}{\frac{2an}{a+b}}$, then G has an even [a, b]-factor. In this paper, we provide counterexamples, which are highly connected. Furthermore, we give sharp sufficient conditions for a graph to have an even [a, b]-factor. For even an, we conjecture a lower bound for the largest eigenvalue in an n-vertex graph to have an [a, b]-factor.

• Journal of the Korean Mathematical Society
• /
• v.59 no.4
• /
• pp.757-774
• /
• 2022

Let a and b be positive even integers. An even [a, b]-factor of a graph G is a spanning subgraph H such that for every vertex v ∈ V (G), d_H(v) is even and a ≤ dH(v) ≤ b. Let κ(G) be the minimum size of a vertex set S such that G - S is disconnected or one vertex, and let σ₂(G) = min_uv∉E(G) (d(u)+d(v)). In 2005, Matsuda proved an Ore-type condition for an n-vertex graph satisfying certain properties to guarantee the existence of an even [2, b]-factor. In this paper, we prove that for an even positive integer b with b ≥ 6, if G is an n-vertex graph such that n ≥ b + 5, κ(G) ≥ 4, and σ₂(G) ≥ ${\frac{8n}{b+4}}$, then G contains an even [4, b]-factor; each condition on n, κ(G), and σ₂(G) is sharp.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.4
• /
• pp.1169-1183
• /
• 2015

We describe generalized Cayley graphs of rectangular groups, so that we obtain (1) an equivalent condition for two Cayley graphs of a rectangular group to be isomorphic to each other, (2) a necessary and sufficient condition for a generalized Cayley graph of a rectangular group to be (strong) connected, (3) a necessary and sufficient condition for the colour-preserving automorphism group of such a graph to be vertex-transitive, and (4) a sufficient condition for the automorphism group of such a graph to be vertex-transitive.