• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.2
• /
• pp.59-70
• /
• 1996

Given the flow matrix, plant size (rectangle shape) and department sizes, the algorithm in this paper provides the plant layout with rectilinear distance measure. To construct automated facility design, eigenvector approach is employed. A branch and bound computer code developed by Tillinghast is modified to find the feasible fits of departments without shape distortion (see [1])in the plant rectangle. The computational results compared with CRAFT are shown.

• 제어로봇시스템학회:학술대회논문집
• /
• 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.

• Journal of Communications and Networks
• /
• v.6 no.3
• /
• pp.226-234
• /
• 2004

This work presents a deterministic channel that rules according to inverse a power propagation law. The proposed channel model allows us to derive the lower bound and upper bound of packet's capture probability in Rayleigh fading and shadowing cellular mobile system. According to these capture probabilities, we analyze the system performance in the case of finite stations and finite communicated coverage of a base station. We also adopted a dynamic backoff window size to discuss the robustness of IEEE 802.11 draft standard. Some suggestions and conclusions from numerical results are given to establish the more strong CSMA/CA protocol.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1991.04a
• /
• pp.46-58
• /
• 1991

An upper-bound method is applied to determine the final-stage extrsuion load and the deformed configuration of extruded billet. A simple kinematically admissible velocity field for trhee-dimensional deformation at final-stage is proposed. From the proposed velocity field the upper-bound extrusion load, the velocity distribution and the configuration of extruded billet are determined byminimizing the otoal power consumption. Experiments are carried out with full-annealed commercial aluminum billets at room temperature by using different sizes of elliptic punches. The theroretical predictions both in extrusion load and deformed configuration of extruded billet are ingood agreements with the experimentalresults.

• Kyungpook Mathematical Journal
• /
• v.55 no.2
• /
• pp.301-311
• /
• 2015

In this paper, we present the error control techniques for the error correction methods (ECM) which is recently developed by P. Kim et al. [8, 9]. We formulate the local truncation error at each time and calculate the approximated solution using the solution and the formulated truncation error at previous time for achieving uniform error bound which enables a long time simulation. Numerical results show that the error controlled ECM provides a clue to have uniform error bound for well conditioned problems [1].

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2001.05a
• /
• pp.145-151
• /
• 2001

An extension of interaction matrix formulation to the problem of system and disturbance identification for a plant that is corrupter by both process and output disturbances is presented. With only an assumed upper bound on the order of the system and an assumed upper bound on the number of disturbance frequencies, it is shown that both the disturbance-free model and disturbance effect can be recovered exactly from disturbance-corrupted input-output data without direct measurement of the periodic disturbances. The rich information returned by the identification can be used by a performance-oriented model-based loaming or repetitive control system to eliminate unwanted periodic disturbances.

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

A Branch-and-Cut algorithm is a branch-and-bound algorithm in which rutting planes are generated throughout the branch-and-bound tree. It is now one of the most widespread and successful methods for solving mixed integer programming problems. In this paper we presents efficient implementation techniques of branch-and-cut algorithm for miked integer programming problems.

• Korean Management Science Review
• /
• v.10 no.1
• /
• pp.207-216
• /
• 1993

The purpose of this paper is to develop a branch and bound algorithm for the transportation problem with a limited number of company owned vehicles. First, we find an initial solution by solving quasi-assignment subproblem induced by relaxing constraints of the vehicle capacity and illegal tours elimination equations. Second, we build routing from the assignment, and if there is a routings which violates relaxed constraints, we introduce branches of the subproblem in order to remove it. After all branches are searched, we get the optimal solution.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.538-540
• /
• 2003

최근 금융 및 통신 산업 중심의 텔레마케팅 시스템이 증가하고 있는 가운데 아웃바운드 전문 콜센터 솔루션에 관한 관심이 증가되고 있다. 과거의 인바운드 위주의 마케팅에서 탈피하여 좀더 구체적이고 효율적인 마케팅전략이 필수적으로 아웃바운드 기반의 콜센타는 고객의 문의사항을 접수받아 해결하는 상담중심의 인바운드 모듈과 달리. 정보제공이나 상품판매를 위해 먼저 전화를 거는 텔레마케팅 운영방식으로, 본 논문에서는 Caller­ID를 활용하여 특히 소규모 콜센타 운영에 필수적인 인아웃바운드 모듈의 설계 및 구현에 관하여 논의하였다.

• Journal of applied mathematics & informatics
• /
• v.11 no.1_2
• /
• pp.283-290
• /
• 2003

Andras Bezdek proved that if a convex n-gon and n points are given, then the points and the sides of the polygon can be renumbered so that at least[${\frac{n}{3}}$] triangles spanned by the ith point and the ith side (i = 1,2,...n) are mutually non-overlapping. In this paper, we show that at least [${\frac{n}{2}}$] mutually non-overlapping triangles can be constructed. This lower bound is best possible.