• The Journal of Advanced Prosthodontics
• /
• 제13권5호
• /
• pp.269-280
• /
• 2021

PURPOSE. The objective of this study was to evaluate the effect of thickness reduction and fatigue on the failure load of monolithic zirconia crowns. MATERIALS AND METHODS. 140 CAD-CAM fabricated crowns (3Y-TZP, inCorisTZI, Dentsply-Sirona) with different ceramic thicknesses (2.0, 1.5, 1.0, 0.8, 0.5 mm, respectively, named G2, G1.5, G1, G0.8, and G0.5) were investigated. Dies of a mandibular first molar were made of composite resin. The zirconia crowns were luted with a resin composite cement (RelyX Unicem 2 Automix, 3M ESPE). Half of the specimens (n = 14 per group) were mouth-motion-fatigued (1.2 million cycles, 1.6 Hz, 200 N/ 5 - 55℃, groups named G2-F, G1.5-F, G1-F, G0.8-F, and G0.5-F). Single-load to failure was performed using a universal testing-machine. Fracture modes were analyzed. Data were statistically analyzed using a Weibull 2-parameter distribution (90% CI) to determine the characteristic strength and Weibull modulus differences among the groups. RESULTS. Three crowns (21%) of G0.8 and five crowns (36%) of G0.5 showed cracks after fatigue. Characteristic strength was the highest for G2, followed by G1.5. Intermediate values were observed for G1 and G1-F, followed by significantly lower values for G0.8, G0.8-F, and G0.5, and the lowest for G0.5-F. Weibull modulus was the lowest for G0.8, intermediate for G0.8-F and G0.5, and significantly higher for the remaining groups. Fatigue only affected G0.5-F. CONCLUSION. Reduced crown thickness lead to reduced characteristic strength, even under failure loads that exceed physiological chewing forces. Fatigue significantly reduced the failure load of 0.5 mm monolithic 3Y-TZP crowns.

• Journal of applied mathematics & informatics
• /
• 제28권3_4호
• /
• pp.909-912
• /
• 2010

In this note we present a short proof of the following result by Zhou, Liu and Xu. Let G be a graph of order n, and let a and b be two integers with 1 $\leq$ a < b and b $\geq$ 3, and let g and f be two integer-valued functions defined on V(G) such that a $\leq$ g(x) < f(x) $\leq$ b for each $x\;{\in}\;V(G)$ and f(V(G)) - V(G) even. If $n\;{\geq}\;\frac{(a+b-1)^2+1}{a}$ and $\delta(G)\;{\geq}\;\frac{(b-1)n}{a+b-1}$,then G has a connected (g, f)-factor.

• 대한수학회지
• /
• 제48권1호
• /
• pp.105-115
• /
• 2011

Let f be a function which assigns a positive integer f(v) to each vertex v $\in$ V (G), let r, s and t be non-negative integers. An f-coloring of G is an edge-coloring of G such that each vertex v $\in$ V (G) has at most f(v) incident edges colored with the same color. The minimum number of colors needed to f-color G is called the f-chromatic index of G and denoted by ${\chi}'_f$(G). An [r, s, t; f]-coloring of a graph G is a mapping c from V(G) $\bigcup$ E(G) to the color set C = {0, 1, $\ldots$; k - 1} such that |c($v_i$) - c($v_j$ )| $\geq$ r for every two adjacent vertices $v_i$ and $v_j$, |c($e_i$ - c($e_j$)| $\geq$ s and ${\alpha}(v_i)$ $\leq$ f($v_i$) for all $v_i$ $\in$ V (G), ${\alpha}$ $\in$ C where ${\alpha}(v_i)$ denotes the number of ${\alpha}$-edges incident with the vertex $v_i$ and $e_i$, $e_j$ are edges which are incident with $v_i$ but colored with different colors, |c($e_i$)-c($v_j$)| $\geq$ t for all pairs of incident vertices and edges. The minimum k such that G has an [r, s, t; f]-coloring with k colors is defined as the [r, s, t; f]-chromatic number and denoted by ${\chi}_{r,s,t;f}$ (G). In this paper, we present some general bounds for [r, s, t; f]-coloring firstly. After that, we obtain some important properties under the restriction min{r, s, t} = 0 or min{r, s, t} = 1. Finally, we present some problems for further research.

