• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.36-39
• /
• 1996

In chemical processes, measurement errors reduce the credibility of information and cause inconsistency in material and energy balances. Because multicomposition flows and temperature measurements make material and energy balances nonlinear equations, data reconciliation becomes a nonlinear constrained optimization problem. In multicomposition processes, if we follow general optimization procedure, the number of measurement variables is so large that data reconciliation requires much computation time. We propose the decomposition procedure to reduce the computation time without the decrease of accuracy of data reconciliation. Decomposition procedure finds global variables, that can reduce the nonlinearity of constraints, and divides two sub-optimization problems. Once we optimize the global variables at upper level, we can easily optimize the remain variables at tower level, We can obtain the short computational time and the same accuracy as SQP optimization method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.8
• /
• pp.790-798
• /
• 2011

An efficient sequential computation algorithm of kinematic optimal control is suggested for redundancy resolution of freefloating manipulators. Utilization of minimum principle usually requires involved and tedious procedure of differentiation of Hamiltonian. Due to the constraints of momentum conservation, it is not easy to get exact differential equations of boundary value problem for even relatively simple free-floating manipulator models. To overcome this difficulty, we developed an effective sequential algorithm for the computation of terms appeared in the differential equations. The usefulness of suggested approach is verified by simulation of a planar 3-joints free-floating manipulator.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.12
• /
• pp.603-610
• /
• 2002

In this paper, a new economic dispatch algorithm for unit commitment is proposed to improve both the accuracy of the final solution and the calculation speed of economic dispatch. By using the inverse incremental cost functions, economic dispatch can be transformed into a simple optimization problem associated with an n-th order polynomial equation. The proposed method remarkably reduces the computation time with adaptability to any higher order generation cost functions. The proposed method is tested with sample system, which shows that the proposed algorithm yields more accurate and economical generation scheduling results with high computation speed.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2005.11b
• /
• pp.49-52
• /
• 2005

Flutter analysis procedure can be divided into two steps such as the computation of generalized mass, stiffness, and unsteady aerodynamic matrices and the calculation of major vibration modes frequency and damping values at each flight speed by solving the complex eigenvalue problem. In aircraft flutter analyses, most of the time is spent in the process of computing the unsteady aerodynamic matrices at each Mach-reduced frequency pairs defined. In this study, the method has been presented for computation and extraction of unsteady aerodynamic matrix portions dependent only on aerodynamic model using DMAP ALTER in MSC/NASTRAN SOL 145. In addition, efficient flutter analysis method has been suggested by computing and utilizing the unsteady generalized aerodynamic matrices for each analysis condition using the unsteady aerodynamic matrix portions extracted above.

• Wind and Structures
• /
• v.19 no.1
• /
• pp.35-58
• /
• 2014

A numerical simultaneous solution involving a linear elastic model was applied to study the fluid-structure interaction (FSI) of membrane structures under wind actions, i.e., formulating the fluid-structure system with a single equation system and solving it simultaneously. The linear elastic model was applied to managing the data transfer at the fluid and structure interface. The monolithic equation of the FSI system was formulated by means of variational forms of equations for the fluid, structure and linear elastic model, and was solved by the Newton-Raphson method. Computation procedures of the proposed simultaneous solution are presented. It was applied to computation of flow around an elastic cylinder and a typical FSI problem to verify the validity and accuracy of the method. Then fluid-structure interaction analyses of a saddle membrane structure under wind actions for three typical cases were performed with the method. Wind pressure, wind-induced responses, displacement power spectra, aerodynamic damping and added mass of the membrane structure were computed and analyzed.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2000.04a
• /
• pp.21-25
• /
• 2000

An inverse finite element approach is employed for more capability to design the optimum blank shape from the desired final shape with small amount of expense and computation time For multi-stage sheet metal forming processes numerical analysis is expense difficult to carry out the to its complexities and convergence problem. It also requires lots of computation time. For the analysis of elliptic cup with large aspect ratio intermediate sliding constraint surfaces are difficult to describe. in this paper multi-stage finite element inverse analysis is applied to multi-stage elliptic cup drawing processes to calculate intermediate blank shapes and strain distributions in each stages. To describe intermediate sliding constraint surfaces an analytic scheme is introduced to deal with merged-arc type sliding surfaces.

• Journal of Information Processing Systems
• /
• v.12 no.4
• /
• pp.591-611
• /
• 2016

High dimensional space is the biggest problem when classification process is carried out, because it takes longer time for computation, so that the costs involved are also expensive. In this research, the facial space generated from homogeneous and non-homogeneous polynomial was proposed to extract the facial image features. The homogeneous and non-homogeneous polynomial-based eigenspaces are the second opinion of the feature extraction of an appearance method to solve non-linear features. The kernel trick has been used to complete the matrix computation on the homogeneous and non-homogeneous polynomial. The weight and projection of the new feature space of the proposed method have been evaluated by using the three face image databases, i.e., the YALE, the ORL, and the UoB. The experimental results have produced the highest recognition rate 94.44%, 97.5%, and 94% for the YALE, ORL, and UoB, respectively. The results explain that the proposed method has produced the higher recognition than the other methods, such as the Eigenface, Fisherface, Laplacianfaces, and O-Laplacianfaces.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.24 no.2
• /
• pp.161-197
• /
• 2020

Total variation minimization is standard in mathematical imaging and there have been numerous researches over the last decades. In order to process large-scale images in real-time, it is essential to design parallel algorithms that utilize distributed memory computers efficiently. The aim of this paper is to illustrate recent advances of domain decomposition methods for total variation minimization as parallel algorithms. Domain decomposition methods are suitable for parallel computation since they solve a large-scale problem by dividing it into smaller problems and treating them in parallel, and they already have been widely used in structural mechanics. Differently from problems arising in structural mechanics, energy functionals of total variation minimization problems are in general nonlinear, nonsmooth, and nonseparable. Hence, designing efficient domain decomposition methods for total variation minimization is a quite challenging issue. We describe various existing approaches on domain decomposition methods for total variation minimization in a unified view. We address how the direction of research on the subject has changed over the past few years, and suggest several interesting topics for further research.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.2
• /
• pp.155-160
• /
• 2002

The personnel and salary management business among computation by computer of a general enterprise is very important. The attendance-absence of our office and in and out of office work for employees in business is very important data element. Because of computation by computer system introduction in a general small and medium enterprise is very expensive, until now it is managed simply by handwork data in the attendance book. On the other hand, to solve the cost problem I designed and implemented a diligence and indolence communication management system for using P.O.P Terminal.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.49 no.2
• /
• pp.70-77
• /
• 2000

This paper proposes a method of solving a unit commitment problem using tabu search (TS) which is heuristic algorithm. Ts is a local search method that starts from any initial solution and attempts to determine a better solution using memory structures. In this paper, to reduce the computation time for finding the optimal solution, changing tabu list size as intensification strategy and path relinking method as diversification strategy are proposed. To show the usefulness of the proposed method, we simulated for 10 units system and 110 units system. Numerical results show improvements in the generation costs and the computation time compared with priority list, genetic algorithm(GA), and hybrid GA.