• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.39 no.7
• /
• pp.729-736
• /
• 2015

In this study, the effects of specimen size and side-groove on the results of the J-R test for leak-before-break (LBB) evaluation were investigated. A series of J-R tests were conducted at both RT and $316^{\circ}C$, using three different sizes of compact tension (CT) specimens machined from SA508 Gr.1a piping material: 12.7 mm-thick 1T-CT, 25.4 mm-thick 1T-CT, and 25.4 mm-thick 2T-CT with and without side-groove. The results showed that side-grooving reduced the J-R curve for all specimens and the effect of side-grooving was more significant at $316^{\circ}C$ than at RT. As the thickness of the specimens decreased and the width of the specimens increased, the J-R curve slightly decreased at RT but it increased at $316^{\circ}C$. However, the variation in the J-R curve of SA508 Gr.1a with the thickness and width of CT specimen was insignificant.

• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.1
• /
• pp.49-57
• /
• 2010

It is shown that for a derivation $$f(x_1{\cdots}x_{j-1}x_jx_{j+1}{\cdots}x_k)=\sum_{j=1}^{k}x_{1}{\cdots}x_{j-1}x_{j+1}{\cdots}x_kf(x_j)$$ on a unital $C^*$-algebra $\mathcal{B}$, there exists a unique $\mathbb{C}$-linear *-derivation $D:{\mathcal{B}}{\rightarrow}{\mathcal{B}}$ near the derivation, by using the Hyers-Ulam-Rassias stability of functional equations. The concept of Hyers-Ulam-Rassias stability originated from the Th.M. Rassias' stability theorem that appeared in his paper: On the stability of the linear mapping in Banach spaces, Proc. Amer. Math. Soc. 72 (1978), 297-300.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.3
• /
• pp.185-191
• /
• 2022

This paper proposed a division algorithm of performance complexity $O{\frac{n(n+1)}{2}}$ for a change-making problem(CMP) in which polynomial time algorithms are not known as NP-hard problem. CMP seeks to minimize the sum of the x_j number of coins exchanged when a given amount of money C is exchanged for c_j,j=1,2,⋯,n coins. Known polynomial algorithms for CMPs are greedy algorithms(GA), divide-and-conquer (DC), and dynamic programming(DP). The optimal solution can be obtained by DP of O(nC), and in general, when given C>2ⁿ, the performance complexity tends to increase exponentially, so it cannot be called a polynomial algorithm. This paper proposes a simple algorithm that calculates quotient by dividing upper triangular matrices and main diagonal for k×n matrices in which only j columns are placed in descending order of c_j of n for c_j ≤ C and i rows are placed k excluding all the dividers in c_j. The application of the proposed algorithm to 39 benchmarking experimental data of various types showed that the optimal solution could be obtained quickly and accurately with only a calculator.

• Proceedings of the KWS Conference
• /
• 2001.05a
• /
• pp.228-231
• /
• 2001

Elastic-plastic fracture toughness $J_{1c}$ can be used as an effective design criterion in elastic plastic fracture mechanics. Most of these systems are operated at high temperature and $J_{1c}$ values are affected by temperature. therefore, the $J_{1c}$ valuse at high temperature must be determined for use of integrity evaluation and designing of such systems. Elastic-plastic fracture toughness $J_{1c}$ tests were performed on SA516 carbon steel plate and test results were analyzed according to ASTM E 813-8, ASTM 1813-89. Safety and integrity are required for reactor pressure vessels vecause pthey are operated in high temperature. there are single specimen method, which used as evaluation of safety and integrity for reactor pressure vessels. In this study, elastic-plastic fracture toughness$(J_{1c})$ and $J-\Delta{a}$ of SA 516/70 steel used as reactor pressure vessel steel are measured and evaluated at room Temperature, $150^{\circ}C$, $250^{\circ}C$ and $370^{\circ}C$ according to unloading compliance method.

• Korean Journal of Mathematics
• /
• v.22 no.1
• /
• pp.91-121
• /
• 2014

Let X and Y be vector spaces. It is shown that a mapping $f:X{\rightarrow}Y$ satisfies the functional equation ${\ddag}$ $$2df(\frac{x_1+{\sum}_{j=2}^{2d}(-1)^jx_j}{2d})-2df(\frac{x_1+{\sum}_{j=2}^{2d}(-1)^{j+1}x_j}{2d})=2\sum_{j=2}^{2d}(-1)^jf(x_j)$$ if and only if the mapping $f:X{\rightarrow}Y$ is additive, and prove the Cauchy-Rassias stability of the functional equation (${\ddag}$) in Banach modules over a unital $C^*$-algebra, and in Poisson Banach modules over a unital Poisson $C^*$-algebra. Let $\mathcal{A}$ and $\mathcal{B}$ be unital $C^*$-algebras, Poisson $C^*$-algebras, Poisson $JC^*$-algebras or Lie $JC^*$-algebras. As an application, we show that every almost homomorphism $h:\mathcal{A}{\rightarrow}\mathcal{B}$ of $\mathcal{A}$ into $\mathcal{B}$ is a homomorphism when $h(d^nuy)=h(d^nu)h(y)$ or $h(d^nu{\circ}y)=h(d^nu){\circ}h(y)$ for all unitaries $u{\in}\mathcal{A}$, all $y{\in}\mathcal{A}$, and n = 0, 1, 2, ${\cdots}$. Moreover, we prove the Cauchy-Rassias stability of homomorphisms in $C^*$-algebras, Poisson $C^*$-algebras, Poisson $JC^*$-algebras or Lie $JC^*$-algebras, and of Lie $JC^*$-algebra derivations in Lie $JC^*$-algebras.

• Korean Journal of Animal Reproduction
• /
• v.27 no.1
• /
• pp.69-75
• /
• 2003

