• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.6
• /
• pp.340-345
• /
• 2002

In this paper, we deal with the following facility location problem. Given a set P of n points in the plane, find two (discrete) centers p and q in P that minimize the sum of there distance plus the distance of any other point to the closer center. In this paper, we propose an Ο(n$^2$1ogn)-time algorithm to compute the two centers.

• Journal of Korean Society for Quality Management
• /
• v.33 no.2
• /
• pp.64-73
• /
• 2005

In this paper, we introduce MTS(Mahalanobis-Taguchi System) Method which is suggested Dr. Taguchi in later 1990. We apply MTS Method for Quality Competitive Appraisal System(QCAS) Model which is executived from 1997 by Agency for Technology and Standards, Ministry of Commerce, Industry and Energy(MOCIE). We can measure company Quality competitive by using MTS. MTS Measure can not be compared statistical sum by calculated QCAS. MTS can be possible distinct subtle which can not distinct using statistical sum. Also MTS Method can seek more strong effect factor among of many factor. If A Company use MTS Method, can find vital factor and level of destination.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.322-325
• /
• 2011

스테레오 비전 시스템에서 전통적인 매칭 알고리즘으로 SAD(Sum of Absolute Differences), SSD(Sum of Squared Differences), NCC(Normalized Cross Correlation) 등 다양한 알고리즘이 존재한다. 그러나 하드웨어로 실시간 처리를 위한 시스템을 구현하기 위해서는 리소스가 한정 되어있다는 제약 때문에 많은 연구에서 SAD 혹은 RT(Rank Transform), CT(Census Transform)를 많이 사용하게 된다. FPGA 내부에는 BRAM(Block RAM)과 MAC(multiply-accumulator)인 DSP슬라이스가 이미 존재한다. 본 논문에서는 BRAM과 DSP로직을 활용해서 전통적인 매칭 알고리즘 중에서 연산기 사용이 가장 많은 NCC를 FPGA로 실시간 처리 가능한 하드웨어 구조를 제안한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.1
• /
• pp.77-82
• /
• 2015

Recently, multi-user massive MIMO (MU-Massive MIMO) network has attracted a lot of attention as a technology to accommodate explosively increasing mobile data traffic. However, the MU-Massive MIMO network causes a tremendous hardware complexity in a base station and computational complexity to select optimal set of users. In this paper, we thus propose a simple algorithm for selecting antennas and users while reducing the hardware and computational complexities simultaneously. The proposed scheme has a computational complexity of $O((N-S_a+1){\times}min(S_a,K))$, which is significantly reduced compared to the complexity of optimal scheme based on Brute-Force searching, $$O\left({_N}C_S_a\sum_{i=1}^{min(S_a,K)}_KC_i\right)$$, where N, $S_a$, and K denote the number of total transmit antennas, the number of selected antennas, and the number of all users, respectively.

• Journal of Oriental Neuropsychiatry
• /
• v.30 no.2
• /
• pp.59-69
• /
• 2019

Objectives: Case report is a description of medical experience that contains a patient's information and treatments. It has been used to determine the effectiveness and side effect of the treatments. Case report can be used for medical, scientific, or educational purposes. The objective of this study was to evaluate the quality of case reports published in Journal of Oriental Neuropsychiatry from 2013 to 2017 using CARE and CARES guideline. Methods: Case reports were selected from Journal of Oriental Neuropsychiatry and their quality assessed using CARE guideline and CARES guideline. The items of CARE and CARES guideline were assessed as 'Sufficient', 'Not sufficient', 'Not reported', 'Not applicable'. The outcome was analyzed using case reports and items. Results: 26 case reports were selected. For CARE guideline, 'Sufficient' percentage was min at 22.2%, max at 46.4% with a median of 39.3%. Sum of 'Sufficient', 'Not sufficient' percentage was min at 59.3%, max at 85.7% with a median of 75.0%. Items 'Timeline', 'Diagnostic assessment', 'Follow up and outcomes', 'Informed consent' were not reported in more than 50% of all case reports. Items 'Keywords', 'Abstract', 'Introduction', 'patient information', 'Diagnostic assessment', 'Therapeutic interventions', 'Follow up and outcomes' were not sufficiently reported in more than 50% of all case reports. For CARES guideline, 'Sufficient' percentage was min at 0%, max at 50% with a median of 0%. Sum of 'Sufficient', 'Not sufficient' percentage was min at 33.3%, max at 100% with a median of 92.9%. Items of herbal prescription 'herb', 'decoction', 'use', items of acupuncture treatment 'materials', 'techniques', items of moxibustion treatment 'materials', 'techniques' were not sufficiently reported in more than 50% of all case reports. Conclusions: The reporting rate of items was good. But the quality of reporting was low. Also, particular items were not reported frequently. Therefore, there is a need to improve the quality of case reports in Journal of Oriental Neuropsychiatry.