• 한국정보처리학회논문지
• /
• 제6권8호
• /
• pp.2124-2132
• /
• 1999

Given a graph G=(V,E), Ld(2,1)-labeling of G is a function f : V(G)$\longrightarrow$[0,$\infty$) such that, if v1,v2$\in$V are adjacent, $\mid$ f(x)-f(y) $\mid$$\geq$2d, and, if the distance between and is two, $\mid$ f(x)-f(y) $\mid$$\geq$d, where dG(,v2) is shortest distance between v1 and in G. The L(2,1)-labeling number (G) is the smallest number m such that G has an L(2,1)-labeling f with maximum m of f(v) for v$\in$V. This problem has been studied by Griggs, Yeh and Sakai for the various classes of graphs. In this paper, we discuss the upper-bound of ${\lambda}$ (G) for a chordal graph G and that of ${\lambda}$(G') for a permutation graph G'.

• Journal of applied mathematics & informatics
• /
• 제27권5_6호
• /
• pp.1157-1163
• /
• 2009

Let G be a graph with vertex set V(G) and let f be a nonnegative integer-valued function defined on V(G). A spanning subgraph F of G is called a fractional f-factor if $d^h_G$(x)=f(x) for all x $\in$ for all x $\in$ V (G), where $d^h_G$ (x) = ${\Sigma}_{e{\in}E_x}$ h(e) is the fractional degree of x $\in$ V(F) with $E_x$ = {e : e = xy $\in$ E|G|}. In this paper it is proved that if ${\delta}(G){\geq}{\frac{b^2(k-1)}{a}},\;n>\frac{(a+b)(k(a+b)-2)}{a}$ and $|N_G(x_1){\cup}N_G(x_2){\cup}{\cdots}{\cup}N_G(x_k)|{\geq}\frac{bn}{a+b}$ for any independent subset ${x_1,x_2,...,x_k}$ of V(G), then G has a fractional f-factor. Where k $\geq$ 2 be a positive integer not larger than the independence number of G, a and b are integers such that 1 $\leq$ a $\leq$ f(x) $\leq$ b for every x $\in$ V(G). Furthermore, we show that the result is best possible in some sense.

• 대한수학회논문집
• /
• 제37권1호
• /
• pp.125-136
• /
• 2022

For k = 1, 2, let $f_k=h_k+{\bar{g_k}}$ be normalized harmonic right half-plane or vertical strip mappings. We consider the convex combination ${\hat{f}}={\eta}f_1+(1-{\eta})f_2={\eta}h_1+(1-{\eta})h_2+{\overline{\bar{\eta}g_1+(1-\bar{\eta})g_2}}$ and the combination ${\tilde{f}}={\eta}h_1+(1-{\eta})h_2+{\overline{{\eta}g_1+(1-{\eta})g_2}}$. For real 𝜂, the two mappings ${\hat{f}}$ and ${\tilde{f}}$ are the same. We investigate the univalence and directional convexity of ${\hat{f}}$ and ${\tilde{f}}$ for 𝜂 ∈ ℂ. Some sufficient conditions are found for convexity of the combination ${\tilde{f}}$.

• 대한수학회논문집
• /
• 제34권1호
• /
• pp.55-82
• /
• 2019

Given ${\sigma}:G{\rightarrow}G$ an involutive automorphism of a semigroup G, we study the solutions and stability of the following functional equations $$f(x{\sigma}(y))=f(x)g(y)+g(x)f(y),\;x,y{\in}G,\\f(x{\sigma}(y))=f(x)f(y)-g(x)g(y),\;x,y{\in}G$$ and $$f(x{\sigma}(y))=f(x)g(y)-g(x)f(y),\;x,y{\in}G$$, from the theory of trigonometric functional equations. (1) We determine the solutions when G is a semigroup generated by its squares. (2) We obtain the stability results for these equations, when G is an amenable group.

• 정보처리학회논문지B
• /
• 제15B권2호
• /
• pp.131-136
• /
• 2008

그래프 G = (V, E) 의 L(2,1)-labeling 이란 함수 f: V(G) $\rightarrow$ {0, 1, 2, ...} 를 정의하는 것으로서 함수 f 는 만일 G 내의 두 개 정점 u, $\upsilon$ 사이의 최단거리가 1 인 경우 $|f(u)\;-\;f(\upsilon)|\;{\geq}\;2$ 라는 조건 및 최단거리가 2 인 경우 $|f(u)\;-\;f(\upsilon)|\;{\geq}\;1$ 라는 조건을 만족시켜야 한다. ${\lambda}(G)$ 로 표기되는 G 의 L(2,1)-labeling 수는 모든 가능한 f 들 사이에서 사용된 가장 큰 정수가 가장 작은 값을 나타낸다. 상기한 문제는 NP-complete 계열의 문제이기 때문에 본 논문에서는 L(2,1)-labeling 에 적용 가능한 유전자 알고리즘을 개발한 후 개발된 알고리즘을 최적값이 알려진 그래프들에 적용하여 그 효율성을 보이고자 한다.

• 식물병연구
• /
• 제18권4호
• /
• pp.310-316
• /
• 2012

Gibberellea fujikuroi (Gf) 종복합체는 최소 15개의 종으로 구성되어 있으며, 대부분 식물에 병을 일으킬 뿐 아니라 푸모니신과 같은 곰팡이독소를 생성한다. 본 연구에서는 우리나라 벼와 옥수수로부터 분리한 Gf 종복합체 소속 야생형 균주의 푸모니신 생성능을 검정하였다. 이들 분석대상 균주는 모두 푸모니신 생합성에 필수적인 polyketide synthase 유전자 FUM1을 가지고 있는 것으로 확인되었다. 총 88주의 Gf 종복합체 소속 균주(55 F. fujikuroi, 10 F. verticillioides, 20 F. proliferatum, 2 F. subglutinans, 1 F. concentricum)와 Gf 종복합체의 근연종인 4주의 F. commune를 쌀 배지에 배양한 후 각 균주의 푸모니신 생성 농도를 HPLC 방법으로 측정하였다. 대부분의 F. verticillioides과 F. proliferatum 균주는 기주 식물에 관계없이 푸모니신 $B_1$($0.5-2,686.4{\mu}g/g$)과 $B_2$($0.7-1,497.6{\mu}g/g$)를 다양한 범위 내에서 생성하였다. 반면 모든 F. fujikuroi을 비롯한 다른 Fusarium spp.의 균주로부터는 푸모니신이 검출되지 않았거나 $10{\mu}g/g$ 이하 수준의 미량만 검출되었다. 흥미롭게도 F. proliferatum과 F. fujikuroi의 경우, 옥수수 유래 균주 집단에서 벼 유래 균주 집단에 비해 상대적으로 고농도 푸모니신 생성 균주의 비율이 높았다. 한편, FUM1 유전자를 함유하고 있는 F. commune의 푸모니신 생성능은 본 연구를 통해 처음 보고된다.

• 디지털융복합연구
• /
• 제20권2호
• /
• pp.345-351
• /
• 2022

단순 무방향 그래프 G 의 L(2,1)-coloring은 d(u,v)가 두 정점 사이의 거리일 때 두 가지 조건 (1) d(x,y) = 1 라면 |f(x)-f(y)|≥ 2, (2) d(x,y) = 2 라면 |f(x)-f(y)|≥ 1 을 만족하는 함수 f : V → [0,1,…,k]를 정의하는 것이다. 임의의 L(2,1)-coloring c 에 대하여 G 의 c-span 은 λ(c)=max{|c(u)-c(v)|| u,v∈V} 이며, L(2,1)-coloring number 인 λ(G)는 모든 가능한 c 에 대하여 λ(G) = min{λ(c)} 로 정의된다. 본 논문에서는 Harary의 정리에 기반하여 지름이 2인 그래프에 대하여 여그래프에 해밀턴 경로의 존재여부를 Tabu Search를 사용해 판단하고 이를 통해 λ(G)가 n(=|V|)과 같음을 분석한다.