• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.1
• /
• pp.1-10
• /
• 2001

In the reverse engineering, surfaces are modeled for new products by interpolating the digitized data points obtained by measuring the existing shapes. However, many measuring or deviation errors are happened during the measuring process. If these errors are ignored, designers could get undesirable results. Therefore, it is important to handle such errors and fairing procedure with the esthetics criteria is needed during surface modeling process. This paper presents algorithms for the fairing of B-spline surfaces. The algorithms are based on automatic repositioning of control points for B-spline surfaces. New positions of the control points are determined by solving a non-linear programming of which the objective functions are derived variously using derived surfaces and constraints are established by distance measures between the original and the modified control points. Changes in surface shapes are analyzed by illustrations of their shapes and continuous plotting of gaussian and mean curvatures.

• Journal of applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.1-14
• /
• 2012

In this paper, the problem of determining the optimal car-deriving strategy has been examined. In order to find the optimal driving strategy, we have modified a method based on measure theory. Further, we demonstrate that the modified method is an efficient and practical algorithm for dealing with optimal control problems in a canonical formulation.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.3
• /
• pp.59-65
• /
• 1992

A modified primal-dual affine scaling algorithm for linear programming is presented. This modified algorithm generates an elipsoid containing all optimal dual solutions at each iteration, then checks whether or not a dual hyperplane intersects this ellipsoid. If the dual hyperplane has no intersection with this ellipsoid, its corresponding column must be optimal nonbasic. By condensing these columns, the size of LP problem can be reduced.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.4
• /
• pp.684-689
• /
• 2006

Rainfall is the most basic input data to analyze the hydrologic system. When we measure the rainfall data, the rainfall data can be missing due to various reasons. Therefore, various interpolation methods are available for compensating the missing data. However, the interpolation methods were used without considering their applicability and accuracy. This study compares the interpolation methods such as the arithmetic mean method, normal ratio method, modified normal ratio method, inverse distance method, linear programming, Kriging method to estimate the existing rainfall correction method.

• Journal of the Korean Geotechnical Society
• /
• v.19 no.5
• /
• pp.7-14
• /
• 2003

In the back analysis of braced excavation based on displacement measurements, the accumulated errors of abnormal displacement caused by unexpected loads are usually observed. To minimize such errors, in this study, displacement increment was used fur back analysis rather than displacement for the conventional method. That is, the increment of sequential displacement is used as the objective function and the back analysis program is developed by taking advantage of sequential linear programming method by modified method of feasible directions. Based on small scale model test, the analysis of proposed method is verified.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.5
• /
• pp.311-318
• /
• 1988

An adaptive control problem for a plant with unmodelled dynamics is studied. The upper bounds of the output due to the unmodelled dynamics and measurement noise is assumed to be known. This problem was studied by Middleton et al. They used a modified form of the least square method in estimating the plant paramaters. In this paper, the bounds of the parameters are estimated by linear programming and the parameters are estimated by the projetion type algorithm incorporating the bounds of the parameters. The stability of the proposed adaptive control system can be proved in nearly the same way as the proof of Middleton. The performance of the proposed method is found to be much better than the method of Midlleton's with respect to the parameter convergence and plant output in computer simulations.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.1
• /
• pp.58-65
• /
• 2002

When we estimate the optimal solution satisfy the objective function and subjective equation in the integer programming, The optimal solution of the objective function Z is decided by the positive integer at extreme point or revised extreme point in the convex set. The convex set is made up the linear subjective equation. The purpose of the paper is thus to establish a stepwise optimization in the integer programming model by estimating the variation △C/sub j/ of the constant term C/sub j/ in the linear objective function, after an application of the modified Branch & Bound method.

• Structural Engineering and Mechanics
• /
• v.84 no.1
• /
• pp.129-141
• /
• 2022

It has previously been proposed that the yield-line method of analysis for reinforced concrete slabs could be automated via the use of rigid finite elements, assuming all deformations occur along element edges. However, the solutions obtained using this approach can be observed to be highly sensitive to mesh topology. To address this, a revised formulation that incorporates modified yield criteria to account for the presence of non-zero shear forces at interfaces between elements is proposed. The resulting formulation remains simple, with linear programming (LP) still used to obtain solutions for problems involving Johansen's square yield criteria. The results obtained are shown to agree well with literature solutions for various slab problems involving uniform loading and a range of geometries and boundary conditions.

• Journal of Communications and Networks
• /
• v.17 no.3
• /
• pp.241-246
• /
• 2015

In this paper, we consider a relaying system which employs a single relay in a wireless network with distributed sources and destinations. Here, all source, destination, and relay nodes are equipped with multiple antennas. For amplify-and-forward relay systems, we confirm the achievable sum rate through a joint multiple source precoders and a single relay filter design. To this end, we propose a new linear processing scheme in terms of maximizing the sum rate performance by applying a blockwise relaying method combined with geometric programming techniques. By allowing the global channel knowledge at the source nodes, we show that this joint design problem is formulated as a standard geometric program, which can guarantees a global optimal value under the modified sum rate criterion. Simulation results show that the proposed blockwise relaying scheme with the joint power allocation method provides substantial sum rate gain compared to the conventional schemes.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.402-408
• /
• 2002

Multicast technology allows the transmission of data from one source node to a selected group of destination nodes. Multicast routes typically use trees, called multicast routing trees, to minimize resource usage such as cost and bandwidth by sharing links. Moreover, the quality of service (QoS) is satisfied by distributing data along a path haying no more than a given number of arcs between the root node of a session and a terminal node of it in the routing tree. Thus, a multicast routing tree for a session can be represented as a hop constrained Steiner tree. In this paper, we consider the hop-constrained multicast route packing problem with bandwidth reservation. Given a set of multicast sessions, each of which has a hop limit constraint and a required bandwidth, the problem is to determine a set of multicast routing trees in an arc-capacitated network to minimize cost. We propose an integer programming formulation of the problem and an algorithm to solve it. An efficient column generation technique to solve the linear programming relaxation is proposed, and a modified cover inequality is used to strengthen the integer programming formulation.