• Nuclear Engineering and Technology
• /
• v.38 no.7
• /
• pp.639-656
• /
• 2006

In order to apply the leak before break (LBB) concept to nuclear piping systems, the dynamic strain aging effect of low carbon steel materials has to be taken into account, in compliance with the requirements of the Korean Standard Review Guide (KSRG) 3.6.3-1. For this goal, J-R tests are needed for a range of various temperatures and loading rates, including dynamic loading conditions. In the dynamic loading J-R test, the unloading compliance method can not be applied to measure the crack growth and direct current potential drop (DCPD) method; this method also has a problem defining the crack initiation point. The normalization method is known as a very useful method to determine the J-R curve under dynamic loading because it does not need additional equipment or complicated loading sequences such as electric current or unloading. This method was accepted by the American Society for Testing and Materials (ASTM) as a standard test method E1820 A15 in 2001. However, it has not yet been clearly verified yet if the normalization method is sufficiently reliable to be applied to LBB. In this study, the basic background of the J-integral, LBB and dynamic loading J-R test are explained, and the current status for dynamic loading J-R test methods are reviewed from the view point of LBB for nuclear piping. In particular, the theoretical and historical background of the normalization method which has received attention recently, is summarized. Recent studies for this method are introduced and future works are suggested that may improve the reliability of LBB for nuclear piping.

• Korean Journal of Mathematics
• /
• v.19 no.4
• /
• pp.403-407
• /
• 2011

In this paper, we study Noetherian Boolean rings. We show that if R is a Noetherian Boolean ring, then R is finite and $R{\simeq}(\mathbb{Z}_2)^n$ for some integer $n{\geq}1$. If R is a Noetherian ring, then R/J is a Noetherian Boolean ring, where J is the intersection of all ideals I of R with |R/I| = 2. Thus R/J is finite, and hence the set of ideals I of R with |R/I| = 2 is finite. We also give a short proof of Hayes's result : For every polynomial $f(x){\in}\mathbb{Z}[x]$ of degree $n{\geq}1$, there are irreducible polynomials $g(x)$ and $h(x)$, each of degree $n$, such that $g(x)+h(x)=f(x)$.

• Bulletin of the Korean Mathematical Society
• /
• v.40 no.1
• /
• pp.29-51
• /
• 2003

In this paper we construct a natural filtration associated to the plethysm $S_{r}(\wedge^2 \varphi)$ over arbitrary commutative ring R. Let $\phi$ : G longrightarrow F be a morphism of finite free R-modules. We construct the natural filtration of $S_{r}(\wedge^2 \varphi)$ as a $GL(F){\times}GL(G)$- complex such that its associated graded complex is ${\Sigma}_{{\lambda}{\in}{\Omega}_{\gamma}}=L_{2{\lambda}{\varphi}$, where ${{\Omega}_{\gamma}}^{-}$ is a set of partitions such that $│\wedge│\;=;{\gamma}\;and\;2{\wedge}$ is a partition of which i-th term is $2{\wedge}_{i}$. Specializing our result, we obtain the filtrations of $S_{r}(\wedge^2 F)\;and\;D_{r}(D_2G).

• 한국정보디스플레이학회:학술대회논문집
• /
• 2005.07a
• /
• pp.285-288
• /
• 2005

A 2.8 inch fully integrated SOP employing a high performance LTPS CMOS TFT technology has been developed for mobile display applications. The LCD module is directly interfaced with 3V 6-bit RGB source via timing control circuitry. The integrated data driver comprises a 6-bit hybrid type DAC with low power analog buffer.

• Korean Journal of Mathematics
• /
• v.12 no.1
• /
• pp.15-22
• /
• 2004

In this paper we establish some recurrence relations satisfied by quotient moments of upper record values from the power distribution. Let {$X_n$, $n{\geq}1$} be a sequence of independent an identically distributed random variables with a common continuous distribution function(cdf) $F(x)$ and probability density function(pdf) $f(x)$. Let $Y_n=max\{X_1,X_2,{\cdots},X_n\}$ for $n{\geq}1$. We say $X_j$ is an upper record value of {$X_n$, $n{\geq}1$}, if $Y_j$ > $Y_{j-1}$, $j$ > 1. The indices at which the upper record values occur are given by the record times {$u(n)$}, $n{\geq}1$, where $u(n)=min\{j{\mid}j>u(n-1),X_j>X_{u(n-1)},n{\geq}2\}$ and $u(1)=1$. Suppose $X{\in}POW(0,1,{\theta})$ then $$E\left(\frac{X^r_{u(m)}}{X^{s+1}_{u(n)}}\right)=\frac{\theta}{s}E\left(\frac{X^r_{u(m)}}{X^s_{u(n-1)}}\right)+\frac{(s-\theta)}{s}E\left(\frac{X^r_{u(m)}}{X^s_{u(n)}\right)\;and\;E\left(\frac{X^{r+1}_{u(m)}}{X^s_{u(n)}}\right)=\frac{\theta}{n+1}\left[E\left(\frac{X^{r+1}_{u(m-1)}}{X^s_{u(n+1)}}\right)-E\left(\frac{X^{r+1}_{u(m)}}{X^s_{u(n-1)}}\right)+\frac{r+1}{\theta}E\left(\frac{X^r_{u(m)}}{X^s_{u(n)}}\right)\right]$$.

• Journal of the Korean Mathematical Society
• /
• v.48 no.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.

• Proceedings of the Materials Research Society of Korea Conference
• /
• 1998.08a
• /
• pp.99.1-99
• /
• 1998

• Communications for Statistical Applications and Methods
• /
• v.1 no.1
• /
• pp.149-156
• /
• 1994

For an r > 2 and a finite B, $E\mid max \;1\leq k\leq n \;\sum\limits_{j=m+1}^{m+k}X_j\mid^r\leq Bn^ {\frac{r}{2}}$ (all $n\geq 1$) is obtained for a negatively associated sequence $\{X_j \;:\; j\in N\}$. We also derive the maximal inequelity for a negatively associated sequence. Stationarity is not required.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2006.10a
• /
• pp.611-612
• /
• 2006

• Communications of the Korean Mathematical Society
• /
• v.9 no.2
• /
• pp.279-284
• /
• 1994

Let R = ($r_1$, $r_2$, …, $r_{m}$) and S = ($s_1$, $s_2$, …, $s_{n}$ ) be positive integral vectors satisfying $r_1$＋ $r_2$＋…＋ $r_{m}$ = $s_1$＋ $s_2$＋ㆍㆍㆍ＋ $s_{n}$ , and let U(R, S) denote the class of all m $\times$ n matrices A = [$_a{ij}$ ] where $a_{ij}$ = 0 or 1 such that (equation omitted) = $r_{i}$ , (equation omitted) = $s_{j}$ , i = 1, ㆍㆍㆍ, m, j = 1, ㆍㆍㆍ, n.(omitted)