• Korean Journal of Ichthyology
• /
• v.8 no.1
• /
• pp.49-55
• /
• 1996

The growth of total length(TL), total weight(TW) and somatic weight(SW) of rainbow trout, Oncorhynchus mykiss alevin at yolk absorption period was expressed by the Gompertz growth model as $TLt=2.7e^{-1.24{\cdot}e^{-0.11t}}(r^{2}=0.66)$, $TWt=1.8e^{-2.03{\cdot}e^{-0.11t}}(r^{2}=0.66)$ and $SWt=1.8e^{-5.41{\cdot}e^{-0.13t}}(r^{2}=0.83)$ respectively. Yolk length, yolk height and yolk volume of rainbow trout decreased linearly. The relative growth of total weight-total length, somatic weight-total length, yolk length-total length, yolk height-total length, yolk volume-total length, yolk weight-total length, yolk weight-total weight, yolk weight-yolk height and yolk weight-yolk length at yolk absorption period revealed the pattern of yolk absorption in rainbow trout.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.3
• /
• pp.711-720
• /
• 2021

Let R denote a commutative noetherian ring, and let 𝐱 := x1, …, xd be an R-regular sequence. Suppose that 𝖆 denotes a monomial ideal with respect to 𝐱. The first purpose of this article is to show that 𝖆 is irreducible if and only if 𝖆 is a generalized-parametric ideal. Next, it is shown that, for any integer n ≥ 1, (x1, …, xd)n = ⋂P(f), where the intersection (irredundant) is taken over all monomials f = xe11 ⋯ xedd such that deg(f) = n - 1 and P(f) := (xe1+11, ⋯, xed+1d). The second main result of this paper shows that if 𝖖 := (𝐱) is a prime ideal of R which is contained in the Jacobson radical of R and R is 𝖖-adically complete, then 𝖆 is a parameter ideal if and only if 𝖆 is a monomial irreducible ideal and Rad(𝖆) = 𝖖. In addition, if a is generated by monomials m1, …, mr, then Rad(𝖆), the radical of a, is also monomial and Rad(𝖆) = (ω1, …, ωr), where ωi = rad(mi) for all i = 1, …, r.

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.413-420
• /
• 2005

The Newton-Raphson iterative algorithm for finding a floating point reciprocal square mot calculates it by performing a fixed number of multiplications. In this paper, a variable latency Newton-Raphson's reciprocal square root algorithm is proposed that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the rediprocal square root of a floating point number F, the algorithm repeats the following operations: '$X_{i+1}=\frac{{X_i}(3-e_r-{FX_i}^2)}{2}$, $i\in{0,1,2,{\ldots}n-1}$' with the initial value is '$X_0=\frac{1}{\sqrt{F}}{\pm}e_0$'. The bits to the right of p fractional bits in intermediate multiplication results are truncated and this truncation error is less than '$e_r=2^{-p}$'. The value of p is 28 for the single precision floating point, and 58 for the double precision floating point. Let '$X_i=\frac{1}{\sqrt{F}}{\pm}e_i$, there is '$X_{i+1}=\frac{1}{\sqrt{F}}-e_{i+1}$, where '$e_{i+1}{<}\frac{3{\sqrt{F}}{{e_i}^2}}{2}{\mp}\frac{{Fe_i}^3}{2}+2e_r$'. If '$|\frac{\sqrt{3-e_r-{FX_i}^2}}{2}-1|<2^{\frac{\sqrt{-p}{2}}}$' is true, '$e_{i+1}<8e_r$' is less than the smallest number which is representable by floating point number. So, $X_{i+1}$ is approximate to '$\frac{1}{\sqrt{F}}$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications Per an operation is derived from many reciprocal square root tables ($X_0=\frac{1}{\sqrt{F}}{\pm}e_0$) with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a reciprocal square root unit. Also, it can be used to construct optimized approximate reciprocal square root tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc.

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

• Journal of Sericultural and Entomological Science
• /
• v.45 no.1
• /
• pp.25-30
• /
• 2003

This study was carried out to investigate active constituents of Bombysis corpus on the neurite outgrowth from PC 12 cells led to isolate three new and a known sphingolipids from the n-hexane soluble portion and five amines from the butanol soluble portion of its methanol extract. On the basis of spectroscopic data, their structures have been elucidated as (4E,6E,2S,3R)-2-N-eicosanoyl-4,6-tetradecasphingadienine, (4E,2S,3R)-2-N-eicosanoyl-4-tetradecasphingenine,(4E,6E,2S,3R)-2-N-docosanoyl-4,6-tetradecasphingadienine,(4E,6E,2S,3R)-2-N-docosanoyl-4,6-tetradecasphingadienine,(4E,2S,3R)-2-N-octadecanoyl-4-tetradecasphingenine, 1,7-dimethyl-xanthine, uracil, urea, betaine and tyrosine, respectively. The neurite outgrowth activities of these compounds were examined in PC12 cells by measuring the length of neurites. These compounds promoted neurite outgrowth in PC12 cells significantly.

• Proceedings of the Korean Society of Applied Pharmacology
• /
• 1995.10a
• /
• pp.107-113
• /
• 1995

