• Communications for Statistical Applications and Methods
• /
• v.9 no.3
• /
• pp.845-851
• /
• 2002

An efficient method is developed to obtain the maximum flow for a network when its simple paths are known. Most of the existing techniques need to convert simple paths into minimal cuts, or to determine the order of simple paths to be applied in the process to reach the correct result. In this paper, we propose a method based on the concepts of signed simple path and signed flow defined in the text. Our method involves a fewer number of arithmetic operations at each iteration, and requires fewer iterations in the whole process than the existing methods. Our method can be easily extended to a mixed network with a slight modification. Furthermore, the correctness of our method does not depend on the order of simple paths to be applied in the process.

• Proceedings of the Korean Reliability Society Conference
• /
• 2002.06a
• /
• pp.297-302
• /
• 2002

An efficient method is developed to obtain the maximum capacity flow for a network when its simple paths are known. Most of the existing techniques need to convert simple paths into minimal cuts, or to determine the order of simple paths to be applied in the process to reach the correct result. In this paper, we propose a method based on the concepts of signed simple path and signed flow defined in the text. Our method involves a fewer number of arithmetic operations at each iteration, and requires fewer iterations in the whole process than the existing methods. Our method can be easily extended to a mixed network with a slight modification. Furthermore, the correctness of our method does not depend on the order of simple paths to be applied in the process.

• Journal of computational fluids engineering
• /
• v.1 no.1
• /
• pp.26-34
• /
• 1996

The performance of the SIMPLE, SIMPLE-C and PISO algorithms for the treatment of the pressure-velocity coupling in fluid flow problems were examined by comparing the computational effort required to obtain the same level of the convergence. Example problems are circular duct and 90-degree bent square-duct. For circular duct case, laminar and turbulent flow were computed. For 90-degree bent square-duct case, laminar flow was simulated by the time-marching method as well as the iterative method. The convergence speed of the other two algorithms are not always superior to SIMPLE algorithm. SIMPLE algorithm is faster than SIMPLE-C algorithm in the simple laminar flow calculations. The application of the PISO algorithm in three dimensional general coordinates is not so effective as in two-dimensional ones. Since computational time of PISO algorithm is increased at each time step(or iterative step) in three dimension, the total convergence speed is not decreased. But PISO algorithm is stable for large time step by using time marching method,.

• 전기의세계
• /
• v.28 no.6
• /
• pp.61-77
• /
• 1979

This paper is concerned with minimization process of the binary logic function. This paper describes an algorithm called the SIMPLE TABLE METHOD that well suited to minimization a switching function of any number of variables. For the Simple Table construction, a theorem based upon the numerical properties of the logic function is derived from the relationships governing minterms of the given function. Finally the minimal sum of products can be obtained in terms of the Direct Method or the Indirect Method from the table and table characteristics derived from the Simple Table. The properties and table characteristics used in this paper are described. All the minterms of a switching function are manipulated only by decimal numbers, not binary numbers. Some examples are used as a vehicle to guide the readers who are familiar with the Karnaugh map and Quine-McCluskey tabular method to this New method. These examples not only treat how to handle Don't Care miterms but also show the multiple output functions.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.751-753
• /
• 1999

In this paper, a simple SR method of AC motor has introduced. The method achived by appling the Pulse-Width Modulation(PWM) method to control the ON and OFF time of motor. The method is simple, practicable and has no problem of shift and out of control which is existed in SR method of SCR.

• International Journal of Highway Engineering
• /
• v.15 no.3
• /
• pp.23-29
• /
• 2013

PURPOSES: This paper aims to give a guideline and the way to apply the advanced composite materials theory to the road structures with different cross sections to the practicing engineers. METHODS: To simple but exact method of calculating natural frequencies corresponding to the modes of vibration of road structures with different cross sections and arbitrary boundary conditions. The effect of the $D_{22}$ stiffness on the natural frequency is rigorously investigated. RESULTS: Simple method of vibration analysis for calculating the natural frequency of the different cross sections is presented. CONCLUSIONS: Simple method of vibration analysis for calculating the natural frequency of the different cross sections is presented. This method is a simple but exact method of calculating natural frequencies of the road structures with different cross sections. This method is extended to be applied to two dimensional problems including composite laminated road structures.

• 한국전산유체공학회:학술대회논문집
• /
• 2010.05a
• /
• pp.397-403
• /
• 2010

The Immersed boundary method(IBM) is one of CFD techniques which can simulate flow field around complex objectives using simple Cartesian grid system. In the previous studies the IBM has mostly been implemented to fractional step method based Navier-Stokes solvers. In these cases, pressure buildup near IB was found to occur when linear interpolation and stadard mass conservation is used and the interpolation scheme became complicated when higher order of interpolation is adopted. In this study, we implement the IBM to an incompressible Navier-Stokes solver which uses SIMPLE algorithm. Bi-linear and quadratic interpolation equations were formulated by using only geometric information of boundary to reconstruct velocities near IB. Flow around 2D circular cylinder at Re=40 and 100 was solved by using these formulations. It was found that the pressure buildup was not observed even when the bi-linear interpolation was adopted. The use of quadratic interpolation made the predicted aerodynamic forces in good agreement with those of previous studies.

• Journal of Veterinary Clinics
• /
• v.4 no.1
• /
• pp.433-438
• /
• 1987

A cheap, simple, and exact method for the preparation of handmade blowgun was studied. The blowgun-dart-adhesive -stand made of plastic syringe shaft was simple and convenient to make a blowgun dart accuratly. The needle end sealing method with wire-lead(solder) made the needle good to secure and simple to make. Because of easy exchangeability, the tail-piece made of yarn and a rivet is able to use permanently. And the materials of this blowgun were inexpensive, common and easily obtainable. This blowgun dart had various capacity up to 12ml.

• Convergence Security Journal
• /
• v.8 no.2
• /
• pp.95-102
• /
• 2008

In this paper, we proposed topology aggregation method that efficiently aggregating topology information in simple node topology. And, it improved QoS of networks by improving call success rate and call access time. Proposed method can improving performance of network by decreasing aggregation information and aggregating multi-links information between boundary nodes using the line segment scheme within bandwidth and delay parameter. To evaluate performance of the proposed scheme, we compare/analyze the current method with the proposed scheme in respect to call success rate, access time.

• Proceedings of the Korean Reliability Society Conference
• /
• 2001.06a
• /
• pp.455-462
• /
• 2001

We propose a new method to evaluate the network reliability which greatly reduces the intermediate steps toward calculations of maximum capacity flow by excluding unnecessary simple paths contained in the set of failure simple paths. By using signed simple paths and signed flow, we show that our method is more efficient than that of Lee and Park (2001a) in the number of generated composite paths and in the procedure for obtaining minimal success composite paths. Numerical examples are given to illustrate the use and the efficiency of the method.