• 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 Korean Society of Transportation
• /
• v.22 no.4 s.75
• /
• pp.85-96
• /
• 2004

Given a Path represented by a sequence of link numbers in a transportation network, the reasonable path is defined as a path that any link is appeared multiple times in it. Application of the link labelmethod(LLM) to the shortest path algorithms(SPA) enables to model the reasonable path choice behavior in urban networks. This study aims at expanding the LLM to a Kth shortest path algorithms(KPSA), which adopts the node label setting method. The small-scaled network test demonstrated that the proposed algorithm works correctly and the revised Sioux fall network test showed that the path choice behaviors are reasonably reflected. In the large-scaled network based on the South Korea peninsula, drivers' route diversion perceptions are included as cost terms in total cost. The algorithm may be applied as an alternative route information tools for the deployment of ATIS.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.613-615
• /
• 2001

최단경로 탐색에 있어서 출발지와 목적지 사이의 최단경로를 계산하는데 있어서 Label-Setting 알고리즘이 Label-Correcting 알고리즘보다 낫다고 믿어왔다. 하지만 특수한 경우에는 Label-Correcting 알고리즘이 GIS기반의 도로에서 더 좋은 결과를 보인다고 Benjamin의 논문에서 밝혔다[1]. 본 논문에서는 Label-Correcting 알고리즘인 Pallottino의 Graph Growth 알고리즘을 수정하여 One-to-One 최단경로탐색에 적합한 알고리즘을 제안한다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.3
• /
• pp.20-33
• /
• 2006

Because of rapid expansion of third party logistics, fierce competition in the transportation industry, and the diversification and globalization of transportation channels, an effective transportation planning by means of multimodal transport is badly needed. Accordingly, this study aims to suggest an optimal transport algorithm for the multimodal transport in the international logistics. As a solution for this problem, first of all, we have applied a pruning algorithm to simplify it, suggesting a heuristic algorithm for constrained shortest path problem to find out a feasible area with an effective time range, which has been applied to the Label Setting Algorithm, consequently leading to multiple Pareto optimal solutions. Also, in order to test the efficiency of the algorithm for constrained shortest path problem, this paper has applied it to the actual transportation path from Busan port of Korea to Rotterdam port of Netherlands.

• 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.

• Investigative Magnetic Resonance Imaging
• /
• v.24 no.3
• /
• pp.123-131
• /
• 2020

Purpose: Joint label fusion (JLF) is a popular multi-atlas-based segmentation algorithm, which compensates for dependent errors that may exist between atlases. However, in order to get good segmentation results, it is very important to set the several free parameters of the algorithm to optimal values. In this study, we first investigate the feasibility of a JLF algorithm for prostate segmentation in MR images, and then suggest the optimal set of parameters for the automatic prostate segmentation by validating the results of each parameter combination. Materials and Methods: We acquired T2-weighted prostate MR images from 20 normal heathy volunteers and did a series of cross validations for every set of parameters of JLF. In each case, the atlases were rigidly registered for the target image. Then, we calculated their voting weights for label fusion from each combination of JLF's parameters (r_pxy, r_pz, r_sxy, r_sz, β). We evaluated the segmentation performances by five validation metrics of the Prostate MR Image Segmentation challenge. Results: As the number of voxels participating in the voting weight calculation and the number of referenced atlases is increased, the overall segmentation performance is gradually improved. The JLF algorithm showed the best results for dice similarity coefficient, 0.8495 ± 0.0392; relative volume difference, 15.2353 ± 17.2350; absolute relative volume difference, 18.8710 ± 13.1546; 95% Hausdorff distance, 7.2366 ± 1.8502; and average boundary distance, 2.2107 ± 0.4972; in parameters of r_pxy = 10, r_pz = 1, r_sxy = 3, r_sz = 1, and β = 3. Conclusion: The evaluated results showed the feasibility of the JLF algorithm for automatic segmentation of prostate MRI. This empirical analysis of segmentation results by label fusion allows for the appropriate setting of parameters.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2006.05a
• /
• pp.95-108
• /
• 2006

Because of rapid expansion of third party logistics, fierce competition in the transportation industry, and the diversification and globalization of transportation channels, an effective transportation planning by means of multimodal transport is badly needed. Accordingly, this study aims to suggest an optimal transport algorithm for the multimodal transport in the international logistics. Cargoes and stopovers can be changed numerously according to the change of transportation modes, thus being a NP-hard problem. As a solution for this problem, first of all, we have applied a pruning algorithm to simplify it, suggesting a heuristic algorithm for constrained shortest path problem to find out a feasible area with an effective time range and effective cost range, which has been applied to the Label Setting Algorithm, consequently leading to multiple Pareto optimal solutions. Also, in order to test the efficiency of the algorithm for constrained shortest path problem, this paper has applied it to the actual transportation path from Busan port of Korea to Rotterdam port of Netherlands.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2019.07a
• /
• pp.267-270
• /
• 2019

Through this research, the rating data of shops were analyzed. The model was designed for discrete multiple classification as to the corresponding data, and the following experiments were initiated to observe the learned machine. By comparing each benchmarks in the experiments, which contains different setting variables for the machine model, the hit ratio was measured which indicates how much it is matched with the expected label. By analyzing those results from each benchmarks, the model was redesigned one time during the research and the effects of each setting variables on this machine were clarified. Furthermore, the research result left the future works, which are related with how the learning could be improved and what should be designed in the further research.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.1
• /
• pp.7-16
• /
• 2016

This paper discusses a method of selecting variant groups to be reviewed for LGR (Label Generation Rule) of Internet Top-Level Hanja Domain. The most difficult problem in setting up LGR of Internet Top-Level Hanja Domain is how to treat Hanja variants. If domains containing variants (e.g.: 東海國) are directed to different addresses, confusion will arise. Therefore, it is desirable that such domains are directed to the same address. Since variant groups of Korea and China are not same, we need to unify variant groups of Korea and China. In the process of reviewing 3093 Chinese variant groups, the author found that Korea does not need to review Chinese variant groups which include no or just one Korean Hanja character. Korea only need to review Chinese variant groups which include two or more Korean Hanja characters. By doing so, the author could reduce the number of Chinese variant groups to be reviewed by Korea from 3093 to 303, which is only one-tenth of the original number of Chinese variant groups. After Korea finishes reviewing 303 Chinese variant groups selected according to the method suggested in this paper, the job of setting up LGR of Internet Top-Level Hanja domain will be accelerated by negotiating with China.