Basement membrane laminin is a multidomain glycoprotein that interacts with itself, heparin and cells. The distal long arm plays major cell and heparin interactive roles. The long arm consists of three subunits (A, B1, B2) joined in a coiled-coil rod attached to a terminal A chain globule (G). The globule is in turn subdivided into five subdomains (Gl-5). In order to analyze the functions of this region, recombinant G domains (rG, rAiG, rG5, rGΔ2980-3028) were expressed in Sf9 insect cells using a baculovirus expression vector. A hybrid molecule (B-rAiG), consisting of recombinant A chain(rAiG) and the authentic B chains (E8-B)was assembled in vitro. The intercalation of rAiG into E8-B chains suppressed a heparin binding activity identified in subdomain Gl-2. By the peptide napping and ligand blotting, the relative affinity of each subeomain to heparin was assigned as Gl> G2= G4> G5> G3, such that G1 bound strongly and G3 not at all. The active heparin binding site of G domain in intact laminin appears to be located in G4 and proximal G5. Cell binding was examined using fibrosarcoma Cells. Cells adhered to E8, B-rAiG, rAiG and rG, did not bind on denatured substrates, poorly bound to the mixture of E8-B and rG. Anti-${\alpha}$6 and anti-${\beta}$1 integrin subunit separately blocked cell adhesion on E8 and B-rAiG, but not on rAiG. Heparin inhibited cell adhesion on rAiG, partially on B-rAiG, and not on E8. In conclusion, 1) There are active and cryptic cell and heparin binding activities in G domain. 2) Triple-helix assembly inactivates cell and heparin binding activities and restores u6131 dependent cell binding activities.

• Korean Journal of Veterinary Research
• /
• v.43 no.1
• /
• pp.139-144
• /
• 2003

A chitinase cDNA named CHT1 was cloned from the hard tick, Haemaphysalis longicornis, and the enzymatic properties of its recombinant proteins were characterized. The CHT1 cDNA encodes 930 amino-acid (aa) residues including a 22 aa putative signal peptide, with the calculated molecular mass of the putative mature protein 104 kDa. The E coli-expressed rCHT1 exhibited weak chitinolytic activity against $4MU-(GlcNAc)_3$. The rCHT1 protein with higher activity was obtained using recombinant Autographa californica multiple nuclear polyhedrosis virus (AcMNPV), which expresses rCHT1 under polyhedrin promoter. These findings suggest that the rCHT1 expressed in baculovirus-mediated Sf 9 cells has a high activity than E coli-expressed rCHT1.

• Journal of the Korean Mathematical Society
• /
• v.51 no.3
• /
• pp.463-472
• /
• 2014

Let R be a ring with identity 1, I(R) be the set of all nonunit idempotents in R and $S_{\ell}$(R) (resp. $S_r$(R)) be the set of all left (resp. right) semicentral idempotents in R. In this paper, the following are investigated: (1) $e{\in}S_{\ell}(R)$ (resp. $e{\in}S_r(R)$) if and only if re=ere (resp. er=ere) for all nilpotent elements $r{\in}R$ if and only if $fe{\in}I(R)$ (resp. $ef{\in}I(R)$) for all $f{\in}I(R)$ if and only if fe=efe (resp. ef=efe) for all $f{\in}I(R)$ if and only if fe=efe (resp. ef=efe) for all $f{\in}I(R)$ which are isomorphic to e if and only if $(fe)^n=(efe)^n$ (resp. $(ef)^n=(efe)^n$) for all $f{\in}I(R)$ which are isomorphic to e where n is some positive integer; (2) For a ring R having a complete set of centrally primitive idempotents, every nonzero left (resp. right) semicentral idempotent is a finite sum of orthogonal left (resp. right) semicentral primitive idempotents, and eRe has also a complete set of primitive idempotents for any $0{\neq}e{\in}S_{\ell}(R)$ (resp. 0$0{\neq}e{\in}S_r(R)$).

• Honam Mathematical Journal
• /
• v.31 no.3
• /
• pp.369-380
• /
• 2009

Let $X,X_1,X_2,\;{\cdots}$ be identically distributed and negatively associated random variables with mean zeros and positive, finite variances. We prove that, if $E{\mid}X_1{\mid}^r$ < ${\infty}$, for 1 < p < 2 and r > $1+{\frac{p}{2}}$, and $lim_{n{\rightarrow}{\infty}}n^{-1}ES^2_n={\sigma}^2$ < ${\infty}$, then $lim_{{\epsilon}{\downarrow}0}{\epsilon}^{{2(r-p}/(2-p)-1}{\sum}^{\infty}_{n=1}n^{{\frac{r}{p}}-2-{\frac{1}{p}}}E\{{{\mid}S_n{\mid}}-{\epsilon}n^{\frac{1}{p}}\}+={\frac{p(2-p)}{(r-p)(2r-p-2)}}E{\mid}Z{\mid}^{\frac{2(r-p)}{2-p}}$, where $S_n\;=\;X_1\;+\;X_2\;+\;{\cdots}\;+\;X_n$ and Z has a normal distribution with mean 0 and variance ${\sigma}^2$.

• The KIPS Transactions:PartA
• /
• v.12A no.2 s.92
• /
• pp.95-102
• /
• 2005

The Newton-Raphson iterative algorithm for finding a floating point reciprocal which is widely used for a floating point division, calculates the reciprocal by performing a fixed number of multiplications. In this paper, a variable latency Newton-Raphson's reciprocal algorithm is proposed that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the reciprocal of a floating point number F, the algorithm repeats the following operations: '$'X_{i+1}=X=X_i*(2-e_r-F*X_i),\;i\in\{0,\;1,\;2,...n-1\}'$ with the initial value $'X_0=\frac{1}{F}{\pm}e_0'$. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than $'e_r=2^{-p}'$. The value of p is 27 for the single precision floating point, and 57 for the double precision floating point. Let $'X_i=\frac{1}{F}+e_i{'}$, these is $'X_{i+1}=\frac{1}{F}-e_{i+1},\;where\;{'}e_{i+1}, is less than the smallest number which is representable by floating point number. So, $X_{i+1}$ is approximate to $'\frac{1}{F}{'}$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal tables $(X_0=\frac{1}{F}{\pm}e_0)$ with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a reciprocal unit. Also, it can be used to construct optimized approximate reciprocal tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia scientific computing, etc.