• KSBB Journal
• /
• v.16 no.5
• /
• pp.442-445
• /
• 2001

Catechin compounds as anticancer and antioxidant were target materials from Korean Green Tea in this work. The methodologies of solvent extraction and partition were utilized to recover catechin compounds from green tea and the optimal experimental conditions were found by comparing the degree of recovery as slovent. extraction times and operating temperatures. The extract was partitioned with chloroform, which was best fit to remove caffeine after the extraction of green tea with 80$^{\circ}C$ water for 40 min. Further, the resulting extract was partitioned in ethyl acetate layer to purify the catechin compounds of EGC, EC EGCG and ECG. This experimental result could be extended to preparative HPLC to obtain EGCG on a commercial scale.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.3
• /
• pp.35-50
• /
• 2007

In a data centric sensor network, a sensor node to store data is determined by the measured data value of each sensor node. Therefore, if the same data occur frequently, the energy of the sensor node to store the data is exhausted quickly due to the concentration of loads. And if the sensor network is extended, the communication cost for storing data and processing queries is increased, since the length of the routing path for them is usually in the distance. However, the existing researches that generally focus on the efficient management of data storing can not solve these problems efficiently. In this paper, we propose a NUNS(Non-Uniform Network Split) method that can distribute loads of sensor nodes and decrease the communication cost caused by the sensor network extension. By dividing the sensor network into non-uniform partitions that have the minimum difference in the number of sensor nodes and the splitted area size and storing the data which is occurred in a partition at the sensor nodes within the partition, the NUNS can distribute loads of sensor nodes and decrease the communication cost efficiently. In addition, by dividing each partition into non-uniform zones that have the minimum difference in the splitted area size as many as the number of the sensor nodes in the partition and allocating each of them as the processing area of each sensor node, the NUNS can protect a specific sensor node from the load concentration and decrease the unnecessary routing cost.

• Journal of the Korean Statistical Society
• /
• v.33 no.4
• /
• pp.401-410
• /
• 2004

We address the problem of parameter estimation in multivariate distributions under ignorable non-monotone missing data. The factoring likelihood method for monotone missing data, termed by Rubin (1974), is extended to a more general case of non-monotone missing data. The proposed method is algebraically equivalent to the Newton-Raphson method for the observed likelihood, but avoids the burden of computing the first and the second partial derivatives of the observed likelihood. Instead, the maximum likelihood estimates and their information matrices for each partition of the data set are computed separately and combined naturally using the generalized least squares method.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.5
• /
• pp.1279-1287
• /
• 2022

A partition of n is complete if every positive integer from 1 to n can be represented by the sum of its parts. The concept of complete partitions has been extended in several ways. In this paper, we consider the number of k-relaxed r-complete partitions of n and the number of double-complete partitions of n.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.37-48
• /
• 2004

Important Java network application services have been rapidly increased along with the growth of the Internet. So, it is desirable for such applications to serve transparently, continuously and safely even if the network is temporally partitioned or certain hosts running those services are crashed down. To satisfy such requirements, many group communication systems have been developed. However, existing Java-based group communication systems do not support both the extended virtual synchrony and various types of message delivery such as FIFO, causal, total and safe delivery service. In this paper, we present the design and implementation of a Java group communication system, named JACE, supporting various types of message delivery between group members and the extended virtual synchrony model. The JACE system consists of a number of protocol modules which can be stacked on top of each other in a variety of ways. In addition, using the JACE system, we have developed an experimental UDDI registry for discovering and publishing information about Web services.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.409-411
• /
• 1998

