• Korean Journal of Food Science and Technology
• /
• v.38 no.1
• /
• pp.114-120
• /
• 2006

Anti-diabetic effects of extracts and fractions of Sasa borealis (SB), white lotus roots (LR) and leaves (LL), and their mixture were determined in 3T3-L1 adipocytes and Min6 cells by investigating insulin-sensitizing activity and glucose-stimulated insulin secretion, respectively. SB, LR, LL, and mixture of SB, LR, and LL (3 : 2 : 3) were extracted using 70% ethanol, and m mixture extract was fractionated by XAD-4 column chromatography with serial mixture solvents of methanol and water. Fractional extractions were utilized for anti-diabetic effect assay. SB and LR extracts increased insulin-stimulated glucose uptake, but not as much as mixture of SB, LR, and LL. Significant insulin-sensitizing activities of 20 and 80% methanol fractions of SB, LR, and LL mixture extract were observed in 3T3-L1 adipocytes, giving 0.5 or $5\;{\mu}g/mL$ each fraction with 0.2 nM insulin to attain glucose uptake level similar to that attained by 10 nM insulin alone. Similar to pioglitazone, peroxisome proliferators-activated $receptor-{\gamma}\;(PPAR-{\gamma})$ agonist, 20 and 80% methanol fractions increased adipocytes by stimulating differentiation from fibroblasts and triglyceride synthesis. LL extract and 20, 60, and 80% methanol fractions of the mixture suppressed ${\alpha}-amylase$ activity, but did not modulate insulin secretion capacity of Min6 cells in both low and high glucose media. These data suggest 20 and 80% methanol tractions contain potential insulin sensitizers with functions similar to that of $PPAR-{\gamma}$ agonist. Crude extract of SB, LR, and LL mixture possibly improves glucose utilization by enhancing insulin-stimulated glucose uptake and inhibiting carbohydrate digestion without affecting insulin secretion in vivo.

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

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

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

• Research in Plant Disease
• /
• v.16 no.3
• /
• pp.259-265
• /
• 2010

Pepper mild mosaic virus(PMMoV) and Cucumber mosaic virus (CMV) are important pathogens in various vegetable crops worldwide. We have found that hot water extract of Phellinus linteus mycelium strongly inhibit PMMoV and CMV infection. Based on these results, the inhibitor named as 'PLM-WE1' formulated from extract of Phellinus linteus mycelium was tested for its inhibitory effects on PMMoV and CMV infection to each local lesion host plant (Nicotiana glutinosa: PMMoV, Chenopodium amaranticolor: CMV). Pretreatment effect of PLM-WE1 against infections of each virus (PMMoV and CMV) to local host plant was measured to be 99.2% to PMMoV and 80.3% to CMV, and its permeability effect was measured to be 45.0% to PMMoV and 41.9% to CMV. Duration of inhibitory activity of PLM-WE1 against PMMoV infection on N. glutinosa was maintained for 3 days at 75% inhibition level and CMV infection on C. amaranticolor maintained for 3 days at 62% inhibition level. Inhibitory effects on systemic host plants of PLM-WE1 were measured to be 75~85% to PMMoV and 75% to CMV. Under electron microscope, PMMoV particles were not denatured or aggregated by mixing PLM-WE1. It is suggested that the mode of action of PLM-WE1 differ from that of inactivation due to the aggregation of viruses. The methanol extract of P. linteus mycelium was sequentially partitioned with haxane, ethyl acetate, BuOH and $H_2O$. The $H_2O$ fraction was showed high activity than the other fractions. The active compound was isolated with a partial acid hydrolysis, fractional precipitation with ethanol. The inhibitory effect of the precipitate isolated from 70% ethanol fraction was 99.1% to PMMoV and 88.0% to CMV. The structure of isolated compound was determined by $^1H$-NMR and $^{13}C$-NMR. This compound was identified as a polysaccharide consisting alpha or beta-glucan.

• Childhood Kidney Diseases
• /
• v.11 no.2
• /
• pp.168-177
• /
• 2007

Purpose : The purpose of this study was to investigate whether hypercalciuria patients with hematuria show different renal indices compared to non-hypercalciuria patients with hematuria. Methods : We retrospectively reviewed the medical records of patients with gross or microscopic hematuria whose blood chemistry and 24 hour urine chemistry were examined. After excluding the patients with more than $4 mg/m^2/day$ proteinuria or the patients with urinary calcium excretion between 3 and 4 mg/kg/day, we divided the patients into two groups: a hypercalciuria group whose calcium excretion was more than 4 mg/kg/day(n=30) and a non hypercalciuria group whose calcium excretion was less than 3 mg/kg/day(n=41). The urinary excretion, clearance, and fractional excretion(FE) of Na, K, Cl, Ca, P, urea, and creatinine were calculated and compared between the two groups. Results : The hypercalciuria group had more calcium excretion($6.1{\pm}2.9$ vs $1.5{\pm}0.9 mg/kg/day$), more urea excretion($341{\pm}102$ vs $233{\pm}123 mg/kg/day$), greater glomerular filtration rate(GFR) ($93.7{\pm}31.1$ vs $79.5{\pm}32.0 mL/min$) but lower FENa($1.0{\pm}0.4%$ vs $1.3{\pm}0.6%$) than the nonhyper-calciuria group, although the urinary sodium excretion was similar between the two groups. Conclusion : The greater urea excretion and GFR in hypercalciuric patients suggest that they might be on a higher protein diet than the non-hypercalciuria group. The increased glomerular filtration of sodium and calcium induced by the higher GFR in hypercalciuria would have increased their delivery to the distal tubule, where sodium is effectively reabsorbed but calcium is not, which is suggested by the lower FENa but higher FECa in hyercalciuria. It is recommended that the diet of hematuria patients be reviewed in detail at initial presentation and during treatment.