• Hwankyungkyoyuk
• /
• v.8 no.1
• /
• pp.122-137
• /
• 1995

The Environmental Education(E.E.) is very important field in Elementary and Secondary School. And the first important problem of E.E. in school is no special teacher. This thesis is a study on the system of E.E. major in the graduate school of education. 1. The aims of E.E. major are training of E.E. teacher and developing research of E.E. 2. The curriculum of E.E. major is consisted of E.E. theory and E.E. content. 3. The student of E.E. major is admited a university graduate of social science and natural science department. 4. The professor of E.E. major is organized a specialist of E.E.

• Korean Journal of Animal Reproduction
• /
• v.20 no.2
• /
• pp.215-221
• /
• 1996

This study was carried out to develop an immunoassay for the diagnosis of the pregnancy and ovarian function of domestic animals. Using 2E92C10 monoclonal antibody(McAb) generated against estrone-3-glucuronide(E1-3-G) and appeared a high cross-reactivity with estrone-3-sulfate(E1-3-S), chemiluminesence immunoassay (CIA) to detect E1-3-S was developed. 2E92C10 McAb cross-reacted with E1-3-S (30%) was purified from ascites fluid using protein G sepharose gel column. The purity of purified antibody fraction was monitored by SDS-PAGE and was better compared to that of crude ascite fluid. The soild and liquid phase CIA for E1-3-S were established utilizing 2E92C10 antibody and E1-3-G-ABEI conjugate used as a tracer. As the results, the titer of 2E92C10 antibody was 5g/ml in soild phase and 1:2000 in liquid phase. The sensitivity on soild and solid phase CIA were about 200 pg/ml. These results indicate that CIA for measurement of E1-3-S was successfully developed by using ant-E1-3-G McAb cross-reacted with E1-3-S and could be usefully used to research this area.

• Journal of Life Science
• /
• v.23 no.7
• /
• pp.941-946
• /
• 2013

Local protein synthesis at subsynaptic sites plays a key role in the regulation of the protein composition in local domains. In this study, we carried out immunocytochemistry of cultured rat hippocampal neurons in various developmental stages to investigate the expression of eIF4E and its binding protein, eIF4EBP1. Both proteins were distributed in dendrites. In addition, eIF4EBP1 was highly expressed in the nucleus throughout the development, whereas eIF4E was not expressed in the nucleus. Punctate expression of eIF4E and eIF4EBP1 was evident in DIV 3. The colocalization rates of eIF4E or eIF4EBP1 puncta with PSD95 were higher in the dendrogenic than in the mature stages. In contrast, the colocalization rates of eIF4E and eIF4EBP1 puncta were higher in the mature than in the dendrogenic stages. As eIF4E is inactive when it is bound to eIF4EBP1, these data indicate that most dendritic eIF4E's are active during development but that they are mostly under inhibition in mature neurons.

• East Asian mathematical journal
• /
• v.18 no.2
• /
• pp.205-209
• /
• 2002

In the paper the following propositions are proved. 1) If ($Q,{\cdot},e$) is a B-algebra, then there exists a group($Q,A,^{-1}$, 1) such that the following equalities hold e=1 and ${\cdot}=^{-1}A$, where $^{-1}A(x,y)=z{\Longleftrightarrow^{def}}A(z,y)=x$; and 2) If ($Q,A,^{-1}$, e) is a group, then ($Q,^{-1}A$, e) is a B-algebra.

• 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

• Communications of the Korean Mathematical Society
• /
• v.35 no.1
• /
• pp.137-149
• /
• 2020

Let γ⁽ⁿ⁾ ≡ {γ_ij} (0 ≤ i+j ≤ 2n, |i-j| ≤ n) be a sequence in the complex number set ℂ and let E (n) be the Embry truncated moment matrices corresponding from γ⁽ⁿ⁾. For an odd number n, it is known that γ⁽ⁿ⁾ has a rank E (n)-atomic representing measure if and only if E(n) ≥ 0 and E(n) admits a flat extension E(n + 1). In this paper we suggest a related problem: if E(n) is positive and nonsingular, does E(n) have a flat extension E(n + 1)? and give a negative answer in the case of E(3). And we obtain some necessary conditions for positive and nonsingular matrix E (3), and also its sufficient conditions.

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

• Journal of Life Science
• /
• v.24 no.8
• /
• pp.910-914
• /
• 2014

