• Journal of applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.127-133
• /
• 2012

We establish the polynomial convergence of a new class of path-following methods for SDLCP whose search directions belong to the class of directions introduced by Monteiro [3]. We show that the polynomial iteration-complexity bounds of the well known algorithms for linear programming, namely the short-step path-following algorithm of Kojima et al. and Monteiro and Alder, carry over to the context of SDLCP.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.24 no.2
• /
• pp.153-160
• /
• 2000

A Particle Image Velocimetry(PIV) algorithm is developed to analyze whole flow field both qualitatively and quantitatively. The practical use of PIV requires the use of fast, reliable, computer-based methods for tracking numerous particles suspended in a flow field. The TSS, NTSS, FFT-Hybrid, which are developed in the area of image compression and coding, are introduced to develop fast vector search algorithm. The numerical solution of the lid-driven cavity flow by the ADI algorithm with the Wachspress Formula is introduced to produce synthetic data for the validation of the tracking algorithms. The algorithms are applied to image data of real flow experiments. The comparisons in CPU time and mean error show, with a small loss of accuracy, CPU time for tracking is reduced considerably.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.4
• /
• pp.317-322
• /
• 2002

The major operations of Evolutionary Computation include crossover, mutation, competition and selection. Although selection does not create new individuals like crossover or mutation, a poor selection mechanism may lead to problems such as taking a long time to reach an optimal solution or even not finding it at all. In view of this, this paper proposes a hybrid Evolutionary Programming (EP) algorithm that exhibits a strong capability to move toward the global optimum even when stuck at a local minimum using a synergistic combination of the following three basic ideas. First, a "local selection" technique is used in conjunction with the normal tournament selection to help escape from a local minimum. Second, the mutation step has been improved with respect to the Fast Evolutionary Programming technique previously developed in our research group. Finally, the crossover and mutation operations of the Genetic Algorithm have been added as a parallel independent branch of the search operation of an EP to enhance search diversity.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.2
• /
• pp.211-219
• /
• 1988

In this paper effective block matching algorithms are proposed to find the motion vector. There are two approaches to the estimation of the motion vector in MCC (motion compensated coding), i.e.pel(pixel element) recursive algorithm and block matching algorithm. The search algorithm in this paper is based on the block matching method. The advantage of this algorithm is the reduction of the computation time. In order to reduce the computation time, three mathods are proposed in this paper. These new algorithms are faster than other methods. Compared with the three step algorithm by Koga et al., the average ratio of the computational savings obtained from the proposed algorithm is about 3-4.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.24 no.6
• /
• pp.845-851
• /
• 2000

In this paper, we show the numerical and the experimental results of two-dimensional fluid motions inside a rectangular container subjected to a background rotation added by a rotational oscillation. In the PlY experiment we apply a new algorithm, new three step search(NTSS), to the velocity calculation. In the numerical computation, the linear Ekman-pumping model was used to take the bottom friction effect into account. It was found that it well produces the experimental results at low e number.

• Convergence Security Journal
• /
• v.23 no.3
• /
• pp.29-36
• /
• 2023

With the recent surge in exposure to fake advertising phishing sites in search engines, the damage caused by poor search quality and personal information leakage is increasing. In particular, the seriousness of the problem is worsening faster as the possibility of automating the creation of advertising phishing sites through tools such as ChatGPT increases. In this paper, the source code of fake advertising phishing sites was statically analyzed to derive structural commonalities, and among them, a detection crawler that filters sites step by step based on foreign domains and redirection was developed to confirm that fake advertising posts were finally detected. In addition, we demonstrate the need for new guide lines by verifying that the redirection page of fake advertising sites is divided into three types and returns different sites according to each situation. Furthermore, we propose new detection guidelines for fake advertising phishing sites that cannot be detected by existing detection methods.

• Progress in Medical Physics
• /
• v.11 no.1
• /
• pp.49-57
• /
• 2000

New method about the dose optimization problem in radiation treatment was researched. Since all conditions are more complex and there are more relevant variables, the solution of three-dimensional treatment planning is much more complicate than that of current two-dimensional one. There(ore, in this study, as a method to solve three-dimensional dose optimization problem, the considered variables was minized and researched by reducing the domain that solutions can exist and pre-determining the important beam parameters. First, the dangerous beam range that passes critical organ was found by coordinate transformation between linear accelerator coordinate and patient coordinate. And the beam size and rotation angle for rectangular collimator that conform tumor at arbitrary beam position was also determined. As a result, the available beam position could be reduced and the dependency on beam size and rotation angle, that is very important parameter in treatment planning, totally removed. Therefore, the resultant combinations of relevant variables could be greatly reduced and the dose optimization by objective function can be done with minimum variables. From the above results, the dose optimization problem was solved for the two-dimensional radiation treatment planning useful in clinic. The objective function was made by combination of dose gradient, critical organ dose and dose homogeniety. And the optimum variables were determined by applying step search method to objective function. From the dose distributions by optimum variables, the merit of new dose optimization method was verified and it can be implemented on commercial radiation treatment planning system with further research.

• Korean Journal of Computational Design and Engineering
• /
• v.11 no.3
• /
• pp.183-196
• /
• 2006

A new operation strategy. which can guarantee the data consistency of engineering information among the various intelligent information systems, is presented for engineering information of bridges, and construction methodology of integrated database is developed to support the strategy. The two core standard techniques are adopted to construct the integrated database. One is the Standard for the Exchange of Product Model Data (STEP) for CAD/CAE information and the other is the Extensible Markup Language(XML) for engineering document information. The former enabler structural engineers to handle the structural details with three-dimensional geometry-based information of bridges, and ACIS solid modeling kernel is employed to develop AutoCAD based application modules. The latter can make document files into data type for web-based application modules which assist end-users to search and retrieve engineering document data. In addition, relaying algorithm is developed to integrate the two different information, e.g. CAD/CAE information and engineering document information. The pilot application modules are also developed, and a case study subjected to the Han-Nam bridge is presented at the end of the paper to illustrate the use of the developed application modules.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.10
• /
• pp.43-48
• /
• 2010

In general, in order to reduce an initial cell searching time, W-CDMA systems adopt a three-step cell search scheme: slot synchronization, frame synchronization, and primary scrambling code identification. We consider the second step (frame synchronization), in which a coherent detection using P-SCH (primary synchronization channel) is possible. In this paper, we propose a new coherent detection scheme, where a first order recursive filter is used to enhance channel estimation performance. Computer simulation results indicate that the detection performance of the proposed scheme can be robust over large range of frequency offset.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.57-60
• /
• 2000

This paper presents a new adaptive fast motion estimation algorithm along with its architecture. The conventional algorithm such as full - search algorithm, three step algorithm have some disadvantages which are related to the amount of computation, the quality of image and the implementation of hardware, the proposed algorithm uses spatial correlation and a slope of motion vector in order to reduce the amount of computation and preserve good image quality, The proposed algorithm is better than the conventional Block Matching Algorithm(BMA) with regard to the amount of computation and image quality. Also, we propose an efficient at chitecture to implement the proposed algorithm. It is suitable for real time processing application.