• Korean Journal of Community Nutrition
• /
• v.4 no.1
• /
• pp.103-110
• /
• 1999

The purpose of this study was to determine the effects of taurine supplementation and taurine depletion on blood glucose and blood lipid concentrations in insulin-treated diabetic rats. Four groups of Sprague-Dawley male rats were fed the purified diet for 3 weeks ; nontaurine-supplemented diabetic rats(E0), nontaurine-supplemented diabetic rats with insulin treatment(E0＋I), 1% taurine-supplemented diabetic rats with insulin treatment(E1＋I) and taurine-depleted diabetic rats with insulin treatment(EA＋I). Diabetes was induced by streptozotocin injection(50mg/kg B.W.). Isophane insulin was given subcutaneously into the abdominal wall of the diabetic rats(4 unit/rat/day). E1＋I were supplemented with 1% taurine in drinking water. To induce taurine depletion, EA＋I were treated with 5% $\beta$-alanine in drinking water. E1＋I had significantly higher body weight compared to that of E0. The food intakes of E1＋I and E0＋I were significantly decreased compared to that of E0. There was no sigfniciant difference in food intake between E1＋I and E0＋I. The water intake of rats was significantly different among the groups ; E0>E0＋I>E1＋I>EA＋I. The urine volume of E0 was significantly increased compared to those of insulin-treated goups. The blood glucose concentration of E0 was significantly increased compared to those of insulin-treated groups. In the oral glucose tolerance test(OGTT), E0＋I and E1＋I had significantly lower blood blucose concentrations compared to E0 after 30 min. Also EA＋I had significantly lower bloodglucose concentrtion compared to E0 and E0＋I. The plasma total cholesterol and LDL-cholesterol concentratons of EA＋I were significantly incrased compared to those of other groups. Therefore, it may be suggested that tuarine supplementation is useful for insulin-dependent diabetes in order to prevent diabetic complications suchas cardiac vascular diseases.

• Journal of Life Science
• /
• v.7 no.4
• /
• pp.253-261
• /
• 1997

In order to enhance glutathione production, various recombinant plasmids containing gshI and/or gshII genes isolated from E. coli K-12 were constructed and introduced into E. coli. Some plasmids contained one to three copies of gshI genes in pBR325 and others contained both gshI and genes for glutathione biosynthesis. $\gamma$-Glutamylcysteine synthetase activities of E, coli strains amplified tandem repeated gshI genes were dependent on the number of inserted gshI genes. The glutathione productivity of E. coli strains harboring various plasmids was investigated using an E. coli acetate kinase reaction as an ATP regenerating system. The glutathione productivity of E. coli strains harboring tandem repeated gshI genes was increased in proportion to the number of inserted gshI genes. By the introduction of gshII gene, the glutathione productivity of the E. coli was increased by two-fold compared with E. coli strain amplified gshI gene only. The enzymatic production of glytathione in E. coli was mainly affected by the increase of $\gamma$-glutamylcysteine synthetase activity. The highest glutathione productivity was obtained in E. coli strains harboring pGH-501 plasmid containing two copies of gshI and copy of gshII genes in pUC8 vector.

• Kyungpook Mathematical Journal
• /
• v.45 no.2
• /
• pp.293-299
• /
• 2005

Let ${\cal{L}}$ be a commutative subspace lattice on a Hilbert space ${\cal{H}}$ and X and Y be operators on ${\cal{H}}$. Let $${\cal{M}}_X=\{{\sum}{\limits_{i=1}^n}E_{i}Xf_{i}:n{\in}{\mathbb{N}},f_{i}{\in}{\cal{H}}\;and\;E_{i}{\in}{\cal{L}}\}$$ and $${\cal{M}}_Y=\{{\sum}{\limits_{i=1}^n}E_{i}Yf_{i}:n{\in}{\mathbb{N}},f_{i}{\in}{\cal{H}}\;and\;E_{i}{\in}{\cal{L}}\}.$$ Then the following are equivalent. (i) There is an operator A in $Alg{\cal{L}}$ such that AX = Y, Ag = 0 for all g in ${\overline{{\cal{M}}_X}}^{\bot},A^*A=AA^*$ and every E in ${\cal{L}}$ reduces A. (ii) ${\sup}\;\{K(E, f)\;:\;n\;{\in}\;{\mathbb{N}},f_i\;{\in}\;{\cal{H}}\;and\;E_i\;{\in}\;{\cal{L}}\}\;<\;\infty,\;{\overline{{\cal{M}}_Y}}\;{\subset}\;{\overline{{\cal{M}}_X}}$and there is an operator T acting on ${\cal{H}}$ such that ${\langle}EX\;f,Tg{\rangle}={\langle}EY\;f,Xg{\rangle}$ and ${\langle}ET\;f,Tg{\rangle}={\langle}EY\;f,Yg{\rangle}$ for all f, g in ${\cal{H}}$ and E in ${\cal{L}}$, where $K(E,\;f)\;=\;{\parallel}{\sum{\array}{n\\i=1}}\;E_{i}Y\;f_{i}{\parallel}/{\parallel}{\sum{\array}{n\\i=1}}\;E_{i}Xf_{i}{\parallel}$.

