• Proceedings of the Optical Society of Korea Conference
• /
• 2005.07a
• /
• pp.252-253
• /
• 2005

• Journal of Korean Society of Steel Construction
• /
• v.11 no.1 s.38
• /
• pp.23-31
• /
• 1999

The concept models are used for the analysis of joints because they are simple to use and accurate. The modeling parameters of concept models are estimated using the results of experiments performed on the joints. The concept joint models accurately describe the behavior of joints under the loads which are used in the experiments for the estimation of parameters. However, they may not be accurate under the loads which are not used in the experiments. The accuracy can be dependent on the loads which are used in the evaluation of accuracy. In this study, antioptimization is presented to find the worst possible loads, under which the accuracy of concept joint models can be evaluated. The procedure was applied to the accuracy evaluation of concept joint models in an isolated 3-D joint and 2-D joints of a vehicle structure.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.6
• /
• pp.477-486
• /
• 2001

In this paper , we study the problem of designing TS(Takagi-Sugeno) fuzzy controllers for the systems that can be approximated or represented by the TS fuzzy model. The main strategy used in this paper is the inverse optimal approach, in which the cost function is determined later than the Lyapunov function and its corresponding control input satisfying the design requirements such as stability, decay rate, and robustness against uncertainty. This approach is useful because it yields controllers satisfying the inherent robustness of optimal controllers as well as the considered design goals. The design procedures established in this paper are all in the from of solving LMIs(Iinear matrix inequalities). Since the LMIs arising in the design procedures can be solved within a given tolerance by the interior point methods. the design method of the paper are efficient in practice. The applicability of the proposed design procedures is demonstrated by design examples.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.11
• /
• pp.119-126
• /
• 2019

The partial inverse optimization problem is an interesting variant of the inverse optimization problem in which the given instance of an optimization problem need to be modified so that a prescribed partial solution can constitute a part of an optimal solution in the modified instance. In this paper, we consider the traveling salesman problem defined on the line (TSP on the line) which has many applications such as item delivery systems, the collection of objects from storage shelves, and so on. It is worth studying the partial inverse TSP on the line, defined as follows. We are given n requests on the line, and a sequence of k requests that need to be served consecutively. Each request has a specific position on the real line and should be served by the server traveling on the line. The task is to modify as little as possible the position vector associated with n requests so that the prescribed sequence can constitute a part of the optimal solution (minimum Hamiltonian cycle) of TSP on the line. In this paper, we show that the partial inverse TSP on the line and its variant can be solved in polynomial time when the sever is equiped with a specific internal algorithm Forward Trip or with a general optimal algorithm.

• Korean Journal of Optics and Photonics
• /
• v.15 no.4
• /
• pp.391-396
• /
• 2004

Spaceborne earth observation or astronomical payloads often use Cassegrain-type telescopes due to the limits in mass and volume. Precision optical alignment of such a telescope is vital to the success of the mission. This paper describes the simulated optical alignment methods using interferograms, wavefront error, and reverse-optimization method for different levels of alignment accuracy. It concludes with the alignment experiment results of a Cassegrain type spaceborne camera with 300mm entrance pupil diameter.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.10
• /
• pp.57-64
• /
• 2019

In this paper, we study a polynomially solvable case of the inverse interval graph coloring problem. Given an interval graph associated with a specific interval system, the inverse interval graph coloring problem is defined with the assumption that there is no proper K-coloring for the given interval graph, where K is a fixed integer. The problem is to modify the system of intervals associated with the given interval graph by shifting some of the intervals in such a way that the resulting interval graph becomes K-colorable and the total modification is minimum with respect to a certain norm. In this paper, we focus on the case K = 1 where all intervals associated with the interval graph have length 1 or 2, and interval displacement is only allowed to the righthand side with respect to its original position. To solve this problem in polynomial time, we propose a two-phase algorithm which consists of the sorting and First Fit procedure.