For the identification of the Jeju black cattle, Hanwoo and imported beef, we performed a multiplex polymerase chain reaction (PCR) associated with microsatellite (MS) and melanocortin 1 receptor (MC1R) gene. The MC1R gene plays an important role in regulation of the melanin synthesis within mammalian melanocytes. MC1R encoded by extension (E) locus was almost fixed with recessive red e allele in the Hanwoo. We estimated that the specific genotypes ($E^+/E^+$, $E^+/e$) of MC1R gene were characteristic genotypes of Jeju black cattle. But the PCR products resulted from using the MC1R gene derived primers only are not sufficient to identify Jeju black cattle from other relatives. We performed two times of successive multiplex PCR to provide a more accurate result for the identification of Jeju black cattle. The results suggest that two types of successive multiplex PCR methods using MC1R gene and Microsatellite derived primer set will be more useful to identification of Jeju black cattle, Hanwoo and imported beef.

• Proceedings of the Korean Radioactive Waste Society Conference
• /
• 2005.06a
• /
• pp.523-530
• /
• 2005

In this study, maximum exposure rate at DAW(Dry Active Waste) drum surface which is satisfying regulation limit was calculated for conceptual design of IP(Industrial Package). DAW can be classified as combustible and non-combustible waste and the calculation was conducted for single and mixed radionuclide for each type of waste. In case of combustible waste that mixed radionuclide is uniformly distributed, the maximum exposure rates at drum surface were 3.60E-01, 8.85E-01 and 1.27E+01 mSv/hr for IP Type 1, 2-a and 2-b, respectively. and 3.60E-01, 8.85E-01, 1.27E+01 mSv/hr for single radionuclide(Co-60). In case of non-combustible waste that mixed radionuclide is uniformly distributed, the maximum exposure rates at drum surface were 7.14E-01, 1.83E+00, 2.69E+01 mSv/hr for IP Type 1, 2-a and 2-b, respectively. and 7.13E-01, 1.81E-01, 2.62E+01 mSv/hr for single radionuclide(Co-60). Through this study, the maximum amount of DAW can be transported by IP was suggested as maximum exposure rate at drum surface and the calculation for the other types of waste will be conducted.

• Korean Business Review
• /
• v.5
• /
• pp.241-274
• /
• 1992

General American English(=A.E.) has conservative elements as well as progressive elements. A.E. and B.E. are languages which have more similarities than differances. In this paper. I studied the process of English progress before the A.E. had come into being, and the historical background and the cahristics of A.E. coming into being. Considering the differences between A.E. and B.E. from spelling, pronunciation, vocabulary and grammar, I can give the outline as follows. A spelling 1. B.E. : au, ou $${\rightarrow}$$A.E. : a, o 2. B.E. : e $${\rightarrow}$$A.E. : i 3. B.E. : $${\ae}$$ oe $${\rightarrow}$$A.E. : e 4. B.E. : our $${\rightarrow}$$A.E. : or 5. B.E. : re $${\rightarrow}$$A.E. : er B. pronunciation 1. B.E. : [e] $${\rightarrow}$$A.E. : [i], [e], $$[\partial]$$ 2. B.E. : [a] $${\rightarrow}$$A.E. : 3. B.E. : [i(:)] $${\rightarrow}$$A.E. : [ai], $$[\partial]$$, $$[{\varepsilon}]$$ 4. B.E. : $$[{\ae}]$$ $${\rightarrow}$$A.E. : [e], [c] 5. B.E. : [ai] $${\rightarrow}$$A.E. : $$[{\ae}]$$, [e] 6. B.E. : [c] $${\rightarrow}$$A.E. : [e], [a], [o] 7. In case of "Vowel+[t]+Vowel", [t] is pronounced into [d] or [r] 8. In case of "-nt", [t] becomes a mute. 9. [t]+[j, l, m, n, r, u, or, w] $${\rightarrow}$$A.E. : [?] (=glottal stop) 10. B.E. : [w] $${\rightarrow}$$A.E. : [hw] 11. B.E. : [Voiceless consonants], [Voiced consonants] $${\leftarrow}$$A.E. : [Voiced consonants], [Voiceless consonants] C. Vocabulary The historical background and geographical conditions of those days caused lots of new compounds and neologies. D. Grammar Though we use "of" to indicate the possessive case of inanimate object, -s genitive is used in A.E. In the perfect tense, "have" is often omitted and also auxiliary verb "will" is used in any case