• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.51-61
• /
• 2012

This paper suggests an algorithm that obtains Directed Graph Minimum Spanning Tree (DMST), using Prim MST algorithm which is Minimum Spanning Tree (MST) of undirected graph. At first, I suggested the Prim DMST algorithm that chooses Minimum Weight Arc(MWA) from out-going nodes from each node, considering differences between undirected graph and directed graph. Next, I proved a disadvantage of Prim DMST algorithm and Chu-Liu/Edmonds DMST (typical representative DMST) of not being able to find DMST, applying them to 3 real graphs. Last, as an algorithm that can always find DMST, an advanced Prim DMST is suggested. The Prim DMST algorithm uses a method of choosing MWA among out-going arcs of each node. On the other hand, the advanced Prim DMST algorithm uses a method of choosing a coinciding arc from the out-going and in-going arcs of each node. And if there is no coinciding arc, it chooses MWA from the out-going arcs from each node. Applying the suggested algorithm to 17 different graphs, it succeeded in finding the same DMST as that found by Chu-Liu/Edmonds DMST algorithm. Also, it does not require such a complicated calculation as that of Chu-Liu/Edmonds DMST algorithm to delete the cycle, and it takes less time for process than Prim DMST algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.5
• /
• pp.159-171
• /
• 2011

This paper suggests an algorithm that obtains the Minimum Spanning Tree for directed graph (DMST). The existing Chu-Liu/Edmonds DMST algorithm has chances of the algorithm not being able to find DMST or of the sum of ST not being the least. The suggested algorithm is made in such a way that it always finds DMST, rectifying the disadvantage of Chu-Liu/Edmonds DMST algorithm. Firstly, it chooses the Minimum-Weight Arc (MWA) from all the nodes including a root node, and gets rid of the nodes in which cycle occurs after sorting them in an ascending order. In this process, Minimum Spanning Forest (MST) is obtained. If there is only one MSF, DMST is obtained. And if there are more than 2 MSFs, to determine MWA among all MST nodes, it chooses a method of directly calculating the sum of all the weights, and hence simplifies the emendation process for solving a cycle problem of Chu-Liu/Edmonds DMST algorithm. The suggested Sulee DMST algorithm can always obtain DMST that minimizes the weight of the arcs no matter if the root node is set or not, and it is also capable to find the root node of a graph with minimized weight.

• Journal of Welding and Joining
• /
• v.21 no.1
• /
• pp.48-53
• /
• 2003

The object of this study is to examine the effect of short circuit time ratio (SCTR) and current rise delay time (Td) on the spatter generation at low and medium current range in $CO_2$ welding. The spatter was evaluated by the weight generated in the welding of bead-on-plate for 30 seconds (3 times). Td was varied by order of 0, 0.4, 0.8 and 1.2 msec. At each Td, the short circuit time ratio was varied by the output voltage of the welding power source. In the low current range, it was found that the optimum SCTR was 20~25%, and the minimum spatter generation weight was obtained in the case of Td=0.4msec and SCTR=22% even though the remarkable difference was not showed by the application of Td. In the medium current range, it was confirmed that the arc was stable though the SCTR was increased from 20% to 40% by the control of current wave. Spatter generation weight depended on the variation of Td, and the lowest value of spatter generation weight occurred at Td=0.8~1.2msec.

• Proceedings of the KIEE Conference
• /
• 1994.07b
• /
• pp.1593-1598
• /
• 1994

Recently rotary-arc, thermal expansion and their composite interrupters are widely used in the distribution power system because they have lots of advantages in making the larger interrupting capacity, the smaller size, the lighter weight and the less surge. A model interrupter of rotary-arc type, which has constant stroke and thermal expansion volume, was studied by varying the design parameters, i.e. the number of turns of the driving coil, the inner diameter of the moving contact, the gas pressure and the shape of the fixed contact for this project. Short cicuit current interrupting tests were conducted to the model interrupters by varying the requirements from 42% to 175% of the test voltage, interrupting current and transient recovery voltage for the test duty No.4 of 7.2kV 12.5kA single phase test. The pressure rise, minimum and maximum arcing times were analyzed for each model interrupter. All types of model interrupters showed good interrupting performances and sufficient design margins for the ratings.