• Proceedings of the Korean Society of Crop Science Conference
• /
• 2017.06a
• /
• pp.290-290
• /
• 2017

Rice (Oryza sativa L.) is one of the most consumed staple food crop which is energy source as carbohydrate and also is considered as the important antioxidant sources including various phenolic compounds. According to the increasing demand of healthy life, the concern to antioxidant also is increasing because of its health-promoting effect. Phenolic compounds are one of the plant secondary metabolites class, which shows various benefits to preventing or treating chronic diseases. In this study, we have measured the total phenol content from total 647 rice samples using the Floin-Ciocalteau method, and then were selected 30 rice genetic resources classified with high, middle, and low group on the basis of total phenol content. The average of the total phenol content of each group was high-group ($6892.9{\pm}488.5{\mu}g\;GAE/g$) > middle-group ($1428.1{\pm}76.0{\mu}g\;GAE/g$) > low-group ($97.6{\pm}11.4{\mu}g\;GAE/g$). The selected rice samples were analyzed with LC-MS/MS to find the composition and concentration of individual phenolic in rice grain. High-group and middle-group contained large amounts of protocatechuic acid and (+)-catechin whereas low-group showed limited amount. Among high-group samples, rice samples with black pericarp color (IT 174089, IT 220079, and IT 259958) had high content of peonidin-3-O-glucoside. Further, these black rice samples were special since polydatin, rarely found stilbenoid in rice grain, was detected. Overall, both the sum of phenolic acid and the sum of flavonoid were high-group > middle-group > low-group. Also, each group exhibited different phenolic compositions; high-group consisted of flavonoid more than phenolic acid, middle-group and low-group was comprised of phenolic acid rather than flavonoid, and non-pigmented rice was composed by fully phenolic acid. The total phenol content had positive relationships with the sum of phenolic compound (r = 0.64), the sum of flavonoid (r = 0.74) at the significance level of p < 0.0001. In addition, protocatechuic acid and quercetin showed positive correlation with above phenolic composition parameters; in order, r = 0.98, 0.65 for protocatechuic acid and r = 0.73, 0.78 for quercetin (p < 0.0001). In conclusion, the total phenol content assay showed the possibility of utilization as a phenolic composition indicator in rice grain. Also, this result was suggested study pigment on other material.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.18 no.4
• /
• pp.305-316
• /
• 2014

The Hodge-Helmholtz decomposition splits a vector field into the unique sum of a divergence-free vector field (solenoidal part) and a gradient field (irrotational part). In a bounded domain, a boundary condition needs to be supplied to the decomposition. The decomposition with the non-penetration boundary condition is equivalent to solving the Poisson equation with the Neumann boundary condition. The Gibou-Min method is an application of the Poisson solver by Purvis and Burkhalter to the decomposition. Using the $L^2$-orthogonality between the error vector and the consistency, the convergence for approximating the divergence-free vector field was recently proved to be $O(h^{1.5})$ with step size h. In this work, we analyze the convergence of the irrotattional in the decomposition. To the end, we introduce a discrete version of the Poincare inequality, which leads to a proof of the O(h) convergence for the scalar variable of the gradient field in a domain with general intersection property.

• Tuberculosis and Respiratory Diseases
• /
• v.61 no.3
• /
• pp.218-226
• /
• 2006

