• 한국정밀공학회지
• /
• 제12권8호
• /
• pp.63-72
• /
• 1995

Closed-die forging of spur gears with hollow cylindrical billet has been analysed by using the upper-bound method. A kinematically admissible velocity field has been developed, wherein, an involute curve has been introduced to represent the forging die profile. In the analysis, the deformation region has been divided into nine zones. A constant frictional stress has been assumed on the contacting surfaces. Utilizing the formulated velocity field, numerical calculations have been carried out to investigate the effects of various parameters, such as module, number of teeth and friction factor, on the forging of spur gears. Hardness and accuracy of forged gears are measured. The following results have been obtained: (1) It is verified that an axisymmetric deformation zone exists between root circle and center of gear through forged gears. (2) The average relative forging pressure is predominantly dependent on the number of teeth and increases near the final filling stage as the addendum modification coefficient increases. (3) Close agreement was found between the predicted values of forging load and those obtained from experimental results.

• 한국정밀공학회지
• /
• 제12권3호
• /
• pp.42-52
• /
• 1995

An UBET(Upper Bound Elemental Techniquel) program has been developed to analyze forging load, die-cavity filling and effective strain distribution for flashless non-axisymmetric forging. To analyze the process easily, it is suggested that the deforma- tion is divided into two different parts. Those are axisymmetric part in corner and plane- strain part in lateral. The total power consumption is minimized through combination of two deformation parts by building block method, form which the upper-bound forging load, the flow pattern, the grid pattern, the velocity distribution and the effective strain are deter- mined. To show the merit of flashless forging, the results of flashless and flash-forging processes are compared through theory and experiment. Experiments have been carried out with plasticine billets at room temperature. The theoretical predictions of the forging load and the flow pattern are in good agrement with the experimental results.

• 한국경영과학회지
• /
• 제20권3호
• /
• pp.31-41
• /
• 1995

The maximum Origin-Destination Flow Path Problem (MODFP) in an Acyclic Network has known as NP-hard. K. S. Sung has suggested on Optimal Algorithm for MODFP based on the Pseudo flo or arc and the K-th shortest path algorithm. When we try to solve MODFP problem by general Branch and Bound Method (BBM), the upper and lower bounds of subproblems are so weak that the BBM become very inefficient. Here we utilized the Pseudo flow of arc' for the tight bounds of subproblems so that it can produce an efficient BBM for MODFP problem.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제16권1호
• /
• pp.1-13
• /
• 2012

In this paper we present an a posteriori error estimator for the stabilized P1 nonconforming finite element method of the linear elasticity problem based on a nonsymmetric H(div)-conforming approximation of the stress tensor in the first-order Raviart-Thomas space. By combining the equilibrated residual method and the hypercircle method, it is shown that the error estimator gives a fully computable upper bound on the actual error. Numerical results are provided to confirm the theory and illustrate the effectiveness of our error estimator.

• 산업경영시스템학회지
• /
• 제40권4호
• /
• pp.137-146
• /
• 2017

For the competitive business environment under purchase dependence, this paper proposes a new approximate calculation of order fill rate which is a probability of satisfying a customer order immediately using the existing inventory. Purchase dependence is different to demand dependence. Purchase dependence treats the purchase behavior of customers, while demand dependence considers demand correlation between items, between regions, or over time. Purchase dependence can be observed in such areas as marketing, manufacturing systems, and distribution systems. Traditional computational methods have a difficulty of the curse of dimensionality for the large cases, when deriving the stationary joint distribution which is utilized to calculate the order fill rate. In order to escape the curse of dimensionality and protect the solution from diverging for the large cases, we develop a greedy iterative search algorithm based on the Gauss-Seidel method. We show that the greedy iterative search algorithm is a dependable algorithm to derive the stationary joint distribution of on-hand inventories in the retailer system by conducting a comparison analysis of a greedy iterative search algorithm with the simulation. In addition, we present some managerial insights such as : (1) The upper bound of order fill rate can be calculated by the one-item pure system, while the lower bound can be provided by the pure system that consists of all items; (2) As the degree of purchase dependence declines while other conditions remain same, it is observed that the difference between the lower and upper bounds reduces, the order fill rate increases, and the order fill rate gets closer to the upper bound.

