• Korean Journal of Animal Reproduction
• /
• v.6 no.1
• /
• pp.31-35
• /
• 1982

A study of 188 lactations of Holstein cows in Gwangju area was undertaken to establish the shape of lactation curve during the period from October in 1980 to January in 1982. The Gammafunction described by Wood(1967) was fitted to the lactations observed. The results obtained in the present study were summarized as follows; 1. The lactation curve of the 188 lactations was expressed by the equation based on Wood's model (1967) as follows; Yn=24.5m0.0762e-0.0944n(R2=0.99) 2. The lactation curves by parity were represented by the equations as follows; Yn=18.81n0.1486e-0.0741n(R2=0.98)……………parity 1 Yn=26.51n0.1161e-0.1200n(R2=0.96)……………parity 2 Yn=26.95n0.2804e-0.1703n(R2=0.99)……………parity 3 Yn=27.92n0.1429e-0.1427n(R2=0.98)……………parity 4 Yn=22.61n0.1985e-0.1211n(R2=0.94)……………parity 5 3. The lactation curves by calving seasons were represented by the equationes as follows; Yn=27.05n0.0739e-0.1005n(R2=0.98)……………spring Yn=23.08n0.2040e-0.1202n(R2=0.98)……………summer Yn=26.81n0.0460e-0.1134n(R2=0.98)……………autumn Yn=23.40n0.1299e-0.1101n(R2=0.95)……………winter

• Honam Mathematical Journal
• /
• v.26 no.4
• /
• pp.463-469
• /
• 2004

In this paper we establish some recurrence relations satisfied by quotient moments of upper record values from the exponential distribution. Let $\{X_n,\;n{\geq}1\}$ be a sequence of independent and identically distributed random variables with a common continuous distribution function 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}Exp(1)$. Then $\Large{E\;\left.{\frac{X^r_{u(m)}}{X^{s+1}_{u(n)}}}\right)=\frac{1}{s}E\;\left.{\frac{X^r_{u(m)}}{X^s_{u(n-1)}}}\right)-\frac{1}{s}E\;\left.{\frac{X^r_{u(m)}}{X^s_{u(n)}}}\right)}$ and $\Large{E\;\left.{\frac{X^{r+1}_{u(m)}}{X^s_{u(n)}}}\right)=\frac{1}{(r+2)}E\;\left.{\frac{X^{r+2}_{u(m)}}{X^s_{u(n-1)}}}\right)-\frac{1}{(r+2)}E\;\left.{\frac{X^{r+2}_{u(m-1)}}{X^s_{u(n-1)}}}\right)}$.

• Korean Journal of Soil Science and Fertilizer
• /
• v.46 no.3
• /
• pp.163-172
• /
• 2013

The aquatic insect collected at six areas (each 2 for mountain area, plain field, and urban area) from 2009 to 2011 were classified to analyze the distribution and diversity of species. Frequency (number of aquatic insect: N), number of species (S), similarity index (C), richness index (R1, R2), variety index (V1, V2), evenness index (E1, E2, E3, E4, E5), and dominance index (D1) were investigated. Total N and S were 143 and 84, respectively. C matrix of 153 combinations was constructed with the average of 0.542. The average C of 3 years (0.659) was 9.9% P, more higher than the average C of 6 areas (0.560). The average values of the index of 18 plots were 2.28, 0.17, 1.24, 1.08, 0.07, 0.06, 0.01, 0.87, 0.31, 0.93 for R1, R2, V1, V2, E1, E2, E3, E4, E5, D1, respectively. The order in the coefficient of variation (CV) of the indicator for 18 plots was N (70.0%) > E3 (54.9%) > E1 (49.6%) > R2 (40.5%) > S (35.3%) > R1 (33.7%) > E2 (28.4%) > E5 (15.9%) > V1 (11.1%) > E4 (6.3%) > V2 (5.1%) > D1 (4.8%). The correlation matrix with 66 combinations between the indexes was constructed with statistical significance for 33 combinations. However, R1, V1, E2 and D1 were the proper indexes to represent species diversity of aquatic insect based on the correlation matrix and the theory of statistical independence. The richness index was highest in mountain, variety index in urban area, and evenness index in plain field. However, the dominance index was lowest in urban area.

