• IE interfaces
• /
• v.16 no.2
• /
• pp.117-124
• /
• 2003

This study focuses on the detailed explanation of the strategic allocation algorithm which can be used as an ATP(Available To Promise) from the perspective of customers, and as a sales plan for sales organizations. A strategic allocation algorithm includes three methods depending on FIXED RATIO, RANK and DEMAND BASIS. In addition, further topics would be discussed regarding the method of system implementation utilizing strategic allocation algorithms and information flow with an aim to integrate such a sales plan into the e-Biz. This study aims to provide a new solution in order to secure emerging competitive factors in today's enterprise world; that is, an achievement of faster business processes. It is suggested that this new solution be implemented in order to achieve an efficient business environment by systemizing the decision making process which in the past was manually conducted.

• Journal of Korean Institute of Industrial Engineers
• /
• v.39 no.2
• /
• pp.135-142
• /
• 2013

In B2B e-Marketplace for free gifts and goods, product-mix recommendation is provided frequently by analysing customer logs and/or performing collaborative and rules-based filtering. This study proposes a new process that encompasses the genetic algorithm and key working processes of B2B e-marketplace based on the previous cooperate client order data. Efficiency and accuracy of the proposed system have been confirmed by cross-confirmation of accumulated data in the e-marketplace. The system can provide better opportunities for manufactures and suppliers to select optimized product-mix without time consuming trials and errors in their B2B e-marketplace networks.

• Industrial Engineering and Management Systems
• /
• v.6 no.2
• /
• pp.119-124
• /
• 2007

The most difficult and time-intensive issue in the successful implementation of genetic algorithms is to find good parameter setting, one of the most popular subjects of current research in genetic algorithms. In this study, we present a new efficient experimental design method for parameter optimization in a genetic algorithm for general job shop scheduling problem using the Taguchi method. Four genetic parameters including the population size, the crossover rate, the mutation rate, and the stopping condition are treated as design factors. For the performance characteristic, makespan is adopted. The number of jobs, the number of operations required to be processed in each job, and the number of machines are considered as noise factors in generating various job shop environments. A robust design experiment with inner and outer orthogonal arrays is conducted by computer simulation, and the optimal parameter setting is presented which consists of a combination of the level of each design factor. The validity of the optimal parameter setting is investigated by comparing its SN ratios with those obtained by an experiment with full factorial designs.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.3E
• /
• pp.124-132
• /
• 2003

We propose a new method for speech/non-speech classifiers based on concepts of the adaptive boosting (AdaBoost) algorithm in order to detect speech for robust speech recognition. The method uses a combination of simple base classifiers through the AdaBoost algorithm and a set of optimized speech features combined with spectral subtraction. The key benefits of this method are the simple implementation, low computational complexity and the avoidance of the over-fitting problem. We checked the validity of the method by comparing its performance with the speech/non-speech classifier used in a standard voice activity detector. For speech recognition purpose, additional performance improvements were achieved by the adoption of new features including speech band energies and MFCC-based spectral distortion. For the same false alarm rate, the method reduced 20-50% of miss errors.

• Proceedings of the KIEE Conference
• /
• 1999.11c
• /
• pp.488-490
• /
• 1999

This paper describes the design of self-tuning speed controller for DC motor drive system using RLS(Recursive Least Squares) algorithm and Pole-Placement method. The model parameters, related to inertia and damping coefficient of motor, are estimated on-line by using RLS estimation algorithm. And a control signal is calculated by using pole placement method. Simulation and experimental results show that the proposed controller possesses excellent adaptation capability than a conventional PI/IP controller under parameter change.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.10a
• /
• pp.248-254
• /
• 2001

This paper presents a progressive algorithm for reconstructing a 3D structure from a given 2D sketch drawing (edge-vertex graph without hidden line removal) according to the user's sketch order. While previous methods reconstruct a 3D structure at once, the proposed method progressively calculate a 3D structure by optimizing the coordinates of vertices of an object according to the sketch order. The progressive method reconstructs the most plausible 3D object quickly by applying 3D constraints that are derived from the relationship between the object and the sketch drawing in the optimization process. The progressive reconstruction algorithm is discussed, and examples from a working implementation are given.

• ETRI Journal
• /
• v.29 no.6
• /
• pp.769-778
• /
• 2007

This paper proposes a multiplication algorithm for $F_{p^m}$, which can be efficiently applied to many pairs of characteristic p and extension degree m except for the case that 8p divides m(p-1). It uses a special class of type- Gauss period normal bases. This algorithm has several advantages: it is easily parallelized; Frobenius mapping is easily carried out since its basis is a normal basis; its calculation cost is clearly given; and it is sufficiently practical and useful when parameters k and m are small.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.377-382
• /
• 2005

This paper presents a new method for the attitude control of planar space robots. In order to control highly constrained non-linear system such as a 3D space robot, the analytical formulation for the system with complex dynamics and effective control methodology based on the formulation, are not always obtainable. In the proposed method, correspondingly, a non-analytical but effective self-organizing modeling method for controlling a highly constrained system is proposed based on a polynomial data mining algorithm. In order to control the attitude of a planar space robot, it is well known to require inputs characterized by a special pattern in time series with a non-deterministic length. In order to correspond to this type of control paradigm, we adopt the Model Predictive Control (MPC) scheme where the length of the non-deterministic horizon is determined based on implementation cost and control performance. The optimal solution to finding the size of the input pattern is found by a solving two-stage programming problem.

• The Journal of the Acoustical Society of Korea
• /
• v.11 no.1
• /
• pp.67-79
• /
• 1992

For effective on-line ARMA parameter estimation, a covariance type ARMA fast transversal filter (FTF) algorithm is presented. The proposed algorithm is a covariance type implementation of ELS(Extended Least Squares) estimator and it is a fast time update recursion which is based on the fact that the correlation matrix of ARMA model satisfies the shift invariance property in each sub-block. The geometric approach is used in the derivation of the proposed algorithm. It takes small computational burden of 13N+37 MADPR(Multiplication And Division Per Recursion). Also, AR and MA orders can be independetly and arbitrarily specified.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.3
• /
• pp.259-268
• /
• 1999

In order to reduce the cost of product and save the processing time, optimal nesting of two-dimensional part is an important application in number of industries like shipbuilding and garment making. There have been many studies on finding the optimal solution of two-dimensional nesting. The problem of two-dimensional nesting has a non-deterministic characteristic and there have been various attempts to solve the problem by reducing the size of problem rather than solving the problem as a whole. Heuristic method and linearlization are often used to find an optimal solution of the problem. In this paper, theoretical and practical nesting algorithm for rectangular, circular and irregular shape of two-dimensional parts is proposed. Both No-Fit-Polygon and Minkowski-Sum are used for solving the overlapping problem of two parts and the dynamic programming technique is used for reducing the number search spae in order to find an optimal solution. Also, nesting designer's expertise is complied into the proposed algorithm to supplement the heuristic method.