• The Pure and Applied Mathematics
• /
• v.5 no.1
• /
• pp.65-72
• /
• 1998

We investigate a chain of properties of real function algebras along the analogous proofs of the complex cases such as the fact that any real function algebra which is both maximal and essential is pervasive. And some properties of real function algebras with a vertex property will be discussed.

• Journal of Technologic Dentistry
• /
• v.35 no.4
• /
• pp.287-293
• /
• 2013

Purpose: This study is to provide basic data of the dental acrylic denture base resin in the mechanical property difference investigation according to the monomer composition weight ratio of the acrylic denture base resin. Methods: The monomer composition of the acrylic denture base resin and weight ratio makes the different specimen. It measured the mechanical property with the specimens through Hardness Test, Tensile Test, Flexural Test, Flexural Modulus, FT-IR Test. Results: The control group Vertex was 18.4 Hv and the experimental group MED was 14.46~19.07Hv in the hardness test. Vertex was 364N, MED-3 was lowest in the tensile strength test and the Head of a family cursor declination was big. The result declination of the experimental specimens showed. Vertex and MED-2 was the highestest in the flexural test and after coming MED-6, MED-5, MED-1, MED-3, MED-4. Vertex and MED-2, as to a spectrum for $500{\sim}1800cm^{-1}$ peak can show the excellent degree of polymerization in the FT-IR Test. Conclusion: The ideal weight ratio of the monomer of the acrylic denture base resin of which the mechanical property is the highestest was MMA 100g, EDGMA 5g, DMA 0.2g, of MED-2.

• Journal of applied mathematics & informatics
• /
• v.37 no.3_4
• /
• pp.163-176
• /
• 2019

Given a distribution of pebbles on the vertices of a connected graph G, a pebbling move is defined as the removal of two pebbles from some vertex and the placement of one of those pebbles at an adjacent vertex. The t-pebbling number, $f_t(G)$, of a connected graph G, is the smallest positive integer such that from every placement of $f_t(G)$ pebbles, t pebbles can be moved to any specified vertex by a sequence of pebbling moves. A graph G has the 2t-pebbling property if for any distribution with more than $2f_t(G)$ - q pebbles, where q is the number of vertices with at least one pebble, it is possible, using the sequence of pebbling moves, to put 2t pebbles on any vertex. In this paper, we determine the t-pebbling number for the middle graph of a complete binary tree $M(B_h)$ and we show that the middle graph of a complete binary tree $M(B_h)$ satisfies the 2t-pebbling property.

• Communications of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.435-445
• /
• 2017

Let D be a directed graph with p vertices and q arcs. A vertex out-magic total labeling is a bijection f from $V(D){\cup}A(D){\rightarrow}\{1,2,{\ldots},p+q\}$ with the property that for every $v{\in}V(D)$, $f(v)+\sum_{u{\in}O(v)}f((v,u))=k$, for some constant k. Such a labeling is called a V-super vertex out-magic total labeling (V-SVOMT labeling) if $f(V(D))=\{1,2,3,{\ldots},p\}$. A digraph D is called a V-super vertex out-magic total digraph (V-SVOMT digraph) if D admits a V-SVOMT labeling. In this paper, we provide a method to find the most vital nodes in a network by introducing the above labeling and we study the basic properties of such labelings for digraphs. In particular, we completely solve the problem of finding V-SVOMT labeling of generalized de Bruijn digraphs which are used in the interconnection network topologies.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.3
• /
• pp.977-986
• /
• 2015

Let G be a graph on the vertex set $V(G)=\{x_1,{\cdots},x_n\}$ with the edge set E(G), and let $R=K[x_1,{\cdots},x_n]$ be the polynomial ring over a field K. Two monomial ideals are associated to G, the edge ideal I(G) generated by all monomials $x_i,x_j$ with $\{x_i,x_j\}{\in}E(G)$, and the vertex cover ideal $I_G$ generated by monomials ${\prod}_{x_i{\in}C}{^{x_i}}$ for all minimal vertex covers C of G. A minimal vertex cover of G is a subset $C{\subset}V(G)$ such that each edge has at least one vertex in C and no proper subset of C has the same property. Indeed, the vertex cover ideal of G is the Alexander dual of the edge ideal of G. In this paper, for an unmixed bipartite graph G we consider the lattice of vertex covers $L_G$ and we explicitly describe the minimal free resolution of the ideal associated to $L_G$ which is exactly the vertex cover ideal of G. Then we compute depth, projective dimension, regularity and extremal Betti numbers of R/I(G) in terms of the associated lattice.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.7
• /
• pp.4388-4397
• /
• 2015

The purpose of this study was to research the property change of acrylic resins depending on the induced-beam change and research the improved physical property of dry-heat and microwave-cured dental place acrylic resin in order to develop the acrylic resins with the optimum characteristic. As a result of observing flexural rigidity, hardness and color difference, the dry-heat-cured specimens of Vertex RS and Paladent 20 showed ideal property at 5, 15, and 25 kGy irradiation. The microwave-cured specimens of Vertex RS and Paladent 20 showed ideal property at 5 kGy irradiation. The correlation analysis showed a positive correlation among ARD, flexural rigidity (0 418), E coefficient (0.675) and Barcol hardness (0 588). The radiation cure technology is helpful for relieving the contamination caused by the manufacture of polymer composite. It can significantly contribute to the fusion of ultra violet cure technology and nano technology and the improvement of mechanical property without giving effect to the workability of polymer.

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

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.682-684
• /
• 2003

상호작용컴퓨터 그래픽스분야의 지배적인 역할을 하는 다각형모델의 간략화 표현을 위해서 본논문에서는 모델의 특징을 이용하고자한다. 본논문에서는 vertex clustring 알고리즘을 이용하여 다각형 메쉬모델을 간략화 한다. 이때 클러스터링하기 위한 셀의 크기를 결정하기 위하여 모델의 에지의 길이 특성을 이용하여 셀의 크기를 결정한다. 개선된 vertex clustering 방법은 기존의 방법에 비해 모델자체의 에지 특성을 이용하기 때문에 신뢰성있는 간략화를 수행할 수 있다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.4
• /
• pp.233-241
• /
• 2014

This paper suggests a fast minimum spanning tree algorithm which simplify the original graph to 2-edge connected graph, and using the cycling property. Borůvka algorithm firstly gets the partial spanning tree using cycle property for one-edge connected graph that selects the only one minimum weighted edge (e) per vertex (v). Additionally, that selects minimum weighted edge between partial spanning trees using cut property. Kruskal algorithm uses cut property for ascending ordered of all edges. Reverse-delete algorithm uses cycle property for descending ordered of all edges. Borůvka and Kruskal algorithms always perform |e| times for all edges. The proposed algorithm obtains 2-edge connected graph that selects 2 minimum weighted edges for each vertex firstly. Secondly, we use cycle property for 2-edges connected graph, and stop the algorithm until |e|=|v|-1 For actual 10 benchmark data, The proposed algorithm can be get the minimum spanning trees. Also, this algorithm reduces 60% of the trial number than Borůvka, Kruskal and Reverse-delete algorithms.