• Honam Mathematical Journal
• /
• v.26 no.4
• /
• pp.379-389
• /
• 2004

Given operators X and Y acting on a Hilbert space ${\mathcal{H}}$, an interpolating operator is a bounded operator A such that AX = Y. An interpolating operator for n-operators satisfies the equation $AX_i=Y_i$, for $i=1,2,{\cdots},n$. In this article, we obtained the following : Let ${\mathcal{H}}$ be a Hilbert space and let ${\mathcal{L}}$ be a commutative subspace lattice on ${\mathcal{H}}$. Let X and Y be operators acting on ${\mathcal{H}}$. Then the following statements are equivalent. (1) There exists an operator A in $Alg{\mathcal{L}}$ such that AX = Y, A is positive and every E in ${\mathcal{L}}$ reduces A. (2) sup ${\frac{{\parallel}{\sum}^n_{i=1}\;E_iY\;f_i{\parallel}}{{\parallel}{\sum}^n_{i=1}\;E_iX\;f_i{\parallel}}}:n{\in}{\mathbb{N}},\;E_i{\in}{\mathcal{L}}$ and $f_i{\in}{\mathcal{H}}<{\infty}$ and <${\sum}^n_{i=1}\;E_iY\;f_i$, ${\sum}^n_{i=1}\;E_iX\;f_i>\;{\geq}0$, $n{\in}{\mathbb{N}}$, $E_i{\in}{\mathcal{L}}$ and $f_i{\in}H$.

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

• Proceedings of the KIEE Conference
• /
• 1997.07a
• /
• pp.230-233
• /
• 1997

In this study, design and analysis of 3-phase induction moter are as follows. - Motor characteristics analysis by equivalent circuit ${\cdot}$ Motor characteristics analysis according to variation of rotor slot-tip ${\cdot}$ Motor characteristics analysis according to variation of rotor slot-mouse ${\cdot}$ Motor characteristics analysis according to variation of rotor slot-opening

• 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 association of regional geographers
• /
• v.17 no.6
• /
• pp.738-752
• /
• 2011

La c$\hat{o}$te m$\acute{e}$ridionale de la Cor$\acute{e}$e du sud, et principalement la ville de Yeosu et ses environs pr$\acute{e}$sentent un int$\acute{e}$r$\hat{e}$t particulier puisque le paysage offre de nombreuses presqu'$\hat{i}$les, baies et $\hat{i}$les. Pour tirer profit de ces paysages naturels il est d'abord n$\acute{e}$ssaire de les prot$\acute{e}$ger. Malgr$\acute{e}$ la haute valeur de ces paysages naturels, ils demeurent peu connus et les analyses $\acute{e}$cotouristiques de la ville de Yeosu et ses environs sont encore incompl$\grave{e}$tes. Par ailleurs, la protection de ces paysages naturels est rendue difficile par la d$\acute{e}$sagr$\acute{e}$gation d$\hat{u}$e aux sels halo$\ddot{i}$des. Cette recherche a pour objet l'$\acute{e}$tude du tourisme physico-$\acute{e}$cologique et sa contribution au d$\acute{e}$veloppement $\acute{e}$conomique d'une r$\acute{e}$gion de Yeosu en Cor$\acute{e}$e du sud. Nous nous int$\acute{e}$ressons particuli$\grave{e}$rement au d$\acute{e}$veloppement d'une route $\acute{e}$cotouristique, aux crit$\grave{e}$res de s$\acute{e}$lection du lieu $\acute{e}$cotouristique et $\grave{a}$ la pr$\acute{e}$sentation des explications touristiques, en tenant compte de l'$\hat{i}$le de Sado et de ses paysages naturels sur le plan de l'$\acute{e}$cotourisme. Il y a plusieurs ressources $\acute{e}$cotouristiques sur l'$\hat{i}$le de Sado et dans ses environs: la plage de sable et la falaise de l'$\hat{i}$le de Sado; les traces fossiles de dinosaures, la ripple-mark et la crevasse dans le sol boueux de l'$\hat{i}$le de Joungdo; le tombolo, l'affleurement tufac$\acute{e}$ et le dyke de l'$\hat{i}$le de Silouseom; le trou provoqu$\acute{e}$ par les sels halo$\ddot{i}$des et le dyke de l'$\hat{i}$le de Jangsado; la mer ass$\acute{e}$ch$\acute{e}$e entre l'$\hat{i}$le de Naquek et l'$\hat{i}$le de Choudo. On a, g$\acute{e}$n$\acute{e}$ralement, d$\acute{e}$velopp$\acute{e}$ les reliefs li$\acute{e}$s $\grave{a}$ la couche s$\acute{e}$dimentaire et les fossiles de la derni$\grave{e}$re p$\acute{e}$riode du m$\acute{e}$sozo$\ddot{i}$que. La route $\acute{e}$cotouristique part de l'embarcad$\grave{e}$re de l'$\hat{i}$le de Sado et continue du Nord jusqu'au Sud.

• Journal of Korean Library and Information Science Society
• /
• v.37 no.1
• /
• pp.305-328
• /
• 2006