자바는 분산환경에 적합하고 이식성이 높으며 코드 재사용이 용이하다는 장점을 가지고 있다. 이러한 이유로 다양한 분야에서 자바로 구현된 응용서비스를 제공하고 있다. 현제와 같은 정보중심사회에서 이러한 자바응용서비스는 서버의 실패(crash) 나 네트워크 분할(partition)과 같은 결함이 발생되더라도 투명하고, 안정적이며, 지속적인 서비스를 제공하는 것이 바람직하다. 이러한 요구사항은 이기종 분산환경에서 동일한 서비스를 제공하는 자바응용서비스를 그룹으로 동작하게 함으로써 해결될 수 있다. 본 논문에서는 자바응용서비스 그룹이 네트워크의 분할로 상호 통신할 수 없는 두 개이상의 구성요소로 분리되더라도 지속적인 서비스를 제공하고 네트워크가 복구(merge)되면 이전과 같이 하나의 그룹으로서 동작할 수 잇도록 그룹 구성원의 일관성을 유지하는 EVS ( Extended Virtual Synchrony)모델을 구현함으로써 자바응용서비스의 신뢰성과 고가용성(high availability)을 지원하고자 한다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.5
• /
• pp.486-493
• /
• 2002

In this paper, we proposed the effective multispectral image compression method using CIBP(classified interband bidrectional prediction) and extended SPIHT(set partition in hierarchical trees) in wavelet domain. We determine separately feature bands that have the highest correlation with other bands in the visible range and in the infrared range of wavelengths. Feature bands are coded to remove the spatial redundancy with SPIHT in the wavelet domain. Prediction bands that have high correlation with feature bands are wavelet transformed and they are classified into one of three classes considering reflection characteristics of the baseband. For Prediction bands, CIBP is performed to reduce the spectral redundancy. for the difference bands between prediction bands and the predicted bands, They are ordered to upgrade the compression efficiency of extended SPIHT with the largest error magnitude. The arranged bands are coded to compensate the prediction error with extended SPIHT. Experiments are carried out on the multispectral images. The results show that the proposed method reconstructs higher quality images than images reconstructed by the conventional methods at the same bit rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2789-2800
• /
• 1996

Real time fractal coding for successive QCIF 144*176 luminance images has been implemented on a 50MHz IBM 486 personal computer. To satisfy the frame encoding speed and data compression ratio, following algorithms are adopted. In order to minimize encoding time, extension SAS being not searching of domain blocks is used. for reducing the bits per pixel, conventioal 4*4 range block is extended to 8*8 range block. and range block extension decrease quality of decoded image. For improvement quality of decoded image, the paper apply quad-tree partition mothod. In order to divide **8 range block, self-simiarity is compared 8*8 range block with spatial contractive transformed 8*8 domain block. According to self-simiarity, the block is partitioned and owing to block partition, increased encoding time is minimized. According to self-simiarity of 8*8 range block and spatial contractive transformed 8*8 domain block, number of fractal factor is varied. Simultaneously with minimizing the decrement of decoded image's quality, transmittion rate and encoding time is shorted. The results enable us to process the real-time fractal coding. For the claire test image, the average PSNR was 32.4dB, 0.12 bit rates and 33ms coding time per frame.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.24 no.3
• /
• pp.426-434
• /
• 2000

This paper deals with a generalized similarity solution for the one-dimensional solidification of ternary or higher-order multicomponent alloys. The present approach not only retains the existing features of binary systems such as temperature- solute coupling, shrinkage-induced flow, solid-liquid property differences, and finite back diffusion, but also is capable of handling a multicomponent alloy without restrictions on the partition coefficient and microsegregation parameter. For an alloy of N-solute species, governing equations in the mushy region reduce to (N+2) nonlinear ordinary differential equations via similarity transformation, which are to be solved along with the closed-form solutions for the solid and liquid regions. A linearized correction scheme adopted in the solution procedure facilitates to determine the solidus and liquidus positions stably. The result for a sample ternary alloy agrees excellently with the numerical prediction as well as the reported similarity solution. Additional calculations are also presented to show the utility of this study. Finally, it is concluded that the present analysis includes the previous analytical approaches as subsets.

• Journal of the Korean Chemical Society
• /
• v.9 no.4
• /
• pp.215-221
• /
• 1965

The significant liquid structure theory is extended to binary mixture, benzene-ethylenechloride system. The partition function, applicable throughout the temperature range in which Raoult's law is satisfied is derived. The thermodynamic quantities such as total and partial pressures, molar volumes and mixing entropies are calculated from the partition function at the temperatures $293.15^{\circ},\;323.14^{\circ}\;and\;357.15^{\circ}K.$ The theoretical values, thus calculated, are found to agree with the experimental data in the literatures.