• 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 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 Korean Society for information Management
• /
• v.6 no.1
• /
• pp.15-36
• /
• 1989

The r a p i d i n c r e a s e o f microcomputer technology has r e s u l t e d i n t h e broad a p p l i c a t i o n t o various f i e l d s . The purpose of t h l s paper 1s to design a computerized r e t r i e v a l system f o r nuclear information m a t e r i a l s using a microcomputer.

• Journal of Gifted/Talented Education
• /
• v.22 no.2
• /
• pp.243-264
• /
• 2012

The purpose of this study was to investigate the current status of R&E programs in gifted high schools/science high schools and to provide suggestions for the better program. The sample included 21 R&E coordinators in the gifted high schools and science high schools. They filled out the survey, asking about the R&E program; then, the researchers interviewed the coordinators based on the answers of the survey. The results are as follows: 1) The R&E guidelines and related materials were not enough to use. 2) At the planning step, students and the mentors received were provided a little information, such as ethical issues, students' information, the roles of mentors/ students, mentor's research interest areas and products, etc. 3) At the research step, 80% of the schools had the monitoring process but the details were not written and saved. 4) At the evaluation step, the rubric of the product evaluation existed; the rubric of performance process were established by half of the schools. 5) At the closing step, 100% of the schools had the final product materials; the results of the evaluation and the information of the mentors were saved by 2/3 and 1/3 of the schools, respectively. Discussions and suggestions were included for the better R&E programs.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.6
• /
• pp.27-33
• /
• 2008

Given a polynomial ${\hbar}(x){\in}F_q[x]$ of degree h, it is an important problem to determine the size of multiplicative subgroup of $\(F_q[x]/({\hbar(x))\)*$ generated by $x-s_1,\;x-s_2,\;{\cdots},\;x-s_n$, where $\{s_1,\;s_2,\;{\cdots},\;s_n\}{\sebseteq}F_q$, and for all ${\hbar}(x){\neq}0$. So far the best known asymptotic lower bound is $(rh)^{O(1)}\(2er+O(\frac{1}{r})\)^h$, where $r=\frac{n}{h}$ and e(=2.718...) is the base of natural logarithm. In this paper, we exploit the coding theory connection of this problem and prove a better lower bound $(rh)^{O(1)}\(2er+{\frac{e}{2}}{\log}r-{\frac{e}{2}}{\log}{\frac{e}{2}}+O{(\frac{{\log}^2r}{r})}\)^h$, where log stands for natural logarithm We also discuss about the limitation of this approach.

• Journal of the Chungcheong Mathematical Society
• /
• v.27 no.1
• /
• pp.105-112
• /
• 2014

In this paper, we first introduce an R-E-KKM map in the E-convex settings, and next we prove an R-E-KKM theorem which generalizes the KKM theorem and the best proximity theorem simultaneously. As applications, a best proximity theorem and a fixed point theorem in E-convex sets are given.

• YAKHAK HOEJI
• /
• v.45 no.4
• /
• pp.339-346
• /
• 2001

A new oxygenated monoterpene (4) was isolated from the methanol extract of the aerial part of Erechtites hieracifolia together with six known components, a dimethylheptane (1), three ionone derivatives (2, 3 and 7) and two phenylpropanoids (5 and 6). Their structures were identified by means of physico-chemical and spectral data to be (2E, 5E)-6-hydroxy-2,6-dimethylhepta-2,4-dienal (1), 3(R)-hydroxy-5,6-epoxy-$\beta$-ionone (2), 3(R)-hydroxy-5,6-epoxy-7-ionol (3), (3E, 6E)-3,7-dimethylocta-3,5-dien-1,2,7-triol(4), 2-hydroxy-4-(2-propenyl)phenyl-$\beta$-D-glucopyranoside (5), 2-methoxy-4-(2-propenyl)phenyl -$\beta$-D-glucopyra-noside (6) and (6R, 9R)-3-oxo-$\beta$-ionol-$\alpha$-D -glucopyranoside (7).