This paper is a bibliographic analysis on printed books of $M\grave{e}ngz\check{i}$(孟子) in Choseon Dynasty. Through examination of the physical characteristics of books in many institutes and private collections, $M\grave{e}ngz\check{i}j\acute{i}zh\grave{u}d\grave{a}q\acute{a}n$(孟子集註大全)was systematically explored, which was the most frequently published $M\grave{e}ngz\check{i}$(孟子) in Choseon Dynasty. $M\grave{e}ngz\check{i}$(孟子) was published mainly in Kyungki and Kyungsang provinces, and in the period of 17C to 19C. There are two streams of $M\grave{e}ngz\check{i}j\acute{i}zh\grave{u}d\grave{a}q\acute{a}n$. One is the series of the reprinted edition of $M\acute{i}ngbon$(明本覆刻), originated from Saseookyungdaejun(四書五經大全), compiled by Hokwang(湖廣) and colleagues in $M\acute{i}ng$(明). The second is the series of Chungyuja books(丁酉字本) among movable type books of Choseon(朝鮮活字本), the contents of which being the same as the other stream. Also, $M\grave{e}ngz\check{i}d\grave{a}iw\acute{e}n$(孟予大文) and $M\grave{e}ngz\check{i}zh\grave{e}ngw\acute{e}n$(孟子正文) are frequently published.

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

• The Journal of the Society of Korean Medicine Diagnostics
• /
• v.10 no.2
• /
• pp.31-42
• /
• 2006

Background and Purpose : The concept of $Wux{\'{\i}}ng$(五行) is central to all elements of the Koran traditional medicine. And $Wux{\'{\i}}ng$ is considered to one of the constitution theories in some of oriental medicine fields in South Korea. The aim of this study is to find necessary and concrete estimation factors for distributing patterns of $Wux{\'{\i}}ngr{\'{e}}n$(五行人) respectively. Methods : We translated and summarized the records about distinguishing characteristics and distributing points of Wu-Xing Ren described in <$L{\'{\i}}ngshu$(靈樞)${\cdot}$Yin-Y${\'{a}}$ng ${\`{e}}rsh{\'{\i}}wur{\'{e}}n$(陰陽二十五人)>. Some review articles were identified through searches of KISS and KERIS databases. Results and Conclusion : Concrete distinguishing characteristics and distributing points of Wu-Xing Ren were described in <$Lingshu{\cdot}Yin-Y{\'{a}}ng\;{\`{e}}rsh{\'{\i}}wur{\'{e}}n$>. According to <$Lingshu{\cdot}Yin-Y{\'{a}}ng\;{\`{e}}rsh{\'{\i}}wur{\'{e}}n$>, the most notable characteristics and distributing points are the skin color and shape of face. but the skin color and shape of face are too ambiguous to be used as distributing criteria in a practical manner. In stead size of head, longitudinal length of back, disposition, and width between both shoulders may be used as distributing criteria in practical clinic fields.

• Journal of the Korean Chemical Society
• /
• v.18 no.3
• /
• pp.202-209
• /
• 1974

Polarographic behaviors of copper and cadmium complexes with 2,2'-bipyridine and ethylenediamine in acetonitrile have been investigated by the DC and AC polarography. The reduction processes are estimated as follows; $Cu(II)-bipy. \;complex\;{\longrightarrow^{e^-}_{E_{1/2}\risingdotseq+0.1V}}\;Cu(I)-bipy.\;complex\;{\longrightarrow^{e^-}_{E_{1/2}=-0.43V}}\;Cu(Hg)$$Cu(II)-en.\;complex\;{\longrightarrow^{e^-}}\;Cu(I)-en.\;complex\;{times}\;{\longrightarrow^{e^-}_{E_{1/2}=-0.56V}}\;Cu(Hg)$$Cu(II)-bipy. \;complex\;{\longrightarrow^{e^-}_{E_{1/2}=-0.57V}}\;Cu(I)-bipy.\;complex\;{\longrightarrow^{2e^-}_{E_{1/2}=-0.97V}}\;Cd(I)-bipy\;complex$$Cu(II)-en.\;complex\;{\longrightarrow^{e^-}_{E_{1/2}=+0.05V}\;Cu(I)-en.\;complex{\longrightarrow^{e^-}_{E_{1/2}=-0.92V}}\;Cu(Hg)$ The limiting currents of all steps are controlled by diffusion. The number of ligand and the dissociation constant for Cu(Ⅰ)-bipy. complex were found to be n = 2 and $K_d=(1.5{\pm}0.1){\times}10^{-7}$, respectively.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.2
• /
• pp.9-14
• /
• 2007

A signed 3-partite graph is a 3-partite graph in which each edge is assigned a positive or a negative sign. Let G(U, V, W) be a signed 3-partite graph with $U\;=\;\{u_1,\;u_2,\;{\cdots},\;u_p\},\;V\;=\;\{v_1,\;v_2,\;{\cdots},\;v_q\}\;and\;W\;=\;\{w_1,\;w_2,\;{\cdots},\;w_r\}$. Then, signed degree of $u_i(v_j\;and\;w_k)$ is $sdeg(u_i)\;=\;d_i\;=\;d^+_i\;-\;d^-_i,\;1\;{\leq}\;i\;{\leq}\;p\;(sdeg(v_j)\;=\;e_j\;=\;e^+_j\;-\;e^-_j,\;1\;{\leq}\;j\;{\leq}q$ and $sdeg(w_k)\;=\;f_k\;=\;f^+_k\;-\;f^-_k,\;1\;{\leq}\;k\;{\leq}\;r)$ where $d^+_i(e^+_j\;and\;f^+_k)$ is the number of positive edges incident with $u_i(v_j\;and\;w_k)$ and $d^-_i(e^-_j\;and\;f^-_k)$ is the number of negative edges incident with $u_i(v_j\;and\;w_k)$. The sequences ${\alpha}\;=\;[d_1,\;d_2,\;{\cdots},\;d_p],\;{\beta}\;=\;[e_1,\;e_2,\;{\cdots},\;e_q]$ and ${\gamma}\;=\;[f_1,\;f_2,\;{\cdots},\;f_r]$ are called the signed degree sequences of G(U, V, W). In this paper, we characterize the signed degree sequences of signed 3-partite graphs.