• Korean Management Science Review
• /
• v.12 no.3
• /
• pp.177-185
• /
• 1995

This paper presents a Tabu Search method to minimize a number of tardy jobs in the nonidentical parallel machine scheduling. The Tabu Search method employs a restricted neighborhood for the reduction of computation time. In this paper, we use two different types of method for a single machine scheduling. One is Moore's algorithm and the other is insertion method. We discuss computational experiments on more than 1000 test problems.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.417-420
• /
• 2002

In this paper, we propose a VLSI architecture for computation of the SVM(Support Vector Machine) that has become established as a powerful technique for solving a variety of classification, regression, and so on. When we compare the proposed systolic arrays with the conventional method, our architecture exhibits a lot of advantages in terms of latency and throughput rate.

• Proceedings of the KIPE Conference
• /
• 2001.10a
• /
• pp.768-772
• /
• 2001

The paper deals with the control of the synchronous reluctance machine without position sensor. A method for the computation of the transformation angle out of terminal voltages and currents is presented. The injection of test signals allows operation at zero speed. Fundamental for this control scheme is the exact modelling of the machine, where especially the saturable inductances are of central interest. The accuracy of the angle estimation method over the whole operating range including field-weakening is discussed in detail. The implementation of the angle estimation method in a rotor-oriented control scheme and practical results are demonstrated.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.6
• /
• pp.2262-2267
• /
• 2018

In electric machine design, there is a large computation cost for finite element analyses (FEA) when analyzing nonlinear characteristics in the machine Therefore, for the optimal design of an electric machine, designers commonly use an optimization algorithm capable of excellent convergence performance. However, robustness consideration, as this factor can guarantee machine performances capabilities within design uncertainties such as the manufacturing tolerance or external perturbations, is essential during the machine design process. Moreover, additional FEA is required to search robust optimum. To address this issue, this paper proposes a computationally efficient robust optimization algorithm. To reduce the computational burden of the FEA, the proposed algorithm employs a useful technique which termed static analysis assisted technique (SAAT). The proposed method is verified via the effective robust optimal design of electric machine to reduce cogging torque at a reasonable computational cost.

• Proceedings of the Korean Society for Cognitive Science Conference
• /
• 2000.05a
• /
• pp.322-328
• /
• 2000

This study discusses cognition as a computable mapping in cognitive system and relates G del's Incompleteness Theorems to the computability of cognition from a metamathematical perspective. Understanding cognition as a from of computation requires not only Turing machine models but also neural network models. In previous studies of computation by cognitive systems, it is remarkable to note how little serious attention has been given to the issue of computation by neural networks with respect to G del's Incompleteness Theorems. To address this problem, first, we introduce a definition of cognition and cognitive science. Second, we deal with G del's view of computability, incompleteness and speed-up theorems, and then we interpret G del's disjunction on the mind and the machine. Third, we discuss cognition as a Turing computable function and its relation to G del's incompleteness. Finally, we investigate cognition as a neural computable function and its relation to G del's incompleteness. The results show that a second-order representing system can be implemented by a finite recurrent neural network. Hence one cannot prove the consistency of such neural networks in terms of first-order theories. Neural computability, theoretically, is beyond the computational incompleteness of Turing machines. If cognition is a neural computable function, then G del's incompleteness result does not limit the compytational capability of cognition in humans or in artifacts.

• Proceedings of the KIEE Conference
• /
• 1996.07a
• /
• pp.68-70
• /
• 1996

In this paper, an efficient parallel computation method for solving large sparse systems of linear algebraic equations by using Cholesky's method in the finite element method is studied. The methods of minimizing the number of fill-ins in the factorization process of factorization are investigated for minimizing the amount of memory and computation time. The parallel programming is implemented under the PVM(Parallel Virtual Machine) environment. The method of load-distribution is studied for minimizing the computation time and the communication time.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2004.04a
• /
• pp.430-438
• /
• 2004

Among the optimization method, GA (genetic algorithm) is a very powerful searching method enough to compete with design sensitivity analysis method. GA is very easy to apply, since it dose not require any design sensitivity information. However, GA has been computationally not efficient due to huge repetitive computation. In this study, parallel computation is adopted to Improve computational efficiency, Paralleled GA is introduced on a clustered LINUX based personal computer system.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.14 no.3
• /
• pp.54-59
• /
• 2005

The cylindrical object are widely used as mechanical parts in the manufacturing process. In order to handling those objects using a robot or an automated machine automatically, the pose of the object must be known. The pose can be described by two rotation angles; one angle about the x axis and the other about the y axis. In the many previous researches these angles were obtained by the computationally intensive algorithm, that is, fitting the data as a polynomial and doing pseudo inverse. So that, this method required high performance microprocessor. In this paper in order to avoid complex computation, a new method based on a genetic algorithm is proposed and analyzed through a series of simulations. This algorithm utilized the geometry of the cylindrical shape. The simulation results show that this method find the pose angles very well In most cases, but the computation time is randomly changed because the genetic algorithm is basically one of the random search method.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.35 no.11
• /
• pp.479-486
• /
• 1986

It is necessary to consider a rotor movement in dynamic analysis on the flux distribution of electric machinery by FEM. Therefore, if air-gap domain was subdivided into triangular elements, computation results contain errors due to variation of element shape in air-gap because the nodal points corresponding to the rotor are displaced in analyzing domain for the time difference. In order to reduce this errors, the paper presents a application of a Macro Air-gap Element that interpolation function is obtained analytically and a means to join it with linear triangular elements in the rotating machine or in the linear machine. At the end of paper, setting up analytic domain model, it compares analytic solution with the computation results of Macro Air-gap Element appliction and that of linear triangular element subdivision only to each cases of nodal displacement. And it carries out that errors due to variation of element shape are reduced effectively by application of a Macro air-gap element.

• Journal of Advanced Marine Engineering and Technology
• /
• v.16 no.5
• /
• pp.29-38
• /
• 1992

This paper describes the general formulation for the in-plane longitudinal and flexural coupled free vibration analysis of a branched structure. The branched structure, which is mainly found in machine tools, pipeline systems and so on, has some crooked parts and subsystems. And it modeled as a distributed mass system. The superiority of the present method to the transfer matrix method in the computation accuracy and speed was confirmed by the numerical computation results. Moreover, we comfirmed that boundary and intermediate conditions have been controlled by the spring constants.