• Journal of Plant Biology
• /
• v.29 no.1
• /
• pp.53-65
• /
• 1986

The montane forests of Ulreung Island, Korea, were investigated by the ZM school method. By comparing the montane forests of this island with those of Korean Peninsula and of Japan, a new order, F a g e t a l i a m u l t i n e r v i s, a new alliance, F a l g i o n m u l t i n e r v i s, a new association, H e p a t i c o-F a g e t u m m u l t i n e r v i s and Rhododendron brachycarpum-Pinus parviflora community were recognized. The H e p a t i c o - F a g e t u m m u l t i n e r v i s was further subdivided into four subassociations; Subass. of Sasa kurilensis, Subass. of Rumohra standishii, Subass. of Rhododendron brachycarpum and Subass. of typicum. Each community was described in terms of floristic, structural and environmental features.

• Lettere Italiane
• /
• no.26
• /
• pp.175-231
• /
• 2009

Questa tesi tratta di due aspetti. Primo, i giullari erano coloro che hanno fatto la satira sulle contraddizioni della societa medievale quasisempre da soli. Gli oggetti della satira erano in gran parte la classe dominate e gli ecclesiastici. Particolarmente chi governa, opprime e sfrutta il popolo come i padroni, i ricchi, gli aristocratici, i mercanti, i re, i sindaci, i militari, e chi rappresenta i sovrani come il papa, i vescovi, e i cardinali. Anche la satira del Fo moderno si rivolge contro gli stessi. Perché anche se il tempo passa, la situazione non è quasi cambiata. Quei soggetti fanno azioni ipocrite in un ambito schematico e dogmatico, e non fanno conoscere al popolo la loro situazione d'inuguaglianza. Perciò Fo ritiene che la situazione disperata del popolo è la stessa, sia nel medievo sia oggi. Secondo, voglio fare vedere che i giullari fanno la satira pungente della classe dominante, e degli ecclesiastici ma non rinnegano la cristianità. E anche gli estremisti che talvolta erano i monaci diventati giullari, dicono che se vogliamo dare dignità alla Chiesa di Cristo dobbiamo distruggere la Chiesa. E per distruggere la Chiesa dobbiamo distruggere chi la governa, il papa, i vescovi, e i cardinali. Ma anche loro, in quel caso, non rinnegano la cristianità in sè stessa. Poiché Dio (il Padreterno) rappresenta i padroni e i sovrani è odiato, mentre e' sempre amato Gesù Cristo da tutti i giullari, gli estremisti e anche il popolo, ché egli è Dio che viene sulla terra a cercar di ridare la primavera agli uomini e si sacrifica come Dioniso. E soprattutto è considerato come il simbolo della resistenza contro la inugualglianza, e dell'amore e della dignità fondamentale degli uomini. Nei nove testi di Mistero Buffo, i giullari e Fo considerano sempre molto importante la dignità degli uomini. E Cristo è il simbolo di questa dignità. Così i testi in Mistero Buffo hanno sempre una forte connotazione, non sono soltanto una satira sulla classe dominante e gli ecclesiastici ma contengono anche in definitiva la volontà di ricercare la restaurazione della dignità degli uomini e dello spirito di Cristo.

• Journal of applied mathematics & informatics
• /
• v.15 no.1_2
• /
• pp.503-510
• /
• 2004

Given vectors x and y in a Hilbert space, an interpolating operator is a bounded operator T such that Tx = y. An interpolating operator for n vectors satisfies the equation $Tx_i\;=\;y_i,\;for\;i\;=\;1,\;2,\;\cdots,\;n$. In this paper the following is proved: Let H be a Hilbert space and L be a commutative subspace lattice on H. Let H and y be vectors in H. Let $M_x\;=\;\{{\sum{n}{i=1}}\;{\alpha}_iE_ix\;:\;n\;{\in}\;N,\;{\alpha}_i\;{\in}\;{\mathbb{C}}\;and\;E_i\;{\in}\;L\}\;and\;M_y\;=\;\{{\sum{n}{i=1}}\;{\alpha}_iE_iy\;:\;n\;{\in}\;N,\;{\alpha}_i\;{\in}\;{\mathbb{C}}\;and\;E_i\;{\in}\;L\}. Then the following are equivalent. (1) There exists an operator A in AlgL such that Ax = y, Af = 0 for all f in ${\overline{M_x}}^{\bot}$, AE = EA for all $E\;{\in}\;L\;and\;A^{*}\;=\;A$. (2) $sup\;\{\frac{{\parallel}{{\Sigma}_{i=1}}^{n}\;{\alpha}_iE_iy{\parallel}}{{\parallel}{{\Sigma}_{i=1}}^{n}\;{\alpha}_iE_iy{\parallel}}\;:\;n\;{\in}\;N,\;{\alpha}_i\;{\in}\;{\mathbb{C}}\;and\;E_i\;{\in}\;L\}\;<\;{\infty},\;{\overline{M_u}}\;{\subset}{\overline{M_x}}$ and < Ex, y >=< Ey, x > for all E in L.

