• Proceedings of the KIPE Conference
• /
• 2001.10a
• /
• pp.428-433
• /
• 2001

This paper presents the control algorithm for maximum efficiency drives of an induction motor system with the high dynamic performance. This system uses a simple model of the induction motor that includes equations of iron losses. The model, which only requires the parameters of induction motor, is referred to a field-oriented frame. The minimum point of the input power can be obtained at the steady state condition. The reference torque and flux currents for the vector control of induction motors are calculated by the optimal efficiency control algorithm. The drive system with the proposed efficiency optimization controller has been implemented by a 32 bit floating point TMS320C32 DSP chip. The results show the effectiveness of the control strategy proposed for the induction motor drive.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1999.11b
• /
• pp.197-200
• /
• 1999

MPEG-4 오디오 부호기의 일부인 HVXC(Harmonic and Vector excitation Coding) 부호기는 음성의 무성음 구간에서는 CELP 코덱, 유성음 구간에서는 MBE 코덱을 이용하여 부호화하는 구조로서, 많은 연산량을 필요로 하여 범용DSP를 이용한 실시간 구현의 장애요소로 작용한다. 본 논문에서는 TMS320C6701 DSP를 이용하여 많은 연산 시간을 요하는 함수들에 대한 C언어 및 어셈블리 레벨의 최적화를 수행하여 HVXC 함수들의 실행시간을 단축하고 이를 라이브러리화 하여 실시간 구현에 이용가능 하도록 하였다.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.294-299
• /
• 2005

We have studied unbound docking for 12 protein-protein complexes using conformational space annealing (CSA) combined along with statistical pair potentials. The CSA, a powerful global optimization tool, is used to search the conformational space represented by a translational vector and three Euler amgles between two proteins. The energy function consists of three statistical pair-wise energy terms; one from the distance-scaled finite ideal-gas reference state (DFIRE) approach by Zhou and the other two derived from residue-residue contacts. The residue-residue contact terms describe both attractive and repulsive interactions between two residues in contact. The performance of the CSA docking is compared with that of ZDOCK, a well-established protein-protein docking method. The results show that the application of CSA to the protein-protein docking is quite successful, indicating that the CSA combined with a good scoring function is a promising method for the study of protein-protein interaction.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2003.05a
• /
• pp.283-287
• /
• 2003

In recent years, design of an optimal blank shape is very important for sheet metal forming process in the automobile industry because the raw material cost rate is significant part in the automobile industry. With the design of an optimal blank shape, the engineer can protect a blank from an excessive holding force to improve the quality and reduce the ratio of material scrap. Therefore design of an optimal blank shape is inevitable in sheet metal forming process. However, if it causes a complicated shape of blank, it may be difficult to do the blank layout optimally. In this study, we developed software of optimal blank layout connected with the software of optimal blank shape design which was created in the past by the present authors. And by using these softwares, we would like to present the method in order to get optimal utilization ratio easily and precisely within short time for the sequence of works from design to blank layout.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2006.11a
• /
• pp.840-843
• /
• 2006

The determination of firing order is very significant procedure in initial stage of design for medium speed diesel engine. Generally, the selection of firing order has been accomplished in view of minimum excitation forces condition. In this paper all possible firing orders under the given number of cylinder were considered to decide the optimum. Meanwhile torsional vibration characteristics using the phase vector sum method and minimum excitation force concept were applied. From these results, some superior cases were selected. And then, the torsional vibration response analysis and the resonance characteristics of engine structure were investigated for the final decision.

• Journal of Ocean Engineering and Technology
• /
• v.26 no.4
• /
• pp.1-7
• /
• 2012

This paper deals with the global path planning problem for AUVs (autonomous underwater vehicles) in a tidal current field. The previous researches in the field were unsuccessful at simultaneously addressing the two issues of obstacle avoidance and tidal current-based optimization. The use of a genetic algorithm is proposed in this paper to move past this limitation and solve both issues at once. Simulation results showed that the genetic algorithm could be applied to generate an optimal path in the field of a tidal current with multiple obstacles.

• Journal of Information Processing Systems
• /
• v.13 no.2
• /
• pp.321-339
• /
• 2017

In this work, we are interested in the extraction of areas of interest from satellite images by introducing a MO-TRIBES/OC-SVM approach. The One-Class Support Vector Machine (OC-SVM) is based on the estimation of a support that includes training data. It identifies areas of interest without including other classes from the scene. We propose generating optimal training data using the Multi-Objective TRIBES (MO-TRIBES) to improve the performances of the OC-SVM. The MO-TRIBES is a parameter-free optimization technique that manages the search space in tribes composed of agents. It makes different behavioral and structural adaptations to minimize the false positive and false negative rates of the OC-SVM. We have applied our proposed approach for the extraction of earthquakes and urban areas. The experimental results and comparisons with different state-of-the-art classifiers confirm the efficiency and the robustness of the proposed approach.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.3
• /
• pp.13-34
• /
• 1993

By operating on many part of a software system concurrently, the parallel processing computers may provide several orders of magnitude more computing power than traditional serial computers. If the Lagrangean approximation procedure is applied to a large scale manufacturing problem which is decomposable into many subproblems, the procedure is a perfect candidate for parallel processing. By distributing Lagrangean subproblems for given multiplier to multiple processors, concurrently running processors and modifying Lagrangean multipliers at the end of each iteration of a subgradient method,a parallel processing of a Lagrangean approximation procedure may provide a significant speedup. This purpose of this research is to investigate the potential of the parallelized Lagrangean approximation procedure (PLAP) for certain combinational optimization problems in manufacturing systems. The framework of a Plap is proposed for some combinatorial manufacturing problems which are decomposable into well-structured subproblems. The synchronous PLAP for the multistage dynamic lot-sizing problem is implemented on a parallel computer Alliant FX/4 and its computational experience is reported as a promising application of vector-concurrent computing.

• Proceedings of the KIEE Conference
• /
• 2006.07d
• /
• pp.1830-1831
• /
• 2006

In this paper, the search is conducted along each of the coordinate directions for finding the minimum. If $e_i$ is the unit vector along the coordinate direction i, we determine the value a, minimizing f(a)= $f(x+ae_i)$, where a is a real number. A move is made to the new point $x+a_ie_i$ at the end of the search along the direction i. In an n dimensional problem, we define the search along all the directions as one stage. The function value at the end of the stage is compared to the value at the beginning of the stage in establishing the convergence. The gradient appears to be zero at point. We can safeguard this by introducing an acceleration step of one additional step along the pattern direction developed by moves along the coordinate directions.

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.434-439
• /
• 1994

Recently neural networks leave been proposed as new computational tools for solving constrained optimization problems because of its computational power. In this paper, the shortest path finding algorithm is proposed by rising a Hopfield type neural network. In order to design a Hopfield type neural network, an energy function must be defined at first. To obtain this energy function, the concept of a vector-represented network is introduced to describe the connected path. Through computer simulations, it will be shown that the proposed algorithm works very well in many cases. The local minima problem of a Hopfield type neural network is discussed.