• Bulletin of the Korean Chemical Society
• /
• v.19 no.1
• /
• pp.39-44
• /
• 1998

$LiCoO_2$ powder was synthesized in an aqueous solution by a sol-gel method and used as a cathode active material for a lithium ion rechargeable battery. The layered $LiCoO_2$ powders were prepared by igniting in air for 12 hrs at 600 ℃ $(600-LiCoO_2)$ and 850 ℃ $(850-LiCoO_2)$. The structure of the $LiCoO_2$ powder was assigned to the space group R bar 3 m (lattice parameters a=2.814 Å and c=14.04Å). The SEM pictures of $600-LiCoO_2$ revealed homogeneous and fine particles of about 1 μm in diameter. Cyclic voltammograms (CVs) of $600-LiCoO_2$ electrode displayed a set of redox peaks at 3.80/4.05 V due to the intercalation/deintercalation of the lithium ions into/out of the $LiCoO_2$ structure. CVs for the $850-LiCoO_2$ electrode had a major set of redox peaks at 3.88/4.13 V, and two small set of redox peaks at 4.18/4.42 V and 4.05/4.25 V due to phase transitions. The initial charge-discharge capacity was 156-132 mAh/g for the $600-LiCoO_2$ electrode and 158-131 mAh/g for the $850-LiCoO_2$ electrode at the current density of 0.2 mA/cm2. The cycleability of the cell consisting of the $600-LiCoO_2$ electrode was better than that of the $850-LiCoO_2$. The diffusion coefficient of the $Li^+$ ion in the $600-LiCoO_2$ electrode was calculated as $4.6{\times}10^{-8}\; cm^2/sec$.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2006.05a
• /
• pp.391-394
• /
• 2006

In this paper, a criterion on enclosed die forging with a double action link type hydraulic die set is presented. Operational principle of the die set in enclosed die forging is introduced with emphasis on force transfer from the press and the hydraulic system to the material through links, die components and punches. Force transfer mechanism is examined and three different modes are introduced. Requirements on force equilibrium are applied to the three force transfer modes and a criterion on enclosed die forging with a double action link type hydraulic die set is drawn. The criterion is discussed to minimize forming load.

• Journal of Practical Agriculture & Fisheries Research
• /
• v.20 no.1
• /
• pp.97-105
• /
• 2018

We assessed the effects of population density on the growth and survival rate of sea cucumber(Stichopus japonicus) in indoor tank Growth of S. japonicus in high density breeding was slow overall, and body weight on 250, 350 and 500 individual/m² group were 31.9g, 26.8g and 21.5g, respectively. The growth rate of body weight was 3.5~5.1 times according to the density of water, and the survival rate was 44.2~50.1%. The growth and survival rate were increased as decreasing the storage density. During the breeding season, small individuals tend not to be large and constantly culled, so it is necessary to set up the sorting period (etc.), and divide S. japonicus into groups of similar size.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2007.11a
• /
• pp.315-316
• /
• 2007

• Journal of Information Display
• /
• v.11 no.1
• /
• pp.24-27
• /
• 2010

A novel stereo 3D LCD for passive interference filter glasses is presented. A demonstrator based on a standard 120Hz LCD was set up. Stereoscopic image separation was realized in a time-sequential mode using a LED-based scanning backlight with two complementary spectra. A stereo brightness of 3 cd/$m^2$ and a channel separation of 30:1 were achieved.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.7
• /
• pp.41-47
• /
• 2015

The bandwidth minimization problem (BMP) has been classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. This paper suggests polynomial time heuristic algorithm is to find the solution of bandwidth minimization problem. To find the minimum bandwidth ${\phi}^*=_{min}{\phi}(G)$, ${\phi}(G)=_{max}\{{\mid}f(v_i)-f(v_j):v_i,v_j{\in}E\}$ for given graph G=(V,E), m=|V|,n=|E|, the proposed algorithm sets the maximum degree vertex $v_i$ in graph G into global central point (GCP), and labels the median value ${\lceil}m+1/2{\rceil}$ between [1,m] range. The graph G is partitioned into subgroup, the maximum degree vertex in each subgroup is set to local central point (LCP), and we adjust the label of LCP per each subgroup as possible as minimum distance from GCP. The proposed algorithm requires O(mn) time complexity for label to all of vertices. For various twelve graph, the proposed algorithm can be obtains the same result as known optimal solution. For one graph, the proposed algorithm can be improve on known solution.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.4
• /
• pp.683-689
• /
• 2007

Let $\mathcal{B}$ be a certain Banach space consisting of analytic functions defined on a bounded domain G in the complex plane. Let ${\varphi}$ be an analytic polynomial or a rational function and let $M_{\varphi}$ denote the operator of multiplication by ${\varphi}$. Under certain condition on ${\varphi}$ and G, we characterize the commutant of $M_{\varphi}$ that is the set of all bounded operators T such that $TM_{\varphi}=M_{\varphi}T$. We show that $T=M_{\Psi}$, for some function ${\Psi}$ in $\mathcal{B}$.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.11
• /
• pp.2103-2108
• /
• 2017

For n points $p_i$ on the m-dimensional plane $R^m$ and a fixed range r, consider a set $T_i$ containing points the distances from $p_i$ of which are less than or equal to r. In case m=1, $T_i$ is an interval on a line, it is a circle on a plane when m=2. For the vertices corresponding to the sets $T_i$, there is an edge between the vertices if the two sets intersect. Then this graph is called an intersection graph G. For m=1 G is called a proper interval graph and for m=2, it is called an unit disk graph. In this paper, we are concerned in the intersection graph G(r) when r changes. In particular, we consider the problem to find the minimum r such that G(r)is connected. For this problem, we propose an O(n) algorithm for the proper interval graph and an $O(n^2{\log}\;n)$ algorithm for the unit disk graph. For the dynamic environment in which the points on a line are added or deleted, we give an O(log n) algorithm for the problem.

• Journal of applied mathematics & informatics
• /
• v.9 no.2
• /
• pp.579-591
• /
• 2002

Let G be a finite group and $\omega$(G) the set of elements orders of G. Denote by h($\omega$(G)) the number of isomorphism classes of finite groups H satisfying $\omega$(G)=$\omega$(H). In this paper, we show that for G=PSL(3, q), h($\omega$(G))=1 where q=11, 12, 19, 23, 25 and 27 and h($\omega$(G)=2 where q = 17 and 29.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.10
• /
• pp.789-796
• /
• 2006

An unpaired many-to-many k-disjoint nth cover (k-DPC) of a graph G is a set of k disjoint paths joining k distinct sources and sinks in which each vertex of G is covered by a path. Here, a source can be freely matched to a sink. In this paper, we investigate unpaired many-to-many DPC's in a subclass of hpercube-like interconnection networks, called restricted HL-graphs, and show that every n-dimensional restricted HL-graph, $(m{\geq}3)$, with f or less faulty elements (vertices and/or edges) has an unpaired many-to-many k-DPC for any $f{\geq}0\;and\;k{\geq}1\;with\;f+k{\leq}m-2$.