The objective of this study is to improve the efficiency of embryo transfer in generation of transgenic mice using inbred mouse (C57BL/6J) embryos. The embryos of C57BL/6J and BCF1 mice were superovulated by the standard protocol. One-cell stage of embryos were microinjected and the resulted one-or two-cell were transferred into one-or two-side oviducts of foster mother, respectively. When one-cell stage of embryos were transferred into one-side oviduct of 0.75 d.p.c. foster mother, the results were not ideal because of showing pregnancy ratios of 68.8$\pm$7.83% for C57BL/6J and 48.3$\pm$14.22% for BCF1, and development ratios of pups vs transferred embryos of 11.9$\pm$5.51% for C57BL/6J and 10.5$\pm$8.03% fur BCF1 . However, when two-cell stage of embryos were transferred into two-side oviducts of 0.5 d.p.c. foster mother, we got better results of 94.4$\pm$9.64% and 100$\pm$0% pregnancy ratio, and 22.1$\pm$0.4% and 21.8$\pm$0.38% development ratio for C57BL/6J and BCF1, respectively. Therefore, transferring two-cell stage of C57BL/6J embryos into two-side oviducts of 0.5 d.p.c. foster mother may be competitive to the result in BCF1 embryos. Even if there are a lot of other factors affecting these results, we conclude from these experiments that transfer of two-cell embryos into two-side oviducts of 0.5 d.p.c. foster mother is a more efficient and safe method than others in generating transgenic mice using inbred mice embryos.

• Journal of Biosystems Engineering
• /
• v.31 no.3 s.116
• /
• pp.168-174
• /
• 2006

The purpose of this study is to develop the cold chain system by developing optimal phase change materials (PCM). There are some benefits from developing this system such as keeping freshness of agriculture products, saving energy, etc. The major results are as follows. To decide a latent heat material, the characteristics of water, sodium, polyacrylate, ethanol and N-tetradecane are analysed. Also, an insulating material is made by mixing water, nucleating agent and latent heat material, using cementing method. In addition, the sensitivity analysis for developed latent heat material($K_l,\;K_2,\;K_3$) is conducted. For $K_l,\;K_2,\;K_3$ which cans keep latent heat temperature, ranging from $0\;to\;5^{\circ}C,\;5\;to\;10^{\circ}C,\;10\;to\;15^{\circ}C$. it can keeps latent heat temperature at radiant heat (5, 12, $17^{\circ}C$) and transportation latent heat container both melting temperature and amount of latent heat of Kl are $-1.6{\pm}1.0^{\circ}C$, 326.51 J/g, respectively and freezing temperature and latent heat are $-7.98{\pm}1.5^{\circ}C$ and 174.18 J/g. and $K_2$ are $7.41{\pm}1.5^{\circ}C$, 89.80 J/g, respectively and freezing temperature and latent heat are $-2.14{\pm}1.5^{\circ}C$ and 83.90 J/g. and $K_3$ are $9.54{\pm}1.0^{\circ}C$, 145.42 J/g, respectively and freezing temperature and latent heat are $0.21{\pm}1.0^{\circ}C$ and 152.48 J/g.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.2
• /
• pp.311-319
• /
• 2009

Let H be a Hilbert space which is the direct sum of five closed subspaces $X_0,\;X_1,\;X_2,\;X_3$ and $X_4$ with $X_1,\;X_2,\;X_3$ of finite dimension. Let J be a $C^{1,1}$ functional defined on H with J(0) = 0. We show the existence of at least four nontrivial critical points when the sublevels of J (the torus with three holes and sphere) link and the functional J satisfies sup-inf variational inequality on the linking subspaces, and the functional J satisfies $(P.S.)^*_c$ condition and $f|X_0{\otimes}X_4$ has no critical point with level c. For the proof of main theorem we use the nonsmooth version of the classical deformation lemma and the limit relative category theory.

• Communications of the Korean Mathematical Society
• /
• v.32 no.4
• /
• pp.959-970
• /
• 2017

In this paper, we investigate the transcendental meromorphic solutions with finite order of two different types of difference equations $${\sum\limits_{j=1}^{n}}a_jf(z+c_j)={\frac{P(z,f)}{Q(z,f)}}={\frac{{\sum_{k=0}^{p}}b_kf^k}{{\sum_{l=0}^{q}}d_lf^l}}$$ and $${\prod\limits_{j=1}^{n}}f(z+c_j)={\frac{P(z,f)}{Q(z,f)}={\frac{{\sum_{k=0}^{p}}b_kf^k}{{\sum_{l=0}^{q}}d_lf^l}}$$ that share three distinct values with another meromorphic function. Here $a_j$, $b_k$, $d_l$ are small functions of f and $a_j{\not{\equiv}}(j=1,2,{\ldots},n)$, $b_p{\not{\equiv}}0$, $d_q{\not{\equiv}}0$. $c_j{\neq}0$ are pairwise distinct constants. p, q, n are non-negative integers. P(z, f) and Q(z, f) are two mutually prime polynomials in f.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.149-154
• /
• 2015

In this paper proposes a stable marriage algorithm. The proposed algorithm firstly constructs an $n{\times}n$ matrix of men's and women's sum preference over opposite sex $p_{ij}$. It then repeatedly deletes row or column corresponding to the then maximum dispreference sum $_{max}p_{ij}$ until ${\forall}(|r_i|=1{\cap}|c_j|=1)$. If $|r_i|=1$ or $|c_j|=1$ then we select the $p_{ij}$ of $|r_i|=1$ or $|c_j|=1$ then the row or column values are deleted repeatedly until ${\forall}(|r_i|=1{\cap}|c_j|=1)$. When tested on 7 stable marriage problems, the proposed algorithm has proved to improve on the existing solutions.