• Journal of the Chungcheong Mathematical Society
• /
• v.25 no.3
• /
• pp.455-462
• /
• 2012

The purpose of this paper is to show that the coset bound can be used to prove the floor bound. Our proof provides a natural relation between the floor bound and the order bound.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.859-863
• /
• 1987

In this paper, a relationship between difference triangular sets and sum triangular sets is developed to evaluate the weighted number of the third-order intermodulation products. In addition, a lower bound of the intermodulation products falling into the worst signal channel has been derived using the relationship between difference triangular sets and sum triangular sets. The formulas of the lower bound are useful for estimating the intermodulation impairment level in satellite communication systems.

• Journal of the Korean Mathematical Society
• /
• v.39 no.4
• /
• pp.593-609
• /
• 2002

The order of speciality of an ample invertible Sheaf L on a curve is the least integer m so that $L^{ m}$ is nonspecial. There is a reasonable upper bound of the order of speciality for a simple invertible sheaf in terms of its degree and projective dimension. We study the case where it reaches the upper bound. Moreover we for mulate Castelnuovo's genus bound involving the order of speciality.ality.

• Proceedings of the KSME Conference
• /
• 2008.11a
• /
• pp.711-716
• /
• 2008

A circular tube undergoes bucking behavior when it is subjected to axial loading. An upper bound analysis can be an attractive approach to predict the buckling load and energy absorption efficiently. The upper bound analysis obtains the load or energy absorption by means of assumption of the kinematically admissible velocity fields. In order to obtain an accurate solution, kinematically admissible velocity fields should be defined by considering many factors such as geometrical parameters, dynamic effect, etc. In this study, experiments and finite element analyses are carried out for circular tubes with various dimensions and loading conditions. As a result, the kinematically admissible velocity field is newly proposed in order to consider various dimensions and the strain rate effect of material. The upper bound analysis with the suggested velocity field accurately estimates the mean load and energy absorption obtained from results of experiment and finite element analysis.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.2
• /
• pp.87-101
• /
• 2008

This paper considers an order scheduling model to minimize the total weighted tardiness of orders. Each order requires different types of products. Each type of product is manufactured on its dedicated machine specified in advance. The completion time of each order is represented by the time when all the products belonging to the order are completed. The objective of this paper is to find the optimal production schedule minimizing the total weighted tardiness of a finite number of orders. In the problem analysis, we first derive a powerful solution property to determine the sequence of two consecutive orders. Moreover, two lower bounds of objective are derived and tested along with the derived property within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed property, branch-and-bound and heuristic algorithms are evaluated through various numerical experiments.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.45
• /
• pp.291-299
• /
• 1998

We present a variant for the generalized continuous multiple-choice knapsack problem[1], which additionally has the well-known generalized lower bound constraints. The presented problem is characterized by some variables which only belong to the simple upper bound constraints and the others which are partitioned into both the continuous multiple-choice constraints and the generalized lower bound constraints. By exploiting some extended structural properties, an efficient algorithm of order Ο($n^2$1og n) is developed, where n is the total number of variables. A numerical example is presented.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.32 no.2
• /
• pp.43-49
• /
• 1983

In this study, model simplification problem using singular perturbation technique is considered. The correctness and errors of simplified model which is obtained by the use of this technique, depends upon the order and the time scaling factor of the simplified model But, unfortunately, there is no explicit criteria for selections of these parameters. In this paper, error equations are derived and expanded by using the useful properties of $L_2$-norm. Then, new criteria for selecting the order of the simplified model and time scaling factor with respect to error bound are suggested. Since these criteria, newly proposed in this study, have strong concern about error bound, it can be used to choose the minimum order of the simplified model and time scaling factor with respect to given error bound. Conversely, if the order of the simplified model and time scaling factor are given, the error induced by the simplification can also be computed easily.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10b
• /
• pp.372-377
• /
• 1993

In this paper, we investigate a set-membership identification approach to the quantification of an upper bound of model uncertainty in frequency domain, which is required in the H$_{\infty}$ robust control system design. First we formulate this problem as a set-membership identification of a nominal model error in the presence f unknown noise input with unknown bound, while the ordinary set-membership approaches assume that an upper bound of the uncertain input is known. For this purpose, the proposed algorithm includes the estimation of the bound of the uncertain input. thus the proposed method can obtain the hard bound of the model error in frequency domain as well as a parametric lower-order nominal model. Finally numerical simulation results are shown to confirm the validity of the presented algorithm..

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.4
• /
• pp.1-9
• /
• 2010

In this paper, we consider a two-machine re-entrant permutation flowshop scheduling problem with the objective of minimizing total flowtime, and suggest branch and bound algorithms for the scheduling problem. In this scheduling problem, each job must be processed twice on each machine, that is, each job should be processed on the two machines in the order of machine 1, machine 2 and then machine 1 and machine 2. In this research, based on the results of existing researches for re-entrant permutation flowshop scheduling problems, various dominance properties, lower bound and heuristic algorithm are suggested for the problem, and those are used to develop branch and bound algorithms. In the computational experiments for evaluation of the performance of the algorithms, the suggested branch and bound algorithms are tested on randomly generated test problems and results are reported.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.12-12
• /
• 2000

This paper consider a new weighted model reduction using block diagonal solutions of Lyapunov inequalities. With the input and/or output weighting function, the stability of reduced order system is quaranteed and a priori error bound is proposed. to achieve this, after finding the solutions of two Lyapunov inequalities and balancing the full order system, we find the reduced order systems using the direct truncation and the singular perturbation approximation. The proposed method is compared with other existing methods using numerical example.