• 콘크리트학회논문집
• /
• 제12권5호
• /
• pp.35-46
• /
• 2000

In this paper, an analytical model is proposed to predict the shear strenth of RC beams strengthened by FRP. This predictional model is composed of two basic models-the upper bound theorem for shear failure (shear tension or shear compression criteria) and a truss model based on the lower bound theorem for diagonal tension creteria. Also, a simple flexural theory based on USD is used to explain flexural failure. The major cause of destruction of RC beams shear strengthened by FRP does not lie in FRP fracture but in the loss of load capacity incurred by rip-off failure of shear strengthening material. Since interfacial shear stree between base concrete and the FRP is a major variable in rip-off failure mode, it is carefully analyzed to derive the shear strengthening effect of FRP. The ultimate shear strength and failure mode of RC beams, using different strengthening methods, estimated in this predictional model is then compared with the result derived from destruction experiment of RC beams shear strengthened using FRP. To verify the accuracy and consistency of the analysis, the estimated results using the predictional model are compared with various other experimental results and data from previous publications. The result of this comparative analysis showed that the estimates from the predictional model are in consistency with the experimental results. Therefore, the proposed shear strength predictional model is found to predict with relative accuracy the shear strength and failure mode of RC beams shear strengthened by FRP regardless of strengthening method variable.

• Wind and Structures
• /
• 제14권1호
• /
• pp.1-14
• /
• 2011

Open frame structures, such as those commonly found in industrial process facilities, are often densely occupied with process related equipment. This paper presents a method for estimating wind loads for high-solidity open frame structures that differs from current approaches, which accumulate wind load contributions from various individual structure components. The method considers the structure as a porous block of arbitrary plan dimension that is subject to wind from any direction. The proposed method compares favorably with wind tunnel test results for similar structures. The possibility of defining an upper bound force coefficient is also discussed.

• Transactions on Control, Automation and Systems Engineering
• /
• 제3권1호
• /
• pp.27-31
• /
• 2001

In this paper, we consider the guaranteed cost filtering design method for time-varying delay system with parameter uncertainties by LMI(Linear Matrix Inequality) approach. The objective is to design a stable guaranteed cost filter which minimizes the guaranteed cost fo the closed loop systems in filtering error dynamics. The sufficient conditions for the existence of filter, the guaranteed cost filter design method, and th guaranteed cost upper bound are proposed by LMI technique in terms of all finding variables. Finally, we give an example to check the validity of the proposed method.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.1817-1822
• /
• 1991

A method of reducing overhead caused by the processor synchronization process and common memory accesses in finely grained tasks is described. We propose a scheduler which considers the preparation time during searching to minimize the redundant accesses to shared memory. Since the suggested hardware (synchronizer) determines the access order of processors and bus arbitration simultaneously by including the synchronization process into the bus arbitration process, the synchronization time vanishes. Therefore this synchronizer has no overhead caused by the processor synchronization[l]. The proposed scheduler algorithm is processed in parallel. The processes share the upper bound derived by each searching and the lower bound function is built considering the preparation time in order to eliminate as many searches as possible. An application of the proposed method to a multi-DSP system to calculate inverse dynamics for robot arms, showed that the sampling time can be twice shorter than that of the conventional one.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제28권1호
• /
• pp.22-32
• /
• 2024

In this paper we present a method of conic section approximation by hexic Bézier curves. The hexic Bézier approximants are G³ Hermite interpolations of conic sections. We show that there exists at least one hexic Bézier approximant for each weight of the conic section The hexic Bézier approximant depends one parameter and it can be obtained by solving a quartic polynomial, which is solvable algebraically. We present the explicit upper bound of the Hausdorff distance between the conic section and the hexic Bézier approximant. We also prove that our approximation method has the maximal order of approximation. The numerical examples for conic section approximation by hexic Bézier curves are given and illustrate our assertions.