• Journal of the Korean Mathematical Society
• /
• v.59 no.1
• /
• pp.71-85
• /
• 2022

In [4], the authors showed that if an h-vector (h₀, h₁, …, h_e) with h₁ = 4e - 4 and h_i ≤ h₁ is a Gorenstein sequence, then h₁ = h_i for every 1 ≤ i ≤ e - 1 and e ≥ 6. In th_is paper, we show that if an h-vector (h₀, h₁, …, h_e) with h₁ = 4e - 4, h₂ = 4e - 3, and h_i ≤ h₂ is a Gorenstein sequence, then h₂ = h_i for every 2 ≤ i ≤ e - 2 and e ≥ 7. We also propose an open question that if an h-vector (h₀, h₁, …, h_e) with h₁ = 4e - 4, 4e - 3 < h₂ ≤ (h₁)₍₁₎|⁺¹₊₁, and h₂ ≤ h_i is a Gorenstein sequence, then h₂ = h_i for every 2 ≤ i ≤ e - 2 and e ≥ 6.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.188-198
• /
• 2005

The Goldschmidt iterative algorithm for finding a floating point square root calculated it by performing a fixed number of multiplications. In this paper, a variable latency Goldschmidt's 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 square root of a floating point number F, the algorithm repeats the following operations: $R_i=\frac{3-e_r-X_i}{2},\;X_{i+1}=X_i{\times}R^2_i,\;Y_{i+1}=Y_i{\times}R_i,\;i{\in}\{{0,1,2,{\ldots},n-1} }}'$with the initial value is $'\;X_0=Y_0=T^2{\times}F,\;T=\frac{1}{\sqrt {F}}+e_t\;'$. 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 doubel precision floating point. Let $'X_i=1{\pm}e_i'$, there is $'\;X_{i+1}=1-e_{i+1},\;where\;'\;e_{i+1}<\frac{3e^2_i}{4}{\mp}\frac{e^3_i}{4}+4e_{r}'$. If '|X_i-1|<2^{\frac{-p+2}{2}}\;'$ is true, $'\;e_{i+1}<8e_r\;'$ is less than the smallest number which is representable by floating point number. So, $\sqrt{F}$ is approximate to $'\;\frac{Y_{i+1}}{T}\;'$. 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 ($T=\frac{1}{\sqrt{F}}+e_i$) 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 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 Korea Institute of Information and Communication Engineering
• /
• v.9 no.2
• /
• pp.380-389
• /
• 2005

The Goldschmidt iterative algorithm for a floating point divide calculates it by performing a fixed number of multiplications. In this paper, a variable latency Goldschmidt's divide algorithm is proposed, that performs multiplications a variable number of times until the error becomes smaller than a given value. To calculate a floating point divide '$\frac{N}{F}$', multifly '$T=\frac{1}{F}+e_t$' to the denominator and the nominator, then it becomes ’$\frac{TN}{TF}=\frac{N_0}{F_0}$'. And the algorithm repeats the following operations: ’$R_i=(2-e_r-F_i),\;N_{i+1}=N_i{\ast}R_i,\;F_{i+1}=F_i{\ast}R_i$, i$\in${0,1,...n-1}'. 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 29 for the single precision floating point, and 59 for the double precision floating point. Let ’$F_i=1+e_i$', there is $F_{i+1}=1-e_{i+1},\;e_{i+1}',\;where\;e_{i+1}, If '$[F_i-1]<2^{\frac{-p+3}{2}}$ is true, ’$e_{i+1}<16e_r$' is less than the smallest number which is representable by floating point number. So, ‘$N_{i+1}$ is approximate to ‘$\frac{N}{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 ($T=\frac{1}{F}+e_t$) with varying sizes. 1'he 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 divider. 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

• Journal of the Korean Society for information Management
• /
• v.6 no.1
• /
• pp.3-14
• /
• 1989

The purpose of t h i s paper i s to i n v e s t i g a t e the development of academic magazines and i t s Charac t e r i s t ~ c s i n o r d e r to determine i t s function a s a means of p r e s e n t i n g t h e i r r e s u l t s of reasearch in Korea.