• Journal of Sasang Constitutional Medicine
• /
• v.26 no.3
• /
• pp.224-240
• /
• 2014

Objectives This research was proposed to present Clinical Practice Guideline(CPG) for Soyangin Disease of Sasang Constitutional Medicine(SCM): Diagnosis and Algorithm. This CPG was developed by the national-wide experts committee consisting of SCM professors. Methods We searched the literature and articles related to Soyangin Symptomatology diagnosis and algorithm. For developing diagnosis and algorithm, we searched the classification, ordinary symptom, present symptom of the Soyangin Symptomatology. Results & Conclusions We classify the Soyangin Symptomatology by 4 steps: Exterior-Interior disease, favorable-unfavorable pattern, mild-moderate-severe-critical pattern (initial-advanced pattern). And at the unfavorable pattern, ordinary symptom is very important. So doctors need to focus on the symptom of unfavorable's ordinary symptom such as temperament inclined symptom, diarrhea, and diurnal body fever.

• Journal of Mechanical Science and Technology
• /
• v.18 no.12
• /
• pp.2209-2215
• /
• 2004

In the present research work, an automated machine vision system and a new algorithm to interpret the inspection data has been developed. In the past, the control of tolerance of front-chassis-module was done manually. In the present work a machine vision system and required algorithm was developed to carryout dimensional evaluation automatically. The present system is used to verify whether the automobile front-chassis-module is within the tolerance limit or not. The directional ability parameters related with front-chassis-module such as camber, caster, toe and king-pin angle are also determined using the present algorithm. The above mentioned parameters are evaluated by the pose of interlinks in the assembly of an automobile front-chassis-module. The location of ball-joint center is important factor to determine these parameters. A method to determine the location of ball-joint center using geometric features is also suggested in this paper. In the present work a 3-D best fitting method is used for determining the relationship between nominal design coordinate system and the corresponding feature coordinate system.

• Nuclear Engineering and Technology
• /
• v.54 no.9
• /
• pp.3422-3428
• /
• 2022

The prompt gamma imaging (PGI) technique is considered as one of the most promising approaches to estimate the range of proton beam in the patient and unlock the full potential of proton therapy. In the PGI technique, a dedicated algorithm is required to estimate the range of the proton beam from the prompt gamma (PG) distribution acquired by a PGI system. In the present study, a new range estimation algorithm was developed for a multi-slit prompt-gamma camera, one of PGI systems, to estimate the range of proton beam with high accuracy. The performance of the developed algorithm was evaluated by Monte Carlo simulations for various beam/phantom combinations. Our results generally show that the developed algorithm is very robust, showing very high accuracy and precision for all the cases considered in the present study. The range estimation accuracy of the developed algorithm was 0.5-1.7 mm, which is approximately 1% of beam range, for 1×10⁹ protons. Even for the typical number of protons for a spot (1×10⁸), the range estimation accuracy of the developed algorithm was 2.1-4.6 mm and smaller than the range uncertainties and typical safety margin, while that of the existing algorithm was 2.5-9.6 mm.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.115-118
• /
• 2000

We present a new variable step size LMS algorithm using the correlation between reference input and error signal of adaptive filter. The proposed algorithm updates each weight of filter by different step size at same sample time. We applied this algorithm to adaptive multip]e-notch filter. Simulation results are presented to compare the performance of the proposed algorithm with the usual LMS algorithm and another variable step algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.48
• /
• pp.185-192
• /
• 1998

A new algorithm is proposed in this paper which efficiently performs join in the temporal database. The main idea is to sort the smaller relation and to partition the larger relation, and the proposed algorithm reduces the cost of sorting the larger relation. To show the usefulness of the algorithm, the cost is analyzed with respect to the number of accesses to secondary storage and compared with that of Sort-Merge algorithm. Through the comparisons, we present and verify the conditions under which the proposed algorithm always outperforms the Sort-Merge algorithm. The comparisons show that the proposed algorithm achieves 10∼30% gain under those conditions.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.430-432
• /
• 2015

This paper describes a hardware implementation of ultra-lightweight block cipher algorithm PRESENT-80/128 that supports for two master key lengths of 80-bit and 128-bit. The PRESENT algorithm that is based on SPN (substitution and permutation network) consists of 31 round transformations. A round processing block of 64-bit data-path is used to process 31 rounds iteratively, and circuits for encryption and decryption are designed to share hardware resources. The PRESENT-80/128 crypto-processor designed in Verilog-HDL was verified using Virtex5 XC5VSX-95T FPGA and test system. The estimated throughput is about 550 Mbps with 275 MHz clock frequency.

• Journal of applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.93-100
• /
• 2012

In this paper, we present a strongly convergent parallel projection algorithm by introducing some parameter sequences for convex feasibility problem. To prove the strong convergence in a simple way, we transmit the parallel algorithm in the original space to an alternating one in a newly constructed product space. Thus, the strong convergence of the parallel projection algorithm is derived with the help of the alternating one under some parametric controlling conditions.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.430-433
• /
• 1999

Woo[8]proposed dual-token based fault-tolerant scheduling algorithm in multiprocessor environment for resolving the problem of old systems that have a central dispatcher processor. However, this algorithm does not present token allocation algorithm in detail when central dispatcher processor has failed. In this paper, we propose a fault detection algorithm and processor selection algorithm for token allocation when central dispatcher processor has failed.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.529-531
• /
• 2001

We present an expectation-maximization algorithm for principal component analysis via orthogonalization. The algorithm finds actual principal components, whereas previously proposed EM algorithms can only find principal subspace. New algorithm is simple and more efficient thant probabilistic PCA specially in noiseless cases. Conventional PCA needs computation of inverse of the covariance matrices, which makes the algorithm prohibitively expensive when the dimensions of data space is large. This EM algorithm is very powerful for high dimensional data when only a few principal components are needed.

• The KIPS Transactions:PartB
• /
• v.17B no.2
• /
• pp.157-162
• /
• 2010

We present a new distributed genetic algorithm that can be used to extract useful information from distributed, large data over the network. The main idea of the proposed algorithms is to determine how many and which individuals move between subpopulations at each site adaptively. In addition, we present a method to help individuals from other subpopulations not be weeded out but adapt to the new subpopulation. We used six data sets from UCI Machine Learning Repository to compare the performance of our approach with that of the single, centralized genetic algorithm. As a result, the proposed algorithm produced better performance than the single genetic algorithm in terms of the classification accuracy with the feature subsets.