• Journal of applied mathematics & informatics
• /
• 제8권2호
• /
• pp.387-401
• /
• 2001

If the distance between two vertices becomes longer after the removal of a vertex u, then u is called a hinge vertex. In this paper, a linear time sequential algorithm is presented to find all hinge vertices of an interval graph. Also, a parallel algorithm is presented which takes O(n/P + log n) time using P processors on an EREW PRAM.

• 대한전자공학회논문지
• /
• 제25권9호
• /
• pp.1081-1090
• /
• 1988

A series of procedures using image processing techniques is presented for extracting layout information fast and automatically from chip images. CIF (caltech intermediate form) is chosen for representing such information. First, line-edges are extracted using a line-edge detector. Then, thinning and noise removal procedures follow. Subsequent procedures are vertex extraction and vertex grouping. Finally, CIF is extracted from the coordinates of the grouped vertices. In this paper, the final process is applied to only metal layer. In experiments, this processing scheme is shown to be very effective in extracting CIF.

• Kyungpook Mathematical Journal
• /
• 제56권3호
• /
• pp.745-754
• /
• 2016

In a graph G = (V, E), a non-empty set $S{\subseteq}V$ is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by ${\rho}^{\circ}$. In this paper, we examine the effect of ${\rho}^{\circ}$ when G is modified by deleting a vertex.

• Journal of applied mathematics & informatics
• /
• 제42권1호
• /
• pp.77-83
• /
• 2024

Chung defined a pebbling move on a graph G as the removal of two pebbles from one vertex and the addition of one pebble to an adjacent vertex. The monophonic pebbling number guarantees that a pebble can be shifted in the chordless and the longest path possible if there are any hurdles in the process of the supply chain. For a connected graph G a monophonic path between any two vertices x and y contains no chords. The monophonic pebbling number, µ(G), is the least positive integer n such that for any distribution of µ(G) pebbles it is possible to move on G allowing one pebble to be carried to any specified but arbitrary vertex using monophonic a path by a sequence of pebbling operations. The aim of this study is to find out the monophonic pebbling numbers of the sun graphs, (C_n × P₂) + K₁ graph, the spherical graph, the anti-prism graphs, and an n-crossed prism graph.

• Journal of applied mathematics & informatics
• /
• 제37권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.

• 대한치과보철학회지
• /
• 제39권6호
• /
• pp.709-734
• /
• 2001

The aims of this experiment were to investigate the strain and temperature changes simultaneously within autopolymerzing acrylic resin specimens. A computerized data acquisition system with an electrical resistance strain gauge and a thermocouple was used over time periods up to 180 minutes. The overall strain kinetics, the effects of stress relaxation and additional heat supply during the polymerization were evaluated. Stone mold replicas with an inner butt-joint rectangular cavity ($40.0{\times}25.0mm$, 5.0mm in depth) were duplicated from a brass master mold. A strain gauge (AE-11-S50N-120-EC, CAS Inc., Korea) and a thermocouple were installed within the cavity, which had been connected to a personal computer and a precision signal conditioning amplifier (DA1600 Dynamic Strain Amplifier, CAS Inc., Korea) so that real-time recordings of both polymerization-induced strain and temperature changes were performed. After each of fresh resin mixture was poured into the mold replica, data recording was done up to 180 minutes with three-second interval. Each of two poly(methyl methacrylate) products (Duralay, Vertex) and a vinyl ethyl methacrylate product (Snap) was examined repeatedly ten times. Additionally, removal procedures were done after 15, 30 and 60 minutes from the start of mixing to evaluate the effect of stress relaxation after deflasking. Six specimens for each of nine conditions were examined. After removal from the mold, the specimen continued bench-curing up to 180 minutes. Using a waterbath (Hanau Junior Curing Unit, Model No.76-0, Teledyne Hanau, New York, U.S.A.) with its temperature control maintained at $50^{\circ}C$, heat-soaking procedures with two different durations (15 and 45 minutes) were done to evaluate the effect of additional heat supply on the strain and temperature changes within the specimen during the polymerization. Five specimens for each of six conditions were examined. Within the parameters of this study the following results were drawn: 1. The mean shrinkage strains reached $-3095{\mu}{\epsilon},\;-1796{\mu}{\epsilon}$ and $-2959{\mu}{\epsilon}$ for Duralay, Snap and Vertex, respectively. The mean maximum temperature rise reached $56.7^{\circ}C,\;41.3^{\circ}C$ and $56.1^{\circ}C$ for Duralay, Snap, and Vertex, respectively. A vinyl ethyl methacrylate product (Snap) showed significantly less polymerization shrinkage strain (p<0.01) and significantly lower maximum temperature rise (p<0.01) than the other two poly(methyl methacrylate) products (Duralay, Vertex). 2. Mean maximum shrinkage rate for each resin was calculated to $-31.8{\mu}{\epsilon}/sec,\;-15.9{\mu}{\epsilon}/sec$ and $-31.8{\mu}{\epsilon}/sec$ for Duralay, Snap and Vertex, respectively. Snap showed significantly lower maximum shrinkage rate than Duralay and Vertex (p<0.01). 3. From the second experiment, some expansion was observed immediately after removal of specimen from the mold, and the amount of expansion increased as the removal time was delayed. For each removal time, Snap showed significantly less strain changes than the other two poly(methyl methacrylate) products (p<0.05). 4. During the external heat supply for the resins, higher maximum temperature rises were found. Meanwhile, the maximum shrinkage rates were not different from those of room temperature polymerizations. 5. From the third experiment, the external heat supply for the resins during polymerization could temporarily decrease or even reverse shrinkage strains of each material. But, shrinkage re-occurred in the linear nature after completion of heat supply. 6. Linear thermal expansion coefficients obtained from the end of heat supply continuing for an additional 5 minutes, showed that Snap exhibited significantly lower values than the other two poly(methyl methacrylate) products (p<0.01). Moreover, little difference was found between the mean linear thermal expansion coefficients obtained from two different heating durations (p>0.05).

