• 전기의세계
• /
• v.18 no.6
• /
• pp.23-32
• /
• 1969

The thesis has derived the formulas and computational algorithms useful for predicting and constraining the potential rises on the neutral line in 3-phase, 4-wire distribution line systems in the case of contact faults and single-line grounding faults. In addition it has suggested economically optimal designing conditions herewith of the distribution line systems in conduction with the potential restraining cost functions.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.6
• /
• pp.191-196
• /
• 1997

Fuzzy clustering has been playing an important role in solving many problems. Fuzzy c-Means(FCM) algorithm is most frequently used for fuzzy clustering. But some fixed point of FCM algorithm, know as Tucker's counter example, is not a reasonable solution. Moreover, FCM algorithm is impossible to perform the on-line learning since it is basically a batch learning scheme. This paper presents unsupervised learning networks as an attempt to improve shortcomings of the conventional clustering algorithm. This model integrates optimization function of FCM algorithm into unsupervised learning networks. The learning rule of the proposed scheme is a result of formal derivation based on the gradient descent procedure of a fuzzy objective function. Using the result of formal derivation, two algorithms of fuzzy cluster analysis, the batch learning version and on-line learning version, are devised. They are tested on several data sets and compared with FCM. The experimental results show that the proposed algorithms find out the reasonable solution on Tucker's counter example.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.56
• /
• pp.9-18
• /
• 2000

This paper considers the problem of two-machine, M-parallel flow shop scheduling to minimize makespan, and proposes a series of heuristic algorithms and a branch and bound algorithm. Two processing times of each job at two machines on each line are identical on any line. Since each flow-shop line consists of two machines, Johnson's sequence is optimal for each flow-shop line. Heuristic algorithms are developed in this paper by combining a "list scheduling" method and a "local search with global evaluation" method. Numerical experiments show that the proposed heuristics can efficiently give optimal or near-optimal schedules with high accuracy. with high accuracy.

• Journal of Advanced Marine Engineering and Technology
• /
• v.27 no.7
• /
• pp.914-920
• /
• 2003

In this paper, we deal with two drift compensation algorithms of acceleration sensor for measuring the galloping on power transmission line. Firstly, the block diagram of galloping measurement system is given and a galloping model is presented. Secondly, two compensation algorithms, a simple compensation and a period compensation, are proposed. A simple compensation algorithm uses the drifts of velocity and distance at fixed periods, so it is useful for constant drift case. Next, a period compensation algorithm can compensate a periodic drift. This algorithm uses the previous measured data and compensated data for constant period, where the period is obtained by FFT method. Lastly, the effectiveness of proposed algorithms is verified by comparing between two algorithms in simulation, and its characteristics and the drift error bound are shown, respectively.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.4 s.175
• /
• pp.991-1000
• /
• 2000

Previous area-based stereo matching algorithms find the disparity by first computing the sum of squared differences (SSD) between corresponding points using a rectangular window, and then searching the position of the minimum SSD within the disparity range. These algorithms generate relatively many matching errors around depth discontinuities, since the SSD function may fail to search for the minimum because of varying disparity profiles in such areas. In this paper, in order to improve the matching accuracy around the depth discontinuities, a new correlation function based on robust estimation technique is proposed for stereo matching. In addition, while previous stereo algorithms utilize a single rectangular window for computing the correlation function, the proposed matching algorithm utilizes 4-directional line masks additionally to reduce the matching errors further. It has been turned out that the proposed algorithm reduces matching errors around depth discontinuities significantly. Experimental results are presented in this paper, comparing the performance of the proposed technique with those of previous algorithms using both synthetic and real images.

• Korean Journal of Remote Sensing
• /
• v.28 no.1
• /
• pp.55-67
• /
• 2012

Real-time image georeferencing is required to generate spatial information rapidly from the image sequences acquired by multi-sensor systems. To complement the performance of position/attitude sensors and process in real-time, we should employ on-line aerial triangulation based on a sequential estimation algorithm. In this study, we thus attempt to derive an efficient on-line aerial triangulation algorithm for real-time georeferencing of image sequences. We implemented on-line aerial triangulation using the existing Given transformation update algorithm, and a new inverse normal matrix update algorithm based on observation classification, respectively. To compare the performance of two algorithms in terms of the accuracy and processing time, we applied these algorithms to simulated airborne multi-sensory data. The experimental results indicate that the inverse normal matrix update algorithm shows 40 % higher accuracy in the estimated ground point coordinates and eight times faster processing speed comparing to the Given transformation update algorithm. Therefore, the inverse normal matrix update algorithm is more appropriate for the real-time image georeferencing.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2000.04b
• /
• pp.357-364
• /
• 2000

The three main processes involved in the design of stressed membrane surface are surface form-finding, stress analysis and cutting pattern generation. The last process, cutting pattern generation, is considered as a very important procedure in the aspect of the practical design for the fabric membrane surface. In this paper, The cutting pattern generation technique using the geodesic line algorithms is first introduced. And the numerical examples resulting from this technique are presented. Cable elements are used for the approximating membrane surface and two kinds of model, square line and central line model, are used in pattern generation. Finally, a number of different cutting pattern generation for the same membrane surface is carried out and the numerical results are compared each

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4C
• /
• pp.217-225
• /
• 2011

In this paper, we propose an adaptive de-interlacing algorithm that is based on the degree of local complexity. The conventional intra field de-interlacing algorithms show the different performance according to the ways which find the edge direction. Furthermore, FDD (Fine Directional De-interlacing) algorithm has the better performance than other algorithms but the computational complexity of FDD algorithm is too high. In order to alleviate these problems, the proposed algorithm selects the most efficient de-interacing algorithm among LA (Line Average), MELA (Modified Edge-based Line Average), and LCID (Low-Complexity Interpolation Method for De-interlacing) algorithms which have low complexity and good performance. The proposed algorithm is trained by the DoLC (Degree of Local Complexity) for selection of the algorithms mentioned above. Simulation results show that the proposed algorithm not only has the low complexity but also performs better objective and subjective image quality performances compared with the conventional intra-field methods.

• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.237-242
• /
• 2012

One of the major problems for accurate channel estimation in power line communication systems is impulsive noise. Traditional channel estimation algorithms are based on the assumption of Gaussian noise, or the need to locate the positions of impulsive noise. The algorithms may lose optimality when impulsive noise exists in the channel, or if the location estimation of impulsive noise is inaccurate. In the present paper, an effective channel estimation algorithm based on a robust cost function is proposed to mitigate impulsive noise. The proposed method can provide a closed-form solution, and the application of robust estimation theory enables the proposed method to be free from localization of impulsive noise and thus can guarantee that the proposed method has better performance. Simulations verified the proposed algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11B
• /
• pp.972-984
• /
• 2003

In this paper, new on-line routing algorithms with a bandwidth constraint are proposed. The proposed algorithms may be used for a dynamic LSP setup in MPLS network. We extend the WSP algorithm, the SWP algorithm and a utilization-based routing algorithm into the proposed algorithms by slightly modified K-shortest loopless path algorithms. The performances such as accepted bandwidth, accepted request number and average path length of the proposed and the previous algorithms are evaluated through extensive simulations. All simulations are conducted under the condition that any node can be an ingress or egress node for a LSP setup. The simulation results show that the proposed algorithms have the good performances in most cases in comparison to the previous algorithms. Under the heavy load condition, the algorithms based on the minimum hop path perform better than any other algorithms.