• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.11
• /
• pp.634-639
• /
• 2002

A Shortest Path Algorithm is the method to find the most efficient route among many routes from a start node to an end node. It is based on Labeling methods. In Labeling methods, there are Label-Setting method and Label-Correcting method. Label-Setting method is known as the fastest one among One-to-One shortest path algorithms. But Benjamin[1,2] shows Label-Correcting method is faster than Label-Setting method by the experiments using large road data. Since Graph Growth algorithm which is based on Label-Correcting method is made to find One-to-All shortest path, it is not suitable to find One-to-One shortest path. In this paper, we propose a new One-to-One shortest path algorithm. We show that our algorithm is faster than Graph Growth algorithm by extensive experiments.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.5
• /
• pp.781-793
• /
• 2020

In this paper, we propose a new RLWE-based scheme named μ-Hope that exploits Error Correcting Code(ECC) on NewHope. The previous parameters of NewHope uses 12289 as a prime modulus, and the size of the public key, private key, and ciphertext is 928-byte, 1888-byte, and 1120-byte respectively, which can be said to be larger than other RLWE based algorithms. In this paper, we propose μ-Hope, which changes modulus 12289 to 769 to reduce the size of the public key, private key, and ciphertext. Also, we adopts XE1 as an Error Correcting Code(ECC) to solve the increased decryption failure rate caused by using a small prime modulus. As a result, the size of the public key, private key, and ciphertext decreased by 38%, 37%, and 37% respectively. As the computational efficiency caused by using a small prime modulus exceeds the performance degradation by exploiting ECC, this result in 25% performance improvement for a single key exchange.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.05a
• /
• pp.210-216
• /
• 2000

The features of bit error rate (BER) are discussed, how to analyze statistics of the bit error rate. How many will the BER be improved after correcting one single-error in the block\ulcorner The answer is satisfactory in this paper.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7C
• /
• pp.659-664
• /
• 2006

We propose two error correcting algorithms for high-density optical storage systems. The first algorithm reduces the false-erasure declaration by reducing the sensitivity on random errors and increases the code rate using a simple erasure indication method. The second one exploits just the known indicator flag instead of error correcting code such as Reed-Solomon(RS) code. The proposed algorithms are superior to the error correcting algorithms of conventional systems such as DVD and BD.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.179-188
• /
• 2001

We analyze the property of candidate node set in the network graph, and propose an algorithm to decrease shortest path-finding computation time by using multiple dynamic-range queue(MDRQ) structure. This MDRQ structure is newly created for effective management of the candidate node set. The MDRQ algorithm is the shortest path-finding algorithm that varies range and size of queue to be used in managing candidate node set, in considering the properties that distribution of candidate node set is constant and size of candidate node set rapidly change. This algorithm belongs to label-correcting algorithm class. Nevertheless, because re-entering of candidate node can be decreased, the shortest path-finding computation time is noticeably decreased. Through the experiment, the MDRQ algorithm is same or superior to the other label-correcting algorithms in the graph which re-entering of candidate node didn’t frequently happened. Moreover the MDRQ algorithm is superior to the other label-correcting algorithms and is about 20 percent superior to the other label-setting algorithms in the graph which re-entering of candidate node frequently happened.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.2
• /
• pp.437-447
• /
• 2006

Error Correcting Output Coding(ECOC) is used to solve multi-class problem. It is known that it improves the classification accuracy. In this paper, we compared various criteria to design code matrix while encoding. In addition. we prorpose an ensemble which uses the ability of each classifier while decoding. We investigate the justification of the proposed method through real data and synthetic data.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.1
• /
• pp.25-36
• /
• 2008

Error Correcting Output Codes (ECOC) can improve generalization performance when applied to multicategory classification problem. In this study we propose a new criterion to select hyperparameters included in ECOC scheme. Instead of margins of a data we propose to use the probability of misclassification error since it makes the criterion simple. Using this we obtain an upper bound of leave-one-out error of OVA(one vs all) method. Our experiments from real and synthetic data indicate that the bound leads to good estimates of parameters.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.28A no.5
• /
• pp.339-346
• /
• 1991

In this paper the performance of communication system in the electrical power line using error correcting codes is analysed. The BCH codes and interleaved code are to be used for correcting burst and random errors in the power line channels. The data rate of 2400 bps and the carrier frequency of 12KHz are assumed. Actual power line noise is recorded and simulated in the BPSK PLC system model.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.4
• /
• pp.1219-1231
• /
• 2008

The main object of this paper is to develop a leave-one-out(LOO) bound of all pairwise comparison error correcting output codes (APC-ECOC). To avoid using classifiers whose corresponding target values are 0 in APC-ECOC and requiring pilot estimates we developed a bound based on mean misclassification probability(MMP). It can be used to tune kernel hyperparameters. Our empirical experiment using kernel mean squared estimate(KMSE) as the binary classifier indicates that the bound leads to good estimates of kernel hyperparameters.

• Journal of Korean Foot and Ankle Society
• /
• v.14 no.1
• /
• pp.5-10
• /
• 2010

Purpose: This study was performed to compare the contact area between three different correcting angles after the proximal crescentic and Ludloff osteotomies of the first metatarsal. Materials and Methods: We used the two sawbone models. Proximal crescentic (PCO) and Ludloff osteotomies (LO) were performed and secured using K-wires under the correcting intermetatarsal angle (IMA) $5^{\circ}$, $10^{\circ}$, and $15^{\circ}$. Then each 6 osteotomized model was scanned five times and measured the contact area using the calculating program. We excluded the highest and lowest values. Results: The mean area of cutting surface was 189 $mm^2$ in PCO, 863 $mm^2$ in LO. The mean contact area (contact ratio; contact area $\times$100/area of cutting surface) of PCO was 149 $mm^2$ (79%) in $5^{\circ}$, 139.5 $mm^2$ (74%) in $10^{\circ}$, 107 $mm^2$ (57%) in $15^{\circ}$ IMA. The mean contact area (contact ratio) of LO was 711 $mm^2$ (82%) in $5^{\circ}$, 535.5 $mm^2$ (62%) in $10^{\circ}$, 330 $mm^2$ (38%) in $15^{\circ}$ IMA. Conclusion: A significant decrease in the contact area and contact ratio according to increase in correcting IMA was noticed in LO. We recommend the PCO rather than LO, when the IMA is needed to correct over $15^{\circ}$.