• Journal of applied mathematics & informatics
• /
• v.6 no.1
• /
• pp.65-78
• /
• 1999

We present a fast/parallel Poisson solver on disks, based on efficient evaluation of the exact solution given by the Newtonian potential and the Poisson integral. Derived from an integral formula-tion it is more accurate and simpler in parallel implementation and in upgrading to a higher order algorithm than an algorithm which solves the linear system obtained from a differential formulation.

• Proceedings of the KIEE Conference
• /
• 1987.11a
• /
• pp.133-136
• /
• 1987

This paper presents a new algorithm of optimal measurement system by using band matrix characteristic respectively for state estimation. A performance index of measurement system is established to reflect relation among measurement sets, probability of measurement failure and cost of individual meter installation. Selection ranking in the candidates of measurement sets is composed to guarantee the observability for any any single meter outage. Performance index sensitivity is introduced and recursive formula which based on the matrix inversion lemma used for selection. The proposed algorithm is composed of successive addition algorithm, successive elimination algorithm and combinatorial algorithm. The band matrix characteristic could save in memory requirements and calculate the performance index faster than earlier.

• Journal of the Korean Solar Energy Society
• /
• v.38 no.2
• /
• pp.1-13
• /
• 2018

This paper deals with the NREL (National Renewable Energy Laboratory) 5-MW reference wind turbine. The controller which include MPPT (Maximum power point tracking) control algorithm and tower load reduction control algorithm was designed by MATLAB Simulink. This paper propose a tower damper algorithm to improve the existing tower damper algorithm. To improve the existing tower damper algorithm, proposed tower damper algorithm were applied the thrust sensitivity scheduling and PI control method. The thrust sensitivity scheduling was calculated by thrust force formula which include thrust coefficient table. Power and Tower root moment DEL (Damage Equivalent Load) was set as a performance index to verify the load reduction algorithm. The simulation were performed 600 seconds under the wind conditions of the NTM (Normal Turbulence Model), TI (Turbulence Intensity)16% and 12~25m/s average wind speed. The effect of the proposed tower damper algorithm is confirmed through PSD (Power Spectral Density). The proposed tower damper algorithm reduces the fore-aft moment DEL of the tower up to 6% than the existing tower damper algorithm.

• Journal of Korea Multimedia Society
• /
• v.14 no.2
• /
• pp.182-193
• /
• 2011

The aim of this paper is to present the methodology for hand tracking and hand gesture recognition. The detected hand and gesture can be used to implement the non-contact mouse. We had developed a MP3 player using this technology controlling the computer instead of mouse. In this algorithm, we first do a pre-processing to every frame which including lighting compensation and background filtration to reducing the adverse impact on correctness of hand tracking and hand gesture recognition. Secondly, YCbCr skin-color likelihood algorithm is used to detecting the hand area. Then, we used Continuously Adaptive Mean Shift (CAMSHIFT) algorithm to tracking hand. As the formula-based region of interest is square, the hand is closer to rectangular. We have improved the formula of the search window to get a much suitable search window for hand. And then, Support Vector Machines (SVM) algorithm is used for hand gesture recognition. For training the system, we collected 1500 hand gesture pictures of 5 hand gestures. Finally we have performed extensive experiment on a Windows XP system to evaluate the efficiency of the proposed scheme. The hand tracking correct rate is 96% and the hand gestures average correct rate is 95%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.7
• /
• pp.1462-1470
• /
• 2003

According to the necessity about information security as well as the advance of IT system and the spread of the Internet, a variety of cryptography algorithms are being developed and put to practical use. In addition the technique about cryptography attack also is advanced, and the algorithms which are strong against its attack are being studied. If the linear transformation matrix in the block cipher algorithm such as Substitution Permutation Networks(SPN) produces the Maximum Distance Separable(MDS) code, it has strong characteristics against the differential attack and linear attack. In this paper, we propose a new algorithm which cm estimate that the linear transformation matrix produces the MDS code. The elements of input code of linear transformation matrix over GF$({2_n})$ can be interpreted as variables. One of variables is transformed as an algebraic formula with the other variables, with applying the formula to the matrix the variables are eliminated one by one. If the number of variables is 1 and the all of coefficient of variable is non zero, then the linear transformation matrix produces the MDS code. The proposed algorithm reduces the calculation time greatly by diminishing the number of multiply and reciprocal operation compared with the conventional algorithm which is designed to know whether the every square submatrix is nonsingular.