Background: The lung volume and diffusing capacity are influenced by ethnicity. However, there are no equations for predicting the normal lung volume in the adult Korean population, and there is only one equation for diffusing capacity. The aim of this study is to select the most suitable reference equation for the Korean population. Method: 30 men and 33 women at Hanyang University Guri Hospital, and 27 men and 34 women at Asan Medical Center in healthy nonsmoking adults were enrolled in this study. The subject's age, gender, height, weight, lung volume by plethysmography, and diffusing capacity by a single breathing method were obtained. The most suitable equation with the lowest sum of residuals between the observed and predicted values for lung volume and diffusing capacity was selected. Result: At Hanyang University Guri Hospital, the equations with the lowest sum of residuals in the total lung capacity were ECSC's equation in males (sum of residual: 0.04 L) and Crapo/Morris's equation (-1.04) in women. At the Asan Medical Center, the equations with the lowest sum of residuals in the total lung capacity were Goldman/Becklake's equation in males (sum of residual: -2.35) and the ECSC's equation -4.49) in women. The equations with the lowest sum of residuals in the Diffusing capacity were Roca's equation in males (sum of residual: -13.66 ml/min/mmHg) and Park's in women (25.08) in Hanyang University Guri hospital and Park's equation in all cases in the Asan Medical Center (male: -1.65, female: -6.46). Conclusions: Until a reference equstion can be made for healthy Koreans by sampling, ECSC's equation can be used for estimating the lung volume and Park's can be used for estimating the diffusing capacity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4A
• /
• pp.332-340
• /
• 2010

In this paper, we deal with multi-user diversity scheduling methods that transmit simultaneously signals from multiple users using superposition coding multiplexing. These methods can make various scheduling methods be obtained, according to strategies for user selection priority from the first user to the first-following users, strategies for per-user power allocation, and resulting combining strategies. For the first user selection, we consider three strategies such as 1) higher priority for a user with a better channel state, 2) following the proportional fair scheduling (PFS) priority, 3) higher priority for a user with a lower average serving rate. For selection of the first-following users, we consider the identical strategies for the first user selection. However, in the second strategy, we can decide user priorities according to the original PFS ordering, or only once an additional user for power allocation according to the PFS criterion by considering a residual power and inter-user interference. In the strategies for power allocation, we consider two strategies as follows. In the first strategy, it allocates a power to provide a permissible per-user maximum rate. In the second strategy, it allocates a power to provide a required per-user minimum rate, and then it reallocates the residual power to respective users with a rate greater than the required minimum and less than the permissible maximum. We consider three directions for scheduling such as maximizing the sum rate, maximizing the fairness, and maximizing the sum rate while maintaining the PFS fairness. We select the max CIR, max-min fair, and PF scheduling methods as their corresponding reference methods [1 and references therein], and then we choose candidate scheduling methods which performances are similar to or better than those of the corresponding reference methods in terms of the sum rate or the fairness while being better than their corresponding performances in terms of the alternative metric (fairness or sum rate). Through computer simulations, we evaluate the sum rate and Jain’s fairness index (JFI) performances of various scheduling methods according to the number of users.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.5
• /
• pp.107-112
• /
• 2015

This paper proposes a simplified algorithm devised to obtain optimal solution to the marriage problem. In solving this problem, the most widely resorted to is the Gale-Shapley algorithm with the time complexity of $O({\mid}V{\mid}^2{\mid}E{\mid})$. The proposed algorithm on the other hand firstly constructs a $p_{ij}$ matrix of inter-preference sum both sexes' preference over the opposite sex. Secondly, it selects $_{min}p_i$ from each row to establish ${\mid}p_{.j}{\mid}{\geq}2,j{\in}S$, ${\mid}p_{.j}{\mid}=1$, $j{\in}H$, ${\mid}p_{.j}{\mid}=0$, $j{\in}T$. Finally, it shifts $_{min}\{_{min}p_{ST},p_{SH}+p_{HT\}$ for $_{min}P_{ST}$ of $S{\rightarrow}T$ and $p_{SH}+p_{HT}$, $p_{HT}<_{min}p_{ST}$ of $S{\rightarrow}H$, $H{\rightarrow}T$. The proposed algorithm has not only improved the Gale-Shapley's algorithm's complexity of $O({\mid}V{\mid}^2{\mid}E{\mid})$ to $O({\mid}V{\mid}^2)$ but also proved its extendable use on unbalanced marriage problems.