• Proceedings of the KIEE Conference
• /
• 2001.04a
• /
• pp.30-32
• /
• 2001

Switched reluctance motors have the advantage a high torque/weight ratio, as the large reluctance torque is made by salient poles of both start and rotor, and a high reliability. On the other hand, the switched reluctance motors have the disadvantage of a large ripple torque which is made by salient poles. So the application for the industrial fields have been limited to special cases. Geometric significant parameters are ${\beta}_r$ and ${\beta}_s$ respectively the rotor and stator pole arc while the significant electric parameters are the angles where the drive switches are turned on and off. It can be simulated that ${\beta}_r$ and ${\beta}_s$ must be chosen in a particular region of the plane (${\beta}_r,\;{\beta}_s$) called the feasible triangle. The aim of this paper is to simulate the minimum of the torque ripple by using finite element method and to determine the best choice of the rotor and stator pole arc.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.7
• /
• pp.893-900
• /
• 2007

This paper suggests an algorithm that improves the disadvantages of the Dijkstra algorithm that is commonly used in GPS navigation system, searching for the shortest path. Dijkstra algorithm, first of all, requires much memory for the performance of the algorithm. It has to carry out number of node minus 1, since it determines the shortest path from all the nodes in the graph, starting from the first node. Therefore, Dijkstra algorithm might not be able to provide the information on every second, searching for the shortest path between the roads of the congested city and the destination. In order to solve these problems, this paper chooses a method of searching a number of nodes at once by means of choosing the shortest path of all the path nodes (select of minimum weight arc in-degree and out-degree), excluding the departure and destination nodes, and of choosing all the arcs that coincide with the shortest path of the path nodes, from all the node outgoing arcs starting from the departure node. On applying the suggested algorithm to 14 various digraphs, we succeeded to search the shortest path. In addition, the result was obtained at the speed of 2 to 3 times faster than that of Dijkstra algorithm, and the memory required was less than that of Dijkstra algorithm.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.46 no.5
• /
• pp.27-39
• /
• 2004

In the first part of this study, five homogeneous regions in view of topographical and geographically homogeneous aspects except Jeju and Ulreung islands in Korea were accomplished by K-means clustering method. A total of 57 rain gauges were used for the regional frequency analysis with minimum rainfall series for the consecutive durations. Generalized Extreme Value distribution was confirmed as an optimal one among applied distributions. Drought rainfalls following the return periods were estimated by at-site and regional frequency analysis using L-moments method. It was confirmed that the design drought rainfalls estimated by the regional frequency analysis were shown to be more appropriate than those by the at-site frequency analysis. In the second part of this study, LH-moment ratio diagram and the Kolmogorov-Smirnov test on the Gumbel (GUM), Generalized Extreme Value (GEV), Generalized Logistic (GLO) and Generalized Pareto (GPA) distributions were accomplished to get optimal probability distribution. Design drought rainfalls were estimated by both at-site and regional frequency analysis using LH-moments and GEV distribution, which was confirmed as an optimal one among applied distributions. Design rainfalls were estimated by at-site and regional frequency analysis using LH-moments, the observed and simulated data resulted from Monte Carlotechniques. Design drought rainfalls derived by regional frequency analysis using L1, L2, L3 and L4-moments (LH-moments) method have shown higher reliability than those of at-site frequency analysis in view of RRMSE (Relative Root-Mean-Square Error), RBIAS (Relative Bias) and RR (Relative Reduction) for the estimated design drought rainfalls. Relative efficiency were calculated for the judgment of relative merits and demerits for the design drought rainfalls derived by regional frequency analysis using L-moments and L1, L2, L3 and L4-moments applied in the first report and second report of this study, respectively. Consequently, design drought rainfalls derived by regional frequency analysis using L-moments were shown as more reliable than those using LH-moments. Finally, design drought rainfalls for the classified five homogeneous regions following the various consecutive durations were derived by regional frequency analysis using L-moments, which was confirmed as a more reliable method through this study. Maps for the design drought rainfalls for the classified five homogeneous regions following the various consecutive durations were accomplished by the method of inverse distance weight and Arc-View, which is one of GIS techniques.