• Journal of the Korean Operations Research and Management Science Society
• /
• v.35 no.2
• /
• pp.71-88
• /
• 2010

A density-based outlier detection such as an LOF (Local Outlier Factor) tries to find an outlying observation by using density of its surrounding space. In spite of several advantages of a density-based outlier detection method, the computational complexity of outlier detection has been one of major barriers in its application. In this paper, we present an LOF algorithm that can reduce computation time of a density based outlier detection algorithm. A kd-tree indexing and approximated k-nearest neighbor search algorithm (ANN) are adopted in the proposed method. A set of experiments was conducted to examine performance of the proposed algorithm. The results show that the proposed method can effectively detect local outliers in reduced computation time.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.311-314
• /
• 2004

The 2 DBPP(Two-Dimensional Bin Packing Problem) is a problem of packing each item into a bin so that no two items overlap and the number of required bins is minimized under the set of rectangular items which may not be rotated and an unlimited number of identical rectangular bins. The 2 DBPP is strongly NP-hard and finds many practical applications in industry. In this paper we discuss a tabu search approach which includes tabu list, intensifying and diversification strategies. The HNFDH(Hybrid Next Fit Decreasing Height) algorithm is used as an internal algorithm. We find that use of the proper parameter and function such as maximum number of tabu list and space utilization function yields a good solution in a reduced time. We present a tabu search algorithm and its performance through extensive computational experiments.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.1020-1025
• /
• 2005

The set covering(SC) problem has many practical application of modeling not only real world problems in civilian but also in military. In this paper we study optimal allocation model for maximizing utility of consolidating old fashioned and new air defense weapon system like Patriot missile and develop the new computational algorithm for the SC problem by using simulated annealing(SA) algorithm. This study examines three different methods: 1) simulated annealing(SA); 2) accelerated simulated annealing(ASA); and 3) selection by effectiveness degree(SED) with SA. The SED is adopted as an enhanced SA algorithm that the neighboring solutions could be generated only in possible optimal feasible region at the PERTURB function. Furthermore, we perform various experiments for both a reduced and an extended scale sized situations depending on the number of customers(protective objective), service(air defense), facilities(air defense artillery), threat, candidate locations, and azimuth angles of Patriot missile. Our experiment shows that the SED obtains the best results than others.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.1
• /
• pp.97-97
• /
• 1988

Genetic Algorithms have been successfully applied to various problems (for example, engineering design problems with a mix of continuous, integer and discrete design variables) that could not have been readily solved with traditional computational techniques. But, several problems for which conventional Genetic Algorithms are ill defined are premature convergence of solution and application of exterior penalty function. Therefore, we developed an Improved Genetic Algorithms (IGAs) to solve above two problems. As a case study, IGAs is applied to several nonlinear optimization problems and it is proved that this algorithm is very useful and efficient in comparison with traditional methods and conventional Genetic Algorithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.2
• /
• pp.47-58
• /
• 1988

The dynamic uncapacitated facility location model is formulated by a mixed integer programming. It has the objective of minimizing total discounted costs for meeting demands specified in different time periods at various demand centers. Costs include those for operation of facilities to demand centers and a fixed cost associated with the capital investment. The problem is decomposed into two simple Lagrangian relaxed subproblems which are coordinated by Lagrangian multipliers. We explored the effect of using the subgradient optimization procedure and a viable solution approach is proposed. Computational results are presented and further research directions are discussed.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.15 no.3
• /
• pp.298-305
• /
• 2012

In this paper, we propose an integrated algorithm for scene recognition, which has been a challenging computer vision problem, with application to mobile robot localization. The proposed scene recognition method utilizes SIFT and visual words as local-level features and GIST as a global-level feature. As local-level and global-level features complement each other, it results in improved performance for scene recognition. This improved algorithm is of low computational complexity and robust to image distortions.

• Management Science and Financial Engineering
• /
• v.1 no.1
• /
• pp.39-66
• /
• 1995

This article presents a new model called the periodic square wave(PSW) to describe the material flow of periodic processes involving an intermediate buffer. The material flows into and out of the intermediate buffer are assumed to be periodic square shaped. By using this model, It is proved that the classical economic lot size model with finite supply rate, the so-called EPQ model, can be applicable to the arbitrary periodic demand case. This new model relaxes the original assumption of the constant demand. It is shown, as a unique application example, that the explicit solution for determining both upstream and downstream economic lot size can be obtained with the aid of the PSW model. The PSW model provides more accurate information on analyzing the inventory and production system than the classical approach, without losing simplicity and increasing the computational burden.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2003.10a
• /
• pp.193-199
• /
• 2003

The application of finding occurrences of a pattern that contains gaps includes information retrieval, data mining, and computational biology. As the biological sequences may contain errors, it is important to find not only the exact occurrences of a pattern but also approximate ones. In this paper we present an O(mnk$_{max}$/w) time algorithm for the approximate gapped pattern matching problem, where m is the length of the text, H is the length of the pattern, w is the word size of the target machine, and k$_{max}$ is the greatest error bound for subpatterns.

• Journal of applied mathematics & informatics
• /
• v.3 no.2
• /
• pp.279-290
• /
• 1996

In the present paper we study the Cauchy problem in a Banach space E for an abstract nonlinear differential equation of form $$\frac{d^2u}{dt^2}=-A{\frac{du}{dt}}+B(t)u+f(t, W)$$ where W=($A_1$(t)u, A_2(t)u)..., A_{\nu}(t)u), A_{i}(t),\;i=1,2,...{\nu}$,(B(t), t{\in}I$=[0, b]) are families of closed operators defined on dense sets in E into E, f is a given abstract nonlinear function on $I{\times}E^{\nu}$ into E and -A is a closed linar operator defined on dense set in e into E which generates a semi-group. Further the existence and uniqueness of the solution of the considered Cauchy problem is studied for a wide class of the families ($A_{i}$(t), i =1.2...${\nu}$), (B(t), $t{\in}I$) An application and some properties are also given for the theory of partial diferential equations.

• Journal of applied mathematics & informatics
• /
• v.9 no.2
• /
• pp.695-703
• /
• 2002

The fractional order evolutionary integral equations have been considered by first author in [6], the existence, uniqueness and some other properties of the solution have been proved. Here we study the continuation of the solution and its fractional order derivative. Also we study the generality of this problem and prove that the fractional order diffusion problem, the fractional order wave problem and the initial value problem of the equation of evolution are special cases of it. The abstract diffusion-wave problem will be given also as an application.