• Atmosphere
• /
• v.18 no.1
• /
• pp.15-23
• /
• 2008

KMA (Korea Meteorological Society) and RSMC (Regional Specialized Meteorological Center) Tokyo - Typhoon Center isue 15/30 m/s radii in the TC (tropical cyclone) advisory for the information on the TC size. Meanwhile, JTWC Beaufort wind force scale, 34 kt and 64 kt correspond to the 'gale' and 'hurricane'. A ned to identify the range of the gale/hurricane wind from the TC bulletin of RSMC Tokyo or KMA that contains only 15/30 m/s radi motivates this study. An algorithm for estimating the radius of gale/huricane wind is developed by utilizing Holland's empirical formula on TC's wind-pressure relationship.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.4
• /
• pp.77-85
• /
• 1999

In this paper. improved the formula of Kass. First of all, improved initial guess inside and outside of an object. So, prevent the of shrink, find more easily and faster the contour of object. Secondly, proposed the algorithm which moved to local minimum with the improvement of formula of the internal energy and $3{times}3$ matrix. Process the noise of local minimum with use of medial filtering. In third, process the phenomenon which edge points gather one point with imposing energy to the energy term. Improve the algorithm to find the contour precisely with the use of threshold. The result of these improvements, make an initial guess easily and find the contour of objects which have higher curvature. Improve the speed of process by reducing the repetition of feedback system.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.15 no.5
• /
• pp.601-614
• /
• 2012

Since the optimized use of sonar systems available for detection is a very practical problem for a given ocean environment, the measure of mission achievability is needed for operating the sonar system efficiently. In this paper, a theory on Measure Of Effectiveness(MOE) for specific mission such as detection is described as the measure of mission achievability, and a recursive Cumulative Detection Probability(CDP) algorithm is found to be most efficient from comparing three CDP algorithms for discrete glimpses search to reduce computation time and memory for complicated scenarios. The three CDPs which are MOE for sonar-maneuver pattern are calculated as time evolves for comparison, based on three different formula depending on the assumptions as follows; dependent or independent glimpses, unimodal or non-unimodal distribution of Probability of Detection(PD) as a function of observation time interval for detection. The proposed CDP algorithm which is made from unimodal formula is verified and applied to OASPP(Optimal Acoustic Search Path Planning) with complicated scenarios.

• Journal of The Korean Astronomical Society
• /
• v.41 no.4
• /
• pp.99-107
• /
• 2008

When a new counting experiment is proposed, it is crucial to predict whether the desired source signal will be detected, or how much observation time is required in order to detect the signal at a certain significance level. The concept of the a priori prediction of the detection limit in a newly proposed experiment should be distinguished from the a posteriori claim or decision whether a source signal was detected in an experiment already performed, and the calculation of statistical significance of a measured source signal. We formulate precise definitions of these concepts based on the statistical theory of hypothesis testing, and derive an approximate formula to estimate quickly the a priori detection limit of expected Poissonian source signals. A more accurate algorithm for calculating the detection limits in a counting experiment is also proposed. The formula and the proposed algorithm may be used for the estimation of required integration or observation time in proposals of new experiments. Applications include the calculation of integration time required for the detection of faint emission lines in a newly proposed spectroscopic observation, and the detection of faint sources in a new imaging observation. We apply the results to the calculation of observation time required to claim the detection of the surface thermal emission from neutron stars with two virtual instruments.

• Journal of Navigation and Port Research
• /
• v.38 no.5
• /
• pp.457-462
• /
• 2014

Indoor-positioning systems are useful to various applications. Navigation system is one of the most popular applications, which needs the information of directions of nodes' movements. Specifically the applications should get the information in real-time to properly show the current moving position of a node. In this paper, simple vector-based algorithms are proposed to compute amount and direction of changes of azimuth of mobile nodes' heading directions using existing indoor positioning systems in indoor environments where azimuth sensors do not work properly. Previous algorithms calculate the azimuth changes by too many steps of topology-based formula. The algorithms proposed in this paper get the amount of changes of azimuth by simple formula based on vector, and determine the direction of changes by the sign of value of simple formula based on the previous movement of nodes. The algorithms are much simpler and less error-prone than previous ones, and then they can detect changes in many location-based applications as well. The performance of the algorithms is proved logically and mathematically.