• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.4
• /
• pp.403-410
• /
• 1999

In this study, a parallel algorithm has been developed that can quickly solve the optiaml control problem of large-scale dynamic systems. The algorithm adopts the sequential quadratic programming methods and achieves domain decomposition-type parallelism in computing sensitivities for search direction computation. A silicon wafer thermal process problem has been solved using the algorithm, and a parallel efficiency of 45% has been achieved with 16 processors. Practical methods have also been investigated in this study as a way to further speed up the computation time.

• 한국데이터정보과학회:학술대회논문집
• /
• 2003.10a
• /
• pp.123-123
• /
• 2003

More elaborated methods allowing the usage of binary classifiers for the resolution of multi-class classification problems are briefly presented. This way of using FSVC to learn a K-class classification problem consists in choosing the maximum applied to the outputs of K FSVC solving a one-per-class decomposition of the general problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10a
• /
• pp.812-816
• /
• 1987

A quadratic regulator problem for a class of nonlinear system, in which a small parameter multiplies the control cost, is considered. In the analysis of the problem, we utilize the method of multiple time-scale decomposition which has been devised for analyzing complex linear cheap control problems. In so doing, we extend the class of nonlinear systems, considerably, for which the minimum cost becomes zero as the small parameter goes to zero.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.44.1-44
• /
• 2002

This paper is concerned with the problem of designing a guaranteed cost state feedback controller for singular systems with time-varying delays. The sufficient condition for the existence of a guaranteed cost controller, the controller design method, and the optimization problem to get the upper bound of guaranteed cost function are proposed by LMI(linear matrix inequality), singular value decomposition, Schur complements, and change of variables. Since the obtained sufficient conditions can be changed to LMI form, all solutions including controller gain and upper bound of guaranteed cost function can be obtained simultaneously.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2011.06a
• /
• pp.187-188
• /
• 2011

Independent component analysis (ICA) is a method separating the mixture of signals into statistically and mutually independent ones. It has been applied to not only the Cocktail-party problem but also EEG analysis using the EEG waveform, digital signal processing, image processing and cognitive technique field actively. This study aims to propose a procedure to estimate the modal responses and mode shapes of a floating structure by using the ICA method from measured responses of the floating structure.

• Proceedings of the Korean Society For Composite Materials Conference
• /
• 2000.04a
• /
• pp.38-42
• /
• 2000

In this study, the low velocity impact behavior of the composite laminates has been described by using 3 dimensional nonlinear finite elements. To describe the geometric nonlinearity due to large deformation, the dynamic contact problem is formulated using the exterior penalty finite element method on the base of Total Lagrangian formulation. The incremental decomposition is introduced, and the converged solution is attained by Newton-Raphson Method. The Newmark's constant-acceleration time integration algorithm is used. To make verification of the finite element program developed in this study, the solution of the nonlinear static problem with occurrence of large deformation is compared with ABAQUS, and the solution of the static contact problem with indentation is compared with the Hertz solution. And, the solution of low velocity impact problem for isotropic material is verificated by comparison with that of LS-DYNA3D. Finally the contact force of impact response from the nonlinear analysis are compared with those from the linear analysis.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.11 no.1
• /
• pp.24-35
• /
• 1986

We investigate various methods of the Benders decoposition algorithm in its application to the simple plant location problem. We developed six variants. The master problem may be relaxed as an LP problem up to an appropriate point in time, or need not be solved to the optimality before a cut is added. Furthermore, since the subproblem is highly degenerated, we can generate more than one cuts at a time. The efficiency of the methods are examined using a sample problem. The result showed that the adding two-cut method was superior to the standard method. The LP relaxation and the non-optimization of the master program greatly improved the efficiency. Applying the LP relaxation method, we were able to reduce the computing time by two thirds of the time required by the standard method.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.307-321
• /
• 2004

In this paper, the unsteady Stokes problem is considered and also the pressure-correction method for the problem is described. At a fixed time level, we reduce the problem to two symmetric positive definite problems which depend on a time step parameter. Linear systems that arise from the problems are large, sparse, symmetric, positive definite and ill-conditioned as the time step tends to zero. Preconditioned problems based on an additive Schwarz method for solving the symmetric positive definite problems are derived and preconditioners are defined implicitly. It will be shown that the rate of convergence is independent of the mesh parameters as well as the time step size.

• Journal of Communications and Networks
• /
• v.18 no.6
• /
• pp.884-891
• /
• 2016

The wireless mesh network (WMN) has attracted significant interests as a broadband wireless network to provide ubiquitous wireless access for broadband services. Especially with incorporating multiple orthogonal channels and multiple directional antennas into the WMN, each node can communicate with its neighbor nodes simultaneously without interference between them. However, as we allow more freedom, we need a more sophisticated algorithm to fully utilize it and developing such an algorithm is not easy in general. In this paper, we study a joint channel assignment, link scheduling, routing, and rate control problem for the WMN with multiple orthogonal channels and multiple directional antennas. This problem is inherently hard to solve, since the problem is formulated as a mixed integer nonlinear problem (MINLP). However, despite of its inherent difficulty, we develop an algorithm to solve the problem by using the generalized Benders decomposition approach [2]. The simulation results show the proposed algorithm provides the optimal solution to maximize the network utility, which is defined as the sum of utilities of all sessions.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.54 no.12
• /
• pp.597-602
• /
• 2005

The introduction of competition in electricity market emphasizes the importance of sufficient transmission capacities to guarantee various electricity transactions. Therefore, when dispatch scheduling, transmission security constraints should be considered for the economic and stable electric power system operation. In this paper, we propose an optimal dispatch scheduling algorithm incorporating transmission security constraints. For solving these constraints, the dispatch scheduling problem is decomposed into a master problem to calculate a general optimal power flow (OPF) without transmission security constraints and several subproblems to inspect the feasibility of OPF solution under various transmission line contingencies. If a dispatch schedule given by the master problem violates transmission security constraints, then an additional constraint is imposed to the master problem. Through these iteration processes between the master problem and subproblems, an optimal dispatch schedule reflecting the post-contingency rescheduling is derived. Moreover, since interruptible loads can positively participate as generators in the competitive electricity market, we consider these interruptible loads active control variables. Numerical example demonstrates efficiency of the proposed algorithm.