• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.9
• /
• pp.1656-1662
• /
• 2011

In a previous paper, the EMTP modeling technique using search coil test is established through various transient analysis including system grounding condition and grounding resistance for HVDC submarine cables. It was also proved by comparison with real test results. Based on this EMTP modeling technique, in this paper, it will be applied for modeling of ${\pm}180kV$ real HVDC submarine system(Jeju~Haenam). This paper variously analyses the effects of fault resistance including the resistance between core and sheath, the resistance between sheath and amore and the resistance between amore and sea water through EMTP modeling of search coil method. The results can contribute to the accuracy of detailed fault point prediction of search coil test for HVDC submarine cables.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1994.04a
• /
• pp.95-102
• /
• 1994

A path-switching strategy by combining the use of generalized inverse and line search is proposed. A reliable predictor for the tangent vector to bifurcation path is first computed by using the generalized inverse approach. A line search in the direction of maximum gradient of total potential at the point of intersection between the above predictor and a constant loading plane introduced in the vicinity of the detected bifurcation point is then carried out for the purpose of obtaining an improved approximation for a point on bifurcation path. With this approximation obtained, an actual point on bifurcation path is then computed through iteration on the constant loading plane.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.28 no.8
• /
• pp.47-53
• /
• 2014

This paper presents an Differential Search(DS) Algorithm for solving the economic load dispatch(ELD) problems with Valve-Point loading constraints. DS algorithm simulates the Brownian-like random-walk movement used by an organism to migrate. Numerical results on a test system consisting of 13 units show that the proposed approach is faster, more robust and powerful than conventional algorithms. Case studies show the simulation results are better than Lagrange method, the Hopfield neural networks and GA.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.11
• /
• pp.102-111
• /
• 1999

In this paper, we propose a fast full search block matching algorithm using the search region subsampling and the difference of adjacent pixels in current block. In the proposed algorithm, we calculate the lower bound of mean absolute difference (MAD) at each search point using the MAD value of neighbor search point and the difference of adjacent pixels in current block. After that, we perform block matching process only at the search points that need block matching process using the lower bound of MAD at each search point. To calculate the lower bound of MAD at each search point, we need the MAD value of neighbor search point. Therefore, the search points are subsampled at the factor of 4 and the MAD value at the subsampled search points are calculated by the block matching process. And then, the lower bound of MAD at the rest search points are calculated using the MAD value of the neighbor subsampled search point and the difference of adjacent pixels in current block. Finally, we discard the search points that have the lower bound of MAD value exceed the reference MAD which is the minimum MAD value of the MAD values at the subsampled search points and we perform the block matching process only at the search points that need block matching process. By doing so, we can reduce the computation complexity drastically while the motion compensated error performance is kept the same as that of full search block matching algorithm (FSBMA). The experimental results show that the proposed method has a much lower computational complexity than that of FSBMA while the motion compensated error performance of the proposed method is kept same as that of FSBMA.

• Journal of Korean Medical classics
• /
• v.25 no.4
• /
• pp.105-113
• /
• 2012

Objectives : Acquiring information from symptoms is one of the important method to gain clinically available information in korean medicine. Therefore, up to now, study of symptom terms was frequently implemented in promotion of various information project. In data extraction methods using symptom information from DB, information search using synonym and method using ontology is studied and utilized. However, considering concept of symptom has essential information of appeared body area and phenomenon we think that extending synonym and ontology relationship in symptom terms can be useful for search and set to this study. Methods : We collect terms relevant to human body area and structure described in Donguibogam. Synonymous relationship between collected terms is organized. Relationship between collected terms is build to human-body-knowledge table which has form of Concept+Relation+Concept. Type of relationship is limited on a range of expressing content about parts of human body. Result & Conclusion : Search condition is generated automatically using relationship of the upper area in knowledge table contents. Information of next and previous acupuncture point, upper and lower acupuncture point, left and right acupuncture point can be searched using information of acupuncture point location, order, relative position in area, direction in knowledge table contents.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1697-1703
• /
• 1999

In this paper, we propose the fast block matching algorithm with half pel accuracy using the lower bound of mean absolute difference (MAD) at search point of half pel accuracy motion estimation. The proposed method uses the lower bound of MAD at search point of half pel accuracy which calculated from MAD's at search points of integer pel accuracy. We can reduce the computational complexity by executing the block matching operation only at the necessary search point. The points are selected when the lower bound of MAD at that point is smaller than reference MAD of integer pel motion estimation. Experimental results show that the proposed method can reduce the computational complexity considerably and keeping the same performance with conventional method.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.47-49
• /
• 2000

In this paper we propose the multiple local search method(MLSM) based on the motion information of the neighbor blocks. In the proposed method motions are estimated from the multiple searches of many candidate local search regions. To reduce the additional search points we avoid to search the same candidate regions previously visited using the distance from the initial search point to the recently found vector points. In the simulation the proposed method shows more excellent results than that of other gradient based method especially in the search of motion boundary.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.9
• /
• pp.987-992
• /
• 2004

There is the temporal correlation of the video sequence between the motion vector of current block and the motion vector of previous block. In this paper, we propose the improved diamond search pattern using an motion vector prediction candidate search point by the predicted motion information from the same block of the previous frame. Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improves as high as high as 14~24% in terms of average number of search point per motion vector estimation and improved about 0.02~0.37dB on an average except the full search(FS) algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.8
• /
• pp.846-855
• /
• 1992

In this paper, the decrease multipoint search method and Its learning algorithm for optimum value computatlon method of object function Is proposed. Using this method, the number of evaluation point according to searching time can t)e reduced multipoint of the direct search method by applying the unlivarlate method. And the learning algorithm can reprat the same search method in a new established boundary by using the searched result. In order to Investigate the efficience of algorithm, this method this method is applied to Rosenbrock and Powell, Colvelle function that are Impossible or uncertain in traditional direct search method. And the result of application, the optimum value searching oil every function Is successful. Especially, the algorithm is certified as a good calculation method for producing global(absolute) optimum value.

• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.247-256
• /
• 2004

In this paper, we propose the prediction search algorithm for block matching using the temporal/spatial correlation of the video sequence and the renter-biased property of motion vectors The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(Sum of Absolute Difference) value by the predicted motion vector from the same block of the previous frame and the predictor candidate pint in each search region and the predicted motion vector from the neighbour blocks of the current frame. And the searching process after moving the starting point is processed a adaptive search pattern according to the magnitude of motion vector Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved up to the 0.75dB as depend on the video sequences and improved about 0.05∼0.34dB on an average except the FS (Full Search) algorithm.