• 대한수학회지
• /
• 제44권6호
• /
• pp.1213-1231
• /
• 2007

The domination number ${\gamma}(G)$ of a graph G=(V,E) is the minimum cardinality of a subset of V such that every vertex is either in the set or is adjacent to some vertex in the set. The bondage number of b(G) of a graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than ${\gamma}(G)$. In this paper, we calculate the bondage number of the Cartesian product of cycles $C_3\;and\;C_n$ for all n.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 2001년도 The Seoul International Simulation Conference
• /
• pp.248-254
• /
• 2001

This paper presents a progressive algorithm for reconstructing a 3D structure from a given 2D sketch drawing (edge-vertex graph without hidden line removal) according to the user's sketch order. While previous methods reconstruct a 3D structure at once, the proposed method progressively calculate a 3D structure by optimizing the coordinates of vertices of an object according to the sketch order. The progressive method reconstructs the most plausible 3D object quickly by applying 3D constraints that are derived from the relationship between the object and the sketch drawing in the optimization process. The progressive reconstruction algorithm is discussed, and examples from a working implementation are given.

• 한국게임학회 논문지
• /
• 제2권2호
• /
• pp.28-36
• /
• 2002

일반적으로 삼각형 메쉬는 가상 게임 캐릭터와 같은 기하학적 객체를 모델링하기 위해 사용되고 있다. 아주 조밀한 메쉬는 복잡한 객체를 세부적으로 표현하는 장점은 있지만 객체를 저장, 전송 및 렌더링하는데 많은 비용을 요구한다. 그러므로 세밀한 객체를 질 좋게 근사시킬 수 있는 기법, 즉 삼각형 메쉬의 단순화가 연구되어왔다. 본 논문에서는 주어진 메쉬를 단순화하기 위해 사용될 수 있는 정점과 에지에 관한 근사 평균 곡률이라는 새로운 측정치를 제시한다. 에지 평균 곡률은 이웃한 에지를 고려하게 계산되고 정점 평균 곡률은 부속된 에지의 평균 곡률의 평균으로 정의된다. 그리고 제안된 측정치를 토끼, 용 및 치아와 같은 모델에 적용한다. 결과로, 제안된 평균 곡률이 주어진 모델에 더 좋은 근사를 제공하기 위한 좋은 기준치로 사용될 수 있음을 알았다.

• 정보처리학회논문지A
• /
• 제9A권4호
• /
• pp.581-588
• /
• 2002

대화적인 멀티미디어 시스템 구현에 있어, 실시간 가시화/시각화(visualization)는 중요한 기능을 한다. 된 논문은 실시간 지형 렌더링을 위한 효율적인 자료 구조와 알고리즘을 제안한다. 대개의 경우, 지형 데이터는 매우 방대한 크기를 가지고 있어서 있는 데이터를 그대로 실시간 렌더링하는 것은 불가능할 경우가 많다. 따라서 실시간 지형 렌더링에서는 LOD(Levels of Detail) 관리와 뷰 프러스텀 컬링이 핵심 사항이 된다. 본 논문은 계층적이면서도 간결한 지형 자료 구조, 신속한 뷰 프러스텀 컬링, 효율적인 LOD 구축 및 이에 기반한 렌더링 기법을 상세히 기술한다. 실험 결과, 제안된 기법은 일반 PC 사양에서 초당 22 프레임의 렌더링 속도를 보였다.