• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.6
• /
• pp.174-181
• /
• 2001

An upper bound elemental technique(UBET) has been carried out to predict the forming load, the deformation pattern and the extrude length of the lateral extrusion of a spider for the automotive universal joint. For the upper bound analysis, a kinematically admissible velocity field(KAVF) is proposed. From the proposed velocity field, the upper bound load, the deformation pattern and the average length of the extruded billets are determined by minimizing the total energy consumption rate which is a function of unknown velocities at each element. Experiments are carried out with antimony-lead billets at room temperature using the rectangular shape punch. The theoretical prediction of the forming load, the deformation pattern and the extruded length are good in agreement with the experimental results.

• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.687-690
• /
• 1991

In deterministic design of feedback controllers for uncertain dynamical systems, the bound on the uncertainty is an important clue to guarantee the asymptotic stability or uniform ultimate boundedness of the closed-loop system. In this paper, using only the measurable output we propose an adaptation law for the estimation of the bound of the uncertainty. And based on this adaptation law an adaptive control which renders the uncertain dynamical systems uniformly ultimately bounded is constructed.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.10a
• /
• pp.10-10
• /
• 1993

본 연구에서는 다품종(multiple products) 다단계(multi-stage) 흐름 생산시스템에서의 제품별 로트 투입순서결정무제를 다루었다. 다단계 흐름 생산시스템의 투입순서 결정문제에 대한 기존연구는 각 단계의 기계대수가 1대인 경우에 관한 것이 대부분이지만, 본 연구에서는 각 단계의 기계대수가 복수이고 각 제품의 생산량이 로트로 주어지며, 또한 각 단계마다의 이송이 로트로 이루어지는 것이 아니라 1단위로 이루어지는 생산시스템을 대상으로 하였다. 그리고 각 제품의 생산준비기간은 투입순서와 관계 없이 일정하며 앞 단계에서 제품이 도착하지 않더라도 생산준비는 먼저 수행될 수 있다고 가정하였다. 제품별 로트 투입순서 결정문제에서 사용된 성능평가기준(performance measure)은 총작업소요시간(makespan)이며 순열투입순서(permutation schedule)만을 대상으로 하였다. 결정기법으로는 투입순서 결정문제에서 효율적인 것으로 알려져 있는 분지한계법(Branch & Bound)이 사용되었으며 분지한계법에서 이용되는 부분투입순서(partial sequence)에 대한 하한값(lower bound)을 제시하였다. 제시된 기법을 사용하면 현실적인 크기의 제품별 로트 투입순서 결정문제를 적당한 시간내에 충분히 해결할 수 있을 것으로 보인다. 제시된 해법으로 해결된 수치예제가 주어져 있다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1997.10a
• /
• pp.52-55
• /
• 1997

In this paper, both the generalization of one artificial variable technique to the general bound problem and the efficient implementation of the technique are suggested. When the steepest-edge method is used as a pricing rule in the simplex method, it is easy to update the reduced cost and the simplex multiplier every iteration. Therefore, one artificial variable technique is more efficient than Wolfe's method in which the reduced cost and simplex multiplier must be recalculated in every iteration. When implementing the one artificial variable technique on the LP problems with the general bound restraints on the variables, an arbitrary basic solution which satisfies the bound restraints is sought first, and the artificial column which adjusts the infeasibility is introduced. The phase one of the simplex method minimizes the one artificial variable. The efficient implementation technique includes the splitting, scaling, storage of the artificial column, and the cure of infeasibility problem.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.2
• /
• pp.144-150
• /
• 2000

In this paper, the formation of a corner cavity in the final stage of axisymmetric backward extrusion process is studied by means of upper bound analysis using kinematically admissible velocity. The quantitative relationships between corner cavity formation and process parameters are studied. And analytical results are compared with those of experiment to which plasticine is used. It is found that the analytical results agree well with experimental one. In addition, to restrict the formation of a corner cavity, driven container is applied to backward extrusion and the results are compared with those of FEM. The critical thickness of the bottom of the billet decreases with increase in reduction of area, and increases with decrease in friction. To prevent the formation of corner cavity, the concept of moving container was applied. Throughout this process, the occurrence of a corner cavity is delayed and forming limit area is enlarged.

• Korean Journal of Pharmacognosy
• /
• v.38 no.2 s.149
• /
• pp.152-156
• /
• 2007

Protein-bound polysaccharide is derived from Acanthopananx senticosus by the cold water extraction. The aim of the study was to evaluate the effects of PS against weight loss and hematological change as a indication of toxicity produced by the treatment of cisplatin. PS protected the weight loss caused by cisplatin (6 mg/kg) and significantly recovered hematological change. Treatment of PS showed the recovery on the weight loss and hematological change as indicators of toxicity of cisplatin treatment. By increasing lymphocyte proliferation and cytokine production, PS may be highly effective in protecting against cisplatin-induced toxicity. The results suggest PS might have a role in reducing toxicity or permitting larger dose of cisplatin to be given.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1178-1184
• /
• 1997

Encoding of segment contours is a critical part of a region-based coding system especially at low bit rates where the contour information occupies a majority of the bit rate. When approximating contours with polygons, a fixed upper bound on the distortion is set for the approximation process. Instead of using this fixed bound, adaptive approximation bound for a lossy coding of contourts is proposed in this paper. A function representing the relative importance of the contour segmentis defined to take into account the spatial content of the image. By using this function, the contour can be approximated adaptively. This allows a more general approach than the methods with the fixed distortion measure. The effectiveness of the adaptive contour coding approach is verified through experiments.

• IE interfaces
• /
• v.24 no.4
• /
• pp.341-350
• /
• 2011

This paper considers a problem of locating both distribution centers and retailers in a zone-dependent two-level distribution network where either a distribution center or a retailer should be located in each zone. Customer demands of each zone should be satisfied directly from either its own distribution center or its own retailer being supplied from a distribution center of another zone. The objective of the proposed problem is to minimize total cost being composed of distribution center/retailer setup costs and transportation costs. In the analysis, the problem is proved to be NP-hard, so that a branch-and-bound algorithm is derived for the problem. Numerical experiments show that the proposed branch-and-bound algorithm provides the optimal solution efficiently for some small problems.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.2
• /
• pp.1-13
• /
• 1998

The purpose of this paper is to formulate the three-dimensional loading problem and to develop an exact algorithm. The three-dimensional loading problem is not only to load as many boxes as possible, but also to ensure load stability. In this Paper, we propose formulation by zero-one integer programming. Further we propose as an algorithm the branch-and-bound enforced by efficient bounding criteria. As an upper bound, we use the solution of the Lagrangean relaxation problem which relaxes constraints of zero-one IP, and as a lower bound, we use a heuristic solution induced by the solution of the Lagrangean relaxation problem. Last, we show computational experiments on convergency of upper and lower bounds.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.2
• /
• pp.83-101
• /
• 1998

Assembly U-lines are increasingly accepted in industry, especially just-in-time production systems, for the efficient utilization of workforce. In this paper, we present an integer programming formulation and a branch-and-bound method for balancing the U-line with the objective of minimizing the number of workstations with a fixed cycle time. In the mathematical model, we provide the method that can reduce the number of variables and constraints. The proposed branch-and-bound method searches the optimal solution based on a depth-first-search. To efficiently search for the optimal solutions to the problems, an assignment rule is used in the method. Bounding strategies and dominance rules are also utilized. Some problems require a large amount of computation time to find the optimal solutions. For this reason. some heuristic fathoming rules are also proposed. Extensive experiments with test-bed problems in the literature are carried out to show the performance of the proposed method. The computational results show that our method is promising in solution quality.