• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.421-426
• /
• 2006

We propose a new algorithm for K-medoids clustering which runs like the K-means clustering algorithm and test several methods for selecting initial medoids. The proposed algorithm calculates similarity matrix once and uses it for finding new medoids at every iterative step. To evaluate the proposed algorithm we use real and artificial data and compare with the clustering results of other algorithms in terms of three performance measures. Experimental results show that the proposed algorithm takes the reduced time in computation with comparable performance as compared to the Partitioning Around Medoids.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.487-491
• /
• 2008

An informatization is recognized as core factors to reinforce business competitiveness such as formation of a new business relation, prior occupation of the strategic superiority and being a step ahead from the purpose to improve only the whole efficiency of enterprise. But existed evaluation framework has focused on the visible aspect of all the conditions to create the input and output. In previous studies, it's hard to know that how IT affect business value creation. Therefore, this study presents the evaluation of IT structure and IT competency as drivers and inhibitors of informatization and suggests new IT evaluation framework which can estimate IT competency. The new IT Evaluation Framework was verified through survey with experts.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.460-463
• /
• 2008

This study tries to apply standard cost accounting model to evaluate the cost of workflow instances. Previous studies mainly focus on matching workflow activities into the elements of Activity based costing in order to assign cost drivers, but rarely examine how to evaluate their instance cost. In this study, we estimate unrealized standard cost from workflow model, and realized cost from accomplished instances. On running, workflow engine cumulates cost of finished activities and it enables to monitor the difference between the target cost and the actual cost dynamically at each step of workflow processes. We implemented a prototype which shows that the proposed work can evaluate effectively the cost of various workflow patterns.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.410-420
• /
• 1994

In many project-oriented production systems, e.g., shipyards or large-scale steel products manufacturing, resource loading by an activity is flexible, and the activity duration is a function of resource allocation. For example, if one doubles the size of the crew assigned to perform an activity, it may be feasible to complete the activity in half the duration. Such flexibility has been modeled by Weglarz [131 and by Leachman, Dincerler, and Kim [7] in extended formulations of the resource-constrained project scheduling problem. This paper presents a new algorithmic approach to the problem that combines the ideas proposed by the aforementioned authors. The method we propose involves a two-step approach: (1) solve the resource-constrained scheduling problem using a heuristic, and (2) using this schedule as an initial feasible solution, find improved resource allocations by solving a linear programming model. We provide computational results indicating the superiority of this approach to previous methodology for the resource-constrained scheduling problem. Extensions to the model to admit overlap relationships of the activities also are presented.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.1122-1127
• /
• 2003

Typical application of detecting piecewise-linear curves includes vectorizing of scanned drawings whirh is a vital step in installing any geographic information system. This paper considers the problem of optimally approximating a piecewise linear curve to a set of digital points while satisfying given intersection angles between each pair of neighboring lines. The criterion for optimality is to minimize the sum of squared deviations. The problem is formulated as an unconstrained nonlinear programming model. An algorithm which guarantees an optimal solution is then proposed and its validity is tested with both a synthetically generated image and a real image. The test results illustrate the excellent performance of the proposed algorithm.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.729-733
• /
• 2003

The presence of local features within clusters incurred by multi-modal nature of data prohibits many conventional clustering techniques from working properly. Especially, the clustering of datasets with non-Gaussian distributions within a cluster can be problematic when the technique with implicit assumption of Gaussian distribution is used. Current study proposes a simple tandem clustering method composed of k-means type algorithm and hierarchical method to solve such problems. The multi-modal dataset is first divided into many small pre-clusters by k-means or fuzzy k-means algorithm. The pre-clusters found from the first step are to be clustered again using agglomerative hierarchical clustering method with Kullback- Leibler divergence as the measure of dissimilarity. This method is not only effective at extracting the multi-modal clusters but also fast and easy in terms of computation complexity and relatively robust at the presence of outliers. The performance of the proposed method was evaluated on three generated datasets and six sets of publicly known real world data.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.22 no.3
• /
• pp.82-86
• /
• 2014

Modern Air Traffic Management has been shifted from the conventional vector- based clearances to trajectory based operations (TBO) concept which utilizes four-dimensional trajectory based on the internationally interoperable information using Globally Unique Flight Identifier (GUFI). This study reviews the development for TBO-related standards and Flight Information Exchange Model (FIXM), which has been discussed by the ICAO Air Traffic Management Requirements and Performance Panel (ATMRPP). In addition, plans for the next step with TBO and the Republic of Korea's participation on the Mini-Global Demonstration were also introduced.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.320-325
• /
• 2002

Today many companies offer millions of products to customers. They are faced with a problem to choose particular products . In response to this problem a new marking strategy, recommendation has emerged. Among recommendation technologies collaborative filtering is most preferred. But the performance degrades with the number of customers and products. Namely, collaborative filtering has two major limitations, sparsity and scalability. To overcome these problems we introduced a new recommendation methodology using adjusted product hierarchy, grain. This methodology focuses on dimensionality reduction to improve recommendation quality and uses a marketer's specific knowledge or experience. In addition, it uses a new measure in the neighborhood formation step which is the most important one in recommendation process.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.10a
• /
• pp.143-146
• /
• 2004

In a situation that rank order information on attribute weights is captured, two solution approaches are presented. An exact solution approach via interaction with a decision-maker pursues progressive reduction of a set of non-dominated alternatives by narrowing down the feasible attribute weights set. In approximate solution approach, on the other hand, three categories of approximate methods such as surrogate weights method, the dominance value-based decision rules, and three classical decision rules are presented and their efficacies in terms of choice accuracy are evaluated via simulation analysis. The simulation results indicate that a method, which combines an exact solution approach through interactions with the decision-maker and the dominance value-based approach is recommendable in a case that a decision is not made at a single step under imprecisely assessed weights information.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.2
• /
• pp.59-66
• /
• 2000

In this paper we propose an approximation analysis for the system size distribution of the M/G/c system which is transform-free,. At first we borrow the system size distribution from the Markovian service models and then introduce a newly defined parameter in place of traffic intensity. In this step we find the distribution of the number of customers up to c. Next we concentrate on each waiting space of the queue separately rather than consider the entire queue as a whole. Then according to the system state of the arrival epoch we induce the probability distribution of the system size recursively. We discuss the effectiveness of this approximation method by comparing with simulation for the mean system size.